From 7fc12cc7a6b307b2fc4b3a4df17ce9c4e185d3f0 Mon Sep 17 00:00:00 2001 From: hyy Date: Thu, 23 Dec 2021 16:17:35 +0800 Subject: [PATCH] =?UTF-8?q?Java=EF=BC=9A449:=E5=BA=8F=E5=88=97=E5=8C=96?= =?UTF-8?q?=E5=92=8C=E5=8F=8D=E5=BA=8F=E5=88=97=E5=8C=96=E4=BA=8C=E5=8F=89?= =?UTF-8?q?=E6=90=9C=E7=B4=A2=E6=A0=91?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/main/java/leetcode/editor/cn/doc/all.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json index 1b03fb3..24512e9 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.2946315376990987,"acs":12782,"articleLive":2,"columnArticles":128,"formTitle":"[1044]最长重复子串","frequency":3.0613031916,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":43383,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.5222011001312387,"acs":2792873,"articleLive":2,"columnArticles":15295,"formTitle":"[1]两数之和","frequency":4.7073908296,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5348271,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4114343600620469,"acs":1104728,"articleLive":2,"columnArticles":7841,"formTitle":"[2]两数相加","frequency":4.6380357527,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2685065,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3830032374102704,"acs":1388196,"articleLive":2,"columnArticles":8300,"formTitle":"[3]无重复字符的最长子串","frequency":4.5536933684,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3624502,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.41047371253361575,"acs":572837,"articleLive":2,"columnArticles":4276,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5883709069,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1395551,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35900431572165736,"acs":821371,"articleLive":2,"columnArticles":4463,"formTitle":"[5]最长回文子串","frequency":4.5051885636,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2287914,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5094448930065368,"acs":335040,"articleLive":2,"columnArticles":2727,"formTitle":"[6]Z 字形变换","frequency":3.8001722835,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":657657,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35073831452497817,"acs":914809,"articleLive":2,"columnArticles":5702,"formTitle":"[7]整数反转","frequency":4.6033582143,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2608238,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21734346189711282,"acs":380616,"articleLive":2,"columnArticles":2919,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.653028649,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1751219,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5810618722781266,"acs":846176,"articleLive":2,"columnArticles":5360,"formTitle":"[9]回文数","frequency":3.8245251247,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1456258,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31581393711046163,"acs":224220,"articleLive":2,"columnArticles":1352,"formTitle":"[10]正则表达式匹配","frequency":4.3057208502,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":709975,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6225554278034157,"acs":592900,"articleLive":2,"columnArticles":3365,"formTitle":"[11]盛最多水的容器","frequency":4.2650939967,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":952365,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.664186531824384,"acs":248253,"articleLive":2,"columnArticles":1941,"formTitle":"[12]整数转罗马数字","frequency":3.4612212901,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":373770,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6300069230316004,"acs":513249,"articleLive":2,"columnArticles":4202,"formTitle":"[13]罗马数字转整数","frequency":4.1282275872,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":814672,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4142768510205718,"acs":687091,"articleLive":2,"columnArticles":4298,"formTitle":"[14]最长公共前缀","frequency":4.4695036968,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1658531,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3410741252634929,"acs":740578,"articleLive":2,"columnArticles":3475,"formTitle":"[15]三数之和","frequency":4.4348261583,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2171311,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4582679528334565,"acs":287087,"articleLive":2,"columnArticles":1575,"formTitle":"[16]最接近的三数之和","frequency":4.1562430761,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":626461,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5749198311725457,"acs":379903,"articleLive":2,"columnArticles":3425,"formTitle":"[17]电话号码的字母组合","frequency":3.647709739,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":660793,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39479517531196867,"acs":246139,"articleLive":2,"columnArticles":1697,"formTitle":"[18]四数之和","frequency":3.4916557754,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":623460,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.43256688568628165,"acs":595796,"articleLive":2,"columnArticles":4438,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.5477667172,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1377350,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44543553536553,"acs":871014,"articleLive":2,"columnArticles":6161,"formTitle":"[20]有效的括号","frequency":4.3648180573,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1955421,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6669890591683105,"acs":802033,"articleLive":2,"columnArticles":3891,"formTitle":"[21]合并两个有序链表","frequency":4.1911793085,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1202468,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7729420908223786,"acs":393831,"articleLive":2,"columnArticles":2946,"formTitle":"[22]括号生成","frequency":4.4092263986,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":509522,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5621398260180789,"acs":363361,"articleLive":2,"columnArticles":2345,"formTitle":"[23]合并K个升序链表","frequency":3.8633066011,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":646389,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.704429606432738,"acs":352262,"articleLive":2,"columnArticles":2790,"formTitle":"[24]两两交换链表中的节点","frequency":3.0585055174,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":500067,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6583644644461666,"acs":255716,"articleLive":2,"columnArticles":2417,"formTitle":"[25]K 个一组翻转链表","frequency":4.2820230588,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":388411,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5365645015104846,"acs":906361,"articleLive":2,"columnArticles":5004,"formTitle":"[26]删除有序数组中的重复项","frequency":3.6737029378,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1689193,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5959732517344166,"acs":542226,"articleLive":2,"columnArticles":4540,"formTitle":"[27]移除元素","frequency":3.5539113741,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":909816,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4031130214183413,"acs":521829,"articleLive":2,"columnArticles":3551,"formTitle":"[28]实现 strStr()","frequency":3.4212393358,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1294498,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22037761551011356,"acs":139131,"articleLive":2,"columnArticles":1103,"formTitle":"[29]两数相除","frequency":3.3570961051,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":631330,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3618349698336832,"acs":87741,"articleLive":2,"columnArticles":676,"formTitle":"[30]串联所有单词的子串","frequency":2.7637383951,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":242489,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3725958522497572,"acs":240549,"articleLive":2,"columnArticles":1941,"formTitle":"[31]下一个排列","frequency":3.7783659245,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":645603,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3575140338711783,"acs":210870,"articleLive":2,"columnArticles":1431,"formTitle":"[32]最长有效括号","frequency":3.5094815594,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":589823,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4301386405040865,"acs":411770,"articleLive":2,"columnArticles":2724,"formTitle":"[33]搜索旋转排序数组","frequency":3.5577668005,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":957296,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42274904004710795,"acs":395576,"articleLive":2,"columnArticles":3740,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.5015981918,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":935723,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.45932989674848573,"acs":596653,"articleLive":2,"columnArticles":4450,"formTitle":"[35]搜索插入位置","frequency":3.4528056801,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1298964,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6378179522561831,"acs":228335,"articleLive":2,"columnArticles":1624,"formTitle":"[36]有效的数独","frequency":3.3917616212,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":357994,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6704477576278881,"acs":112241,"articleLive":2,"columnArticles":953,"formTitle":"[37]解数独","frequency":2.8660615813,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":167412,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5970776965372706,"acs":253558,"articleLive":2,"columnArticles":2677,"formTitle":"[38]外观数列","frequency":2.4697929101,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":424665,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7275144608477941,"acs":379206,"articleLive":2,"columnArticles":2212,"formTitle":"[39]组合总和","frequency":3.7538717049,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":521235,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6158677086025703,"acs":223980,"articleLive":2,"columnArticles":1529,"formTitle":"[40]组合总和 II","frequency":3.1641924389,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":363682,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4201151204388821,"acs":180497,"articleLive":2,"columnArticles":1534,"formTitle":"[41]缺失的第一个正数","frequency":4.1588297304,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":429637,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5902162177747734,"acs":368459,"articleLive":2,"columnArticles":2705,"formTitle":"[42]接雨水","frequency":4.4705110252,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":624278,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44937631543377937,"acs":186182,"articleLive":2,"columnArticles":1253,"formTitle":"[43]字符串相乘","frequency":3.9044773842,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":414312,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32846731216420644,"acs":90543,"articleLive":2,"columnArticles":593,"formTitle":"[44]通配符匹配","frequency":2.7637383951,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":275653,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4353095310114104,"acs":238897,"articleLive":2,"columnArticles":1879,"formTitle":"[45]跳跃游戏 II","frequency":3.7075790787,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":548798,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7843273609635959,"acs":474831,"articleLive":2,"columnArticles":3053,"formTitle":"[46]全排列","frequency":3.9390915201,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":605399,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6411798675734187,"acs":243154,"articleLive":2,"columnArticles":1660,"formTitle":"[47]全排列 II","frequency":3.345545298,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":379229,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.736201047958364,"acs":250234,"articleLive":2,"columnArticles":2089,"formTitle":"[48]旋转图像","frequency":3.322846182,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":339899,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6670728527429177,"acs":258386,"articleLive":2,"columnArticles":1466,"formTitle":"[49]字母异位词分组","frequency":2.6762190171,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":387343,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37720614672732106,"acs":241295,"articleLive":2,"columnArticles":1436,"formTitle":"[50]Pow(x, n)","frequency":3.5520524993,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":639690,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7380678338595981,"acs":169932,"articleLive":2,"columnArticles":1689,"formTitle":"[51]N 皇后","frequency":3.6769075295,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":230239,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8222070492329019,"acs":79477,"articleLive":2,"columnArticles":648,"formTitle":"[52]N皇后 II","frequency":0.4626968388,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":96663,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.552822891521469,"acs":788033,"articleLive":2,"columnArticles":4202,"formTitle":"[53]最大子数组和","frequency":3.9448624401,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1425471,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.48281898084712244,"acs":208249,"articleLive":2,"columnArticles":2211,"formTitle":"[54]螺旋矩阵","frequency":3.7583251736,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":431319,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4339254793668982,"acs":374144,"articleLive":2,"columnArticles":2849,"formTitle":"[55]跳跃游戏","frequency":3.2933802907,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":862231,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.47391942527627995,"acs":339341,"articleLive":2,"columnArticles":2607,"formTitle":"[56]合并区间","frequency":4.2795102842,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":716031,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41282207290619544,"acs":93633,"articleLive":2,"columnArticles":992,"formTitle":"[57]插入区间","frequency":1.8995387239,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":226812,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.38491413365560695,"acs":271361,"articleLive":2,"columnArticles":2902,"formTitle":"[58]最后一个单词的长度","frequency":2.7523496151,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":704991,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.782309646182092,"acs":144448,"articleLive":2,"columnArticles":1766,"formTitle":"[59]螺旋矩阵 II","frequency":3.5482144891,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":184643,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5263442670921649,"acs":95332,"articleLive":2,"columnArticles":1023,"formTitle":"[60]排列序列","frequency":2.0926915615,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":181121,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41758999514175116,"acs":213168,"articleLive":2,"columnArticles":2182,"formTitle":"[61]旋转链表","frequency":2.4697929101,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":510472,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6651763318232125,"acs":347391,"articleLive":2,"columnArticles":2653,"formTitle":"[62]不同路径","frequency":3.2502924607,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":522254,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39520978014641245,"acs":201853,"articleLive":2,"columnArticles":1901,"formTitle":"[63]不同路径 II","frequency":2.5960693289,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":510749,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6893982607069384,"acs":294897,"articleLive":2,"columnArticles":2271,"formTitle":"[64]最小路径和","frequency":3.6227897004,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":427760,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.27105249995832015,"acs":48774,"articleLive":2,"columnArticles":682,"formTitle":"[65]有效数字","frequency":1.9340106329,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":179943,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.46293208140230563,"acs":414739,"articleLive":2,"columnArticles":3780,"formTitle":"[66]加一","frequency":2.8236214295,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":895896,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5409297385829995,"acs":211371,"articleLive":2,"columnArticles":1929,"formTitle":"[67]二进制求和","frequency":3.0188872931,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":390755,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5227467133400887,"acs":39723,"articleLive":2,"columnArticles":608,"formTitle":"[68]文本左右对齐","frequency":3.3905860494,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":75989,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39064094443055053,"acs":427987,"articleLive":2,"columnArticles":2165,"formTitle":"[69]Sqrt(x)","frequency":3.5777674672,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1095602,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5325758105589679,"acs":647274,"articleLive":2,"columnArticles":3939,"formTitle":"[70]爬楼梯","frequency":4.2957869431,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1215365,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42213193076916683,"acs":101608,"articleLive":2,"columnArticles":918,"formTitle":"[71]简化路径","frequency":3.2513925951,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":240702,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6151091779798779,"acs":196007,"articleLive":2,"columnArticles":1370,"formTitle":"[72]编辑距离","frequency":4.0352497648,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":318654,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6087723012531859,"acs":149523,"articleLive":2,"columnArticles":1112,"formTitle":"[73]矩阵置零","frequency":2.7160649256,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":245614,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4654641844408828,"acs":188769,"articleLive":2,"columnArticles":1899,"formTitle":"[74]搜索二维矩阵","frequency":2.5707890111,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":405550,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5994152976576133,"acs":301603,"articleLive":2,"columnArticles":2088,"formTitle":"[75]颜色分类","frequency":2.8160625289,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":503162,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.430245456355414,"acs":211778,"articleLive":2,"columnArticles":1460,"formTitle":"[76]最小覆盖子串","frequency":3.2933802907,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":492226,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7691428952360174,"acs":253831,"articleLive":2,"columnArticles":1506,"formTitle":"[77]组合","frequency":3.127987796,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":330018,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8021756237559599,"acs":346588,"articleLive":2,"columnArticles":2277,"formTitle":"[78]子集","frequency":3.3292778996,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":432060,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45954257088379324,"acs":248965,"articleLive":2,"columnArticles":1572,"formTitle":"[79]单词搜索","frequency":2.7855510965,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":541767,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6178540430223557,"acs":158031,"articleLive":2,"columnArticles":1407,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.7309772211,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":255774,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4143626915422732,"acs":133881,"articleLive":2,"columnArticles":1062,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.1911730311,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":323101,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5315297862760087,"acs":203038,"articleLive":2,"columnArticles":1849,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.2452478049,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":381988,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5375157899900661,"acs":350628,"articleLive":2,"columnArticles":2188,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.7366299343,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":652312,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43447720819043034,"acs":200284,"articleLive":2,"columnArticles":1277,"formTitle":"[84]柱状图中最大的矩形","frequency":3.6692667888,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":460977,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5178311428626895,"acs":106696,"articleLive":2,"columnArticles":753,"formTitle":"[85]最大矩形","frequency":2.4361649936,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":206044,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325676555379894,"acs":129238,"articleLive":2,"columnArticles":1207,"formTitle":"[86]分隔链表","frequency":2.3045445898,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":204307,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48458228157768907,"acs":43578,"articleLive":2,"columnArticles":327,"formTitle":"[87]扰乱字符串","frequency":0.4900060181,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":89929,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.519297981140384,"acs":523604,"articleLive":2,"columnArticles":3648,"formTitle":"[88]合并两个有序数组","frequency":4.3301405188,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1008292,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7127571924824084,"acs":64017,"articleLive":2,"columnArticles":531,"formTitle":"[89]格雷编码","frequency":2.4294598592,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":89816,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338838228792656,"acs":153417,"articleLive":2,"columnArticles":1339,"formTitle":"[90]子集 II","frequency":2.4143966112,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":242027,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.31343002879068577,"acs":178321,"articleLive":2,"columnArticles":1636,"formTitle":"[91]解码方法","frequency":3.1641924389,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":568934,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.549726570751285,"acs":234222,"articleLive":2,"columnArticles":2195,"formTitle":"[92]反转链表 II","frequency":3.6944497873,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":426070,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5469944850893746,"acs":171887,"articleLive":2,"columnArticles":1490,"formTitle":"[93]复原 IP 地址","frequency":3.9999209131,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":314239,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557337477091698,"acs":637110,"articleLive":2,"columnArticles":2601,"formTitle":"[94]二叉树的中序遍历","frequency":2.9892918005,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":843035,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7072434023273375,"acs":109581,"articleLive":2,"columnArticles":679,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9475072798,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":154941,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995339757150834,"acs":184181,"articleLive":2,"columnArticles":1456,"formTitle":"[96]不同的二叉搜索树","frequency":3.3821052234,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":263291,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4544462666086549,"acs":67892,"articleLive":2,"columnArticles":586,"formTitle":"[97]交错字符串","frequency":1.9166098111,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":149395,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35247350299804925,"acs":392088,"articleLive":2,"columnArticles":2174,"formTitle":"[98]验证二叉搜索树","frequency":3.4290895426,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1112390,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6084831796415793,"acs":80436,"articleLive":2,"columnArticles":659,"formTitle":"[99]恢复二叉搜索树","frequency":2.2512895408,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":132191,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5995196306050316,"acs":276815,"articleLive":2,"columnArticles":2047,"formTitle":"[100]相同的树","frequency":2.589261719,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":461728,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.566973191082435,"acs":461866,"articleLive":2,"columnArticles":2527,"formTitle":"[101]对称二叉树","frequency":3.2696036119,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":814617,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421151894269322,"acs":446010,"articleLive":2,"columnArticles":2799,"formTitle":"[102]二叉树的层序遍历","frequency":4.2888513543,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":694595,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717068762231945,"acs":191045,"articleLive":2,"columnArticles":1714,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.6549861586,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":334166,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7671105310830149,"acs":572513,"articleLive":2,"columnArticles":2823,"formTitle":"[104]二叉树的最大深度","frequency":3.5777674672,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":746324,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7061649115754605,"acs":277556,"articleLive":2,"columnArticles":1592,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.4063671541,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":393047,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7217062896431511,"acs":149054,"articleLive":2,"columnArticles":995,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.3974241504,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":206530,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7013688373445273,"acs":176106,"articleLive":2,"columnArticles":1424,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.6913478987,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":251089,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7618065446678085,"acs":211268,"articleLive":2,"columnArticles":1305,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.7719204077,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":277325,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7621722283963596,"acs":101500,"articleLive":2,"columnArticles":791,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.6762190171,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":133172,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5647452827186814,"acs":283972,"articleLive":2,"columnArticles":1613,"formTitle":"[110]平衡二叉树","frequency":2.8160625289,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":502832,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.49085084108284166,"acs":303819,"articleLive":2,"columnArticles":2001,"formTitle":"[111]二叉树的最小深度","frequency":2.3620884053,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":618964,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5270681769400039,"acs":302038,"articleLive":2,"columnArticles":1895,"formTitle":"[112]路径总和","frequency":3.1182543256,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":573053,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6278905166203723,"acs":199602,"articleLive":2,"columnArticles":1403,"formTitle":"[113]路径总和 II","frequency":2.5658128862,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":317893,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7268718607639294,"acs":199128,"articleLive":2,"columnArticles":1503,"formTitle":"[114]二叉树展开为链表","frequency":2.1439007835,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":273952,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5209023384610677,"acs":68096,"articleLive":2,"columnArticles":736,"formTitle":"[115]不同的子序列","frequency":2.9539431367,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":130727,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7072203201805558,"acs":184878,"articleLive":2,"columnArticles":1407,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.6133051917,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":261415,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6212186362562758,"acs":102575,"articleLive":2,"columnArticles":867,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.3020460165,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":165119,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7366918860145879,"acs":243915,"articleLive":2,"columnArticles":1966,"formTitle":"[118]杨辉三角","frequency":3.3089230344,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":331095,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6736175720210553,"acs":162907,"articleLive":2,"columnArticles":1356,"formTitle":"[119]杨辉三角 II","frequency":2.2207434884,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":241839,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6830444737970188,"acs":195988,"articleLive":2,"columnArticles":1723,"formTitle":"[120]三角形最小路径和","frequency":2.19441232,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":286933,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5736841960763139,"acs":626863,"articleLive":2,"columnArticles":3781,"formTitle":"[121]买卖股票的最佳时机","frequency":4.2173601849,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1092697,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6922035751851497,"acs":513966,"articleLive":2,"columnArticles":2900,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.9135135239,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":742507,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5412613719534163,"acs":142729,"articleLive":2,"columnArticles":889,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.1020398576,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":263697,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44639343849850305,"acs":177428,"articleLive":2,"columnArticles":1203,"formTitle":"[124]二叉树中的最大路径和","frequency":4.1163997285,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":397470,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4715292723923412,"acs":304093,"articleLive":2,"columnArticles":2003,"formTitle":"[125]验证回文串","frequency":2.9879986411,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":644908,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.398382355881706,"acs":39847,"articleLive":2,"columnArticles":355,"formTitle":"[126]单词接龙 II","frequency":1.6895656358,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100022,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4713178350006793,"acs":131821,"articleLive":2,"columnArticles":706,"formTitle":"[127]单词接龙","frequency":1.5653366358,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":279686,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5446499409863274,"acs":194275,"articleLive":2,"columnArticles":1291,"formTitle":"[128]最长连续序列","frequency":4.0078386108,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":356697,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6858385693571774,"acs":131967,"articleLive":2,"columnArticles":1225,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.8312403979,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":192417,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44875892425450686,"acs":142936,"articleLive":2,"columnArticles":1295,"formTitle":"[130]被围绕的区域","frequency":2.2701118544,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":318514,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7232897283750774,"acs":148346,"articleLive":2,"columnArticles":986,"formTitle":"[131]分割回文串","frequency":2.8944725831,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":205099,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49280090519070296,"acs":52264,"articleLive":2,"columnArticles":464,"formTitle":"[132]分割回文串 II","frequency":2.1870248524,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106055,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6780397396663936,"acs":78656,"articleLive":2,"columnArticles":558,"formTitle":"[133]克隆图","frequency":1.5368771169,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":116005,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5666069514998323,"acs":138532,"articleLive":2,"columnArticles":1051,"formTitle":"[134]加油站","frequency":3.3905860494,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":244494,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4868844813628524,"acs":110663,"articleLive":2,"columnArticles":890,"formTitle":"[135]分发糖果","frequency":4.2453889256,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":227288,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190803811033265,"acs":558957,"articleLive":2,"columnArticles":2540,"formTitle":"[136]只出现一次的数字","frequency":3.8829324742,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":777322,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7200668560922614,"acs":107704,"articleLive":2,"columnArticles":809,"formTitle":"[137]只出现一次的数字 II","frequency":2.1230732056,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":149575,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6629295887057199,"acs":122933,"articleLive":2,"columnArticles":930,"formTitle":"[138]复制带随机指针的链表","frequency":3.2827123849,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":185439,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5196635700785694,"acs":220513,"articleLive":2,"columnArticles":1380,"formTitle":"[139]单词拆分","frequency":3.5520524993,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":424338,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5022418791735954,"acs":57687,"articleLive":2,"columnArticles":604,"formTitle":"[140]单词拆分 II","frequency":0.9711860341,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":114859,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5131216405438367,"acs":590720,"articleLive":2,"columnArticles":3047,"formTitle":"[141]环形链表","frequency":3.3459787032,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1151228,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5544847385116655,"acs":334911,"articleLive":2,"columnArticles":1943,"formTitle":"[142]环形链表 II","frequency":3.2220459846,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":604004,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6256585391681889,"acs":141798,"articleLive":2,"columnArticles":1193,"formTitle":"[143]重排链表","frequency":4.0698921394,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":226638,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7048715116640228,"acs":465230,"articleLive":2,"columnArticles":2064,"formTitle":"[144]二叉树的前序遍历","frequency":1.9698516251,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":660021,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.752174470587715,"acs":340204,"articleLive":2,"columnArticles":1747,"formTitle":"[145]二叉树的后序遍历","frequency":3.3006636441,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":452294,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5244214702169863,"acs":261744,"articleLive":2,"columnArticles":1539,"formTitle":"[146]LRU 缓存机制","frequency":4.2071177286,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":499110,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6836407197903921,"acs":106717,"articleLive":2,"columnArticles":826,"formTitle":"[147]对链表进行插入排序","frequency":2.3045445898,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":156101,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6663293897882939,"acs":231147,"articleLive":2,"columnArticles":1375,"formTitle":"[148]排序链表","frequency":3.3292778996,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":346896,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.35003919195808525,"acs":50909,"articleLive":2,"columnArticles":547,"formTitle":"[149]直线上最多的点数","frequency":2.6133051917,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":145438,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5348000908178735,"acs":146040,"articleLive":2,"columnArticles":1154,"formTitle":"[150]逆波兰表达式求值","frequency":2.4697929101,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":273074,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48987205585269006,"acs":189870,"articleLive":2,"columnArticles":1574,"formTitle":"[151]翻转字符串里的单词","frequency":2.5286523063,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":387591,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42261202163318184,"acs":205512,"articleLive":2,"columnArticles":1368,"formTitle":"[152]乘积最大子数组","frequency":3.6586686483,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":486290,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5680431011312825,"acs":232483,"articleLive":2,"columnArticles":1635,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.3835847173,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":409270,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5310946908937916,"acs":121182,"articleLive":2,"columnArticles":958,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.7446608131,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":228174,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5753065679939537,"acs":314378,"articleLive":2,"columnArticles":1735,"formTitle":"[155]最小栈","frequency":3.3105451474,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":546453,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7216464606961283,"acs":7381,"articleLive":2,"columnArticles":136,"formTitle":"[156]上下翻转二叉树","frequency":0.4113903831,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10228,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5363556338028169,"acs":6093,"articleLive":2,"columnArticles":89,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11360,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5960806697108066,"acs":3133,"articleLive":2,"columnArticles":73,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.5185304849,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5256,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5496957403651116,"acs":17886,"articleLive":2,"columnArticles":214,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.6252347774,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32538,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.61822182195042,"acs":373427,"articleLive":2,"columnArticles":2174,"formTitle":"[160]相交链表","frequency":2.7576475004,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":604034,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33740811436461843,"acs":8308,"articleLive":2,"columnArticles":115,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.4900060181,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24623,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49631698910384703,"acs":178555,"articleLive":2,"columnArticles":1200,"formTitle":"[162]寻找峰值","frequency":3.3013713832,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":359760,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3323442136498516,"acs":10304,"articleLive":2,"columnArticles":157,"formTitle":"[163]缺失的区间","frequency":1.3914088712,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31004,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6091969654288129,"acs":62715,"articleLive":2,"columnArticles":529,"formTitle":"[164]最大间距","frequency":2.6244386845,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":102947,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5210270355659866,"acs":92351,"articleLive":2,"columnArticles":961,"formTitle":"[165]比较版本号","frequency":3.8908439079,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":177248,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.331343641735531,"acs":44186,"articleLive":2,"columnArticles":398,"formTitle":"[166]分数到小数","frequency":2.8944725831,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":133354,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5871861793591336,"acs":334995,"articleLive":2,"columnArticles":2206,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.2058058506,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":570509,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43388966954393815,"acs":90781,"articleLive":2,"columnArticles":803,"formTitle":"[168]Excel表列名称","frequency":2.7947885255,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":209226,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6652785535747162,"acs":426389,"articleLive":2,"columnArticles":2384,"formTitle":"[169]多数元素","frequency":3.2095536297,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":640918,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.42245641425969294,"acs":9741,"articleLive":2,"columnArticles":100,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":1.0918686795,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23058,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174301310592911,"acs":114080,"articleLive":2,"columnArticles":976,"formTitle":"[171]Excel 表列序号","frequency":2.6133051917,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":159012,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4452235852059623,"acs":96508,"articleLive":2,"columnArticles":631,"formTitle":"[172]阶乘后的零","frequency":2.6133051917,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":216763,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8057048864639332,"acs":80332,"articleLive":2,"columnArticles":673,"formTitle":"[173]二叉搜索树迭代器","frequency":1.594767836,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":99704,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4804406607549799,"acs":40689,"articleLive":2,"columnArticles":427,"formTitle":"[174]地下城游戏","frequency":3.1772406408,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":84691,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7365538193474885,"acs":329722,"articleLive":2,"columnArticles":1561,"formTitle":"[175]组合两个表","frequency":4.3798190204,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":447655,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3544458457109447,"acs":270372,"articleLive":2,"columnArticles":1091,"formTitle":"[176]第二高的薪水","frequency":4.1041772938,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":762802,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4631150548754045,"acs":138828,"articleLive":2,"columnArticles":546,"formTitle":"[177]第N高的薪水","frequency":3.6944497873,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":299770,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.603592207272778,"acs":129785,"articleLive":2,"columnArticles":704,"formTitle":"[178]分数排名","frequency":2.6913478987,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":215021,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40957701566655325,"acs":129985,"articleLive":2,"columnArticles":1033,"formTitle":"[179]最大数","frequency":3.3211856037,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":317364,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48509663798964353,"acs":94898,"articleLive":2,"columnArticles":549,"formTitle":"[180]连续出现的数字","frequency":3.5777674672,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":195627,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.6968958960051125,"acs":178843,"articleLive":2,"columnArticles":724,"formTitle":"[181]超过经理收入的员工","frequency":3.3032990389,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":256628,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7943613441971705,"acs":195961,"articleLive":2,"columnArticles":641,"formTitle":"[182]查找重复的电子邮箱","frequency":3.1772406408,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":246690,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6739160039781942,"acs":163304,"articleLive":2,"columnArticles":592,"formTitle":"[183]从不订购的客户","frequency":2.7637383951,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":242321,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4818260783135914,"acs":111496,"articleLive":2,"columnArticles":725,"formTitle":"[184]部门工资最高的员工","frequency":3.0100745928,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":231403,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5011460815698395,"acs":77178,"articleLive":2,"columnArticles":680,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6102378523,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":154003,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7569141193595342,"acs":8320,"articleLive":2,"columnArticles":128,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.9996374553,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":10992,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5227528904061061,"acs":81160,"articleLive":2,"columnArticles":591,"formTitle":"[187]重复的DNA序列","frequency":3.3650295064,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":155255,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39776136345208946,"acs":98115,"articleLive":2,"columnArticles":764,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9851143011,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":246668,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.44663023102071125,"acs":394546,"articleLive":2,"columnArticles":1983,"formTitle":"[189]轮转数组","frequency":3.6678779189,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":883384,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7017920236134664,"acs":143607,"articleLive":2,"columnArticles":901,"formTitle":"[190]颠倒二进制位","frequency":1.8883353802,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":204629,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7506367702576512,"acs":206588,"articleLive":2,"columnArticles":1305,"formTitle":"[191]位1的个数","frequency":1.3307781213,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":275217,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35731631382316315,"acs":22954,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.1544941029,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64240,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.326634893536302,"acs":27551,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.6568080393,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84348,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3462510264670583,"acs":10963,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.0291817016,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31662,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4379311941473353,"acs":37832,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":1.9759656084,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":86388,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6648629345148385,"acs":109844,"articleLive":2,"columnArticles":430,"formTitle":"[196]删除重复的电子邮箱","frequency":2.8623361416,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":165213,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334615684541603,"acs":102614,"articleLive":2,"columnArticles":559,"formTitle":"[197]上升的温度","frequency":2.9577848625,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":192355,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5205212623311943,"acs":434781,"articleLive":2,"columnArticles":2975,"formTitle":"[198]打家劫舍","frequency":3.6900347691,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":835280,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.652647673369133,"acs":158363,"articleLive":2,"columnArticles":1747,"formTitle":"[199]二叉树的右视图","frequency":3.1136868563,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":242647,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5635662326231587,"acs":370090,"articleLive":2,"columnArticles":2329,"formTitle":"[200]岛屿数量","frequency":4.0886090323,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":656693,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5281072717895823,"acs":53248,"articleLive":2,"columnArticles":347,"formTitle":"[201]数字范围按位与","frequency":1.3914088712,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":100828,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6212619568143173,"acs":189260,"articleLive":2,"columnArticles":1531,"formTitle":"[202]快乐数","frequency":2.9851143011,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":304638,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5222850299214319,"acs":267763,"articleLive":2,"columnArticles":1864,"formTitle":"[203]移除链表元素","frequency":1.6895656358,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":512676,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3773314415772516,"acs":178717,"articleLive":2,"columnArticles":769,"formTitle":"[204]计数质数","frequency":2.7947885255,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":473634,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49926929231573103,"acs":122305,"articleLive":2,"columnArticles":942,"formTitle":"[205]同构字符串","frequency":2.4987636499,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":244968,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7243985807300135,"acs":801944,"articleLive":2,"columnArticles":7771,"formTitle":"[206]反转链表","frequency":3.9728800089,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1107048,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5406439662513104,"acs":159364,"articleLive":2,"columnArticles":1034,"formTitle":"[207]课程表","frequency":3.2118222333,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":294767,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7181096814694047,"acs":159006,"articleLive":2,"columnArticles":1073,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.8660615813,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":221423,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4768861329337338,"acs":228180,"articleLive":2,"columnArticles":1597,"formTitle":"[209]长度最小的子数组","frequency":3.0412772906,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":478479,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5463831459018809,"acs":100134,"articleLive":2,"columnArticles":753,"formTitle":"[210]课程表 II","frequency":2.2450992954,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":183267,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.5111667461452869,"acs":51452,"articleLive":2,"columnArticles":561,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4234560486,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":100656,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46434234699936433,"acs":66472,"articleLive":2,"columnArticles":599,"formTitle":"[212]单词搜索 II","frequency":1.6895656358,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":143153,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4342799831081081,"acs":189221,"articleLive":2,"columnArticles":1711,"formTitle":"[213]打家劫舍 II","frequency":2.9936815509,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":435712,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3743394511051764,"acs":32940,"articleLive":2,"columnArticles":334,"formTitle":"[214]最短回文串","frequency":2.5658128862,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":87995,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463340707234126,"acs":489388,"articleLive":2,"columnArticles":2531,"formTitle":"[215]数组中的第K个最大元素","frequency":4.0966593092,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":757175,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7358330892165479,"acs":113035,"articleLive":2,"columnArticles":1145,"formTitle":"[216]组合总和 III","frequency":3.1617268329,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":153615,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5555917168136129,"acs":431907,"articleLive":2,"columnArticles":2020,"formTitle":"[217]存在重复元素","frequency":4.4268229143,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":777382,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417706036660926,"acs":33664,"articleLive":2,"columnArticles":299,"formTitle":"[218]天际线问题","frequency":3.744738008,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62137,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4221810777073439,"acs":121079,"articleLive":2,"columnArticles":1000,"formTitle":"[219]存在重复元素 II","frequency":2.3966341549,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":286794,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2869160798983447,"acs":68416,"articleLive":2,"columnArticles":451,"formTitle":"[220]存在重复元素 III","frequency":1.8663395523,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":238453,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4787466353614605,"acs":154560,"articleLive":2,"columnArticles":1102,"formTitle":"[221]最大正方形","frequency":3.5117586866,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":322843,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7847310988022534,"acs":132607,"articleLive":2,"columnArticles":973,"formTitle":"[222]完全二叉树的节点个数","frequency":2.0632850908,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":168984,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5249682710143513,"acs":43018,"articleLive":2,"columnArticles":532,"formTitle":"[223]矩形面积","frequency":3.3485453903,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":81944,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4175899935982666,"acs":76320,"articleLive":2,"columnArticles":695,"formTitle":"[224]基本计算器","frequency":3.1068757688,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":182763,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6746099684927148,"acs":150521,"articleLive":2,"columnArticles":4836,"formTitle":"[225]用队列实现栈","frequency":1.9458004417,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":223123,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7881173128052645,"acs":345632,"articleLive":2,"columnArticles":2070,"formTitle":"[226]翻转二叉树","frequency":3.6144486381,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":438554,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4371445591369826,"acs":93931,"articleLive":2,"columnArticles":753,"formTitle":"[227]基本计算器 II","frequency":3.1267248506,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":214874,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5766557205272859,"acs":61637,"articleLive":2,"columnArticles":701,"formTitle":"[228]汇总区间","frequency":0.4626968388,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":106887,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5342699244619983,"acs":71153,"articleLive":2,"columnArticles":667,"formTitle":"[229]求众数 II","frequency":2.826879292,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":133178,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7522076775232456,"acs":173769,"articleLive":2,"columnArticles":1192,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.797440042,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":231012,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5046735274679327,"acs":187085,"articleLive":2,"columnArticles":1337,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":370705,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6897144941727628,"acs":179612,"articleLive":2,"columnArticles":1410,"formTitle":"[232]用栈实现队列","frequency":2.5239920313,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":260415,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47705375752094065,"acs":36393,"articleLive":2,"columnArticles":441,"formTitle":"[233]数字 1 的个数","frequency":3.1772406408,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76287,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5020342917204984,"acs":343896,"articleLive":2,"columnArticles":2165,"formTitle":"[234]回文链表","frequency":3.4077719249,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":685005,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6678628135916164,"acs":189279,"articleLive":2,"columnArticles":1094,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.8350727012,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":283410,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6833054354780449,"acs":289427,"articleLive":2,"columnArticles":1564,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.4645565165,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":423569,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8568323281624542,"acs":257006,"articleLive":2,"columnArticles":1350,"formTitle":"[237]删除链表中的节点","frequency":2.5914224804,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":299949,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7249525526665401,"acs":152791,"articleLive":2,"columnArticles":964,"formTitle":"[238]除自身以外数组的乘积","frequency":2.4987636499,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":210760,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4968814636574085,"acs":217647,"articleLive":2,"columnArticles":1487,"formTitle":"[239]滑动窗口最大值","frequency":3.4916557754,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":438026,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.49752376641014034,"acs":219806,"articleLive":2,"columnArticles":1118,"formTitle":"[240]搜索二维矩阵 II","frequency":3.2174713275,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":441800,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7353701330083419,"acs":34997,"articleLive":2,"columnArticles":321,"formTitle":"[241]为运算表达式设计优先级","frequency":2.7435845489,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":47591,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6473016023401509,"acs":327945,"articleLive":2,"columnArticles":1904,"formTitle":"[242]有效的字母异位词","frequency":2.2701118544,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":506634,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6572390572390573,"acs":9760,"articleLive":2,"columnArticles":118,"formTitle":"[243]最短单词距离","frequency":0.4365173332,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14850,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5597964376590331,"acs":5720,"articleLive":2,"columnArticles":68,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10218,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5939680957128615,"acs":4766,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":1.0598966468,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8024,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4766592095451156,"acs":6392,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13410,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5267337704312495,"acs":5704,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10829,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46785068245354383,"acs":2845,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6081,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.641175306687772,"acs":6481,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":1.0598966468,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10108,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6371808233454924,"acs":4891,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4113903831,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7676,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5500729539726754,"acs":4147,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":0.9996374553,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7539,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5639192071258311,"acs":13485,"articleLive":2,"columnArticles":170,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":23913,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5052857960813887,"acs":36182,"articleLive":2,"columnArticles":387,"formTitle":"[253]会议室 II","frequency":2.9237486786,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":71607,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687469762941461,"acs":5878,"articleLive":2,"columnArticles":84,"formTitle":"[254]因子的组合","frequency":1.0598966468,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10335,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4769088928002682,"acs":5690,"articleLive":2,"columnArticles":70,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":11931,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6459192290497243,"acs":13003,"articleLive":2,"columnArticles":206,"formTitle":"[256]粉刷房子","frequency":0.4626968388,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20131,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6867800400447253,"acs":158469,"articleLive":2,"columnArticles":1164,"formTitle":"[257]二叉树的所有路径","frequency":2.7045094469,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":230742,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917110203408012,"acs":83825,"articleLive":2,"columnArticles":708,"formTitle":"[258]各位相加","frequency":2.4361649936,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":121185,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5618081839605799,"acs":7867,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.5185304849,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14003,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7404232049012429,"acs":79885,"articleLive":2,"columnArticles":710,"formTitle":"[260]只出现一次的数字 III","frequency":3.1478354054,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":107891,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4979876160990712,"acs":9651,"articleLive":2,"columnArticles":133,"formTitle":"[261]以图判树","frequency":1.4234560486,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19380,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43098149955358067,"acs":41513,"articleLive":2,"columnArticles":393,"formTitle":"[262]行程和用户","frequency":2.9277203263,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":96322,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5142955200658949,"acs":112389,"articleLive":2,"columnArticles":875,"formTitle":"[263]丑数","frequency":1.8034217671,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":218530,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5808033300897394,"acs":107437,"articleLive":2,"columnArticles":665,"formTitle":"[264]丑数 II","frequency":2.6613267091,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":184980,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5989506982485919,"acs":7763,"articleLive":2,"columnArticles":171,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":12961,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6791915480018373,"acs":7393,"articleLive":2,"columnArticles":113,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10885,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44704610951008644,"acs":3723,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8328,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6515105789732656,"acs":198613,"articleLive":2,"columnArticles":1537,"formTitle":"[268]丢失的数字","frequency":2.3966341549,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":304850,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3446106928428476,"acs":7232,"articleLive":2,"columnArticles":115,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":20986,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5636188447690045,"acs":11114,"articleLive":2,"columnArticles":147,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.4113903831,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19719,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.555786686838124,"acs":2939,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.5483656333,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5288,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.648368456832087,"acs":3815,"articleLive":2,"columnArticles":85,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4900060181,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5884,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3664922761060196,"acs":29632,"articleLive":2,"columnArticles":359,"formTitle":"[273]整数转换英文表示","frequency":2.5914224804,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":80853,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4401694069197891,"acs":56435,"articleLive":2,"columnArticles":594,"formTitle":"[274]H 指数","frequency":2.9301397019,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128212,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4609626227679544,"acs":52895,"articleLive":2,"columnArticles":439,"formTitle":"[275]H 指数 II","frequency":2.107756625,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":114749,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49917725268215624,"acs":7584,"articleLive":2,"columnArticles":142,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15193,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5728454172366622,"acs":8375,"articleLive":2,"columnArticles":96,"formTitle":"[277]搜寻名人","frequency":0.4365173332,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14620,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45274799059975906,"acs":229258,"articleLive":2,"columnArticles":1292,"formTitle":"[278]第一个错误的版本","frequency":3.8310651565,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":506370,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6362663082784267,"acs":223458,"articleLive":2,"columnArticles":1306,"formTitle":"[279]完全平方数","frequency":3.1502520914,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":351202,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6835287548855388,"acs":6121,"articleLive":2,"columnArticles":76,"formTitle":"[280]摆动排序","frequency":1.0291817016,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8955,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7569246699456381,"acs":2924,"articleLive":2,"columnArticles":73,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3863,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48401989481449753,"acs":20339,"articleLive":2,"columnArticles":172,"formTitle":"[282]给表达式添加运算符","frequency":1.4567702553,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42021,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6403650099055858,"acs":571155,"articleLive":2,"columnArticles":3729,"formTitle":"[283]移动零","frequency":3.9370414989,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":891921,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7703998337736353,"acs":25954,"articleLive":2,"columnArticles":218,"formTitle":"[284]窥探迭代器","frequency":1.8663395523,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33689,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.635357168041746,"acs":9010,"articleLive":2,"columnArticles":114,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14181,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5174185717175804,"acs":12788,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24715,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6552000673911212,"acs":194447,"articleLive":2,"columnArticles":1320,"formTitle":"[287]寻找重复数","frequency":2.6039854597,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":296775,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4431341421929924,"acs":3908,"articleLive":2,"columnArticles":63,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8819,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7538270303865537,"acs":55793,"articleLive":2,"columnArticles":854,"formTitle":"[289]生命游戏","frequency":1.6252347774,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74013,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4556647856395067,"acs":89226,"articleLive":2,"columnArticles":1181,"formTitle":"[290]单词规律","frequency":2.1911730311,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":195815,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5255530129672006,"acs":2756,"articleLive":2,"columnArticles":61,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5244,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7077511181485705,"acs":119789,"articleLive":2,"columnArticles":795,"formTitle":"[292]Nim 游戏","frequency":2.1544941029,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":169253,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7127360385697067,"acs":5322,"articleLive":2,"columnArticles":88,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7467,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5819035049127438,"acs":3968,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6819,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5226285628110391,"acs":69311,"articleLive":2,"columnArticles":546,"formTitle":"[295]数据流的中位数","frequency":3.1267248506,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":132620,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6205387980658531,"acs":2695,"articleLive":2,"columnArticles":50,"formTitle":"[296]最佳的碰头地点","frequency":1.0918686795,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4343,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5637544613731434,"acs":117518,"articleLive":2,"columnArticles":824,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.9539431367,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":208456,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5819310054690787,"acs":5533,"articleLive":2,"columnArticles":87,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9508,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.564280910410251,"acs":63766,"articleLive":2,"columnArticles":727,"formTitle":"[299]猜数字游戏","frequency":2.4987636499,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113004,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5216556207797143,"acs":400872,"articleLive":2,"columnArticles":2207,"formTitle":"[300]最长递增子序列","frequency":3.5396893852,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":768461,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5477888872307616,"acs":55061,"articleLive":2,"columnArticles":394,"formTitle":"[301]删除无效的括号","frequency":2.8944725831,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":100515,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6586879432624113,"acs":2229,"articleLive":2,"columnArticles":42,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3384,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7312922270295615,"acs":137246,"articleLive":2,"columnArticles":843,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.6252347774,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":187676,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5579301869024628,"acs":69912,"articleLive":2,"columnArticles":619,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.5368771169,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":125306,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3953804347826087,"acs":4947,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.4626968388,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12512,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3384210233489735,"acs":18248,"articleLive":2,"columnArticles":274,"formTitle":"[306]累加数","frequency":2.2207434884,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":53921,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5310075126067716,"acs":25799,"articleLive":2,"columnArticles":250,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.4900060181,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":48585,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6169839679358717,"acs":2463,"articleLive":2,"columnArticles":51,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3992,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6160838413003957,"acs":132503,"articleLive":2,"columnArticles":1046,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.3764017239,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":215073,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.38237897998545545,"acs":24187,"articleLive":2,"columnArticles":229,"formTitle":"[310]最小高度树","frequency":1.6252347774,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":63254,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.763212337784465,"acs":4058,"articleLive":2,"columnArticles":49,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0918686795,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5317,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6846943379201443,"acs":60705,"articleLive":2,"columnArticles":414,"formTitle":"[312]戳气球","frequency":2.7543837899,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":88660,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6164973308076459,"acs":42960,"articleLive":2,"columnArticles":372,"formTitle":"[313]超级丑数","frequency":2.5914224804,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":69684,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5514047231270358,"acs":5417,"articleLive":2,"columnArticles":98,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9824,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4173109203962456,"acs":52953,"articleLive":2,"columnArticles":494,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.4987636499,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":126891,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4768323559893476,"acs":72695,"articleLive":2,"columnArticles":587,"formTitle":"[316]去除重复字母","frequency":3.1267248506,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":152454,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4823689849990259,"acs":4952,"articleLive":2,"columnArticles":69,"formTitle":"[317]离建筑物最近的距离","frequency":0.4626968388,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10266,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7365991879180908,"acs":50432,"articleLive":2,"columnArticles":492,"formTitle":"[318]最大单词长度乘积","frequency":2.4361649936,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68466,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5706361120232678,"acs":48657,"articleLive":2,"columnArticles":443,"formTitle":"[319]灯泡开关","frequency":2.826879292,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85268,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6817702845100105,"acs":3235,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4745,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4233532205040789,"acs":27816,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.4914477937,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":65704,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.447907219538945,"acs":339786,"articleLive":2,"columnArticles":1985,"formTitle":"[322]零钱兑换","frequency":3.4539235857,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":758608,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6319065747504887,"acs":12283,"articleLive":2,"columnArticles":166,"formTitle":"[323]无向图中连通分量的数目","frequency":1.7589897586,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19438,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37988245126111436,"acs":27728,"articleLive":2,"columnArticles":181,"formTitle":"[324]摆动排序 II","frequency":1.9458004417,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":72991,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5348679756262694,"acs":10270,"articleLive":2,"columnArticles":125,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.0291817016,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19201,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5047247889035557,"acs":144534,"articleLive":2,"columnArticles":614,"formTitle":"[326]3 的幂","frequency":2.4987636499,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":286362,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.4181847649918963,"acs":25802,"articleLive":2,"columnArticles":214,"formTitle":"[327]区间和的个数","frequency":1.7235940976,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":61700,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.654788735735807,"acs":138000,"articleLive":2,"columnArticles":1145,"formTitle":"[328]奇偶链表","frequency":3.0036321018,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":210755,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4902974692196962,"acs":60968,"articleLive":2,"columnArticles":534,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.5316938562,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":124349,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5322129619475819,"acs":19413,"articleLive":2,"columnArticles":154,"formTitle":"[330]按要求补齐数组","frequency":1.0918686795,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36476,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47937013338231843,"acs":46973,"articleLive":2,"columnArticles":521,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.9996374553,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":97989,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4509649712836964,"acs":43579,"articleLive":2,"columnArticles":355,"formTitle":"[332]重新安排行程","frequency":1.0918686795,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":96635,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46964334331609037,"acs":5175,"articleLive":2,"columnArticles":89,"formTitle":"[333]最大 BST 子树","frequency":0.5185304849,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11019,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4113373710397889,"acs":51752,"articleLive":2,"columnArticles":335,"formTitle":"[334]递增的三元子序列","frequency":2.2207434884,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":125814,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.43038073645532016,"acs":16515,"articleLive":2,"columnArticles":148,"formTitle":"[335]路径交叉","frequency":1.9698516251,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38373,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40099356283235377,"acs":22924,"articleLive":2,"columnArticles":198,"formTitle":"[336]回文对","frequency":1.0918686795,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57168,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6072143009150883,"acs":142665,"articleLive":2,"columnArticles":998,"formTitle":"[337]打家劫舍 III","frequency":3.2933802907,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":234950,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7866502940723354,"acs":173609,"articleLive":2,"columnArticles":1475,"formTitle":"[338]比特位计数","frequency":2.295816246,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":220694,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8189841145322613,"acs":4176,"articleLive":2,"columnArticles":65,"formTitle":"[339]嵌套列表权重和","frequency":0.5483656333,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5099,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49693319131744224,"acs":13530,"articleLive":2,"columnArticles":200,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.4234560486,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27227,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7260432506627552,"acs":53953,"articleLive":2,"columnArticles":506,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.8034217671,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74311,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5179258226310699,"acs":92110,"articleLive":2,"columnArticles":805,"formTitle":"[342]4的幂","frequency":1.6568080393,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":177844,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.609740558000326,"acs":123456,"articleLive":2,"columnArticles":1150,"formTitle":"[343]整数拆分","frequency":3.2839373499,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":202473,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7744254849416286,"acs":416723,"articleLive":2,"columnArticles":2200,"formTitle":"[344]反转字符串","frequency":2.9798486368,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":538106,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5400085134559902,"acs":114174,"articleLive":2,"columnArticles":1083,"formTitle":"[345]反转字符串中的元音字母","frequency":2.7947885255,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":211430,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7089724732086573,"acs":13496,"articleLive":2,"columnArticles":147,"formTitle":"[346]数据流中的移动平均值","frequency":0.4626968388,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19036,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6234015451961531,"acs":224154,"articleLive":2,"columnArticles":1669,"formTitle":"[347]前 K 个高频元素","frequency":3.3292778996,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":359566,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6019142919295193,"acs":5534,"articleLive":2,"columnArticles":86,"formTitle":"[348]设计井字棋","frequency":0.4900060181,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9194,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385406615642595,"acs":236511,"articleLive":2,"columnArticles":1655,"formTitle":"[349]两个数组的交集","frequency":3.4341312917,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":320241,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5524246164697584,"acs":281952,"articleLive":2,"columnArticles":1593,"formTitle":"[350]两个数组的交集 II","frequency":3.3022314725,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":510390,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5918692283197113,"acs":5576,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9421,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6780057538490721,"acs":21446,"articleLive":2,"columnArticles":353,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.8343265753,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31631,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.43044302706429927,"acs":2497,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.4626968388,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5801,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45835402298850575,"acs":74769,"articleLive":2,"columnArticles":581,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.6244386845,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":163125,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4091292490229707,"acs":29103,"articleLive":2,"columnArticles":486,"formTitle":"[355]设计推特","frequency":1.6895656358,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71134,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35419659347424587,"acs":1726,"articleLive":2,"columnArticles":43,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4873,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5203756130627218,"acs":26101,"articleLive":2,"columnArticles":416,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.8663395523,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50158,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35295434198746645,"acs":4731,"articleLive":2,"columnArticles":62,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.5796181768,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13404,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7286527514231499,"acs":5376,"articleLive":2,"columnArticles":63,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7378,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6032692307692308,"acs":3137,"articleLive":2,"columnArticles":64,"formTitle":"[360]有序转化数组","frequency":0.5185304849,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5200,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.564729397293973,"acs":3673,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6504,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6898173268222102,"acs":3814,"articleLive":2,"columnArticles":71,"formTitle":"[362]敲击计数器","frequency":0.4626968388,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5529,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48786693884592164,"acs":33937,"articleLive":2,"columnArticles":223,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69562,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7312633832976445,"acs":2049,"articleLive":2,"columnArticles":50,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2802,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3688317625910494,"acs":35496,"articleLive":2,"columnArticles":494,"formTitle":"[365]水壶问题","frequency":2.5914224804,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96239,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7665177146504948,"acs":4803,"articleLive":2,"columnArticles":127,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4626968388,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6266,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4476609684436842,"acs":123263,"articleLive":2,"columnArticles":982,"formTitle":"[367]有效的完全平方数","frequency":2.2207434884,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":275349,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45937303417907316,"acs":43815,"articleLive":2,"columnArticles":466,"formTitle":"[368]最大整除子集","frequency":2.2828752695,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":95380,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6186686876342049,"acs":4898,"articleLive":2,"columnArticles":139,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7917,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7398843930635838,"acs":3968,"articleLive":2,"columnArticles":60,"formTitle":"[370]区间加法","frequency":0.9996374553,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5363,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128615721320445,"acs":84008,"articleLive":2,"columnArticles":527,"formTitle":"[371]两整数之和","frequency":3.0173262562,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137075,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5747448979591837,"acs":36048,"articleLive":2,"columnArticles":373,"formTitle":"[372]超级次方","frequency":1.0918686795,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":62720,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4069723584244841,"acs":22659,"articleLive":2,"columnArticles":240,"formTitle":"[373]查找和最小的K对数字","frequency":1.8663395523,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":55677,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5176344852155326,"acs":90086,"articleLive":2,"columnArticles":616,"formTitle":"[374]猜数字大小","frequency":0.9996374553,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":174034,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6007793557325943,"acs":34689,"articleLive":2,"columnArticles":273,"formTitle":"[375]猜数字大小 II","frequency":2.6762190171,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":57740,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4673433169374363,"acs":85321,"articleLive":2,"columnArticles":899,"formTitle":"[376]摆动序列","frequency":1.7735545369,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":182566,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5127196074763666,"acs":71267,"articleLive":2,"columnArticles":602,"formTitle":"[377]组合总和 Ⅳ","frequency":1.8995387239,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":138998,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.628788265399112,"acs":86249,"articleLive":2,"columnArticles":606,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.2828752695,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":137167,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.628665056916178,"acs":3645,"articleLive":2,"columnArticles":78,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5798,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5058864714882141,"acs":39017,"articleLive":2,"columnArticles":252,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.1911730311,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":77126,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4390643985419198,"acs":21681,"articleLive":2,"columnArticles":181,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.5483656333,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49380,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6376679654783147,"acs":17511,"articleLive":2,"columnArticles":139,"formTitle":"[382]链表随机节点","frequency":1.3307781213,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27461,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6422461717984566,"acs":116682,"articleLive":2,"columnArticles":1257,"formTitle":"[383]赎金信","frequency":1.1828233549,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":181678,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.6069586065661503,"acs":85061,"articleLive":2,"columnArticles":403,"formTitle":"[384]打乱数组","frequency":2.6613267091,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":140143,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4195232201474466,"acs":7796,"articleLive":2,"columnArticles":94,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18583,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495614170077868,"acs":24354,"articleLive":2,"columnArticles":258,"formTitle":"[386]字典序排数","frequency":2.4987636499,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32491,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5387543659981947,"acs":247104,"articleLive":2,"columnArticles":1364,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.8944725831,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":458658,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5354789272030651,"acs":6988,"articleLive":2,"columnArticles":132,"formTitle":"[388]文件的最长绝对路径","frequency":1.0291817016,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13050,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6898689280989782,"acs":107950,"articleLive":2,"columnArticles":1077,"formTitle":"[389]找不同","frequency":0.4365173332,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":156479,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46717156293898493,"acs":7649,"articleLive":2,"columnArticles":103,"formTitle":"[390]消除游戏","frequency":1.8034217671,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":16373,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.46752372472800713,"acs":21529,"articleLive":2,"columnArticles":196,"formTitle":"[391]完美矩形","frequency":2.1544941029,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46049,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.516451584782728,"acs":159959,"articleLive":2,"columnArticles":1719,"formTitle":"[392]判断子序列","frequency":2.3774764808,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":309727,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39280260274882145,"acs":11832,"articleLive":2,"columnArticles":142,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30122,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5543210237110778,"acs":132858,"articleLive":2,"columnArticles":1404,"formTitle":"[394]字符串解码","frequency":3.8424082908,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":239677,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5201617092822262,"acs":55069,"articleLive":2,"columnArticles":450,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.5914224804,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":105869,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.437190900098912,"acs":10166,"articleLive":2,"columnArticles":170,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23253,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.4318101279279918,"acs":48741,"articleLive":2,"columnArticles":563,"formTitle":"[397]整数替换","frequency":3.0173262562,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":112876,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6640173109733262,"acs":15957,"articleLive":2,"columnArticles":134,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24031,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5910596243209634,"acs":45154,"articleLive":2,"columnArticles":557,"formTitle":"[399]除法求值","frequency":1.1962391719,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":76395,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.45444488599138627,"acs":42312,"articleLive":2,"columnArticles":482,"formTitle":"[400]第 N 位数字","frequency":2.1120195695,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93107,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6153567944938242,"acs":56147,"articleLive":2,"columnArticles":683,"formTitle":"[401]二进制手表","frequency":1.3914088712,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91243,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32658634054109026,"acs":86709,"articleLive":2,"columnArticles":639,"formTitle":"[402]移掉 K 位数字","frequency":2.9237486786,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":265501,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45555960557111613,"acs":47493,"articleLive":2,"columnArticles":471,"formTitle":"[403]青蛙过河","frequency":2.0729826067,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104252,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5893967207643206,"acs":113018,"articleLive":2,"columnArticles":1246,"formTitle":"[404]左叶子之和","frequency":3.1136868563,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":191752,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5596856142961784,"acs":48138,"articleLive":2,"columnArticles":484,"formTitle":"[405]数字转换为十六进制数","frequency":2.6244386845,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86009,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7396494332068753,"acs":130432,"articleLive":2,"columnArticles":857,"formTitle":"[406]根据身高重建队列","frequency":2.6487447615,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":176343,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5798954895489549,"acs":25302,"articleLive":2,"columnArticles":252,"formTitle":"[407]接雨水 II","frequency":3.1601081333,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43632,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3315534379364167,"acs":4036,"articleLive":2,"columnArticles":84,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12173,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558180839612487,"acs":103271,"articleLive":2,"columnArticles":1422,"formTitle":"[409]最长回文串","frequency":2.8066969722,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":185800,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5690273359572977,"acs":42215,"articleLive":2,"columnArticles":351,"formTitle":"[410]分割数组的最大值","frequency":3.0851623896,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74188,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4962292609351433,"acs":987,"articleLive":2,"columnArticles":26,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1989,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7098078733475649,"acs":107066,"articleLive":2,"columnArticles":615,"formTitle":"[412]Fizz Buzz","frequency":2.4669442299,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":150838,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6898994277787411,"acs":79573,"articleLive":2,"columnArticles":1040,"formTitle":"[413]等差数列划分","frequency":2.6322236522,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":115340,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39399375680092763,"acs":93778,"articleLive":2,"columnArticles":1207,"formTitle":"[414]第三大的数","frequency":2.7947885255,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":238019,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5410119857809258,"acs":163760,"articleLive":2,"columnArticles":1172,"formTitle":"[415]字符串相加","frequency":3.9287991279,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":302692,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.509813244925248,"acs":194065,"articleLive":2,"columnArticles":1118,"formTitle":"[416]分割等和子集","frequency":3.1772406408,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":380659,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4862176754759875,"acs":30798,"articleLive":2,"columnArticles":362,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.1870248524,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":63342,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36816524908869985,"acs":2424,"articleLive":2,"columnArticles":35,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6584,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7900911405658806,"acs":33202,"articleLive":2,"columnArticles":436,"formTitle":"[419]甲板上的战舰","frequency":0.0346775385,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42023,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21213648142816008,"acs":2947,"articleLive":2,"columnArticles":55,"formTitle":"[420]强密码检验器","frequency":2.0729826067,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13892,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6209972716829408,"acs":34597,"articleLive":2,"columnArticles":316,"formTitle":"[421]数组中两个数的最大异或值","frequency":1.3307781213,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":55712,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.43301997649823737,"acs":2211,"articleLive":2,"columnArticles":55,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5106,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6120187861533719,"acs":33751,"articleLive":2,"columnArticles":393,"formTitle":"[423]从英文中重建数字","frequency":1.8000531727,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55147,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5327104624767398,"acs":54679,"articleLive":2,"columnArticles":475,"formTitle":"[424]替换后的最长重复字符","frequency":2.5914224804,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":102643,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6181073025335321,"acs":1659,"articleLive":2,"columnArticles":35,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2684,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6752761257434154,"acs":7948,"articleLive":2,"columnArticles":126,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.0291817016,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11770,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6176347680735479,"acs":4434,"articleLive":2,"columnArticles":74,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7179,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6606334841628959,"acs":2920,"articleLive":2,"columnArticles":57,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4420,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7050028008790451,"acs":65444,"articleLive":2,"columnArticles":526,"formTitle":"[429]N 叉树的层序遍历","frequency":1.8034217671,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":92828,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5888208758769632,"acs":46077,"articleLive":2,"columnArticles":699,"formTitle":"[430]扁平化多级双向链表","frequency":2.1544941029,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78253,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7271364317841079,"acs":970,"articleLive":2,"columnArticles":32,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1334,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.38228639155263444,"acs":7096,"articleLive":2,"columnArticles":98,"formTitle":"[432]全 O(1) 的数据结构","frequency":2.1544941029,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18562,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5330379983777376,"acs":17086,"articleLive":2,"columnArticles":241,"formTitle":"[433]最小基因变化","frequency":1.3914088712,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32054,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.39826852794919415,"acs":66475,"articleLive":2,"columnArticles":909,"formTitle":"[434]字符串中的单词数","frequency":3.1601081333,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":166910,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5065319429350967,"acs":109535,"articleLive":2,"columnArticles":964,"formTitle":"[435]无重叠区间","frequency":2.7719204077,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":216245,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48986131277224254,"acs":9784,"articleLive":2,"columnArticles":163,"formTitle":"[436]寻找右区间","frequency":0.4626968388,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":19973,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742620419441629,"acs":134255,"articleLive":2,"columnArticles":1088,"formTitle":"[437]路径总和 III","frequency":2.8944725831,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":233787,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.536514690982776,"acs":132385,"articleLive":2,"columnArticles":1145,"formTitle":"[438]找到字符串中所有字母异位词","frequency":1.9015303597,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":246750,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5912195121951219,"acs":3030,"articleLive":2,"columnArticles":71,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5125,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38219375983785064,"acs":17725,"articleLive":2,"columnArticles":134,"formTitle":"[440]字典序的第K小数字","frequency":3.158112284,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46377,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45875056087877636,"acs":80769,"articleLive":2,"columnArticles":776,"formTitle":"[441]排列硬币","frequency":2.6244386845,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176063,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6977700833074385,"acs":47156,"articleLive":2,"columnArticles":475,"formTitle":"[442]数组中重复的数据","frequency":3.0100745928,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":67581,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4774439128467059,"acs":59077,"articleLive":2,"columnArticles":717,"formTitle":"[443]压缩字符串","frequency":2.8623361416,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":123736,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25588255470947385,"acs":3730,"articleLive":2,"columnArticles":57,"formTitle":"[444]序列重建","frequency":0.5483656333,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14577,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5907121326299924,"acs":87794,"articleLive":2,"columnArticles":990,"formTitle":"[445]两数相加 II","frequency":2.0071693881,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":148624,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5506497834055315,"acs":19830,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3155712755,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36012,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6634907059719642,"acs":49651,"articleLive":2,"columnArticles":386,"formTitle":"[447]回旋镖的数量","frequency":2.2828752695,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":74833,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6510346315675909,"acs":150861,"articleLive":2,"columnArticles":1184,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3620884053,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":231725,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.561497858779006,"acs":16914,"articleLive":2,"columnArticles":151,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.4900060181,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":30123,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4902885682574917,"acs":72447,"articleLive":2,"columnArticles":716,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.275762864,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":147764,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7118692403588394,"acs":87367,"articleLive":2,"columnArticles":1003,"formTitle":"[451]根据字符出现频率排序","frequency":3.1772406408,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":122729,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5079360575104048,"acs":107398,"articleLive":2,"columnArticles":942,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5833448921,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":211440,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6116530675205583,"acs":57496,"articleLive":2,"columnArticles":693,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.826879292,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94001,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6088102618032878,"acs":87995,"articleLive":2,"columnArticles":553,"formTitle":"[454]四数相加 II","frequency":2.9851143011,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":144536,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5759122546549165,"acs":169127,"articleLive":2,"columnArticles":1384,"formTitle":"[455]分发饼干","frequency":3.1314241074,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":293668,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3627303795923349,"acs":59437,"articleLive":2,"columnArticles":473,"formTitle":"[456]132 模式","frequency":2.0071693881,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":163860,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.435482926257834,"acs":29740,"articleLive":2,"columnArticles":338,"formTitle":"[457]环形数组是否存在循环","frequency":2.3494555946,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68292,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6982289442824067,"acs":23221,"articleLive":2,"columnArticles":212,"formTitle":"[458]可怜的小猪","frequency":1.6396650422,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33257,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5095507791887994,"acs":86910,"articleLive":2,"columnArticles":697,"formTitle":"[459]重复的子字符串","frequency":2.0729826067,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":170562,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43443934580538884,"acs":36923,"articleLive":2,"columnArticles":427,"formTitle":"[460]LFU 缓存","frequency":2.6244386845,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":84990,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8130462414979018,"acs":180380,"articleLive":2,"columnArticles":1441,"formTitle":"[461]汉明距离","frequency":1.7446608131,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":221857,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6096027660995639,"acs":15515,"articleLive":2,"columnArticles":148,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.3605422232,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25451,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7050629497918528,"acs":83667,"articleLive":2,"columnArticles":1011,"formTitle":"[463]岛屿的周长","frequency":2.4697929101,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":118666,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3546648117554995,"acs":12237,"articleLive":2,"columnArticles":118,"formTitle":"[464]我能赢吗","frequency":1.1598715277,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34503,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5351149782473587,"acs":1722,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.8430683946,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3218,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.372982158028887,"acs":11853,"articleLive":2,"columnArticles":184,"formTitle":"[466]统计重复个数","frequency":1.6048050577,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31779,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44226284861486803,"acs":9483,"articleLive":2,"columnArticles":123,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.9996374553,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21442,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25315007857760585,"acs":27223,"articleLive":2,"columnArticles":321,"formTitle":"[468]验证IP地址","frequency":2.463474173,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":107537,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4318738101713353,"acs":1588,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.6815479423,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3677,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5475639913928766,"acs":68198,"articleLive":2,"columnArticles":351,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.0412772906,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":124548,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6019880715705765,"acs":1514,"articleLive":2,"columnArticles":26,"formTitle":"[471]编码最短长度的字符串","frequency":2.0729826067,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2515,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3901313258970273,"acs":7100,"articleLive":2,"columnArticles":88,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":18199,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42124462350955516,"acs":23211,"articleLive":2,"columnArticles":199,"formTitle":"[473]火柴拼正方形","frequency":2.2207434884,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55101,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6154280891594954,"acs":81671,"articleLive":2,"columnArticles":653,"formTitle":"[474]一和零","frequency":2.0926915615,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":132706,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.4017230376515635,"acs":49101,"articleLive":2,"columnArticles":554,"formTitle":"[475]供暖器","frequency":2.5073187539,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":122226,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123005995541222,"acs":65818,"articleLive":2,"columnArticles":886,"formTitle":"[476]数字的补数","frequency":2.1230732056,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92402,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039017013232514,"acs":39933,"articleLive":2,"columnArticles":340,"formTitle":"[477]汉明距离总和","frequency":0.4626968388,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66125,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4451258688160738,"acs":7621,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":0.9996374553,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17121,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4310985771054993,"acs":3363,"articleLive":2,"columnArticles":34,"formTitle":"[479]最大回文数乘积","frequency":1.0918686795,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7801,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.447314245667314,"acs":30637,"articleLive":2,"columnArticles":417,"formTitle":"[480]滑动窗口中位数","frequency":2.2207434884,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68491,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.547911547911548,"acs":6244,"articleLive":2,"columnArticles":106,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11396,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4725446329685908,"acs":42667,"articleLive":2,"columnArticles":453,"formTitle":"[482]密钥格式化","frequency":1.3914088712,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90292,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5898798182617617,"acs":16099,"articleLive":2,"columnArticles":121,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27292,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6320792079207921,"acs":1596,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2525,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6085949633902817,"acs":131661,"articleLive":2,"columnArticles":1068,"formTitle":"[485]最大连续 1 的个数","frequency":2.8600812983,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":216336,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5871053078659321,"acs":48381,"articleLive":2,"columnArticles":415,"formTitle":"[486]预测赢家","frequency":2.3155712755,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82406,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5781740135380552,"acs":7004,"articleLive":2,"columnArticles":131,"formTitle":"[487]最大连续1的个数 II","frequency":1.3605422232,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12114,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5262380333293937,"acs":17810,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":2.9362148701,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33844,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7346063912704599,"acs":1885,"articleLive":2,"columnArticles":26,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2566,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48576336130012554,"acs":7353,"articleLive":2,"columnArticles":89,"formTitle":"[490]迷宫","frequency":0.4113903831,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15137,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5410049811043994,"acs":53111,"articleLive":2,"columnArticles":450,"formTitle":"[491]递增子序列","frequency":2.1870248524,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":98171,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6051084452212601,"acs":45699,"articleLive":2,"columnArticles":439,"formTitle":"[492]构造矩形","frequency":2.1870248524,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75522,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34700108500920995,"acs":27504,"articleLive":2,"columnArticles":277,"formTitle":"[493]翻转对","frequency":1.0918686795,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79262,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4916621808052195,"acs":167144,"articleLive":2,"columnArticles":1128,"formTitle":"[494]目标和","frequency":2.826879292,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":339957,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6066883069248826,"acs":66163,"articleLive":2,"columnArticles":952,"formTitle":"[495]提莫攻击","frequency":2.7223455643,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109056,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7049297875821712,"acs":146483,"articleLive":2,"columnArticles":1499,"formTitle":"[496]下一个更大元素 I","frequency":2.7045094469,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":207798,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4052126874846324,"acs":3296,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.5483656333,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8134,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.47828425172540856,"acs":48025,"articleLive":2,"columnArticles":502,"formTitle":"[498]对角线遍历","frequency":2.6244386845,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":100411,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3775094953879544,"acs":2783,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7372,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7444536902528807,"acs":52784,"articleLive":2,"columnArticles":772,"formTitle":"[500]键盘行","frequency":2.2512895408,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":70903,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5173655739325715,"acs":73260,"articleLive":2,"columnArticles":600,"formTitle":"[501]二叉搜索树中的众数","frequency":2.3846147794,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":141602,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4409905937683715,"acs":30005,"articleLive":2,"columnArticles":365,"formTitle":"[502]IPO","frequency":2.2828752695,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68040,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6400668536302088,"acs":112975,"articleLive":2,"columnArticles":1063,"formTitle":"[503]下一个更大元素 II","frequency":2.5499126148,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":176505,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5036706080572856,"acs":33481,"articleLive":2,"columnArticles":359,"formTitle":"[504]七进制数","frequency":0.4113903831,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":66474,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4902847172654453,"acs":6182,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.6124079997,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12609,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.6535012907984511,"acs":56703,"articleLive":2,"columnArticles":731,"formTitle":"[506]相对名次","frequency":1.2893095868,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":86768,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4193079647625102,"acs":32319,"articleLive":2,"columnArticles":259,"formTitle":"[507]完美数","frequency":0.9711860341,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":77077,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6796635755876644,"acs":15758,"articleLive":2,"columnArticles":231,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.3605422232,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23185,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6707214096056594,"acs":285950,"articleLive":2,"columnArticles":1681,"formTitle":"[509]斐波那契数","frequency":2.9879986411,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":426332,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.609522178455215,"acs":3559,"articleLive":2,"columnArticles":58,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5839,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7301895137967405,"acs":21461,"articleLive":2,"columnArticles":117,"formTitle":"[511]游戏玩法分析 I","frequency":1.3605422232,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29391,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5385024321522554,"acs":20259,"articleLive":2,"columnArticles":160,"formTitle":"[512]游戏玩法分析 II","frequency":0.4626968388,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":37621,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7318506497498125,"acs":59528,"articleLive":2,"columnArticles":665,"formTitle":"[513]找树左下角的值","frequency":0.9996374553,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":81339,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4987857826182942,"acs":20334,"articleLive":2,"columnArticles":253,"formTitle":"[514]自由之路","frequency":0.4900060181,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40767,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.64859627908332,"acs":44519,"articleLive":2,"columnArticles":476,"formTitle":"[515]在每个树行中找最大值","frequency":0.9996374553,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":68639,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6576860695620833,"acs":94887,"articleLive":2,"columnArticles":682,"formTitle":"[516]最长回文子序列","frequency":3.089387867,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":144274,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5087516087516087,"acs":19765,"articleLive":2,"columnArticles":170,"formTitle":"[517]超级洗衣机","frequency":2.9301397019,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38850,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.663639989806433,"acs":119791,"articleLive":2,"columnArticles":745,"formTitle":"[518]零钱兑换 II","frequency":3.0944530283,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":180506,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.4702366490111278,"acs":19354,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":1.3210893748,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41158,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5760616980433099,"acs":68420,"articleLive":2,"columnArticles":1049,"formTitle":"[520]检测大写字母","frequency":2.1544941029,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":118772,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7128973853772831,"acs":26775,"articleLive":2,"columnArticles":271,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.4365173332,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37558,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36198914829010903,"acs":7272,"articleLive":2,"columnArticles":115,"formTitle":"[522]最长特殊序列 II","frequency":1.4234560486,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20089,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2759970339339362,"acs":72208,"articleLive":2,"columnArticles":625,"formTitle":"[523]连续的子数组和","frequency":1.1598715277,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":261626,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49644729178800234,"acs":76716,"articleLive":2,"columnArticles":792,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.6613267091,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":154530,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5373299748110831,"acs":47997,"articleLive":2,"columnArticles":541,"formTitle":"[525]连续数组","frequency":2.6586438723,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":89325,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344483443988666,"acs":34735,"articleLive":2,"columnArticles":398,"formTitle":"[526]优美的排列","frequency":3.0506496061,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47294,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5775716694772344,"acs":2055,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3558,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4790699003873033,"acs":33521,"articleLive":2,"columnArticles":267,"formTitle":"[528]按权重随机选择","frequency":2.5316938562,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":69971,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6435105685472541,"acs":41222,"articleLive":2,"columnArticles":481,"formTitle":"[529]扫雷游戏","frequency":1.594767836,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64058,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6213570681827946,"acs":86775,"articleLive":2,"columnArticles":695,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.2993162117,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":139654,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6623586429725363,"acs":4100,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6190,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37891608242438035,"acs":26645,"articleLive":2,"columnArticles":296,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.4113903831,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70319,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5291452733313199,"acs":1752,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3311,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6748070353030495,"acs":15999,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.4626968388,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23709,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8442190669371197,"acs":16648,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.9996374553,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19720,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5356978350990327,"acs":3489,"articleLive":2,"columnArticles":57,"formTitle":"[536]从字符串生成二叉树","frequency":1.0918686795,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6513,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.71316442546315,"acs":12357,"articleLive":2,"columnArticles":190,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17327,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7107564158689967,"acs":120142,"articleLive":2,"columnArticles":923,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.5093309599,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":169034,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6006046226848308,"acs":15695,"articleLive":2,"columnArticles":218,"formTitle":"[539]最小时间差","frequency":1.8995387239,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26132,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5833016407693143,"acs":42945,"articleLive":2,"columnArticles":444,"formTitle":"[540]有序数组中的单一元素","frequency":2.1544941029,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":73624,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.602385788296244,"acs":81857,"articleLive":2,"columnArticles":864,"formTitle":"[541]反转字符串 II","frequency":2.5960693289,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":135888,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4576707107736173,"acs":78653,"articleLive":2,"columnArticles":720,"formTitle":"[542]01 矩阵","frequency":2.6133051917,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":171855,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.556572500499443,"acs":164372,"articleLive":2,"columnArticles":1322,"formTitle":"[543]二叉树的直径","frequency":3.2408550897,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":295329,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7136941733215025,"acs":2413,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3381,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.423779437105112,"acs":3689,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8705,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6264510610565761,"acs":15380,"articleLive":2,"columnArticles":123,"formTitle":"[546]移除盒子","frequency":0.5483656333,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24551,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.618791842908765,"acs":176722,"articleLive":2,"columnArticles":1235,"formTitle":"[547]省份数量","frequency":1.9543169299,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":285592,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3549260570714434,"acs":1704,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.9437569969,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4801,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4899413243922883,"acs":2338,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4772,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4380872639315285,"acs":14127,"articleLive":2,"columnArticles":195,"formTitle":"[550]游戏玩法分析 IV","frequency":1.0918686795,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32247,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5676278447370622,"acs":61083,"articleLive":2,"columnArticles":776,"formTitle":"[551]学生出勤记录 I","frequency":2.2828752695,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":107611,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5771425887216103,"acs":24573,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.2512895408,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42577,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6059589959762407,"acs":6325,"articleLive":2,"columnArticles":97,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10438,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5040907103009099,"acs":47258,"articleLive":2,"columnArticles":494,"formTitle":"[554]砖墙","frequency":2.0729826067,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":93749,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3440448113207547,"acs":1167,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3392,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32940648948312407,"acs":16162,"articleLive":2,"columnArticles":241,"formTitle":"[556]下一个更大元素 III","frequency":2.1544941029,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49064,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7434950054158141,"acs":185331,"articleLive":2,"columnArticles":1551,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3874935822,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":249270,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.50467596390484,"acs":3076,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6095,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7400105988341282,"acs":90766,"articleLive":2,"columnArticles":804,"formTitle":"[559]N 叉树的最大深度","frequency":1.8609238878,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":122655,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4461726425105127,"acs":169447,"articleLive":2,"columnArticles":1031,"formTitle":"[560]和为 K 的子数组","frequency":3.7943254078,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":379779,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7764632120639677,"acs":95359,"articleLive":2,"columnArticles":790,"formTitle":"[561]数组拆分 I","frequency":1.6568080393,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":122812,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4722128662849444,"acs":4206,"articleLive":2,"columnArticles":69,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.4900060181,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8907,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6540802438891611,"acs":60074,"articleLive":2,"columnArticles":602,"formTitle":"[563]二叉树的坡度","frequency":2.3155712755,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":91845,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.18190586419753085,"acs":4715,"articleLive":2,"columnArticles":84,"formTitle":"[564]寻找最近的回文数","frequency":1.0291817016,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":25920,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6070734705205979,"acs":15311,"articleLive":2,"columnArticles":151,"formTitle":"[565]数组嵌套","frequency":1.4234560486,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25221,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6790281873263254,"acs":79906,"articleLive":2,"columnArticles":754,"formTitle":"[566]重塑矩阵","frequency":2.4361649936,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":117677,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4337356183371872,"acs":138618,"articleLive":2,"columnArticles":1251,"formTitle":"[567]字符串的排列","frequency":3.0821119327,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":319591,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5058209554395825,"acs":1260,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2491,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5645594463381882,"acs":10931,"articleLive":2,"columnArticles":167,"formTitle":"[569]员工薪水中位数","frequency":1.9698516251,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19362,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6589826201388573,"acs":14522,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.4626968388,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22037,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4775468308955607,"acs":7444,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.5796181768,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15588,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47378764727170375,"acs":94261,"articleLive":2,"columnArticles":815,"formTitle":"[572]另一棵树的子树","frequency":2.7947885255,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":198952,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6568509615384616,"acs":1093,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1664,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6492637215528781,"acs":14065,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4365173332,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21663,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7119146365358239,"acs":87201,"articleLive":2,"columnArticles":842,"formTitle":"[575]分糖果","frequency":3.0506496061,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":122488,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4682179440357559,"acs":26923,"articleLive":2,"columnArticles":291,"formTitle":"[576]出界的路径数","frequency":2.2207434884,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57501,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6986351599103687,"acs":17148,"articleLive":2,"columnArticles":93,"formTitle":"[577]员工奖金","frequency":1.6252347774,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24545,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4855803255484784,"acs":10978,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.0918686795,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22608,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40996444700682233,"acs":8533,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.4900060181,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":20814,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5225651005467519,"acs":11278,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.4567702553,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21582,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40601523901371206,"acs":106093,"articleLive":2,"columnArticles":910,"formTitle":"[581]最短无序连续子数组","frequency":2.8944725831,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":261303,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.41681678976760944,"acs":9255,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22204,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6262756376800329,"acs":56398,"articleLive":2,"columnArticles":533,"formTitle":"[583]两个字符串的删除操作","frequency":3.2630197317,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":90053,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7736751964537578,"acs":15359,"articleLive":2,"columnArticles":65,"formTitle":"[584]寻找用户推荐人","frequency":0.4900060181,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":19852,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.575147195537651,"acs":9280,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.4900060181,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16135,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7432481751824818,"acs":16292,"articleLive":2,"columnArticles":92,"formTitle":"[586]订单最多的客户","frequency":1.0598966468,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":21920,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.39024804621134895,"acs":2297,"articleLive":2,"columnArticles":39,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5886,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42466783655051393,"acs":1694,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.6461560426,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3989,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7465896045287201,"acs":94298,"articleLive":2,"columnArticles":607,"formTitle":"[589]N 叉树的前序遍历","frequency":1.5368771169,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":126305,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7631816571226097,"acs":66770,"articleLive":2,"columnArticles":502,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":87489,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34179446500969507,"acs":1939,"articleLive":2,"columnArticles":43,"formTitle":"[591]标签验证器","frequency":1.2742818789,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5673,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5274713271436373,"acs":4829,"articleLive":2,"columnArticles":115,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9155,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4428774300964693,"acs":9044,"articleLive":2,"columnArticles":145,"formTitle":"[593]有效的正方形","frequency":1.6252347774,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20421,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5659363648466176,"acs":59515,"articleLive":2,"columnArticles":543,"formTitle":"[594]最长和谐子序列","frequency":2.4361649936,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105162,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.790833845375357,"acs":109400,"articleLive":2,"columnArticles":253,"formTitle":"[595]大的国家","frequency":1.7735545369,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":138335,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.43147180679310565,"acs":87792,"articleLive":2,"columnArticles":314,"formTitle":"[596]超过5名学生的课","frequency":2.3155712755,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":203471,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44177949709864606,"acs":11420,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.4900060181,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":25850,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5710751665080875,"acs":42014,"articleLive":2,"columnArticles":493,"formTitle":"[598]范围求和 II","frequency":2.4294598592,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73570,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221085055643879,"acs":31527,"articleLive":2,"columnArticles":302,"formTitle":"[599]两个列表的最小索引总和","frequency":0.5185304849,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60384,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4821660260961101,"acs":19696,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.463474173,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40849,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5052786534229465,"acs":33981,"articleLive":2,"columnArticles":406,"formTitle":"[601]体育馆的人流量","frequency":1.8995387239,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67252,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6188473735006205,"acs":8977,"articleLive":2,"columnArticles":99,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":1.1251939893,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14506,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6688598552495535,"acs":14232,"articleLive":2,"columnArticles":123,"formTitle":"[603]连续空余座位","frequency":1.0598966468,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21278,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.374076179647527,"acs":2632,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7036,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3323205869934842,"acs":116489,"articleLive":2,"columnArticles":1336,"formTitle":"[605]种花问题","frequency":2.559517222,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":350532,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5732228360957643,"acs":31126,"articleLive":2,"columnArticles":339,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4365173332,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54300,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6616833317153674,"acs":13632,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.0918686795,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20602,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6266155695822062,"acs":8339,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.0918686795,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13308,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4873011442924923,"acs":6984,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14332,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6633827825190446,"acs":11582,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17459,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5325443204848198,"acs":54131,"articleLive":2,"columnArticles":420,"formTitle":"[611]有效三角形的个数","frequency":4.0025671174,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":101646,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6641555285540705,"acs":8199,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.0598966468,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12345,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8151534526854219,"acs":12749,"articleLive":2,"columnArticles":88,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15640,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3515025267137291,"acs":9112,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.4234560486,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":25923,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42448388265121334,"acs":5860,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13805,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46722437258084654,"acs":3742,"articleLive":2,"columnArticles":63,"formTitle":"[616]给字符串添加加粗标签","frequency":1.3914088712,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8009,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7869217742654268,"acs":211896,"articleLive":2,"columnArticles":1394,"formTitle":"[617]合并二叉树","frequency":3.0811167493,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":269272,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6202734326887548,"acs":5036,"articleLive":2,"columnArticles":50,"formTitle":"[618]学生地理信息报告","frequency":0.4626968388,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8119,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46368653421633554,"acs":12603,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":1.0291817016,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27180,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.772704547940069,"acs":98917,"articleLive":2,"columnArticles":336,"formTitle":"[620]有趣的电影","frequency":2.0071693881,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128014,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5738877756890937,"acs":83344,"articleLive":2,"columnArticles":542,"formTitle":"[621]任务调度器","frequency":3.1209511625,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":145227,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4403724491051867,"acs":71557,"articleLive":2,"columnArticles":469,"formTitle":"[622]设计循环队列","frequency":1.9759656084,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":162492,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5463154507424264,"acs":11884,"articleLive":2,"columnArticles":200,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21753,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42352725942188074,"acs":2315,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.8430683946,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5466,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3443446088794926,"acs":2606,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7568,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6840073529411764,"acs":48373,"articleLive":2,"columnArticles":382,"formTitle":"[626]换座位","frequency":1.0291817016,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":70720,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8092633278034345,"acs":90245,"articleLive":2,"columnArticles":368,"formTitle":"[627]变更性别","frequency":0.9996374553,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":111515,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5242978514471811,"acs":84359,"articleLive":2,"columnArticles":804,"formTitle":"[628]三个数的最大乘积","frequency":1.3914088712,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":160899,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5218532434523152,"acs":18889,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.7435845489,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36196,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.46318851823118695,"acs":23882,"articleLive":2,"columnArticles":226,"formTitle":"[630]课程表 III","frequency":1.2441318713,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51560,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2939068100358423,"acs":1148,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3906,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5991215136994716,"acs":19505,"articleLive":2,"columnArticles":247,"formTitle":"[632]最小区间","frequency":0.4900060181,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32556,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39530467805972724,"acs":98470,"articleLive":2,"columnArticles":803,"formTitle":"[633]平方数之和","frequency":1.3914088712,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":249099,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43839367204137514,"acs":1441,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3287,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5524484063988276,"acs":4524,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.6468704038,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8189,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5574996106121177,"acs":10738,"articleLive":2,"columnArticles":124,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19261,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6908384371700106,"acs":81778,"articleLive":2,"columnArticles":701,"formTitle":"[637]二叉树的层平均值","frequency":1.3605422232,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":118375,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6460163041030491,"acs":28687,"articleLive":2,"columnArticles":274,"formTitle":"[638]大礼包","frequency":2.3494555946,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44406,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37633597615937897,"acs":20458,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.3846147794,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54361,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42655761185028834,"acs":11317,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4365173332,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26531,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5316472938612423,"acs":23418,"articleLive":2,"columnArticles":268,"formTitle":"[641]设计循环双端队列","frequency":0.9711860341,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44048,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49761273209549073,"acs":2814,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.6815479423,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5655,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.44827244696514523,"acs":67894,"articleLive":2,"columnArticles":617,"formTitle":"[643]子数组最大平均数 I","frequency":1.3914088712,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":151457,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.40522022838499183,"acs":1242,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.407279701,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3065,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.42928556180175054,"acs":72393,"articleLive":2,"columnArticles":736,"formTitle":"[645]错误的集合","frequency":1.8343265753,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":168636,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5806125397284022,"acs":24114,"articleLive":2,"columnArticles":221,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41532,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6586851703927551,"acs":136884,"articleLive":2,"columnArticles":1001,"formTitle":"[647]回文子串","frequency":2.8944725831,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":207814,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.589326910888579,"acs":23246,"articleLive":2,"columnArticles":306,"formTitle":"[648]单词替换","frequency":0.5185304849,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39445,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4798969649456826,"acs":29995,"articleLive":2,"columnArticles":316,"formTitle":"[649]Dota2 参议院","frequency":1.3914088712,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62503,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5678112538768276,"acs":51262,"articleLive":2,"columnArticles":672,"formTitle":"[650]只有两个键的键盘","frequency":2.3155712755,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90280,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5824239778844755,"acs":4003,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6873,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5711238872403561,"acs":36954,"articleLive":2,"columnArticles":264,"formTitle":"[652]寻找重复的子树","frequency":2.8944725831,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":64704,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6011246029306282,"acs":46931,"articleLive":2,"columnArticles":480,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":78072,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8096599493294284,"acs":69668,"articleLive":2,"columnArticles":697,"formTitle":"[654]最大二叉树","frequency":2.2207434884,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":86046,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.6004890267175572,"acs":10069,"articleLive":2,"columnArticles":154,"formTitle":"[655]输出二叉树","frequency":1.594767836,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16768,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.31007488087134105,"acs":911,"articleLive":2,"columnArticles":26,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2938,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832100921521997,"acs":84311,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.4626968388,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":107648,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.454559302927825,"acs":29840,"articleLive":2,"columnArticles":266,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.594767836,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":65646,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418246005202527,"acs":29161,"articleLive":2,"columnArticles":267,"formTitle":"[659]分割数组为连续子序列","frequency":0.4113903831,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":53820,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6365914786967418,"acs":762,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.6815479423,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1197,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5634379263301501,"acs":17759,"articleLive":2,"columnArticles":227,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31519,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4092647952979327,"acs":32309,"articleLive":2,"columnArticles":311,"formTitle":"[662]二叉树最大宽度","frequency":2.2512895408,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":78944,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.45875788452207666,"acs":1891,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4122,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6540022025155046,"acs":22567,"articleLive":2,"columnArticles":193,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34506,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2715317515701326,"acs":77821,"articleLive":2,"columnArticles":978,"formTitle":"[665]非递减数列","frequency":1.7958602944,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":286600,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6196369636963697,"acs":2253,"articleLive":2,"columnArticles":81,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3636,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242316522254314,"acs":8429,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13503,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5129635930588635,"acs":7538,"articleLive":2,"columnArticles":81,"formTitle":"[668]乘法表中第k小的数","frequency":1.0918686795,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14695,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.665183339266643,"acs":41107,"articleLive":2,"columnArticles":343,"formTitle":"[669]修剪二叉搜索树","frequency":0.4365173332,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":61798,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4552342797422052,"acs":20908,"articleLive":2,"columnArticles":311,"formTitle":"[670]最大交换","frequency":2.463474173,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":45928,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48515979749125765,"acs":55773,"articleLive":2,"columnArticles":699,"formTitle":"[671]二叉树中第二小的节点","frequency":2.559517222,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":114958,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5464223150518798,"acs":4055,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.4626968388,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7421,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43642510035918025,"acs":51640,"articleLive":2,"columnArticles":433,"formTitle":"[673]最长递增子序列的个数","frequency":3.4309303671,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":118325,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5034837851590248,"acs":99937,"articleLive":2,"columnArticles":837,"formTitle":"[674]最长连续递增序列","frequency":2.0632850908,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":198491,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4016624040920716,"acs":3141,"articleLive":2,"columnArticles":52,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5483656333,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7820,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5949640287769784,"acs":8270,"articleLive":2,"columnArticles":142,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":13900,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.666762208448282,"acs":37220,"articleLive":2,"columnArticles":558,"formTitle":"[677]键值映射","frequency":1.594767836,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":55822,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3857235539733502,"acs":46374,"articleLive":2,"columnArticles":494,"formTitle":"[678]有效的括号字符串","frequency":3.2677510047,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":120226,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5403622097170484,"acs":27271,"articleLive":2,"columnArticles":268,"formTitle":"[679]24 点游戏","frequency":3.3485453903,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50468,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4008410753749437,"acs":93410,"articleLive":2,"columnArticles":881,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.7735545369,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":233035,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5028001400070004,"acs":2873,"articleLive":2,"columnArticles":67,"formTitle":"[681]最近时刻","frequency":0.5796181768,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5714,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6945087283220479,"acs":48617,"articleLive":2,"columnArticles":545,"formTitle":"[682]棒球比赛","frequency":1.0291817016,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70002,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.44175276095475596,"acs":2480,"articleLive":2,"columnArticles":53,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5614,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6668329021600224,"acs":64182,"articleLive":2,"columnArticles":644,"formTitle":"[684]冗余连接","frequency":0.9996374553,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96249,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4286771051658242,"acs":20862,"articleLive":2,"columnArticles":262,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48666,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3996777186386054,"acs":40925,"articleLive":2,"columnArticles":554,"formTitle":"[686]重复叠加字符串匹配","frequency":0.58766651,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":102395,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4436855926032173,"acs":40213,"articleLive":2,"columnArticles":285,"formTitle":"[687]最长同值路径","frequency":1.8034217671,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":90634,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5128725882563766,"acs":8586,"articleLive":2,"columnArticles":112,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.6895656358,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16741,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.561728746090418,"acs":19756,"articleLive":2,"columnArticles":265,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.9657984419,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35170,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.649047243206675,"acs":57564,"articleLive":2,"columnArticles":586,"formTitle":"[690]员工的重要性","frequency":1.0291817016,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88690,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4877230806084561,"acs":4072,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.1598715277,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8349,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.574806558954416,"acs":71687,"articleLive":2,"columnArticles":782,"formTitle":"[692]前K个高频单词","frequency":1.8995387239,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":124715,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6087165064207383,"acs":27920,"articleLive":2,"columnArticles":318,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":45867,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5381507560891147,"acs":4662,"articleLive":2,"columnArticles":89,"formTitle":"[694]不同岛屿的数量","frequency":0.4626968388,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8663,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6678797687654525,"acs":149384,"articleLive":2,"columnArticles":1477,"formTitle":"[695]岛屿的最大面积","frequency":3.2759156484,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":223669,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6333774250440917,"acs":54587,"articleLive":2,"columnArticles":493,"formTitle":"[696]计数二进制子串","frequency":1.6568080393,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86184,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.603794759369454,"acs":69405,"articleLive":2,"columnArticles":883,"formTitle":"[697]数组的度","frequency":0.5185304849,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":114948,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4492798120436251,"acs":33656,"articleLive":2,"columnArticles":240,"formTitle":"[698]划分为k个相等的子集","frequency":2.8544672485,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":74911,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.48230731943771205,"acs":2985,"articleLive":2,"columnArticles":44,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6189,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7739869150973905,"acs":124454,"articleLive":2,"columnArticles":820,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.7142377129,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":160796,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7213515515680303,"acs":87637,"articleLive":2,"columnArticles":651,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.1962391719,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":121490,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7439155058931578,"acs":4860,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6533,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5138329433898551,"acs":63909,"articleLive":2,"columnArticles":586,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6895656358,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":124377,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5488448268719782,"acs":370973,"articleLive":2,"columnArticles":1796,"formTitle":"[704]二分查找","frequency":4.6727132912,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":675916,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6427911028928044,"acs":72305,"articleLive":2,"columnArticles":455,"formTitle":"[705]设计哈希集合","frequency":2.7543837899,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":112486,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6415707501609788,"acs":63767,"articleLive":2,"columnArticles":419,"formTitle":"[706]设计哈希映射","frequency":1.3020460165,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":99392,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3251721172237032,"acs":75995,"articleLive":2,"columnArticles":517,"formTitle":"[707]设计链表","frequency":2.8218717702,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":233707,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34792294587865286,"acs":2655,"articleLive":2,"columnArticles":56,"formTitle":"[708]循环有序列表的插入","frequency":0.4900060181,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7631,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7729067158636971,"acs":98871,"articleLive":2,"columnArticles":720,"formTitle":"[709]转换成小写字母","frequency":0.7901059423,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":127921,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.36104255703364835,"acs":5998,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.4900060181,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16613,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5611353711790393,"acs":771,"articleLive":2,"columnArticles":26,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1374,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.676175382989963,"acs":16640,"articleLive":2,"columnArticles":190,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.9711860341,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24609,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.42571278336059826,"acs":29146,"articleLive":2,"columnArticles":258,"formTitle":"[713]乘积小于K的子数组","frequency":2.0394823771,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":68464,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7267077498153872,"acs":111203,"articleLive":2,"columnArticles":758,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":1.9043832252,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":153023,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4097193129451194,"acs":2934,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7161,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4636149030072873,"acs":4517,"articleLive":2,"columnArticles":83,"formTitle":"[716]最大栈","frequency":0.4900060181,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9743,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5113965888185589,"acs":32802,"articleLive":2,"columnArticles":403,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64142,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5649946638207044,"acs":92645,"articleLive":2,"columnArticles":628,"formTitle":"[718]最长重复子数组","frequency":2.8643134819,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":163975,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37644315314626503,"acs":9847,"articleLive":2,"columnArticles":92,"formTitle":"[719]找出第 k 小的距离对","frequency":2.3693845124,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26158,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4842736636853037,"acs":22849,"articleLive":2,"columnArticles":309,"formTitle":"[720]词典中最长的单词","frequency":1.3307781213,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47182,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.47089065104612937,"acs":30226,"articleLive":2,"columnArticles":346,"formTitle":"[721]账户合并","frequency":0.9996374553,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64189,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3224378411158278,"acs":5317,"articleLive":2,"columnArticles":76,"formTitle":"[722]删除注释","frequency":2.1815227752,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16490,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.723729649728663,"acs":1467,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.7545149972,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2027,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4696207693353269,"acs":148565,"articleLive":2,"columnArticles":925,"formTitle":"[724]寻找数组的中心下标","frequency":1.9458004417,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":316351,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6083124336838044,"acs":50451,"articleLive":2,"columnArticles":647,"formTitle":"[725]分隔链表","frequency":2.6586438723,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":82936,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524463434513077,"acs":22368,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":3.0255499868,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40489,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40772316950852555,"acs":3252,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":1.9698516251,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":7976,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7575951118775415,"acs":35585,"articleLive":2,"columnArticles":325,"formTitle":"[728]自除数","frequency":0.4626968388,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":46971,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5197594501718213,"acs":9680,"articleLive":2,"columnArticles":119,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18624,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49560047562425685,"acs":4168,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.7958602944,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8410,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5034841278619622,"acs":4552,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9041,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6169519152404238,"acs":3785,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.4567702553,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6135,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.58019985196151,"acs":78385,"articleLive":2,"columnArticles":661,"formTitle":"[733]图像渲染","frequency":2.9237486786,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":135100,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4773688663282572,"acs":2257,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4728,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41014222590444627,"acs":23762,"articleLive":2,"columnArticles":300,"formTitle":"[735]行星碰撞","frequency":2.8218717702,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":57936,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46930579460699945,"acs":1636,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3486,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46708185053380785,"acs":4200,"articleLive":2,"columnArticles":74,"formTitle":"[737]句子相似性 II","frequency":0.4626968388,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8992,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.501792356358651,"acs":44654,"articleLive":2,"columnArticles":616,"formTitle":"[738]单调递增的数字","frequency":1.7235940976,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":88989,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6829717746549958,"acs":232752,"articleLive":2,"columnArticles":1638,"formTitle":"[739]每日温度","frequency":3.6979961418,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":340793,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.627932623781433,"acs":60355,"articleLive":2,"columnArticles":669,"formTitle":"[740]删除并获得点数","frequency":2.8384669071,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":96117,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36989907854322074,"acs":4215,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.6461560426,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11395,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4942462600690449,"acs":1718,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3476,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5255421445384885,"acs":62961,"articleLive":2,"columnArticles":563,"formTitle":"[743]网络延迟时间","frequency":2.70930723,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":119802,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4593302429999792,"acs":44194,"articleLive":2,"columnArticles":398,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.3872462842,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":96214,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.40105210420841686,"acs":3202,"articleLive":2,"columnArticles":58,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7984,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5978279587174394,"acs":156225,"articleLive":2,"columnArticles":1465,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.3299427804,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":261321,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41994235385452827,"acs":47060,"articleLive":2,"columnArticles":429,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112063,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6820656455142232,"acs":38963,"articleLive":2,"columnArticles":495,"formTitle":"[748]最短补全词","frequency":0.8566444923,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57125,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5045395590142672,"acs":1556,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3084,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.717654986522911,"acs":2130,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.7198374588,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2968,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.4952413324269205,"acs":1457,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2942,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.530222469488792,"acs":75290,"articleLive":2,"columnArticles":632,"formTitle":"[752]打开转盘锁","frequency":0.9172864201,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":141997,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5973531844499587,"acs":3611,"articleLive":2,"columnArticles":48,"formTitle":"[753]破解保险箱","frequency":1.0598966468,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6045,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43253480753480755,"acs":8450,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.5185304849,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19536,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4980151569830386,"acs":1380,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2771,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5569836214740673,"acs":4897,"articleLive":2,"columnArticles":72,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8792,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4246508606690484,"acs":2615,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6158,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4658987964281092,"acs":3600,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7727,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6715260545905707,"acs":2165,"articleLive":2,"columnArticles":50,"formTitle":"[759]员工空闲时间","frequency":0.4365173332,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3224,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8389490573606098,"acs":4183,"articleLive":2,"columnArticles":95,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4986,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5939930276213462,"acs":2215,"articleLive":2,"columnArticles":35,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3729,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7024027502709166,"acs":18797,"articleLive":2,"columnArticles":163,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26761,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631010379156958,"acs":90065,"articleLive":2,"columnArticles":1062,"formTitle":"[763]划分字母区间","frequency":2.9539431367,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":118025,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49830776173285196,"acs":4417,"articleLive":2,"columnArticles":59,"formTitle":"[764]最大加号标志","frequency":0.5185304849,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8864,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6640091870762571,"acs":30067,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.8663395523,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45281,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7074566214599123,"acs":56755,"articleLive":2,"columnArticles":650,"formTitle":"[766]托普利茨矩阵","frequency":0.4113903831,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80224,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4778756984044698,"acs":41482,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.7435845489,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":86805,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5138670419736733,"acs":6207,"articleLive":2,"columnArticles":90,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4365173332,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12079,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5851443944680315,"acs":13920,"articleLive":2,"columnArticles":169,"formTitle":"[769]最多能完成排序的块","frequency":0.4900060181,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":23789,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5641137855579869,"acs":1289,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2285,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512193533682806,"acs":156861,"articleLive":2,"columnArticles":1166,"formTitle":"[771]宝石与石头","frequency":1.0291817016,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184278,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4972988757482844,"acs":6812,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":0.5185304849,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13698,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7101108595971908,"acs":24469,"articleLive":2,"columnArticles":347,"formTitle":"[773]滑动谜题","frequency":2.3155712755,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34458,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5928290766208252,"acs":1207,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.8430683946,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2036,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.458907649896623,"acs":5327,"articleLive":2,"columnArticles":84,"formTitle":"[775]全局倒置与局部倒置","frequency":0.5796181768,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11608,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5693233082706767,"acs":1893,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3325,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32434801665570895,"acs":5920,"articleLive":2,"columnArticles":64,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.1251939893,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18252,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5929359930279849,"acs":24493,"articleLive":2,"columnArticles":355,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41308,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4367836676217765,"acs":19512,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.6895656358,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44672,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2877230490913576,"acs":3499,"articleLive":2,"columnArticles":54,"formTitle":"[780]到达终点","frequency":0.6124079997,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12161,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6135796512028676,"acs":44506,"articleLive":2,"columnArticles":679,"formTitle":"[781]森林中的兔子","frequency":2.1544941029,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72535,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.41415701415701417,"acs":1609,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.7545149972,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3885,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5965079866100723,"acs":71813,"articleLive":2,"columnArticles":697,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.0291817016,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120389,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6909942853964767,"acs":49697,"articleLive":2,"columnArticles":574,"formTitle":"[784]字母大小写全排列","frequency":2.0394823771,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":71921,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5161624973475114,"acs":43784,"articleLive":2,"columnArticles":434,"formTitle":"[785]判断二分图","frequency":1.9340106329,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":84826,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.6746417878528657,"acs":25237,"articleLive":2,"columnArticles":257,"formTitle":"[786]第 K 个最小的素数分数","frequency":1.0509966236,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37408,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3891688416845406,"acs":45179,"articleLive":2,"columnArticles":427,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.8218717702,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":116091,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.609051904900158,"acs":18880,"articleLive":2,"columnArticles":196,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30999,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6917595528388847,"acs":21163,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.3846147794,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30593,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4528322090159546,"acs":4229,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.4900060181,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9339,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6959818902093945,"acs":12298,"articleLive":2,"columnArticles":215,"formTitle":"[791]自定义字符串排序","frequency":1.0598966468,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17670,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4654428158057018,"acs":9812,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.0291817016,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21081,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3942219396764851,"acs":5581,"articleLive":2,"columnArticles":71,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14157,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.38948611282727186,"acs":28369,"articleLive":2,"columnArticles":461,"formTitle":"[794]有效的井字游戏","frequency":0.0778423327,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":72837,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.530313044523223,"acs":8826,"articleLive":2,"columnArticles":100,"formTitle":"[795]区间子数组个数","frequency":1.8663395523,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16643,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5392480827981795,"acs":25947,"articleLive":2,"columnArticles":324,"formTitle":"[796]旋转字符串","frequency":2.3342438623,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48117,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7893750600595791,"acs":49287,"articleLive":2,"columnArticles":595,"formTitle":"[797]所有可能的路径","frequency":2.1625198281,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":62438,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4715472162411566,"acs":1533,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3251,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.41341866820077666,"acs":5749,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.3605422232,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13906,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7103825136612022,"acs":1560,"articleLive":2,"columnArticles":38,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2196,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207343887423043,"acs":7654,"articleLive":2,"columnArticles":91,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.6568080393,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18192,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5774905456030396,"acs":32526,"articleLive":2,"columnArticles":341,"formTitle":"[802]找到最终的安全状态","frequency":2.4669442299,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56323,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4804177545691906,"acs":12512,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":0.6124079997,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26044,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7738036879218674,"acs":41041,"articleLive":2,"columnArticles":420,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.0291817016,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53038,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2980596119223845,"acs":2980,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.5483656333,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9998,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6548487057965731,"acs":14370,"articleLive":2,"columnArticles":168,"formTitle":"[806]写字符串需要的行数","frequency":0.4626968388,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21944,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8894714381515576,"acs":43770,"articleLive":2,"columnArticles":617,"formTitle":"[807]保持城市天际线","frequency":1.1814939917,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49209,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48316811235026846,"acs":4679,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.5796181768,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9684,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4206528765352295,"acs":5206,"articleLive":2,"columnArticles":99,"formTitle":"[809]情感丰富的文字","frequency":0.4900060181,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12376,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7309195102891378,"acs":16836,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.5185304849,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23034,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7057550843790567,"acs":16310,"articleLive":2,"columnArticles":208,"formTitle":"[811]子域名访问计数","frequency":0.9996374553,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23110,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6318935071991306,"acs":11630,"articleLive":2,"columnArticles":109,"formTitle":"[812]最大三角形面积","frequency":0.4626968388,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18405,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5538259153694365,"acs":7578,"articleLive":2,"columnArticles":89,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13683,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000199265564064,"acs":24591,"articleLive":2,"columnArticles":380,"formTitle":"[814]二叉树剪枝","frequency":1.3605422232,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35129,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4330174439413037,"acs":27827,"articleLive":2,"columnArticles":324,"formTitle":"[815]公交路线","frequency":3.5070416411,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64263,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5133610850006715,"acs":3823,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.5483656333,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7447,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5923176919528662,"acs":14125,"articleLive":2,"columnArticles":176,"formTitle":"[817]链表组件","frequency":0.4900060181,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23847,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43536488480308705,"acs":3836,"articleLive":2,"columnArticles":47,"formTitle":"[818]赛车","frequency":0.6124079997,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8811,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4223891080015128,"acs":23454,"articleLive":2,"columnArticles":265,"formTitle":"[819]最常见的单词","frequency":0.3872462842,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":55527,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5094125834195782,"acs":57097,"articleLive":2,"columnArticles":627,"formTitle":"[820]单词的压缩编码","frequency":0.4626968388,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112084,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6943577676607499,"acs":27148,"articleLive":2,"columnArticles":371,"formTitle":"[821]字符的最短距离","frequency":1.3307781213,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39098,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5080474719557796,"acs":3125,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6151,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4279001074113856,"acs":3187,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.6124079997,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7448,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6172175783011342,"acs":17795,"articleLive":2,"columnArticles":248,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28831,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3959018603397142,"acs":7342,"articleLive":2,"columnArticles":101,"formTitle":"[825]适龄的朋友","frequency":1.0291817016,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":18545,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.38085359932912566,"acs":8629,"articleLive":2,"columnArticles":124,"formTitle":"[826]安排工作以达到最大收益","frequency":1.7235940976,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22657,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39134036144578316,"acs":10394,"articleLive":2,"columnArticles":202,"formTitle":"[827]最大人工岛","frequency":1.0918686795,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26560,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.5007094211123723,"acs":3529,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.5185304849,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7048,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36783464566929136,"acs":9343,"articleLive":2,"columnArticles":110,"formTitle":"[829]连续整数求和","frequency":1.0291817016,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25400,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429404996712689,"acs":52852,"articleLive":2,"columnArticles":594,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97344,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40701935483870966,"acs":7886,"articleLive":2,"columnArticles":78,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19375,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955346864037275,"acs":87761,"articleLive":2,"columnArticles":959,"formTitle":"[832]翻转图像","frequency":0.4626968388,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110317,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4371430806539936,"acs":5588,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12783,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.526902382782475,"acs":13710,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.1598715277,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26020,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5758423394787031,"acs":4529,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.5185304849,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7865,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4806791354234199,"acs":39296,"articleLive":2,"columnArticles":675,"formTitle":"[836]矩形重叠","frequency":1.6568080393,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":81751,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39581492489356573,"acs":19710,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.1251939893,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49796,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5014246859215128,"acs":7743,"articleLive":2,"columnArticles":138,"formTitle":"[838]推多米诺","frequency":2.463474173,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15442,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747805734347572,"acs":19646,"articleLive":2,"columnArticles":276,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34180,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3607156748346947,"acs":9274,"articleLive":2,"columnArticles":117,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25710,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.659456348803358,"acs":58443,"articleLive":2,"columnArticles":578,"formTitle":"[841]钥匙和房间","frequency":1.3605422232,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":88623,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48718939533946004,"acs":28998,"articleLive":2,"columnArticles":324,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0394823771,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59521,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38569089305957927,"acs":3062,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7939,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.507818369411694,"acs":101390,"articleLive":2,"columnArticles":1084,"formTitle":"[844]比较含退格的字符串","frequency":1.2474274187,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":199658,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4219658803433588,"acs":39031,"articleLive":2,"columnArticles":574,"formTitle":"[845]数组中的最长山脉","frequency":1.8663395523,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92498,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5147163998459592,"acs":9356,"articleLive":2,"columnArticles":131,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":18177,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.678818464144551,"acs":19235,"articleLive":2,"columnArticles":160,"formTitle":"[847]访问所有节点的最短路径","frequency":2.8944725831,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28336,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4480528479696956,"acs":9699,"articleLive":2,"columnArticles":107,"formTitle":"[848]字母移位","frequency":1.4234560486,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21647,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42813699971651675,"acs":16613,"articleLive":2,"columnArticles":200,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38803,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4476466575716235,"acs":2625,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.1815227752,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5864,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6281313600844243,"acs":24999,"articleLive":2,"columnArticles":269,"formTitle":"[851]喧闹和富有","frequency":0.7756574338,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":39799,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7143808042087029,"acs":89079,"articleLive":2,"columnArticles":768,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":124694,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3883423770348328,"acs":11093,"articleLive":2,"columnArticles":140,"formTitle":"[853]车队","frequency":1.6252347774,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28565,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36276147299769346,"acs":4561,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12573,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.41140919811320753,"acs":5582,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.4900060181,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13568,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6288742984997983,"acs":17145,"articleLive":2,"columnArticles":233,"formTitle":"[856]括号的分数","frequency":2.7435845489,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27263,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4715271786022433,"acs":3279,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4900060181,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6954,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5573294629898403,"acs":3072,"articleLive":2,"columnArticles":51,"formTitle":"[858]镜面反射","frequency":1.8745249135,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5512,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.345791446285334,"acs":59232,"articleLive":2,"columnArticles":750,"formTitle":"[859]亲密字符串","frequency":2.3649190232,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171294,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5858140123702391,"acs":97176,"articleLive":2,"columnArticles":842,"formTitle":"[860]柠檬水找零","frequency":1.3020460165,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":165882,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.809237607010278,"acs":32045,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.1251939893,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39599,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.196140398063475,"acs":17502,"articleLive":2,"columnArticles":138,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3846147794,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89232,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062391737222969,"acs":37448,"articleLive":2,"columnArticles":581,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.6442418721,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":61771,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.46106269328085464,"acs":3280,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.5796181768,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7114,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6637203967343634,"acs":9837,"articleLive":2,"columnArticles":142,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4365173332,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14821,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22755976544880469,"acs":8072,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35472,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6689824945295405,"acs":85603,"articleLive":2,"columnArticles":769,"formTitle":"[867]转置矩阵","frequency":1.0291817016,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":127960,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6258250373773839,"acs":17162,"articleLive":2,"columnArticles":250,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27423,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6423409130971267,"acs":32796,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.8995387239,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51057,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.437182624253427,"acs":16616,"articleLive":2,"columnArticles":215,"formTitle":"[870]优势洗牌","frequency":1.3307781213,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38007,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3466631355932203,"acs":10472,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":2.0729826067,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30208,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6518180387218637,"acs":62115,"articleLive":2,"columnArticles":745,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95295,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5188028344107409,"acs":16693,"articleLive":2,"columnArticles":125,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9340106329,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32176,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4192644483362522,"acs":21546,"articleLive":2,"columnArticles":242,"formTitle":"[874]模拟行走机器人","frequency":1.4567702553,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51390,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48285738433077596,"acs":51419,"articleLive":2,"columnArticles":409,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8883353802,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":106489,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058602584175484,"acs":178529,"articleLive":2,"columnArticles":1864,"formTitle":"[876]链表的中间结点","frequency":2.4721734101,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":252924,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7579970104633782,"acs":70994,"articleLive":2,"columnArticles":498,"formTitle":"[877]石子游戏","frequency":1.2742818789,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":93660,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2860410521880455,"acs":4752,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16613,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5526610993393992,"acs":22170,"articleLive":2,"columnArticles":187,"formTitle":"[879]盈利计划","frequency":1.9698516251,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40115,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2550229329869708,"acs":6283,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24637,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5379215758269528,"acs":49811,"articleLive":2,"columnArticles":606,"formTitle":"[881]救生艇","frequency":3.5442072707,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":92599,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4922563736001906,"acs":2066,"articleLive":2,"columnArticles":34,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4197,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.692722208767256,"acs":11441,"articleLive":2,"columnArticles":123,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16516,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6634290676358022,"acs":20628,"articleLive":2,"columnArticles":269,"formTitle":"[884]两句话中的不常见单词","frequency":1.0598966468,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31093,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6991356839072576,"acs":5096,"articleLive":2,"columnArticles":75,"formTitle":"[885]螺旋矩阵 III","frequency":1.1598715277,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7289,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.43870911772360544,"acs":10114,"articleLive":2,"columnArticles":135,"formTitle":"[886]可能的二分法","frequency":1.8343265753,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23054,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2906228403593642,"acs":53828,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.70930723,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":185216,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6409237305557459,"acs":56118,"articleLive":2,"columnArticles":478,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87558,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6749899152884228,"acs":16733,"articleLive":2,"columnArticles":164,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.9340106329,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":24790,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.727805032441842,"acs":9198,"articleLive":2,"columnArticles":132,"formTitle":"[890]查找和替换模式","frequency":0.5483656333,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12638,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3311088866644422,"acs":2977,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8991,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6383367560336869,"acs":33881,"articleLive":2,"columnArticles":692,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53077,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7245843464546231,"acs":11026,"articleLive":2,"columnArticles":111,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15217,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7750362036315027,"acs":13915,"articleLive":2,"columnArticles":131,"formTitle":"[894]所有可能的满二叉树","frequency":0.4626968388,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17954,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5571887605113831,"acs":8150,"articleLive":2,"columnArticles":91,"formTitle":"[895]最大频率栈","frequency":2.0729826067,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14627,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5849099612491452,"acs":61584,"articleLive":2,"columnArticles":735,"formTitle":"[896]单调数列","frequency":0.3872462842,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105288,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7429994568295023,"acs":64291,"articleLive":2,"columnArticles":739,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86529,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3413187997843924,"acs":5699,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4365173332,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16697,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5411307934967241,"acs":4460,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8242,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4989162828501761,"acs":3683,"articleLive":2,"columnArticles":57,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7382,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5501314405888539,"acs":20927,"articleLive":2,"columnArticles":253,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38040,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.33838242169237964,"acs":3619,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.1251939893,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10695,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5367142102482831,"acs":3048,"articleLive":2,"columnArticles":44,"formTitle":"[903]DI 序列的有效排列","frequency":0.8917161188,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5679,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.44842499574323175,"acs":26336,"articleLive":2,"columnArticles":370,"formTitle":"[904]水果成篮","frequency":2.2207434884,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":58730,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7008759510572419,"acs":60890,"articleLive":2,"columnArticles":640,"formTitle":"[905]按奇偶排序数组","frequency":1.3914088712,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":86877,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2873019626389217,"acs":2430,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8458,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3222284864947978,"acs":12574,"articleLive":2,"columnArticles":137,"formTitle":"[907]子数组的最小值之和","frequency":2.0071693881,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39022,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6990799492385786,"acs":22035,"articleLive":2,"columnArticles":206,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":31520,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45990180032733224,"acs":16579,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":2.2207434884,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36049,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3210470332516302,"acs":6942,"articleLive":2,"columnArticles":70,"formTitle":"[910]最小差值 II","frequency":0.4626968388,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21623,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.5423983413024162,"acs":25637,"articleLive":2,"columnArticles":319,"formTitle":"[911]在线选举","frequency":1.0079638981,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47266,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5575028369052957,"acs":259895,"articleLive":2,"columnArticles":1182,"formTitle":"[912]排序数组","frequency":3.8980916294,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":466177,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4024414254774562,"acs":2044,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.8917161188,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5079,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889504045839947,"acs":50231,"articleLive":2,"columnArticles":632,"formTitle":"[914]卡牌分组","frequency":1.0291817016,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129145,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46822773613891344,"acs":10058,"articleLive":2,"columnArticles":125,"formTitle":"[915]分割数组","frequency":0.4900060181,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21481,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44660322495374044,"acs":6758,"articleLive":2,"columnArticles":80,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15132,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5689887722368038,"acs":31217,"articleLive":2,"columnArticles":463,"formTitle":"[917]仅仅反转字母","frequency":1.3914088712,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":54864,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.36083791373321444,"acs":27113,"articleLive":2,"columnArticles":274,"formTitle":"[918]环形子数组的最大和","frequency":2.5316938562,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":75139,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6434643995749203,"acs":6055,"articleLive":2,"columnArticles":108,"formTitle":"[919]完全二叉树插入器","frequency":0.5185304849,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9410,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4874726343955242,"acs":2004,"articleLive":2,"columnArticles":21,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4111,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7433845359493998,"acs":23036,"articleLive":2,"columnArticles":341,"formTitle":"[921]使括号有效的最少添加","frequency":1.0291817016,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":30988,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140576194203955,"acs":92127,"articleLive":2,"columnArticles":861,"formTitle":"[922]按奇偶排序数组 II","frequency":1.3605422232,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129019,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3436362704392844,"acs":6704,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.0918686795,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19509,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3579990659540242,"acs":6899,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.5796181768,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19271,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38707818930041155,"acs":51733,"articleLive":2,"columnArticles":693,"formTitle":"[925]长按键入","frequency":1.3914088712,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":133650,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5337800111669458,"acs":7648,"articleLive":2,"columnArticles":141,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.4365173332,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14328,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.34159341686927247,"acs":3653,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":1.1962391719,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10694,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42300821722043586,"acs":2368,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5598,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6450431346088968,"acs":26768,"articleLive":2,"columnArticles":238,"formTitle":"[929]独特的电子邮件地址","frequency":0.4900060181,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41498,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5452666262569745,"acs":35083,"articleLive":2,"columnArticles":351,"formTitle":"[930]和相同的二元子数组","frequency":2.8574861187,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64341,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6713822193380922,"acs":25865,"articleLive":2,"columnArticles":328,"formTitle":"[931]下降路径最小和","frequency":0.9437569969,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":38525,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6378100465504064,"acs":9180,"articleLive":2,"columnArticles":88,"formTitle":"[932]漂亮数组","frequency":1.0598966468,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14393,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7275931705525978,"acs":39632,"articleLive":2,"columnArticles":343,"formTitle":"[933]最近的请求次数","frequency":2.0394823771,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54470,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4708265802269044,"acs":26145,"articleLive":2,"columnArticles":291,"formTitle":"[934]最短的桥","frequency":0.4113903831,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55530,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.48014652014652015,"acs":6554,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":1.0291817016,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13650,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37893768682455736,"acs":1648,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4349,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5875695984790186,"acs":12980,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":1.0598966468,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22091,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8199809348444235,"acs":100642,"articleLive":2,"columnArticles":833,"formTitle":"[938]二叉搜索树的范围和","frequency":0.9711860341,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":122737,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45889992360580595,"acs":6007,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":1.0291817016,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13090,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4245939675174014,"acs":5307,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12499,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3930049656108318,"acs":63712,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.3605422232,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162115,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.731699075354038,"acs":23819,"articleLive":2,"columnArticles":225,"formTitle":"[942]增减字符串匹配","frequency":0.4626968388,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32553,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4549710209540794,"acs":2041,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6124079997,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4486,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6869364450407164,"acs":22017,"articleLive":2,"columnArticles":189,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32051,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4853685163489189,"acs":36457,"articleLive":2,"columnArticles":545,"formTitle":"[945]使数组唯一的最小增量","frequency":0.4900060181,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75112,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6278561791978071,"acs":29319,"articleLive":2,"columnArticles":336,"formTitle":"[946]验证栈序列","frequency":1.8663395523,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":46697,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125894659570563,"acs":26704,"articleLive":2,"columnArticles":343,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43592,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3936716549781876,"acs":7129,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18109,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37295273748245206,"acs":8767,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6895656358,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23507,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7776524550718099,"acs":10342,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.9996374553,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13299,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6632323457340165,"acs":11909,"articleLive":2,"columnArticles":181,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":17956,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.36246540344901,"acs":3405,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9394,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5511924414316322,"acs":15693,"articleLive":2,"columnArticles":186,"formTitle":"[953]验证外星语词典","frequency":0.4626968388,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28471,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3043902042805507,"acs":7495,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.4567702553,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24623,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.332948199499326,"acs":3458,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10386,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.44092039800995025,"acs":4254,"articleLive":2,"columnArticles":54,"formTitle":"[956]最高的广告牌","frequency":0.6468704038,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9648,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3609412455359327,"acs":14756,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.2557365619,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":40882,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5372265315202043,"acs":27773,"articleLive":2,"columnArticles":267,"formTitle":"[958]二叉树的完全性检验","frequency":1.8995387239,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":51697,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7441033806050283,"acs":20096,"articleLive":2,"columnArticles":308,"formTitle":"[959]由斜杠划分区域","frequency":0.4900060181,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27007,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5592192033764178,"acs":2120,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3791,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6772271961705523,"acs":38199,"articleLive":2,"columnArticles":328,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56405,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44635427738467615,"acs":14698,"articleLive":2,"columnArticles":148,"formTitle":"[962]最大宽度坡","frequency":1.1251939893,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":32929,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5117781155015197,"acs":2694,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.3605422232,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5264,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43980828869467153,"acs":1560,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3547,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6842713955281419,"acs":35500,"articleLive":2,"columnArticles":419,"formTitle":"[965]单值二叉树","frequency":1.3914088712,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":51880,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40836254381572357,"acs":3262,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7988,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.47105247998156574,"acs":8177,"articleLive":2,"columnArticles":165,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17359,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5020617612022359,"acs":27395,"articleLive":2,"columnArticles":355,"formTitle":"[968]监控二叉树","frequency":1.4234560486,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":54565,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6482323430273575,"acs":16539,"articleLive":2,"columnArticles":207,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25514,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4128248567206142,"acs":11453,"articleLive":2,"columnArticles":129,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27743,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44464820588055504,"acs":7274,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16359,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40253612503686226,"acs":1365,"articleLive":2,"columnArticles":29,"formTitle":"[972]相等的有理数","frequency":0.797440042,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3391,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6424354377195842,"acs":70948,"articleLive":2,"columnArticles":660,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3605422232,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":110436,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.466310488388824,"acs":39538,"articleLive":2,"columnArticles":400,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.107756625,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":84789,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4507195221286994,"acs":3320,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.5185304849,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7366,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5979931383831105,"acs":55602,"articleLive":2,"columnArticles":521,"formTitle":"[976]三角形的最大周长","frequency":1.6252347774,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":92981,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7024612669150814,"acs":214911,"articleLive":2,"columnArticles":1622,"formTitle":"[977]有序数组的平方","frequency":3.1502520914,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":305940,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733371160619654,"acs":44213,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.4365173332,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93407,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7142290923503766,"acs":9010,"articleLive":2,"columnArticles":143,"formTitle":"[979]在二叉树中分配硬币","frequency":1.3605422232,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12615,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7347553568825615,"acs":15122,"articleLive":2,"columnArticles":228,"formTitle":"[980]不同路径 III","frequency":2.3494555946,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20581,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5305477780170866,"acs":22170,"articleLive":2,"columnArticles":319,"formTitle":"[981]基于时间的键值存储","frequency":2.5658128862,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41787,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5504735039290751,"acs":2732,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.5483656333,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4963,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335734597156398,"acs":33421,"articleLive":2,"columnArticles":462,"formTitle":"[983]最低票价","frequency":1.6895656358,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52750,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41973840665873957,"acs":9531,"articleLive":2,"columnArticles":154,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.3605422232,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22707,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6017587030469711,"acs":16629,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.4900060181,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27634,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6820511682605898,"acs":30738,"articleLive":2,"columnArticles":289,"formTitle":"[986]区间列表的交集","frequency":1.6895656358,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":45067,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329149477749495,"acs":24286,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5914224804,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":45572,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5011243815901254,"acs":10028,"articleLive":2,"columnArticles":123,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.4626968388,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20011,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.46987704392021973,"acs":54915,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":0.9996374553,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":116871,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5081797830204925,"acs":35412,"articleLive":2,"columnArticles":525,"formTitle":"[990]等式方程的可满足性","frequency":0.4900060181,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":69684,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.521383075523203,"acs":9168,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17584,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4553327001508464,"acs":24450,"articleLive":2,"columnArticles":279,"formTitle":"[992]K 个不同整数的子数组","frequency":1.3914088712,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53697,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5571971251486357,"acs":52951,"articleLive":2,"columnArticles":834,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.3914088712,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95031,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5110019453662683,"acs":62517,"articleLive":2,"columnArticles":1501,"formTitle":"[994]腐烂的橘子","frequency":2.1230732056,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":122342,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.538996839087501,"acs":21997,"articleLive":2,"columnArticles":254,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.5185304849,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40811,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49450314868182305,"acs":4633,"articleLive":2,"columnArticles":96,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9369,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5359938976344951,"acs":63943,"articleLive":2,"columnArticles":686,"formTitle":"[997]找到小镇的法官","frequency":1.1718119681,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":119298,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6177733476460665,"acs":8057,"articleLive":2,"columnArticles":121,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13042,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6910936491329609,"acs":31046,"articleLive":2,"columnArticles":579,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44923,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41154462854088725,"acs":3850,"articleLive":2,"columnArticles":43,"formTitle":"[1000]合并石头的最低成本","frequency":1.5653366358,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9355,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2973400052673163,"acs":2258,"articleLive":2,"columnArticles":58,"formTitle":"[1001]网格照明","frequency":0.6468704038,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7594,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7312981028481789,"acs":59671,"articleLive":2,"columnArticles":630,"formTitle":"[1002]查找共用字符","frequency":2.2828752695,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":81596,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5788849347568209,"acs":12688,"articleLive":2,"columnArticles":191,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21918,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5954637278893689,"acs":72512,"articleLive":2,"columnArticles":760,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4987636499,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":121774,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5207063309576218,"acs":63635,"articleLive":2,"columnArticles":1012,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.8166467783,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":122209,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6269049384962007,"acs":44798,"articleLive":2,"columnArticles":611,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71459,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46648999232861427,"acs":6689,"articleLive":2,"columnArticles":89,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14339,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7217856867729759,"acs":18739,"articleLive":2,"columnArticles":242,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.594767836,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":25962,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5885934436379897,"acs":17111,"articleLive":2,"columnArticles":244,"formTitle":"[1009]十进制整数的反码","frequency":1.0291817016,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29071,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45571666270501543,"acs":19172,"articleLive":2,"columnArticles":256,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.4626968388,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42070,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6256421754515944,"acs":64179,"articleLive":2,"columnArticles":615,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.3307781213,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":102581,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3386458333333333,"acs":3251,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.1962391719,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9600,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3945714656880257,"acs":48597,"articleLive":2,"columnArticles":937,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.6895656358,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123164,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.556452026023257,"acs":43450,"articleLive":2,"columnArticles":496,"formTitle":"[1014]最佳观光组合","frequency":0.9711860341,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":78084,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35766625190100926,"acs":5174,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.6124079997,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14466,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5844666383340417,"acs":5501,"articleLive":2,"columnArticles":88,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.5483656333,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9412,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5632390360724443,"acs":3763,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6681,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5157331184157504,"acs":44794,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86855,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6001115137998327,"acs":21526,"articleLive":2,"columnArticles":284,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.5185304849,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":35870,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5510969245579369,"acs":10877,"articleLive":2,"columnArticles":167,"formTitle":"[1020]飞地的数量","frequency":0.9437569969,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":19737,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830825389322199,"acs":59638,"articleLive":2,"columnArticles":678,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76158,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7073195187165775,"acs":21163,"articleLive":2,"columnArticles":283,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.4626968388,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":29920,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.567365828170486,"acs":7601,"articleLive":2,"columnArticles":174,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13397,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5558108000319055,"acs":34841,"articleLive":2,"columnArticles":396,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":62685,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.709073696475386,"acs":77896,"articleLive":2,"columnArticles":663,"formTitle":"[1025]除数博弈","frequency":0.9996374553,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":109856,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6762914075390278,"acs":10657,"articleLive":2,"columnArticles":185,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15758,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4342368564671639,"acs":14322,"articleLive":2,"columnArticles":129,"formTitle":"[1027]最长等差数列","frequency":1.4234560486,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":32982,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320612551016848,"acs":20986,"articleLive":2,"columnArticles":439,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.7958602944,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28667,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6599694337794013,"acs":17705,"articleLive":2,"columnArticles":192,"formTitle":"[1029]两地调度","frequency":0.4626968388,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26827,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7095779137319418,"acs":41406,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.5483656333,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58353,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5736417428725121,"acs":5332,"articleLive":2,"columnArticles":87,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9295,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.4095129267247536,"acs":2867,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.0918686795,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7001,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39350230574529316,"acs":11349,"articleLive":2,"columnArticles":171,"formTitle":"[1033]移动石子直到连续","frequency":0.5185304849,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28841,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5603417586329654,"acs":28332,"articleLive":2,"columnArticles":459,"formTitle":"[1034]边界着色","frequency":1.2214294207,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50562,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6396613459157381,"acs":38230,"articleLive":2,"columnArticles":411,"formTitle":"[1035]不相交的线","frequency":0.4626968388,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":59766,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30220061412487204,"acs":3543,"articleLive":2,"columnArticles":59,"formTitle":"[1036]逃离大迷宫","frequency":1.1598715277,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11724,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43936188219363576,"acs":10383,"articleLive":2,"columnArticles":134,"formTitle":"[1037]有效的回旋镖","frequency":1.4234560486,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23632,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7955340872935528,"acs":27504,"articleLive":2,"columnArticles":343,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.9996374553,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34573,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5578041404977901,"acs":4796,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8598,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.522483537158984,"acs":2777,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.6815479423,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5315,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4874036655657017,"acs":7526,"articleLive":2,"columnArticles":123,"formTitle":"[1041]困于环中的机器人","frequency":1.4567702553,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15441,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5339554854539081,"acs":12187,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.4900060181,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22824,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.692230155396892,"acs":8241,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.3914088712,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11905,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.6411558789209967,"acs":9341,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.4626968388,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14569,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6590085226177163,"acs":68355,"articleLive":2,"columnArticles":954,"formTitle":"[1046]最后一块石头的重量","frequency":0.9711860341,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":103724,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7242915257193763,"acs":116264,"articleLive":2,"columnArticles":1035,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5286523063,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":160521,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.46395921978346044,"acs":11013,"articleLive":2,"columnArticles":157,"formTitle":"[1048]最长字符串链","frequency":2.6586438723,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23737,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6508735321795344,"acs":47724,"articleLive":2,"columnArticles":443,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.9711860341,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":73323,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7605412589102332,"acs":12590,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.3605422232,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16554,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7562610970937296,"acs":32371,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":0.9711860341,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42804,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801952580195258,"acs":49920,"articleLive":2,"columnArticles":773,"formTitle":"[1052]爱生气的书店老板","frequency":1.0918686795,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86040,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45969482694454783,"acs":6176,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13435,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.38204838345014697,"acs":8449,"articleLive":2,"columnArticles":112,"formTitle":"[1054]距离相等的条形码","frequency":0.4626968388,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22115,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5945885509838998,"acs":5318,"articleLive":2,"columnArticles":98,"formTitle":"[1055]形成字符串的最短路径","frequency":1.0918686795,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":8944,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4178633975481611,"acs":3579,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8565,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4712474196402241,"acs":3196,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6782,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34758961681087763,"acs":1406,"articleLive":2,"columnArticles":37,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4045,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36511976047904193,"acs":2439,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6680,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5294001966568338,"acs":5384,"articleLive":2,"columnArticles":80,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10170,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6090492076730609,"acs":2921,"articleLive":2,"columnArticles":64,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4796,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5458431603773585,"acs":3703,"articleLive":2,"columnArticles":52,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6784,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.715057636887608,"acs":1985,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2776,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6489129036408079,"acs":5044,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7773,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5427323767935122,"acs":2610,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4809,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47729741472952425,"acs":2197,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4603,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.417027417027417,"acs":867,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2079,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8665934334187722,"acs":14200,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16386,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8186014935505771,"acs":12058,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14730,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.47928994082840237,"acs":8586,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":17914,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5875472198290145,"acs":35462,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":0.9711860341,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60356,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5888049901510177,"acs":3587,"articleLive":2,"columnArticles":59,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6092,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3409831790324684,"acs":2615,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7669,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687094831556201,"acs":18877,"articleLive":2,"columnArticles":194,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28229,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6942751126424596,"acs":10478,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4365173332,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15092,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49417249417249415,"acs":11236,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":22737,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7226084660741001,"acs":8211,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.4626968388,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11363,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6196916956737941,"acs":12462,"articleLive":2,"columnArticles":196,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":20110,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7368356675432696,"acs":12048,"articleLive":2,"columnArticles":199,"formTitle":"[1079]活字印刷","frequency":0.5185304849,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16351,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4965643117887052,"acs":4625,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9314,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5724056434863568,"acs":15985,"articleLive":2,"columnArticles":161,"formTitle":"[1081]不同字符的最小子序列","frequency":1.6252347774,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":27926,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.760609756097561,"acs":12474,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.0598966468,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16400,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278681120144535,"acs":11687,"articleLive":2,"columnArticles":109,"formTitle":"[1083]销售分析 II","frequency":1.4567702553,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22140,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5359348814938951,"acs":11193,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.4626968388,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":20885,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7717081125152874,"acs":3786,"articleLive":2,"columnArticles":75,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4906,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6857801100729554,"acs":5358,"articleLive":2,"columnArticles":85,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7813,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5387618516452872,"acs":1932,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3586,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4566022213081037,"acs":1110,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2431,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5839689245513057,"acs":20596,"articleLive":2,"columnArticles":306,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35269,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5525229663160698,"acs":4150,"articleLive":2,"columnArticles":86,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7511,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37996377152535993,"acs":32303,"articleLive":2,"columnArticles":327,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.4669442299,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":85016,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49350199272223183,"acs":2848,"articleLive":2,"columnArticles":56,"formTitle":"[1092]最短公共超序列","frequency":1.8745249135,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5771,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37039841014479036,"acs":3914,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10567,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5928632276384288,"acs":31318,"articleLive":2,"columnArticles":438,"formTitle":"[1094]拼车","frequency":2.2512895408,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":52825,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3725125164928516,"acs":20610,"articleLive":2,"columnArticles":397,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55327,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5466998754669987,"acs":1756,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3212,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5221835251362811,"acs":6897,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9340106329,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13208,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4747010661483183,"acs":8059,"articleLive":2,"columnArticles":107,"formTitle":"[1098]小众书籍","frequency":0.5483656333,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":16977,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5857988165680473,"acs":5346,"articleLive":2,"columnArticles":99,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4365173332,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9126,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6984146491335873,"acs":5683,"articleLive":2,"columnArticles":115,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0598966468,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8137,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6740317130231349,"acs":2593,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3847,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37463622841621935,"acs":5793,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15463,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6372009611031793,"acs":36597,"articleLive":2,"columnArticles":1119,"formTitle":"[1103]分糖果 II","frequency":1.3914088712,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57434,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7605556713928273,"acs":29181,"articleLive":2,"columnArticles":685,"formTitle":"[1104]二叉树寻路","frequency":2.2207434884,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38368,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5618094642484887,"acs":5390,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.1962391719,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9594,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5814408770555991,"acs":4455,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.8430683946,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7662,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41169271847360517,"acs":7401,"articleLive":2,"columnArticles":98,"formTitle":"[1107]每日新用户统计","frequency":1.0918686795,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":17977,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8388386816160835,"acs":69429,"articleLive":2,"columnArticles":703,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":82768,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5833394874824607,"acs":63192,"articleLive":2,"columnArticles":623,"formTitle":"[1109]航班预订统计","frequency":2.5316938562,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":108328,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6301826765188834,"acs":12281,"articleLive":2,"columnArticles":222,"formTitle":"[1110]删点成林","frequency":0.9996374553,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19488,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713584442556405,"acs":24513,"articleLive":2,"columnArticles":405,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.5653366358,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31779,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6470634360542618,"acs":8252,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12753,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5400255936300299,"acs":7596,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14066,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6535361716801527,"acs":81494,"articleLive":2,"columnArticles":600,"formTitle":"[1114]按序打印","frequency":3.2253268274,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":124697,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5613842992999766,"acs":45631,"articleLive":2,"columnArticles":493,"formTitle":"[1115]交替打印 FooBar","frequency":0.9996374553,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81283,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5212296783120027,"acs":24110,"articleLive":2,"columnArticles":381,"formTitle":"[1116]打印零与奇偶数","frequency":2.5658128862,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46256,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5234951123306465,"acs":18315,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8343265753,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":34986,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.635725037631711,"acs":2534,"articleLive":2,"columnArticles":42,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3986,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8671977412523949,"acs":8600,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9917,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6159056150316802,"acs":2819,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4577,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5712861415752741,"acs":1146,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2006,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068496589815474,"acs":67572,"articleLive":2,"columnArticles":900,"formTitle":"[1122]数组的相对排序","frequency":1.9759656084,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":95596,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7051911468812877,"acs":8762,"articleLive":2,"columnArticles":115,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.4900060181,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12425,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3213239258338998,"acs":13708,"articleLive":2,"columnArticles":148,"formTitle":"[1124]表现良好的最长时间段","frequency":0.4900060181,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42661,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4926889333538556,"acs":3201,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6497,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6902061855670103,"acs":6695,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4365173332,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9700,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.42424242424242425,"acs":4452,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.1962391719,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10494,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449279112222749,"acs":37909,"articleLive":2,"columnArticles":488,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.9996374553,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69567,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38391819660701837,"acs":6608,"articleLive":2,"columnArticles":121,"formTitle":"[1129]颜色交替的最短路径","frequency":1.1251939893,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17212,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6319312618643221,"acs":6325,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.4900060181,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10009,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45811076750070284,"acs":3259,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7114,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39200240078025356,"acs":5225,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.6124079997,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13329,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6440989977500511,"acs":3149,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.4900060181,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4889,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7724425887265136,"acs":3330,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4311,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5407718761941154,"acs":7076,"articleLive":2,"columnArticles":79,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4900060181,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13085,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.574901680371827,"acs":3216,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.5185304849,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5594,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6095571620777783,"acs":94688,"articleLive":2,"columnArticles":962,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.1513032897,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":155339,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43612275246721643,"acs":6452,"articleLive":2,"columnArticles":144,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14794,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.48111370716510904,"acs":9884,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.6895656358,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20544,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6515758790307888,"acs":7153,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":0.9996374553,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10978,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5086348877699873,"acs":10809,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0291817016,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21251,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3721756290083868,"acs":7544,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20270,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6384378484760563,"acs":182636,"articleLive":2,"columnArticles":1213,"formTitle":"[1143]最长公共子序列","frequency":3.2335776993,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":286067,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44294125015658276,"acs":10608,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.5796181768,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23949,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46964490263459335,"acs":6970,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14841,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.29086809470124014,"acs":4644,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15966,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5617819760020424,"acs":4401,"articleLive":2,"columnArticles":88,"formTitle":"[1147]段式回文","frequency":2.107756625,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7834,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7119414289320879,"acs":8460,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11883,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44249775381850853,"acs":5910,"articleLive":2,"columnArticles":49,"formTitle":"[1149]文章浏览 II","frequency":0.4900060181,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13356,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.5999293369450006,"acs":5094,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":1.0291817016,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8491,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4960293219303604,"acs":4872,"articleLive":2,"columnArticles":74,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":1.0291817016,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9822,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.39044438736193166,"acs":1520,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.5796181768,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3893,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.36924047969703344,"acs":1755,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4753,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.650163316952594,"acs":44189,"articleLive":2,"columnArticles":530,"formTitle":"[1154]一年中的第几天","frequency":1.3196088143,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":67966,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4803802315628238,"acs":10663,"articleLive":2,"columnArticles":135,"formTitle":"[1155]掷骰子的N种方法","frequency":1.4914477937,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22197,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43153964775586395,"acs":5317,"articleLive":2,"columnArticles":97,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.4900060181,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12321,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.322606436138317,"acs":3228,"articleLive":2,"columnArticles":49,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10006,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.551528464213802,"acs":6026,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":10926,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4931062449310625,"acs":4256,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.0598966468,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8631,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872777602736643,"acs":61077,"articleLive":2,"columnArticles":928,"formTitle":"[1160]拼写单词","frequency":1.3605422232,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":88868,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.632980229989237,"acs":11174,"articleLive":2,"columnArticles":183,"formTitle":"[1161]最大层内元素和","frequency":1.0291817016,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17653,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4710570569148054,"acs":39777,"articleLive":2,"columnArticles":503,"formTitle":"[1162]地图分析","frequency":0.4365173332,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84442,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26773187840997664,"acs":6183,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23094,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6095155207426748,"acs":6303,"articleLive":2,"columnArticles":91,"formTitle":"[1164]指定日期的产品价格","frequency":1.4234560486,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10341,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8355536608760524,"acs":7840,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9383,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4771118452100047,"acs":3033,"articleLive":2,"columnArticles":53,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6357,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.44762897342365815,"acs":2577,"articleLive":2,"columnArticles":39,"formTitle":"[1167]连接棒材的最低费用","frequency":0.4900060181,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5757,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5676296782665792,"acs":1729,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":0.8430683946,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3046,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224442912933609,"acs":7018,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.5185304849,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21765,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6160315374507227,"acs":14064,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.5185304849,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22830,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47602668334375653,"acs":13701,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.0729826067,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":28782,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2639293243650236,"acs":2629,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9961,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7546525525012805,"acs":8840,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4626968388,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11714,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.621800069500753,"acs":5368,"articleLive":2,"columnArticles":67,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8633,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49080100125156445,"acs":7843,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":1.0291817016,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":15980,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45430991529646236,"acs":4559,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10035,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2693280499114746,"acs":6389,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.1251939893,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23722,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4626195732155997,"acs":18861,"articleLive":2,"columnArticles":185,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40770,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6370165852528334,"acs":32993,"articleLive":2,"columnArticles":197,"formTitle":"[1179]重新格式化部门表","frequency":2.3966341549,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":51793,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.774768353528154,"acs":3261,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4209,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3730004847309743,"acs":1539,"articleLive":2,"columnArticles":30,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4126,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.4173641884129329,"acs":2543,"articleLive":2,"columnArticles":45,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6093,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5890052356020943,"acs":675,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1146,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5836102342581824,"acs":14051,"articleLive":2,"columnArticles":275,"formTitle":"[1184]公交站间的距离","frequency":0.4626968388,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24076,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6027301365068254,"acs":12054,"articleLive":2,"columnArticles":221,"formTitle":"[1185]一周中的第几天","frequency":0.4365173332,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":19999,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39762865792129165,"acs":7881,"articleLive":2,"columnArticles":115,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0291817016,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19820,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44379627552165135,"acs":1978,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4457,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6992760712189395,"acs":3574,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.407279701,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5111,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.645539077212806,"acs":21938,"articleLive":2,"columnArticles":345,"formTitle":"[1189]“气球” 的最大数量","frequency":1.0291817016,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":33984,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6506812978164963,"acs":46607,"articleLive":2,"columnArticles":626,"formTitle":"[1190]反转每对括号间的子串","frequency":2.1439007835,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71628,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2663087824779901,"acs":6201,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23285,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5016174250593056,"acs":4652,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9274,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6044075501531772,"acs":6116,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.5796181768,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10119,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5131717597471022,"acs":3896,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.4365173332,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7592,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6380498374864572,"acs":14723,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":1.9759656084,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23075,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6875232083178611,"acs":3703,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.5483656333,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5386,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3748653500897666,"acs":5220,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.5185304849,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13925,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.740236148955495,"acs":4075,"articleLive":2,"columnArticles":63,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5505,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43746462931522356,"acs":773,"articleLive":2,"columnArticles":19,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1767,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6839997113163973,"acs":18955,"articleLive":2,"columnArticles":269,"formTitle":"[1200]最小绝对差","frequency":1.3914088712,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27712,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2501262871575675,"acs":6437,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.9340106329,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25735,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032150512026673,"acs":27469,"articleLive":2,"columnArticles":302,"formTitle":"[1202]交换字符串中的元素","frequency":0.4900060181,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54587,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6189829485438358,"acs":12306,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19881,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7297946439293863,"acs":6077,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8327,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46787293928427826,"acs":5818,"articleLive":2,"columnArticles":87,"formTitle":"[1205]每月交易II","frequency":0.5483656333,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12435,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6143358005453837,"acs":7885,"articleLive":2,"columnArticles":98,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12835,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7296972294650618,"acs":61288,"articleLive":2,"columnArticles":848,"formTitle":"[1207]独一无二的出现次数","frequency":1.6252347774,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":83991,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4972126887138691,"acs":50126,"articleLive":2,"columnArticles":632,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":100814,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5236891723833594,"acs":13054,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.4900060181,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":24927,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4527215918434468,"acs":2753,"articleLive":2,"columnArticles":56,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.797440042,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6081,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6590204081632653,"acs":8073,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4113903831,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12250,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5143389199255121,"acs":5524,"articleLive":2,"columnArticles":104,"formTitle":"[1212]查询球队积分","frequency":0.4900060181,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10740,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7761267954432888,"acs":6268,"articleLive":2,"columnArticles":134,"formTitle":"[1213]三个有序数组的交集","frequency":0.4900060181,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8076,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6383571179951271,"acs":3668,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5483656333,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5746,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4128757108042242,"acs":2033,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4924,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5394470667565745,"acs":1600,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2966,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6958798567430102,"acs":23122,"articleLive":2,"columnArticles":371,"formTitle":"[1217]玩筹码","frequency":0.9711860341,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33227,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.514326587869276,"acs":37031,"articleLive":2,"columnArticles":357,"formTitle":"[1218]最长定差子序列","frequency":2.826879292,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":71999,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6298201773727277,"acs":12854,"articleLive":2,"columnArticles":182,"formTitle":"[1219]黄金矿工","frequency":1.3605422232,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20409,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5289095847885138,"acs":4089,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7731,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439672120580557,"acs":78559,"articleLive":2,"columnArticles":1135,"formTitle":"[1221]分割平衡字符串","frequency":2.5316938562,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93083,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6754119687771032,"acs":6230,"articleLive":2,"columnArticles":136,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5185304849,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9224,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4762942779291553,"acs":3496,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.8430683946,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7340,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3258178898775674,"acs":4870,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.2742818789,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14947,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5403781327861644,"acs":3687,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.9996374553,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6823,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.594077232883203,"acs":12538,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.1870248524,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21105,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6643904272647538,"acs":10605,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.0291817016,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15962,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5378686327077749,"acs":3210,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5968,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.43373669631141565,"acs":2975,"articleLive":2,"columnArticles":54,"formTitle":"[1229]安排会议日程","frequency":0.4626968388,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":6859,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5009087096323221,"acs":3583,"articleLive":2,"columnArticles":70,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7153,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5701657458563536,"acs":3612,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.4900060181,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6335,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4689503123341363,"acs":34458,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.4626968388,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73479,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4860050890585242,"acs":8595,"articleLive":2,"columnArticles":123,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17685,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3473981087208981,"acs":6282,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.6568080393,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18083,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4673984487971605,"acs":7111,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.8745249135,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15214,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5702554744525548,"acs":1250,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2192,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7115925138822239,"acs":10380,"articleLive":2,"columnArticles":138,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14587,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6631663974151858,"acs":3284,"articleLive":2,"columnArticles":77,"formTitle":"[1238]循环码排列","frequency":0.6468704038,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4952,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49144493234407477,"acs":35702,"articleLive":2,"columnArticles":390,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72647,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49668995954394995,"acs":2701,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.407279701,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5438,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5933173816441634,"acs":6943,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11702,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4698379869010686,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9437569969,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2901,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5384462547188555,"acs":2710,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5033,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6244630341397241,"acs":2762,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.5483656333,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4423,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5119500271591526,"acs":3770,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.6124079997,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7364,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4809135920779428,"acs":3011,"articleLive":2,"columnArticles":43,"formTitle":"[1246]删除回文子数组","frequency":0.8430683946,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6261,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6214229456550275,"acs":9468,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15236,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5623409669211196,"acs":36686,"articleLive":2,"columnArticles":495,"formTitle":"[1248]统计「优美子数组」","frequency":1.4234560486,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65238,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5783480245201128,"acs":25851,"articleLive":2,"columnArticles":358,"formTitle":"[1249]移除无效的括号","frequency":0.9996374553,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":44698,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5668863900736719,"acs":2924,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.5483656333,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5158,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7717682817807974,"acs":8633,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11186,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7488435702505933,"acs":18617,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24861,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39491817398794143,"acs":5502,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13932,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6054382620580513,"acs":16833,"articleLive":2,"columnArticles":262,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.4113903831,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":27803,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6875135252109933,"acs":3177,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4621,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6661143330571665,"acs":1608,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2414,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5679267572356763,"acs":1923,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3386,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5581593523647209,"acs":1310,"articleLive":2,"columnArticles":47,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2347,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4839390386869871,"acs":2064,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4265,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.603759092757421,"acs":13363,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22133,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7300602778020442,"acs":8357,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11447,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5286238120182594,"acs":14128,"articleLive":2,"columnArticles":205,"formTitle":"[1262]可被三整除的最大和","frequency":1.4567702553,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26726,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.42642822851656265,"acs":3553,"articleLive":2,"columnArticles":64,"formTitle":"[1263]推箱子","frequency":1.1962391719,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8332,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5676977416247458,"acs":5304,"articleLive":2,"columnArticles":90,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9343,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9185298621745789,"acs":2999,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.6468704038,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3265,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8244988382774086,"acs":30518,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37014,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6087978716822372,"acs":9840,"articleLive":2,"columnArticles":154,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16163,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5872058336095459,"acs":8858,"articleLive":2,"columnArticles":152,"formTitle":"[1268]搜索推荐系统","frequency":0.9996374553,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15085,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4909114369123079,"acs":30437,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62001,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.803921568627451,"acs":6437,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8007,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.509313038253555,"acs":2543,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4993,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5252679938744257,"acs":1715,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3265,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5455442288720815,"acs":1659,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3041,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.608259587020649,"acs":1031,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1695,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5454026270702456,"acs":8595,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.4113903831,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15759,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5037388021026135,"acs":6804,"articleLive":2,"columnArticles":101,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13507,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7280203081983625,"acs":20362,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.6568080393,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":27969,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.603206106870229,"acs":3951,"articleLive":2,"columnArticles":60,"formTitle":"[1278]分割回文串 III","frequency":1.5653366358,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6550,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6250925240562546,"acs":1689,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2702,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.50539912520503,"acs":7395,"articleLive":2,"columnArticles":75,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14632,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831294223018361,"acs":46407,"articleLive":2,"columnArticles":631,"formTitle":"[1281]整数的各位积和之差","frequency":1.0291817016,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55825,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8108563932787807,"acs":12981,"articleLive":2,"columnArticles":243,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16009,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.42045454545454547,"acs":7548,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.5185304849,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17952,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6670734683915059,"acs":2733,"articleLive":2,"columnArticles":62,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.797440042,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4097,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8137535816618912,"acs":4828,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5933,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6508098456829486,"acs":5103,"articleLive":2,"columnArticles":101,"formTitle":"[1286]字母组合迭代器","frequency":0.5483656333,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7841,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6017173051519155,"acs":16398,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.0291817016,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27252,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5650188377668683,"acs":14847,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.4234560486,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26277,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6235785953177257,"acs":7458,"articleLive":2,"columnArticles":109,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":11960,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8076555160548822,"acs":56569,"articleLive":2,"columnArticles":732,"formTitle":"[1290]二进制链表转整数","frequency":0.4365173332,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70041,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5200919284072707,"acs":7468,"articleLive":2,"columnArticles":167,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14359,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4759806081974438,"acs":6480,"articleLive":2,"columnArticles":100,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13614,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3648987996584802,"acs":14531,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.6586438723,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39822,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6548367645792058,"acs":7602,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11609,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080804776314713,"acs":49402,"articleLive":2,"columnArticles":656,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.4626968388,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61135,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45417789757412397,"acs":8088,"articleLive":2,"columnArticles":130,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17808,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.46152816807172486,"acs":6898,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0598966468,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14946,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5907036797934151,"acs":2745,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4647,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7876786027075044,"acs":31478,"articleLive":2,"columnArticles":447,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":39963,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4647792129768699,"acs":24756,"articleLive":2,"columnArticles":375,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.5185304849,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53264,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36052186037247286,"acs":3620,"articleLive":2,"columnArticles":87,"formTitle":"[1301]最大得分的路径数目","frequency":0.4626968388,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10041,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8207356035221695,"acs":21065,"articleLive":2,"columnArticles":311,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.9996374553,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25666,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8231838991103049,"acs":9530,"articleLive":2,"columnArticles":89,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11577,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7233543086303023,"acs":22186,"articleLive":2,"columnArticles":399,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30671,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7486605661182495,"acs":15790,"articleLive":2,"columnArticles":237,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.4900060181,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21091,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5760341754256562,"acs":18743,"articleLive":2,"columnArticles":289,"formTitle":"[1306]跳跃游戏 III","frequency":0.9711860341,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32538,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33060299756012546,"acs":1897,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5738,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7522863862032924,"acs":5758,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7654,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7543092134044973,"acs":17242,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.4626968388,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22858,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7143643681652491,"acs":37627,"articleLive":2,"columnArticles":506,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52672,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3830703012912482,"acs":5874,"articleLive":2,"columnArticles":90,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15334,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6691586635229168,"acs":11636,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.5185304849,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17389,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8328195619422877,"acs":35932,"articleLive":2,"columnArticles":552,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43145,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7479005255458634,"acs":13804,"articleLive":2,"columnArticles":222,"formTitle":"[1314]矩阵区域和","frequency":1.7235940976,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18457,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8112170973194881,"acs":13437,"articleLive":2,"columnArticles":279,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16564,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4415506660679539,"acs":2950,"articleLive":2,"columnArticles":63,"formTitle":"[1316]不同的循环子字符串","frequency":0.6815479423,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6681,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6169979832901181,"acs":10708,"articleLive":2,"columnArticles":203,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17355,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6577036310107949,"acs":6702,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.1251939893,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10190,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6181557298641668,"acs":32311,"articleLive":2,"columnArticles":522,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52270,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5934090909090909,"acs":2611,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4400,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.618200435172149,"acs":4830,"articleLive":2,"columnArticles":88,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.5185304849,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7813,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5956490654682872,"acs":5832,"articleLive":2,"columnArticles":67,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9791,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7536434650810306,"acs":25856,"articleLive":2,"columnArticles":501,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.4113903831,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34308,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5900122722552629,"acs":6250,"articleLive":2,"columnArticles":125,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10593,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7289310232101994,"acs":11149,"articleLive":2,"columnArticles":195,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15295,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47339890033299775,"acs":6113,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12913,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6896790579542831,"acs":5974,"articleLive":2,"columnArticles":56,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8662,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.466215210596815,"acs":6265,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.4900060181,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13438,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7710641856575371,"acs":7376,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":1.0291817016,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9566,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38403990024937656,"acs":1232,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.9996374553,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3208,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5325174387034793,"acs":12749,"articleLive":2,"columnArticles":219,"formTitle":"[1331]数组序号转换","frequency":1.4234560486,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":23941,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6910686133388169,"acs":10082,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4365173332,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14589,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5489695422214116,"acs":6020,"articleLive":2,"columnArticles":126,"formTitle":"[1333]餐厅过滤器","frequency":1.1251939893,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10966,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49811532600850106,"acs":6211,"articleLive":2,"columnArticles":97,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.5275963078,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12469,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5891764705882353,"acs":3756,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.5483656333,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6375,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4324441552808501,"acs":1994,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4611,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7043948899080956,"acs":40085,"articleLive":2,"columnArticles":645,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.2207434884,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":56907,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6399919775371039,"acs":9573,"articleLive":2,"columnArticles":143,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14958,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.40178530971045356,"acs":8867,"articleLive":2,"columnArticles":142,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.4626968388,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22069,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.574502487562189,"acs":4619,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8040,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.44003378378378377,"acs":3647,"articleLive":2,"columnArticles":51,"formTitle":"[1341]电影评分","frequency":0.4900060181,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8288,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8188995712369908,"acs":43355,"articleLive":2,"columnArticles":651,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.4626968388,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":52943,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5483817701453104,"acs":13284,"articleLive":2,"columnArticles":226,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24224,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5965023559260602,"acs":6583,"articleLive":2,"columnArticles":124,"formTitle":"[1344]时钟指针的夹角","frequency":1.0291817016,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11036,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3639249808924687,"acs":6190,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.5796181768,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17009,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4332350301320682,"acs":16894,"articleLive":2,"columnArticles":287,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":38995,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7435828637867812,"acs":8314,"articleLive":2,"columnArticles":128,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11181,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3106212424849699,"acs":3565,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4234560486,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11477,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5063765941485371,"acs":3375,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6665,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8464522232734153,"acs":8947,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10570,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.753502213834652,"acs":31143,"articleLive":2,"columnArticles":567,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.4626968388,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41331,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4493499968598882,"acs":7155,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15923,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28638738570628847,"acs":12278,"articleLive":2,"columnArticles":162,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.8995387239,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":42872,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2818097014925373,"acs":3021,"articleLive":2,"columnArticles":74,"formTitle":"[1354]多次求和构造目标数组","frequency":0.7198374588,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10720,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6634359856182586,"acs":4244,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.5483656333,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6397,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.730728418950128,"acs":46828,"articleLive":2,"columnArticles":523,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0291817016,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64084,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5321285140562249,"acs":4505,"articleLive":2,"columnArticles":45,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4365173332,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8466,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4962400186060935,"acs":6401,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12899,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5550433339479993,"acs":3010,"articleLive":2,"columnArticles":73,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5423,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5069677774717709,"acs":9204,"articleLive":2,"columnArticles":150,"formTitle":"[1360]日期之间隔几天","frequency":1.3307781213,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18155,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.3998411358784689,"acs":8054,"articleLive":2,"columnArticles":213,"formTitle":"[1361]验证二叉树","frequency":0.4626968388,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20143,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5303684645777819,"acs":5772,"articleLive":2,"columnArticles":74,"formTitle":"[1362]最接近的因数","frequency":0.5483656333,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10883,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3679472201223284,"acs":5354,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.5796181768,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14551,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6837317160185515,"acs":3833,"articleLive":2,"columnArticles":71,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5606,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8246512764597511,"acs":87733,"articleLive":2,"columnArticles":1111,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.4900060181,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":106388,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5406311493331389,"acs":7418,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.4626968388,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13721,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41916199204656185,"acs":15916,"articleLive":2,"columnArticles":233,"formTitle":"[1367]二叉树中的列表","frequency":0.4365173332,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":37971,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5366753175795657,"acs":3929,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7321,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6051838456901748,"acs":3012,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.5185304849,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4977,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7903058411442286,"acs":48735,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.4900060181,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61666,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5810767419458418,"acs":21716,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.0598966468,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37372,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.518045201751272,"acs":8756,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16902,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40470987021096294,"acs":9074,"articleLive":2,"columnArticles":191,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.3914088712,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":22421,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7406515401191532,"acs":17529,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23667,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5788998516798866,"acs":8977,"articleLive":2,"columnArticles":177,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15507,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5072964669738863,"acs":7926,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15624,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.327772470052179,"acs":4460,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.4900060181,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13607,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8643323575771222,"acs":7677,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8882,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8387420026208279,"acs":10881,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12973,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7272461955388785,"acs":17443,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":23985,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7314194028995473,"acs":12764,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.5185304849,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17451,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7022670312143996,"acs":12329,"articleLive":2,"columnArticles":188,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17556,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3258744147617736,"acs":4733,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2742818789,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14524,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.543873113328217,"acs":2126,"articleLive":2,"columnArticles":49,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3909,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6986150907354346,"acs":14629,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":20940,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3177390720214961,"acs":6622,"articleLive":2,"columnArticles":134,"formTitle":"[1386]安排电影院座位","frequency":1.0918686795,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20841,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6942081814499798,"acs":10284,"articleLive":2,"columnArticles":189,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14814,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5476760900814567,"acs":4572,"articleLive":2,"columnArticles":56,"formTitle":"[1388]3n 块披萨","frequency":0.5185304849,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8348,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8308628223802588,"acs":29091,"articleLive":2,"columnArticles":495,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.4365173332,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35013,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3641258887494772,"acs":6965,"articleLive":2,"columnArticles":123,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19128,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.40167581623808146,"acs":6951,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5185304849,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17305,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.41140597455810185,"acs":8635,"articleLive":2,"columnArticles":156,"formTitle":"[1392]最长快乐前缀","frequency":1.1251939893,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":20989,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8565629228687416,"acs":4431,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5173,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.665432144035789,"acs":18147,"articleLive":2,"columnArticles":295,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27271,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7394670239690337,"acs":14901,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4626968388,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20151,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.40611905553708016,"acs":12212,"articleLive":2,"columnArticles":167,"formTitle":"[1396]设计地铁系统","frequency":0.4113903831,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30070,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38383484954513647,"acs":1097,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2858,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7584887613582019,"acs":4758,"articleLive":2,"columnArticles":75,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6273,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6708758731864589,"acs":9988,"articleLive":2,"columnArticles":161,"formTitle":"[1399]统计最大组的数目","frequency":0.4626968388,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14888,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.608399209486166,"acs":6157,"articleLive":2,"columnArticles":103,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10120,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41891755184623164,"acs":4141,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9885,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7542819010899384,"acs":10173,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13487,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6896787210926587,"acs":22218,"articleLive":2,"columnArticles":374,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.0598966468,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32215,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4936733757293647,"acs":7530,"articleLive":2,"columnArticles":160,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15253,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5093652004407153,"acs":6010,"articleLive":2,"columnArticles":145,"formTitle":"[1405]最长快乐字符串","frequency":1.4567702553,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11799,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5694705427213441,"acs":5152,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9047,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6693539832396308,"acs":6310,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9427,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6145134593605714,"acs":14108,"articleLive":2,"columnArticles":214,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22958,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8081328751431844,"acs":8466,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10476,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47558399602385687,"acs":7655,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.6468704038,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16096,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5511016541972682,"acs":8029,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1962391719,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14569,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5492125984251969,"acs":3069,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5588,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6951874815470919,"acs":11773,"articleLive":2,"columnArticles":245,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.4365173332,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":16935,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6050203315608382,"acs":7737,"articleLive":2,"columnArticles":154,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3914088712,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12788,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6865893547427891,"acs":6927,"articleLive":2,"columnArticles":187,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.5483656333,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10089,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.41170704383139617,"acs":2940,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7141,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5211197487841305,"acs":13608,"articleLive":2,"columnArticles":190,"formTitle":"[1417]重新格式化字符串","frequency":0.4626968388,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26113,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7315345233153452,"acs":26434,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":2.5658128862,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36135,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.42122219381232423,"acs":8237,"articleLive":2,"columnArticles":159,"formTitle":"[1419]数青蛙","frequency":1.0598966468,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19555,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6030769230769231,"acs":2548,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.7545149972,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4225,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.742096884239254,"acs":3263,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4397,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5413005272407733,"acs":11088,"articleLive":2,"columnArticles":202,"formTitle":"[1422]分割字符串的最大得分","frequency":0.9996374553,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20484,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5543632129320973,"acs":36420,"articleLive":2,"columnArticles":532,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":65697,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.40176315346173286,"acs":7155,"articleLive":2,"columnArticles":157,"formTitle":"[1424]对角线遍历 II","frequency":0.9711860341,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17809,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.443827479338843,"acs":3437,"articleLive":2,"columnArticles":75,"formTitle":"[1425]带限制的子序列和","frequency":0.5185304849,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7744,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6997389033942559,"acs":1608,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.407279701,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2298,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6435030937648739,"acs":1352,"articleLive":2,"columnArticles":51,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2101,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5960863020572001,"acs":1188,"articleLive":2,"columnArticles":22,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1993,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5007490636704119,"acs":1337,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2670,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5720369056068133,"acs":806,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1409,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8460747851701156,"acs":79850,"articleLive":2,"columnArticles":1049,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94377,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3972040850493889,"acs":4745,"articleLive":2,"columnArticles":103,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11946,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6406489133761861,"acs":6279,"articleLive":2,"columnArticles":112,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9801,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4690218356115746,"acs":2642,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5633,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6223940356205993,"acs":4508,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7243,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8224169248851373,"acs":46182,"articleLive":2,"columnArticles":658,"formTitle":"[1436]旅行终点站","frequency":0.9996374553,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56154,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5837547573119233,"acs":11197,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19181,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4824003392705683,"acs":34125,"articleLive":2,"columnArticles":481,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.3914088712,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70740,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5425101214574899,"acs":5092,"articleLive":2,"columnArticles":70,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.0598966468,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9386,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6997126436781609,"acs":2922,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4176,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.649114392408099,"acs":18947,"articleLive":2,"columnArticles":382,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29189,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915493592198023,"acs":35144,"articleLive":2,"columnArticles":378,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44399,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4117317653646927,"acs":5882,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14286,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5291419835658322,"acs":2769,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5233,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8559718969555035,"acs":4386,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5124,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6109987080418302,"acs":50130,"articleLive":2,"columnArticles":680,"formTitle":"[1446]连续字符","frequency":0.5606901669,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":82046,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.612729545236035,"acs":6373,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10401,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7133835943037566,"acs":11071,"articleLive":2,"columnArticles":180,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":1.0291817016,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15519,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6274832578846945,"acs":16772,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26729,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8027404343329886,"acs":24840,"articleLive":2,"columnArticles":352,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30944,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5250740375123396,"acs":10638,"articleLive":2,"columnArticles":161,"formTitle":"[1451]重新排列句子中的单词","frequency":0.4626968388,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20260,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5011010521164668,"acs":6144,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12261,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36741214057507987,"acs":1725,"articleLive":2,"columnArticles":36,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.7198374588,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4695,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39430512394305123,"acs":5456,"articleLive":2,"columnArticles":86,"formTitle":"[1454]活跃用户","frequency":0.5483656333,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":13837,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6277028367387423,"acs":12657,"articleLive":2,"columnArticles":224,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20164,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.524992140836215,"acs":15030,"articleLive":2,"columnArticles":226,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4365173332,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":28629,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6296434991012583,"acs":8407,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13352,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44340634094041964,"acs":5790,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13058,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5992941176470589,"acs":2547,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4250,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7424876903962082,"acs":16135,"articleLive":2,"columnArticles":328,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21731,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5067632850241546,"acs":6294,"articleLive":2,"columnArticles":90,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12420,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.43644170295113693,"acs":7217,"articleLive":2,"columnArticles":141,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16536,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5944973544973545,"acs":2809,"articleLive":2,"columnArticles":68,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4725,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7670043415340086,"acs":28090,"articleLive":2,"columnArticles":399,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.0291817016,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36623,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.31316725978647686,"acs":6688,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4365173332,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21356,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4841726618705036,"acs":6730,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.4900060181,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13900,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6162873399715505,"acs":1733,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2812,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7006614038830808,"acs":3284,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4687,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7992667277726856,"acs":2616,"articleLive":2,"columnArticles":97,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3273,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8422875627508125,"acs":55201,"articleLive":2,"columnArticles":746,"formTitle":"[1470]重新排列数组","frequency":0.4626968388,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":65537,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.546524064171123,"acs":7665,"articleLive":2,"columnArticles":110,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.5796181768,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14025,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6202841096795507,"acs":9388,"articleLive":2,"columnArticles":151,"formTitle":"[1472]设计浏览器历史记录","frequency":1.3605422232,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15135,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6734352193697948,"acs":15687,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23294,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7158358765683283,"acs":2111,"articleLive":2,"columnArticles":72,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2949,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7206757284926391,"acs":16595,"articleLive":2,"columnArticles":256,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23027,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8642842935755486,"acs":13036,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15083,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28978161229441896,"acs":5374,"articleLive":2,"columnArticles":104,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":1.0291817016,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18545,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5843629734656675,"acs":2885,"articleLive":2,"columnArticles":61,"formTitle":"[1478]安排邮筒","frequency":0.5483656333,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4937,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5673151750972762,"acs":2187,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.5185304849,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3855,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692056798339538,"acs":131915,"articleLive":2,"columnArticles":1339,"formTitle":"[1480]一维数组的动态和","frequency":1.6568080393,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":151765,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5156265071862641,"acs":10691,"articleLive":2,"columnArticles":153,"formTitle":"[1481]不同整数的最少数目","frequency":1.3914088712,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20734,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5873322301893731,"acs":31945,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54390,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3020191649555099,"acs":3530,"articleLive":2,"columnArticles":76,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11688,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8119891008174387,"acs":894,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1101,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6558073654390935,"acs":4167,"articleLive":2,"columnArticles":48,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6354,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586656185984469,"acs":72097,"articleLive":2,"columnArticles":704,"formTitle":"[1486]数组异或操作","frequency":0.4113903831,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":83964,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3134310896185945,"acs":8037,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":1.1251939893,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25642,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.24358035986581275,"acs":7987,"articleLive":2,"columnArticles":120,"formTitle":"[1488]避免洪水泛滥","frequency":3.1946809154,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":32790,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.689194729136164,"acs":11768,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.5483656333,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17075,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8528628495339547,"acs":1281,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1502,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6714433589959242,"acs":20757,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":30914,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6523321764158131,"acs":7706,"articleLive":2,"columnArticles":89,"formTitle":"[1492]n 的第 k 个因子","frequency":1.3605422232,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":11813,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5736703873933027,"acs":8737,"articleLive":2,"columnArticles":165,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.0291817016,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15230,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37513530230400494,"acs":2426,"articleLive":2,"columnArticles":38,"formTitle":"[1494]并行课程 II","frequency":1.3605422232,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6467,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5418952618453865,"acs":4346,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8020,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5356335624336916,"acs":11612,"articleLive":2,"columnArticles":175,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21679,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3942196531791908,"acs":8866,"articleLive":2,"columnArticles":118,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":1.0291817016,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22490,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33497387288856484,"acs":5513,"articleLive":2,"columnArticles":72,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16458,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37662337662337664,"acs":2958,"articleLive":2,"columnArticles":64,"formTitle":"[1499]满足不等式的最大值","frequency":0.5483656333,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7854,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30204323363932484,"acs":1020,"articleLive":2,"columnArticles":32,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3377,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5952222073935673,"acs":4460,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.4900060181,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7493,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7163787033526513,"acs":26453,"articleLive":2,"columnArticles":313,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6568080393,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":36926,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5155723416618245,"acs":8873,"articleLive":2,"columnArticles":90,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.4365173332,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17210,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.599406753878917,"acs":7881,"articleLive":2,"columnArticles":138,"formTitle":"[1504]统计全 1 子矩形","frequency":1.0291817016,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13148,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36345296241240177,"acs":3423,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9418,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8370273794002607,"acs":642,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":767,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5868931494562171,"acs":10469,"articleLive":2,"columnArticles":135,"formTitle":"[1507]转变日期格式","frequency":0.4900060181,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17838,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5534956250541454,"acs":6389,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11543,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5516835182094827,"acs":5620,"articleLive":2,"columnArticles":83,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.5185304849,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10187,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5798969072164949,"acs":5400,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.0598966468,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9312,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6804698972099853,"acs":4634,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.4900060181,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6810,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8481921639440642,"acs":60594,"articleLive":2,"columnArticles":774,"formTitle":"[1512]好数对的数目","frequency":1.4234560486,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71439,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3824528678968756,"acs":11482,"articleLive":2,"columnArticles":162,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30022,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33658097879037696,"acs":8982,"articleLive":2,"columnArticles":158,"formTitle":"[1514]概率最大的路径","frequency":0.9996374553,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":26686,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34394641937145803,"acs":3338,"articleLive":2,"columnArticles":61,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9705,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5892018779342723,"acs":251,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":426,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6627659574468086,"acs":3738,"articleLive":2,"columnArticles":38,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5640,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.7031824471239375,"acs":53361,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.1818749481,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":75885,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.30105374077976815,"acs":5714,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.4626968388,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18980,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33591032083494393,"acs":2607,"articleLive":2,"columnArticles":73,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7761,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3932488249537103,"acs":2761,"articleLive":2,"columnArticles":54,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7021,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7079710144927536,"acs":977,"articleLive":2,"columnArticles":32,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1380,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5748010324801033,"acs":10689,"articleLive":2,"columnArticles":180,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18596,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4340020295058934,"acs":5560,"articleLive":2,"columnArticles":109,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4365173332,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12811,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6585476895060324,"acs":5786,"articleLive":2,"columnArticles":115,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8786,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6207595870206489,"acs":3367,"articleLive":2,"columnArticles":53,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5424,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49226739835370414,"acs":3947,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8018,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851698551309878,"acs":31110,"articleLive":2,"columnArticles":371,"formTitle":"[1528]重新排列字符串","frequency":1.3914088712,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39622,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6934405289653618,"acs":9229,"articleLive":2,"columnArticles":138,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.5185304849,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13309,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.5705563947633434,"acs":9065,"articleLive":2,"columnArticles":151,"formTitle":"[1530]好叶子节点对的数量","frequency":1.0918686795,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15888,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3436414751116256,"acs":2078,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.1625198281,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6047,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6174656852993833,"acs":3104,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.5275963078,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5027,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6062176165803109,"acs":351,"articleLive":2,"columnArticles":19,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":579,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7862459194776932,"acs":18064,"articleLive":2,"columnArticles":167,"formTitle":"[1534]统计好三元组","frequency":1.0598966468,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":22975,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45439983982380616,"acs":13617,"articleLive":2,"columnArticles":185,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.4626968388,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29967,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4438149197355996,"acs":4230,"articleLive":2,"columnArticles":81,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.6815479423,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9531,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36875790139064474,"acs":4667,"articleLive":2,"columnArticles":95,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12656,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6051502145922747,"acs":141,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":233,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5396127024034001,"acs":18029,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.0918686795,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33411,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3190075321222862,"acs":5040,"articleLive":2,"columnArticles":90,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15799,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4658719346049046,"acs":6839,"articleLive":2,"columnArticles":104,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":14680,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3883495145631068,"acs":2640,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6798,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5533344532168655,"acs":3294,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5953,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5501765398195371,"acs":21036,"articleLive":2,"columnArticles":335,"formTitle":"[1544]整理字符串","frequency":1.4234560486,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38235,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5549768105601142,"acs":7778,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0598966468,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14015,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4179427687548337,"acs":5404,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12930,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5383030771211536,"acs":4181,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.5796181768,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7767,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7105751391465677,"acs":383,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":539,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.666177908113392,"acs":2726,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4092,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6561744055696501,"acs":22243,"articleLive":2,"columnArticles":299,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":33898,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8178831096196868,"acs":11699,"articleLive":2,"columnArticles":163,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14304,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5128994585412464,"acs":9662,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":1.0291817016,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18838,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29772296720032687,"acs":8015,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.0918686795,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26921,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7108571428571429,"acs":622,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":875,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382372881355932,"acs":3232,"articleLive":2,"columnArticles":61,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7375,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5748164605873262,"acs":11901,"articleLive":2,"columnArticles":183,"formTitle":"[1556]千位分隔数","frequency":2.3155712755,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20704,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7754346703391289,"acs":9009,"articleLive":2,"columnArticles":128,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.3914088712,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11618,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6237373737373737,"acs":4693,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.5483656333,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7524,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37605100249468726,"acs":4070,"articleLive":2,"columnArticles":71,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10823,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5717458907152376,"acs":9009,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15757,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7784766337505503,"acs":12377,"articleLive":2,"columnArticles":180,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0291817016,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15899,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.31057410452563095,"acs":4344,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13987,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38205552491266775,"acs":4156,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10878,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5623123123123123,"acs":749,"articleLive":2,"columnArticles":27,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1332,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7291873634015498,"acs":3670,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.4626968388,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5033,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44511805998723675,"acs":8370,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.4626968388,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18804,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.4087356104031456,"acs":17256,"articleLive":2,"columnArticles":261,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.5653366358,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":42218,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45975650997632733,"acs":2719,"articleLive":2,"columnArticles":49,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5914,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47228863290589,"acs":2173,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4601,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8945028294260308,"acs":2213,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.4626968388,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2474,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7597309965355614,"acs":3728,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4907,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8011986029528496,"acs":20187,"articleLive":2,"columnArticles":336,"formTitle":"[1572]矩阵对角线元素的和","frequency":1.0598966468,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25196,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2975501113585746,"acs":4676,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15715,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.33137432188065097,"acs":5131,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.4900060181,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15484,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5956730769230769,"acs":4956,"articleLive":2,"columnArticles":71,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8320,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4766718706011824,"acs":18625,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39073,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32816569515068833,"acs":5292,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.7198374588,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16126,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5850203471900273,"acs":11357,"articleLive":2,"columnArticles":212,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19413,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6196253886403276,"acs":16342,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26374,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6262425447316103,"acs":315,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":503,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8065525876460768,"acs":3865,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4792,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6691415917676176,"acs":10274,"articleLive":2,"columnArticles":122,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.4900060181,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15354,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853053089327776,"acs":18911,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6244386845,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27595,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.663789647447235,"acs":28148,"articleLive":2,"columnArticles":357,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6568080393,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42405,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4310710498409332,"acs":2439,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5658,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6278409090909091,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":704,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8304385584020842,"acs":3825,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4606,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8392595477899579,"acs":45247,"articleLive":2,"columnArticles":721,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.1870248524,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":53913,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29650702196615053,"acs":4117,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.6815479423,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13885,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2715856638609829,"acs":4001,"articleLive":2,"columnArticles":60,"formTitle":"[1590]使数组和能被 P 整除","frequency":1.1598715277,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14732,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5856536101934875,"acs":1241,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2119,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4456704897537642,"acs":8199,"articleLive":2,"columnArticles":130,"formTitle":"[1592]重新排列单词间的空格","frequency":0.4900060181,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18397,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5403188216649576,"acs":5796,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":1.0291817016,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10727,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31452305929533086,"acs":4392,"articleLive":2,"columnArticles":102,"formTitle":"[1594]矩阵的最大非负积","frequency":0.5483656333,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13964,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46838131193959415,"acs":1985,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.7198374588,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4238,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7538677918424754,"acs":2680,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3555,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6625514403292181,"acs":322,"articleLive":2,"columnArticles":21,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":486,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6729502091331003,"acs":11745,"articleLive":2,"columnArticles":157,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17453,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.420863309352518,"acs":3978,"articleLive":2,"columnArticles":70,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9452,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.675924836216704,"acs":17230,"articleLive":2,"columnArticles":209,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25491,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4913005654632449,"acs":2259,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4598,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7482935153583617,"acs":877,"articleLive":2,"columnArticles":35,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1172,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8439267361410157,"acs":58793,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.0291817016,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69666,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4147577539022907,"acs":4092,"articleLive":2,"columnArticles":69,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.0598966468,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9866,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7394130391963758,"acs":3754,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5077,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34988132911392406,"acs":1769,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5056,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5403171390013495,"acs":3203,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5928,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392572944297082,"acs":10604,"articleLive":2,"columnArticles":177,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16588,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5116881391951122,"acs":7705,"articleLive":2,"columnArticles":142,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":15058,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.4456033287101248,"acs":16064,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.854933745,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36050,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6100055279159757,"acs":2207,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3618,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7308248914616498,"acs":505,"articleLive":2,"columnArticles":22,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":691,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.73262438283327,"acs":1929,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.5796181768,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2633,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8210459702571984,"acs":18164,"articleLive":2,"columnArticles":302,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.5185304849,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22123,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5020296505471232,"acs":5689,"articleLive":2,"columnArticles":68,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11332,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2772067394299036,"acs":5232,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.4567702553,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18874,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6261872455902306,"acs":1846,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2948,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5781990521327014,"acs":366,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":633,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.671573137074517,"acs":8030,"articleLive":2,"columnArticles":138,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11957,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37362794012829653,"acs":2621,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7015,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4418169047061578,"acs":1887,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4271,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15518663075147052,"acs":2823,"articleLive":2,"columnArticles":60,"formTitle":"[1622]奇妙序列","frequency":1.9698516251,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18191,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.784650870203397,"acs":3742,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4769,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6211371173162877,"acs":12924,"articleLive":2,"columnArticles":223,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.0291817016,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":20807,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5474660956459672,"acs":3068,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5604,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.39059111907231076,"acs":4143,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.5185304849,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10607,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3848699052489096,"acs":2559,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6649,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8377896613190731,"acs":470,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":561,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5238425925925926,"acs":9052,"articleLive":2,"columnArticles":105,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17280,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7624668043670699,"acs":7752,"articleLive":2,"columnArticles":122,"formTitle":"[1630]等差子数组","frequency":1.4234560486,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10167,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49350908727781106,"acs":27181,"articleLive":2,"columnArticles":313,"formTitle":"[1631]最小体力消耗路径","frequency":1.5275963078,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55077,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3239143985040515,"acs":1559,"articleLive":2,"columnArticles":28,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4813,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6554039419536496,"acs":3026,"articleLive":2,"columnArticles":31,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4617,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5472589792060492,"acs":579,"articleLive":2,"columnArticles":29,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1058,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5456365092073658,"acs":1363,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2498,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068207600680658,"acs":9969,"articleLive":2,"columnArticles":196,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.3914088712,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14104,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8087840700466036,"acs":5727,"articleLive":2,"columnArticles":80,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7081,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7145513714551371,"acs":3074,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.6468704038,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4302,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.3997084548104956,"acs":1371,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3430,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6547441629408842,"acs":13180,"articleLive":2,"columnArticles":226,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20130,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.773286358860251,"acs":12511,"articleLive":2,"columnArticles":290,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.0598966468,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16179,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4520152290928187,"acs":6886,"articleLive":2,"columnArticles":111,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15234,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4562344378471557,"acs":2382,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5221,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5556420233463035,"acs":1428,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2570,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40307692307692305,"acs":917,"articleLive":2,"columnArticles":26,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2275,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5341045015608133,"acs":36615,"articleLive":2,"columnArticles":365,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4669442299,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":68554,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5180683311432326,"acs":7885,"articleLive":2,"columnArticles":118,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.0598966468,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15220,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2808821338101624,"acs":3770,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.1598715277,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13422,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4745222929936306,"acs":2682,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5652,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7987206823027718,"acs":1873,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4626968388,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2345,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6580547112462006,"acs":866,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6815479423,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1316,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6507229320780095,"acs":7741,"articleLive":2,"columnArticles":191,"formTitle":"[1652]拆炸弹","frequency":1.0291817016,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11896,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5154179408766565,"acs":4045,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7848,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.28138227742696553,"acs":4055,"articleLive":2,"columnArticles":54,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.4234560486,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14411,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.37910146390711763,"acs":2253,"articleLive":2,"columnArticles":34,"formTitle":"[1655]分配重复整数","frequency":0.5796181768,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5943,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7822512844465204,"acs":8374,"articleLive":2,"columnArticles":98,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10705,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4650974682520424,"acs":5750,"articleLive":2,"columnArticles":82,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.4626968388,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12363,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3061002854660544,"acs":9865,"articleLive":2,"columnArticles":159,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":1.0918686795,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32228,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41347851677457326,"acs":1405,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.9996374553,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3398,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7246153846153847,"acs":471,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":650,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7324825427401879,"acs":3042,"articleLive":2,"columnArticles":60,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":1.0918686795,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4153,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128784522227145,"acs":22016,"articleLive":2,"columnArticles":313,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27084,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5730176839703366,"acs":8036,"articleLive":2,"columnArticles":135,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.4900060181,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14024,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5487662716145327,"acs":5649,"articleLive":2,"columnArticles":109,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10294,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6584297017650639,"acs":5409,"articleLive":2,"columnArticles":87,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.5483656333,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8215,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.7,"acs":287,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":410,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6040252182347235,"acs":2491,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4124,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.444398511781728,"acs":7525,"articleLive":2,"columnArticles":140,"formTitle":"[1668]最大重复子字符串","frequency":0.4900060181,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16933,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7536992840095466,"acs":14211,"articleLive":2,"columnArticles":263,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":18855,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5268070327762101,"acs":4854,"articleLive":2,"columnArticles":85,"formTitle":"[1670]设计前中后队列","frequency":0.4900060181,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9214,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46762895351305456,"acs":2203,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6124079997,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4711,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.849102756046644,"acs":40267,"articleLive":2,"columnArticles":462,"formTitle":"[1672]最富有客户的资产总量","frequency":0.4626968388,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47423,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.36059512673170296,"acs":8095,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.4900060181,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22449,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.37006993006993005,"acs":2646,"articleLive":2,"columnArticles":55,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.5796181768,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7150,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4345072598084646,"acs":2813,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.6815479423,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6474,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7688253012048193,"acs":1021,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1328,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.37720156555772993,"acs":2313,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6132,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.828039331188545,"acs":18274,"articleLive":2,"columnArticles":301,"formTitle":"[1678]设计 Goal 解析器","frequency":0.4626968388,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22069,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49757379700768295,"acs":7383,"articleLive":2,"columnArticles":121,"formTitle":"[1679]K 和数对的最大数目","frequency":0.4365173332,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14838,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.47063648293963256,"acs":5738,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12192,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38618965786595844,"acs":2472,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6401,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5304709141274239,"acs":383,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":722,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8974001857010213,"acs":3866,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.4626968388,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4308,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8270781082049444,"acs":18467,"articleLive":2,"columnArticles":380,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22328,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6097236589330575,"acs":4126,"articleLive":2,"columnArticles":92,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6767,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4757486979166667,"acs":2923,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6144,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39664378337147216,"acs":1040,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2622,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8063323318696557,"acs":20934,"articleLive":2,"columnArticles":280,"formTitle":"[1688]比赛中的配对次数","frequency":1.0291817016,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":25962,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8651491540516474,"acs":15545,"articleLive":2,"columnArticles":206,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17968,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5223476297968397,"acs":4628,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.5796181768,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8860,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.49307425933051174,"acs":2563,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5198,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657051282051282,"acs":205,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":312,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8054682589566311,"acs":2563,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3182,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6371510324027531,"acs":8239,"articleLive":2,"columnArticles":143,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12931,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4719588730137535,"acs":7069,"articleLive":2,"columnArticles":143,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4365173332,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":14978,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39539181151469655,"acs":6847,"articleLive":2,"columnArticles":121,"formTitle":"[1696]跳跃游戏 VI","frequency":0.5796181768,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17317,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5314588614888223,"acs":2306,"articleLive":2,"columnArticles":45,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4339,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5125581395348837,"acs":551,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.8917161188,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1075,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8019689511548656,"acs":2118,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.5796181768,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2641,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7037563603711464,"acs":9405,"articleLive":2,"columnArticles":195,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4626968388,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13364,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6147398843930636,"acs":4254,"articleLive":2,"columnArticles":85,"formTitle":"[1701]平均等待时间","frequency":0.4900060181,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6920,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4788732394366197,"acs":3162,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6603,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38908594815825376,"acs":1426,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.7545149972,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3665,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7805570660383059,"acs":12919,"articleLive":2,"columnArticles":201,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16551,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34848659224306594,"acs":6056,"articleLive":2,"columnArticles":126,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":17378,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5929271085103677,"acs":4661,"articleLive":2,"columnArticles":118,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7861,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503100613154961,"acs":14441,"articleLive":2,"columnArticles":152,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28704,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7054930509596293,"acs":1066,"articleLive":2,"columnArticles":26,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1511,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.71729070256626,"acs":1705,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.5483656333,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2377,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6956943471466293,"acs":12910,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4365173332,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18557,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35889404394620944,"acs":30478,"articleLive":2,"columnArticles":363,"formTitle":"[1711]大餐计数","frequency":2.6012072943,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":84922,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2644219892919086,"acs":7013,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.5483656333,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26522,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49427676272606014,"acs":15934,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.6981497206,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32237,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6022988505747127,"acs":262,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":435,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7259927797833935,"acs":2011,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2770,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6685998959030411,"acs":8992,"articleLive":2,"columnArticles":200,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13449,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43913684987089635,"acs":2381,"articleLive":2,"columnArticles":52,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.6124079997,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5422,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4985142857142857,"acs":2181,"articleLive":2,"columnArticles":51,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.5796181768,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4375,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37641083521444696,"acs":667,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1772,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8688512585812357,"acs":47461,"articleLive":2,"columnArticles":500,"formTitle":"[1720]解码异或后的数组","frequency":0.4626968388,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54625,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6448211920529802,"acs":12171,"articleLive":2,"columnArticles":188,"formTitle":"[1721]交换链表中的节点","frequency":1.0291817016,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":18875,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5165806927044952,"acs":4907,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9499,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5054485554992397,"acs":23934,"articleLive":2,"columnArticles":179,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.4567702553,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47352,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5579399141630901,"acs":390,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":699,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7890462307371928,"acs":11367,"articleLive":2,"columnArticles":155,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14406,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48809622563251764,"acs":5884,"articleLive":2,"columnArticles":114,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12055,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5779105441627644,"acs":3579,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.5796181768,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6193,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3631025957972806,"acs":1175,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3236,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6226228698444061,"acs":2521,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4049,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5256064690026954,"acs":780,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1484,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46216857081267515,"acs":2144,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4639,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7887153408402955,"acs":13028,"articleLive":2,"columnArticles":220,"formTitle":"[1732]找到最高海拔","frequency":0.4626968388,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16518,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.46605876393110435,"acs":2300,"articleLive":2,"columnArticles":56,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4935,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7235352990992379,"acs":28194,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.4900060181,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38967,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.489749430523918,"acs":1075,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2195,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44865779555418817,"acs":29165,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8995387239,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65005,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31893715037841397,"acs":3877,"articleLive":2,"columnArticles":106,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12156,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537431941923775,"acs":28817,"articleLive":2,"columnArticles":391,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44080,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4747101327507982,"acs":2825,"articleLive":2,"columnArticles":61,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5951,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6499162479061976,"acs":776,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.797440042,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1194,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8388908388908389,"acs":2390,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2849,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7103242989190036,"acs":9068,"articleLive":2,"columnArticles":135,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12766,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965688681561503,"acs":22697,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.4591545118,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32584,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36284457328857694,"acs":28537,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78648,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48471792109869394,"acs":3600,"articleLive":2,"columnArticles":75,"formTitle":"[1745]回文串分割 IV","frequency":0.6124079997,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7427,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5742481203007519,"acs":1222,"articleLive":2,"columnArticles":47,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.0918686795,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2128,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6933392936969155,"acs":1551,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2237,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7430374616409009,"acs":12833,"articleLive":2,"columnArticles":249,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17271,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5360824742268041,"acs":4056,"articleLive":2,"columnArticles":94,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7566,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45354209445585214,"acs":3534,"articleLive":2,"columnArticles":81,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7792,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4784390243902439,"acs":2452,"articleLive":2,"columnArticles":36,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.6815479423,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5125,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6700524687205704,"acs":9961,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.4626968388,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14866,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6300106765019897,"acs":6491,"articleLive":2,"columnArticles":136,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10303,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4236965017634163,"acs":4445,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.5796181768,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10491,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4179581795817958,"acs":3398,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.3162872142,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8130,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8100303951367781,"acs":533,"articleLive":2,"columnArticles":16,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":658,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9224620303756994,"acs":3462,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3753,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6429884673240849,"acs":7694,"articleLive":2,"columnArticles":117,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11966,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4348289649044869,"acs":4894,"articleLive":2,"columnArticles":101,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11255,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5459944249181917,"acs":4505,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8251,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4392434988179669,"acs":2787,"articleLive":2,"columnArticles":43,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.8430683946,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6345,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.726161369193154,"acs":1188,"articleLive":2,"columnArticles":25,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1636,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.58843916326278,"acs":4754,"articleLive":2,"columnArticles":89,"formTitle":"[1763]最长的美好子字符串","frequency":0.4900060181,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8079,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4749195532841189,"acs":2509,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.5483656333,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5283,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5467726195455179,"acs":3922,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.0291817016,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7173,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37968317827508175,"acs":1510,"articleLive":2,"columnArticles":29,"formTitle":"[1766]互质树","frequency":1.407279701,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3977,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7942811755361397,"acs":1000,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1259,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7600217996851156,"acs":12551,"articleLive":2,"columnArticles":224,"formTitle":"[1768]交替合并字符串","frequency":0.4365173332,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16514,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8546367913244558,"acs":10718,"articleLive":2,"columnArticles":187,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12541,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37263826863620747,"acs":4339,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11644,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36807668898356666,"acs":2419,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6572,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5070754716981132,"acs":430,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":848,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.843414078367266,"acs":17026,"articleLive":2,"columnArticles":213,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20187,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5460895059067,"acs":6333,"articleLive":2,"columnArticles":92,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11597,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4761148183455142,"acs":4495,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9441,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4619081951453977,"acs":1922,"articleLive":2,"columnArticles":45,"formTitle":"[1776]车队 II","frequency":0.7198374588,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4161,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7864603993124422,"acs":5948,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":1.0291817016,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7563,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5023584905660378,"acs":213,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":424,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6470086381571931,"acs":6067,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.4626968388,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9377,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6686129778561198,"acs":6069,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9077,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5254734270006108,"acs":4301,"articleLive":2,"columnArticles":62,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.6468704038,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8185,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29642689233662434,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4254,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7942636514065086,"acs":1440,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1813,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.423149990953501,"acs":9355,"articleLive":2,"columnArticles":111,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22108,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3534093924117803,"acs":6660,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18845,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3427813062849559,"acs":3616,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.5185304849,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10549,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6526952695269527,"acs":11866,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.9996374553,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18180,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6517647058823529,"acs":277,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":425,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7131667288325252,"acs":1912,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2681,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6348980341723315,"acs":13823,"articleLive":2,"columnArticles":159,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":21772,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8089107478663388,"acs":11184,"articleLive":2,"columnArticles":154,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13826,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.512133013780707,"acs":6838,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.8995387239,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13352,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4189699133095359,"acs":4108,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9805,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5861111111111111,"acs":211,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":360,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7850631136044881,"acs":2239,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.4900060181,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2852,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.49199144024382335,"acs":7587,"articleLive":2,"columnArticles":137,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15421,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5704373423044575,"acs":5426,"articleLive":2,"columnArticles":83,"formTitle":"[1797]设计一个验证系统","frequency":1.0291817016,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9512,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5260291526509691,"acs":3284,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.1598715277,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6243,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5199415326790562,"acs":2490,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.3605422232,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4789,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.679940236455762,"acs":10467,"articleLive":2,"columnArticles":175,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15394,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3837016333304219,"acs":4393,"articleLive":2,"columnArticles":114,"formTitle":"[1801]积压订单中的订单总数","frequency":0.6124079997,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11449,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.264244971480036,"acs":4401,"articleLive":2,"columnArticles":110,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16655,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40764094955489616,"acs":2198,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5392,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5820610687022901,"acs":610,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.6815479423,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1048,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4777635578307471,"acs":11946,"articleLive":2,"columnArticles":162,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25004,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6635432283858071,"acs":5311,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8004,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5861399592351743,"acs":6039,"articleLive":2,"columnArticles":92,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10303,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26870892516429934,"acs":2535,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9434,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6255910165484634,"acs":2117,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4626968388,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3384,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6153846153846154,"acs":216,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":351,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6601719197707736,"acs":1152,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.5796181768,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1745,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7924944812362031,"acs":8975,"articleLive":2,"columnArticles":221,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.4900060181,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11325,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5012156686177398,"acs":5566,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.0598966468,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11105,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.35107939992682036,"acs":3838,"articleLive":2,"columnArticles":87,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10932,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29483828814113033,"acs":1805,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6122,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7347754416521523,"acs":47249,"articleLive":2,"columnArticles":641,"formTitle":"[1816]截断句子","frequency":0.8363731366,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64304,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6974550241333919,"acs":6358,"articleLive":2,"columnArticles":105,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.5185304849,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9116,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3718273931835896,"acs":26238,"articleLive":2,"columnArticles":341,"formTitle":"[1818]绝对差值和","frequency":2.6012072943,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70565,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3806393785479534,"acs":2548,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.6468704038,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6694,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.48986486486486486,"acs":145,"articleLive":2,"columnArticles":9,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":296,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9007271577616187,"acs":2849,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3163,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8030084327281015,"acs":21140,"articleLive":2,"columnArticles":210,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26326,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7217910018686216,"acs":10043,"articleLive":2,"columnArticles":128,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6568080393,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":13914,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6500733257291836,"acs":7979,"articleLive":2,"columnArticles":159,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12274,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28432601880877745,"acs":2721,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9570,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4267352185089974,"acs":332,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":778,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7915191793686339,"acs":10957,"articleLive":2,"columnArticles":154,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":13843,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8659132559560171,"acs":8505,"articleLive":2,"columnArticles":107,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9822,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6906229720960415,"acs":4257,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6164,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.49069003285870755,"acs":896,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1826,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7406166219839142,"acs":1105,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1492,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8235359794562608,"acs":14752,"articleLive":2,"columnArticles":231,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":17913,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6831154029786382,"acs":44354,"articleLive":2,"columnArticles":393,"formTitle":"[1833]雪糕的最大数量","frequency":1.4234560486,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":64929,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3559741657696448,"acs":6614,"articleLive":2,"columnArticles":137,"formTitle":"[1834]单线程 CPU","frequency":0.6124079997,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18580,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5151057401812689,"acs":3751,"articleLive":2,"columnArticles":62,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.797440042,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7282,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7339331619537275,"acs":571,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.5483656333,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":778,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7949147806649902,"acs":8535,"articleLive":2,"columnArticles":103,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4626968388,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10737,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42886004126547456,"acs":29931,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.2305297528,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":69792,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5661241514680625,"acs":6922,"articleLive":2,"columnArticles":134,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12227,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3899323816679189,"acs":2076,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5324,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5259683098591549,"acs":1195,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2272,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6462264150943396,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":212,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5022421524663677,"acs":784,"articleLive":2,"columnArticles":27,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1561,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7992753623188406,"acs":7721,"articleLive":2,"columnArticles":129,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9660,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5085660955936271,"acs":7629,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.4900060181,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15001,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6331718580224557,"acs":27971,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.1544941029,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44176,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3627737226277372,"acs":2485,"articleLive":2,"columnArticles":47,"formTitle":"[1847]最近的房间","frequency":0.797440042,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6850,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6810073452256034,"acs":8437,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12389,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3286395511921459,"acs":5858,"articleLive":2,"columnArticles":113,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.5483656333,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17825,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6110441282855076,"acs":2534,"articleLive":2,"columnArticles":51,"formTitle":"[1850]邻位交换的最小次数","frequency":0.6468704038,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4147,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40480210091915214,"acs":2158,"articleLive":2,"columnArticles":52,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.797440042,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5331,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5784313725490197,"acs":413,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":714,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.638327853452325,"acs":1359,"articleLive":2,"columnArticles":21,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2129,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7750155763239875,"acs":12439,"articleLive":2,"columnArticles":133,"formTitle":"[1854]人口最多的年份","frequency":1.3914088712,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16050,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6686970822927453,"acs":10978,"articleLive":2,"columnArticles":107,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16417,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35492627099992663,"acs":4838,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.4626968388,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13631,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45714285714285713,"acs":2384,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5215,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6407185628742516,"acs":428,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":668,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7653924715494602,"acs":7869,"articleLive":2,"columnArticles":158,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10281,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.76938018717994,"acs":4357,"articleLive":2,"columnArticles":79,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5663,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6210022233624081,"acs":3631,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5847,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31539986781229346,"acs":2386,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.6124079997,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7565,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8881203198375428,"acs":13995,"articleLive":2,"columnArticles":164,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.9711860341,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":15758,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3909191583610188,"acs":4589,"articleLive":2,"columnArticles":111,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.5796181768,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11739,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5104695138824832,"acs":5534,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.6124079997,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10841,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6051165146909828,"acs":2389,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.783399074,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3948,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.74364896073903,"acs":644,"articleLive":2,"columnArticles":18,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":866,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5233441910966341,"acs":482,"articleLive":2,"columnArticles":20,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":921,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7735401354245037,"acs":13366,"articleLive":2,"columnArticles":154,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.4626968388,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17279,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45049135107177746,"acs":7839,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.5185304849,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17401,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2756636589512227,"acs":6324,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":22941,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6158536585365854,"acs":2222,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3608,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8192090395480226,"acs":2610,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3186,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8742632612966601,"acs":445,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":509,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.722636815920398,"acs":581,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":804,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7260356818869066,"acs":7203,"articleLive":2,"columnArticles":120,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":9921,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8182003724774856,"acs":32071,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.8600812983,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39197,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43333333333333335,"acs":2262,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5220,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41682321018576496,"acs":1997,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4791,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7706824247045367,"acs":8086,"articleLive":2,"columnArticles":112,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10492,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3568963597907158,"acs":6412,"articleLive":2,"columnArticles":66,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17966,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.28199426111908177,"acs":3931,"articleLive":2,"columnArticles":118,"formTitle":"[1882]使用服务器处理任务","frequency":0.6815479423,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13940,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.38286786160900377,"acs":1837,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.8430683946,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4798,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6942384483742157,"acs":2434,"articleLive":2,"columnArticles":43,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.3155712755,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3506,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5256975036710719,"acs":358,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":681,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.571597516507342,"acs":5800,"articleLive":2,"columnArticles":86,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.4113903831,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10147,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6472472710014239,"acs":5455,"articleLive":2,"columnArticles":72,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.4900060181,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8428,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3237441911927418,"acs":2926,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9038,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2724458204334365,"acs":2288,"articleLive":2,"columnArticles":43,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.6815479423,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8398,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7323232323232324,"acs":1305,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1782,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.3448275862068966,"acs":1800,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.4900060181,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5220,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3586374695863747,"acs":737,"articleLive":2,"columnArticles":18,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2055,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.590618609406953,"acs":32347,"articleLive":2,"columnArticles":425,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1230732056,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54768,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45758336148241086,"acs":37930,"articleLive":2,"columnArticles":522,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":2.0394823771,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":82892,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5378358392901158,"acs":2182,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4057,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5074285714285715,"acs":888,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1750,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.536085698647275,"acs":6856,"articleLive":2,"columnArticles":87,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4365173332,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12789,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31349793021880545,"acs":4241,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13528,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6353761348897535,"acs":3919,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6168,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.44356435643564357,"acs":1344,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1251939893,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3030,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6201117318435754,"acs":1554,"articleLive":2,"columnArticles":47,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2506,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.47580645161290325,"acs":118,"articleLive":2,"columnArticles":5,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":248,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6380558428128231,"acs":8638,"articleLive":2,"columnArticles":112,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13538,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.28717910336052693,"acs":3837,"articleLive":2,"columnArticles":74,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13361,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5950761567199924,"acs":6212,"articleLive":2,"columnArticles":134,"formTitle":"[1905]统计子岛屿","frequency":1.3914088712,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10439,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4239043824701195,"acs":2660,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.1251939893,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6275,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5867126833477135,"acs":680,"articleLive":2,"columnArticles":25,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1159,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6707692307692308,"acs":218,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":325,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32024480397503485,"acs":5285,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.4626968388,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":16503,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.674341560377671,"acs":4071,"articleLive":2,"columnArticles":66,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.4900060181,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6037,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5662236822457817,"acs":3792,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.3914088712,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6697,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.250061289531748,"acs":2040,"articleLive":2,"columnArticles":46,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8158,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8324589317966802,"acs":9679,"articleLive":2,"columnArticles":114,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.9996374553,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11627,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44508746547415495,"acs":3384,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.2742818789,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7603,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3959801618376403,"acs":3034,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7662,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5498687664041995,"acs":1257,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.5093309599,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2286,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.29054520358868186,"acs":421,"articleLive":2,"columnArticles":11,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1449,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5289421157684631,"acs":265,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.1962391719,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":501,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3962765957446808,"acs":596,"articleLive":2,"columnArticles":19,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1504,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8928125,"acs":14285,"articleLive":2,"columnArticles":124,"formTitle":"[1920]基于排列构建数组","frequency":2.1544941029,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16000,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34763744427934623,"acs":5849,"articleLive":2,"columnArticles":95,"formTitle":"[1921]消灭怪物的最大数量","frequency":1.0918686795,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16825,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36213113547722425,"acs":4921,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.5185304849,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13589,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23934327458954663,"acs":1589,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.9458004417,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6639,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.39226519337016574,"acs":71,"articleLive":2,"columnArticles":6,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":181,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6928176795580111,"acs":5643,"articleLive":2,"columnArticles":73,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.6568080393,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8145,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34665866003259843,"acs":4041,"articleLive":2,"columnArticles":68,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11657,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41558991739038337,"acs":1962,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.5483656333,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4721,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.40996835443037977,"acs":2591,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.2207434884,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6320,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8917159763313609,"acs":16577,"articleLive":2,"columnArticles":144,"formTitle":"[1929]数组串联","frequency":1.3307781213,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":18590,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4839893262174783,"acs":5804,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.0918686795,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11992,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5646008403361344,"acs":2150,"articleLive":2,"columnArticles":65,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.7545149972,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3808,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3300813008130081,"acs":1218,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.7352356726,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3690,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5063063063063064,"acs":562,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.7545149972,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1110,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7588028169014085,"acs":431,"articleLive":2,"columnArticles":16,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":568,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7333655239014969,"acs":7594,"articleLive":2,"columnArticles":107,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10355,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45081842982722037,"acs":5949,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13196,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2491560252458535,"acs":3395,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.4567702553,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13626,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3551103368176539,"acs":1223,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.5093309599,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3444,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6376237623762376,"acs":644,"articleLive":2,"columnArticles":17,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1010,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7866666666666666,"acs":472,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":600,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7654256703983338,"acs":5880,"articleLive":2,"columnArticles":103,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":1.0291817016,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7682,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39898605830164763,"acs":3148,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7890,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.41350638815656054,"acs":2039,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.6815479423,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4931,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5829979879275654,"acs":2318,"articleLive":2,"columnArticles":66,"formTitle":"[1944]队列中可以看到的人数","frequency":1.0291817016,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3976,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6598069568384629,"acs":7246,"articleLive":2,"columnArticles":90,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.4900060181,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":10982,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3060747663551402,"acs":5633,"articleLive":2,"columnArticles":83,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0598966468,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18404,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5453850076491585,"acs":4278,"articleLive":2,"columnArticles":93,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7844,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5188347564038172,"acs":1033,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.9996374553,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1991,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5247252747252747,"acs":382,"articleLive":2,"columnArticles":15,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":728,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5287356321839081,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":348,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7063037249283668,"acs":493,"articleLive":2,"columnArticles":16,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":698,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5434937357630979,"acs":7635,"articleLive":2,"columnArticles":85,"formTitle":"[1952]三除数","frequency":0.4626968388,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14048,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.33235531431086335,"acs":4531,"articleLive":2,"columnArticles":86,"formTitle":"[1953]你可以工作的最大周数","frequency":0.5483656333,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13633,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.47944311507504894,"acs":4408,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.5185304849,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9194,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4978933870672284,"acs":2718,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.9996374553,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5459,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.8343265753,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6081188343349586,"acs":5363,"articleLive":2,"columnArticles":63,"formTitle":"[1957]删除字符使字符串变好","frequency":0.4365173332,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8819,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42600969305331177,"acs":2637,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6190,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.42152704135737007,"acs":1590,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3772,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28577319587628863,"acs":693,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.6252347774,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2425,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5350108642321441,"acs":7633,"articleLive":2,"columnArticles":72,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.4900060181,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14267,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.43759156167594493,"acs":5974,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.4567702553,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13652,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6193599160545645,"acs":4722,"articleLive":2,"columnArticles":61,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.4626968388,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7624,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3901577584177066,"acs":3314,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8494,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7651775486827033,"acs":668,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":873,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.723404255319149,"acs":68,"articleLive":2,"columnArticles":8,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":94,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7820928931169558,"acs":6988,"articleLive":2,"columnArticles":75,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8935,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3631914578080973,"acs":4898,"articleLive":2,"columnArticles":71,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13486,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2828301710440228,"acs":3026,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.1738745544,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10699,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4782079870261504,"acs":2359,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.783399074,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4933,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.4972375690607735,"acs":1170,"articleLive":2,"columnArticles":31,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2353,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4343283582089552,"acs":291,"articleLive":2,"columnArticles":12,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.6815479423,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":670,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.6047904191616766,"acs":101,"articleLive":2,"columnArticles":11,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":167,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7332384566729918,"acs":4637,"articleLive":2,"columnArticles":66,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.9996374553,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6324,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38808296367342043,"acs":3237,"articleLive":2,"columnArticles":47,"formTitle":"[1975]最大方阵和","frequency":1.4914477937,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8341,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.30187492135397004,"acs":2399,"articleLive":2,"columnArticles":54,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":7947,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.25535823637477034,"acs":834,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.407279701,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3266,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5399159663865546,"acs":514,"articleLive":2,"columnArticles":15,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.4900060181,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":952,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7916631148239707,"acs":9287,"articleLive":2,"columnArticles":117,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11731,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5851552969878953,"acs":6236,"articleLive":2,"columnArticles":111,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0598966468,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10657,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30436706060797575,"acs":4816,"articleLive":2,"columnArticles":86,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.7958602944,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15823,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46818416968442833,"acs":905,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.2742818789,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1933,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6370370370370371,"acs":86,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":135,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5771428571428572,"acs":6565,"articleLive":2,"columnArticles":72,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11375,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4149045899948427,"acs":6436,"articleLive":2,"columnArticles":92,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15512,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2859501758920238,"acs":3983,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.5185304849,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13929,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4723076923076923,"acs":1535,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.9996374553,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3250,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6689774696707106,"acs":386,"articleLive":2,"columnArticles":10,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.2742818789,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":577,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5949367088607594,"acs":94,"articleLive":2,"columnArticles":3,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":158,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5493975903614458,"acs":456,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.5483656333,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":830,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6581571162484935,"acs":6007,"articleLive":2,"columnArticles":83,"formTitle":"[1991]找到数组的中间位置","frequency":0.4365173332,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9127,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5943804034582133,"acs":3300,"articleLive":2,"columnArticles":68,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5552,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3864734299516908,"acs":2000,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5175,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37377416643317457,"acs":1334,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3569,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5646409822937983,"acs":6346,"articleLive":2,"columnArticles":50,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":11239,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2554782774390244,"acs":5363,"articleLive":2,"columnArticles":101,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":20992,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3401511783014673,"acs":2295,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.3162872142,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6747,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4229658160808859,"acs":1757,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.7198374588,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4154,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6126760563380281,"acs":87,"articleLive":2,"columnArticles":9,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":142,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7702407002188184,"acs":8096,"articleLive":2,"columnArticles":121,"formTitle":"[2000]反转单词前缀","frequency":0.4626968388,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10511,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3625348933895587,"acs":6104,"articleLive":2,"columnArticles":132,"formTitle":"[2001]可互换矩形的组数","frequency":0.6124079997,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16837,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5823406789755807,"acs":3911,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6716,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3948969578017664,"acs":2012,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5095,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4024896265560166,"acs":194,"articleLive":2,"columnArticles":8,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":482,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6181818181818182,"acs":34,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":55,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8494028546460821,"acs":5832,"articleLive":2,"columnArticles":79,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":6866,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3197104370933749,"acs":3489,"articleLive":2,"columnArticles":68,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.4626968388,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":10913,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4267680854507202,"acs":2637,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.6895656358,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6179,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41471658866354655,"acs":1595,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3846,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6468401486988847,"acs":174,"articleLive":2,"columnArticles":9,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"","submitted":269,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.8774125740493025,"acs":9183,"articleLive":2,"columnArticles":95,"formTitle":"[2011]执行操作后的变量值","frequency":1.3605422232,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10466,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36410090031632736,"acs":4489,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12329,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.34307709472274905,"acs":3075,"articleLive":2,"columnArticles":56,"formTitle":"[2013]检测正方形","frequency":0.5185304849,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8963,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5312183597705029,"acs":1574,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2963,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6814159292035398,"acs":77,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":113,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5559275474289639,"acs":6476,"articleLive":2,"columnArticles":87,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.4626968388,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11649,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.35603042375950744,"acs":3932,"articleLive":2,"columnArticles":99,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11044,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41043344840813195,"acs":2140,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.6468704038,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5214,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35766637349750807,"acs":1220,"articleLive":2,"columnArticles":35,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.6468704038,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3411,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7606382978723404,"acs":286,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":376,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.6633663366336634,"acs":134,"articleLive":2,"columnArticles":9,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":202,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.6526908635794744,"acs":4172,"articleLive":2,"columnArticles":55,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":6392,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.75139146567718,"acs":3240,"articleLive":2,"columnArticles":55,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4312,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4916827175625985,"acs":2808,"articleLive":2,"columnArticles":70,"formTitle":"[2024]考试的最大困扰度","frequency":0.4900060181,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5711,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2640858566500575,"acs":1378,"articleLive":2,"columnArticles":45,"formTitle":"[2025]分割数组的最多方案数","frequency":0.6815479423,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5218,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8599348534201955,"acs":528,"articleLive":2,"columnArticles":15,"formTitle":"[2026]Low-Quality Problems","frequency":1.0598966468,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":614,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5620807214340702,"acs":5111,"articleLive":2,"columnArticles":59,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9093,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4289051391427991,"acs":4223,"articleLive":2,"columnArticles":63,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9846,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23649754500818332,"acs":2312,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.6124079997,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9776,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35135135135135137,"acs":1326,"articleLive":2,"columnArticles":41,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.5483656333,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3774,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.547486033519553,"acs":98,"articleLive":2,"columnArticles":5,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":2.0071693881,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":179,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6632390745501285,"acs":6708,"articleLive":2,"columnArticles":115,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10114,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.39732620320855616,"acs":4458,"articleLive":2,"columnArticles":92,"formTitle":"[2033]获取单值网格的最小操作数","frequency":1.0291817016,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11220,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.30480811645346273,"acs":3455,"articleLive":2,"columnArticles":71,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11335,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3212053213656035,"acs":2004,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.5796181768,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6239,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4896551724137931,"acs":71,"articleLive":2,"columnArticles":7,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":145,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8331210191082803,"acs":3924,"articleLive":2,"columnArticles":56,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4710,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5074675324675325,"acs":3126,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6160,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.36429906542056073,"acs":1949,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.5483656333,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5350,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.32435465768799104,"acs":1156,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3564,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6325581395348837,"acs":272,"articleLive":2,"columnArticles":13,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":430,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6676812891674128,"acs":7458,"articleLive":2,"columnArticles":119,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.3605422232,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11170,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5925135764158262,"acs":6110,"articleLive":2,"columnArticles":72,"formTitle":"[2043]简易银行系统","frequency":0.4900060181,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10312,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7414698162729659,"acs":5085,"articleLive":2,"columnArticles":97,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4113903831,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6858,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.33218489807637097,"acs":2314,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.5796181768,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":6966,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.7142857142857143,"acs":170,"articleLive":2,"columnArticles":18,"formTitle":"[2046]Sort Linked List Already Sorted Using Absolute Values","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":238,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.28682305241818706,"acs":4952,"articleLive":2,"columnArticles":106,"formTitle":"[2047]句子中的有效单词数","frequency":0.4626968388,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17265,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4155751125665166,"acs":4061,"articleLive":2,"columnArticles":93,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9772,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.39598893499308435,"acs":2863,"articleLive":2,"columnArticles":94,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7230,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5593356549691937,"acs":2088,"articleLive":2,"columnArticles":70,"formTitle":"[2050]并行课程 III","frequency":0.4626968388,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3733,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6812080536912751,"acs":203,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":298,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5180722891566265,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":83,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7500443813243387,"acs":4225,"articleLive":2,"columnArticles":66,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5633,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3317817429531937,"acs":2566,"articleLive":2,"columnArticles":60,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7734,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3841485183862906,"acs":2152,"articleLive":2,"columnArticles":69,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.9996374553,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5602,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6113243761996161,"acs":637,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1042,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7744015874984497,"acs":6244,"articleLive":2,"columnArticles":42,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8063,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5726003103524717,"acs":5166,"articleLive":2,"columnArticles":74,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9022,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.4265629992544467,"acs":4005,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9389,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.36232952451161077,"acs":983,"articleLive":2,"columnArticles":21,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2713,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5192307692307693,"acs":54,"articleLive":2,"columnArticles":5,"formTitle":"[2061]Number of Spaces Cleaning Robot Cleaned","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":104,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6064944134078212,"acs":5211,"articleLive":2,"columnArticles":93,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.4626968388,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8592,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.4837360594795539,"acs":4164,"articleLive":2,"columnArticles":100,"formTitle":"[2063]所有子字符串中的元音","frequency":0.4626968388,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8608,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.4146341463414634,"acs":3315,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":7995,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5335660580021482,"acs":1987,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3724,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8333333333333334,"acs":180,"articleLive":2,"columnArticles":10,"formTitle":"[2066]Account Balance","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":216,"title":"Account Balance","titleSlug":"account-balance"},{"acceptance":0.4158415841584158,"acs":42,"articleLive":2,"columnArticles":4,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":101,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7388832487309644,"acs":3639,"articleLive":2,"columnArticles":64,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":4925,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.18984126984126984,"acs":2392,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12600,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.4259874492432632,"acs":2308,"articleLive":2,"columnArticles":78,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5418,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.36241830065359476,"acs":1109,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.4626968388,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3060,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.7002967359050445,"acs":236,"articleLive":2,"columnArticles":6,"formTitle":"[2072]The Winner University","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":337,"title":"The Winner University","titleSlug":"the-winner-university"},{"acceptance":0.6165369074603331,"acs":6256,"articleLive":2,"columnArticles":94,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10147,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.4148803329864724,"acs":3987,"articleLive":2,"columnArticles":115,"formTitle":"[2074]反转偶数长度组的节点","frequency":0.9996374553,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9610,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.45701104431706974,"acs":3269,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.4900060181,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7153,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.49370277078085645,"acs":2548,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5161,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.64,"acs":48,"articleLive":2,"columnArticles":4,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":75,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.752360717658168,"acs":6374,"articleLive":2,"columnArticles":84,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.3201069813,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8472,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7713271823988644,"acs":5434,"articleLive":2,"columnArticles":101,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7045,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.2675309047150202,"acs":4891,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.4113903831,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18282,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.4030808729139923,"acs":2198,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5453,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.7585301837270341,"acs":289,"articleLive":2,"columnArticles":9,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":381,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6885245901639344,"acs":84,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":122,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.8058823529411765,"acs":137,"articleLive":2,"columnArticles":8,"formTitle":"[2084]Drop Type 1 Orders for Customers With Type 0 Orders","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":170,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7364102564102564,"acs":3590,"articleLive":2,"columnArticles":55,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":4875,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.4480088495575221,"acs":2835,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6328,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.46367211757400123,"acs":2240,"articleLive":2,"columnArticles":57,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.0,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4831,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6160354552780016,"acs":1529,"articleLive":2,"columnArticles":42,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2482,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.8441431537803835,"acs":6911,"articleLive":2,"columnArticles":76,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.0503937192,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8187,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3465039705597521,"acs":5367,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.1125198712,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15489,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5711820534943917,"acs":5296,"articleLive":2,"columnArticles":107,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9272,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.2630430334856441,"acs":3857,"articleLive":2,"columnArticles":107,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.2299611348,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14663,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6607142857142857,"acs":37,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":56,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5496581504138179,"acs":6110,"articleLive":2,"columnArticles":104,"formTitle":"[2094]找出 3 位偶数","frequency":0.1471974097,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11116,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.5963640184951661,"acs":5675,"articleLive":2,"columnArticles":87,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9516,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.40069547938400396,"acs":4033,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.2646386732,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10065,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.3350838214502121,"acs":1659,"articleLive":2,"columnArticles":44,"formTitle":"[2097]合法重新排列数对","frequency":0.6124079997,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":4951,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.5714285714285714,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":1.4567702553,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":56,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.4929459421706942,"acs":3529,"articleLive":2,"columnArticles":84,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.5483656333,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7159,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.3503722794959908,"acs":2447,"articleLive":2,"columnArticles":52,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":6984,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.36728133987480965,"acs":2171,"articleLive":2,"columnArticles":58,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":5911,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5230502599653379,"acs":1509,"articleLive":2,"columnArticles":54,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":2885,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.817811490377862,"acs":5822,"articleLive":2,"columnArticles":104,"formTitle":"[2103]环和杆","frequency":0.21344821,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7119,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.55574381565571,"acs":4920,"articleLive":2,"columnArticles":86,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":8853,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5482674849763457,"acs":4288,"articleLive":2,"columnArticles":74,"formTitle":"[2105]给植物浇水 II","frequency":0.3201069813,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":7821,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.3138771186440678,"acs":2963,"articleLive":2,"columnArticles":72,"formTitle":"[2106]摘水果","frequency":1.4567702553,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9440,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5932203389830508,"acs":35,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":59,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.8274988827647848,"acs":5555,"articleLive":2,"columnArticles":72,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":6713,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6049874743794125,"acs":5313,"articleLive":2,"columnArticles":67,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":8782,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.49206500047514967,"acs":5178,"articleLive":2,"columnArticles":97,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":10523,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.30746631546955727,"acs":3035,"articleLive":2,"columnArticles":76,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":9871,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.7678571428571429,"acs":43,"articleLive":2,"columnArticles":3,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":56,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.875,"acs":7,"articleLive":2,"columnArticles":3,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":8,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.8450158292069161,"acs":83278,"articleLive":2,"columnArticles":640,"formTitle":"[LCP 01]猜数字","frequency":0.4626968388,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98552,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6914172236752882,"acs":14275,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 02]分式化简","frequency":1.0291817016,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20646,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22132167225845364,"acs":11742,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":1.0918686795,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53054,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.38205199115044247,"acs":2763,"articleLive":2,"columnArticles":63,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7232,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.202268253819477,"acs":2158,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10669,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8391348366313852,"acs":45586,"articleLive":2,"columnArticles":689,"formTitle":"[LCP 06]拿硬币","frequency":0.4900060181,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54325,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7668980225618768,"acs":40993,"articleLive":2,"columnArticles":492,"formTitle":"[LCP 07]传递信息","frequency":3.5430296917,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53453,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2926708484648399,"acs":5319,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 08]剧情触发时间","frequency":1.1598715277,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18174,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2798258463541667,"acs":6877,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.2207434884,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24576,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5977188655980271,"acs":1939,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.9607573463,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3244,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6937160293696958,"acs":7275,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":0.4626968388,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10487,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4154534606205251,"acs":6963,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.5185304849,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16760,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6115813774528664,"acs":9537,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15594,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.215376513954713,"acs":2863,"articleLive":2,"columnArticles":44,"formTitle":"[LCP 14]切分数组","frequency":1.5653366358,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13293,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5809815950920245,"acs":947,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.0598966468,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1630,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3138248847926267,"acs":681,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.9996374553,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2170,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7983537766300839,"acs":24733,"articleLive":2,"columnArticles":269,"formTitle":"[LCP 17]速算机器人","frequency":1.0291817016,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":30980,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28985008832127057,"acs":18542,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 18]早餐组合","frequency":1.6568080393,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":63971,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171519020187867,"acs":19930,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.4914477937,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38538,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3183046268152651,"acs":1885,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5922,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3317972350230415,"acs":936,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2821,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3358931431067113,"acs":9229,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27476,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.34086978008401286,"acs":2759,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8094,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2860931054802593,"acs":971,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3394,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.34060539950913554,"acs":1249,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3667,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.34496567505720827,"acs":603,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.1251939893,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1748,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32819605861546236,"acs":1299,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3958,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2884803001876173,"acs":11532,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 28]采购方案","frequency":0.4900060181,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":39975,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19204394254716659,"acs":5629,"articleLive":2,"columnArticles":133,"formTitle":"[LCP 29]乐团站位","frequency":1.7235940976,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29311,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3545988030910464,"acs":6103,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17211,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25634343711425045,"acs":1869,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":1.9607573463,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7291,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.41231544832553113,"acs":1145,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.5093309599,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2777,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22482789251610039,"acs":5062,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0291817016,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22515,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4989809153233278,"acs":2693,"articleLive":2,"columnArticles":63,"formTitle":"[LCP 34]二叉树染色","frequency":1.9340106329,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5397,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4132701421800948,"acs":1308,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.2343245059,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3165,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2716436637390213,"acs":866,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.8944725831,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3188,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1991262359163026,"acs":866,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 37]最小矩形面积","frequency":0.6815479423,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4349,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5755555555555556,"acs":518,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":900,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5131673449844386,"acs":4287,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.4626968388,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8354,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2527624309392265,"acs":3477,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13756,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.43210253280439426,"acs":1416,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.6124079997,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3277,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2076271186440678,"acs":1127,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5428,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.41619047619047617,"acs":437,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1050,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8162447257383966,"acs":3869,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":4740,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20444968818472947,"acs":1213,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5933,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3892644135188867,"acs":979,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2515,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36454018227009116,"acs":880,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2414,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17130089374379345,"acs":345,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":0.8917161188,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2014,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.24416909620991253,"acs":335,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1372,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5423213380638622,"acs":5350,"articleLive":2,"columnArticles":114,"formTitle":"[LCS 01]下载插件","frequency":1.8663395523,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":9865,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6737873433986509,"acs":4195,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 02]完成一半题目","frequency":1.0598966468,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6226,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41057830829388764,"acs":1995,"articleLive":2,"columnArticles":64,"formTitle":"[LCS 03]主题空间","frequency":1.0918686795,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4859,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6785537235112018,"acs":442111,"articleLive":2,"columnArticles":3004,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1857978433,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":651549,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031646649402672,"acs":290666,"articleLive":2,"columnArticles":2300,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.6048988113,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":720961,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7601439215141839,"acs":328519,"articleLive":2,"columnArticles":2148,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.4290895426,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":432180,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7498747864808768,"acs":342857,"articleLive":2,"columnArticles":2322,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.598184673,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":457219,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6993874247939302,"acs":204824,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.1192953959,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":292862,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7131468619568996,"acs":305674,"articleLive":2,"columnArticles":1895,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.526280694,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":428627,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.36092515276083187,"acs":291673,"articleLive":2,"columnArticles":1987,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.7100604696,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":808126,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4467722264924417,"acs":217969,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.2452478049,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":487875,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49232603416229126,"acs":290303,"articleLive":2,"columnArticles":1770,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.9833037145,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":589656,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45248610470851536,"acs":189441,"articleLive":2,"columnArticles":1242,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.826879292,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":418667,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5281270771076394,"acs":195463,"articleLive":2,"columnArticles":1843,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.6102378523,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":370106,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5704248333366633,"acs":171302,"articleLive":2,"columnArticles":1408,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.8600812983,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":300306,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31384593954589773,"acs":90124,"articleLive":2,"columnArticles":522,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.3416595397,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":287160,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7479243437712849,"acs":214127,"articleLive":2,"columnArticles":1340,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.5368771169,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":286295,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.34142903092866406,"acs":135871,"articleLive":2,"columnArticles":827,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":397948,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7780479818166058,"acs":161571,"articleLive":2,"columnArticles":1178,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":2.9505410786,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":207662,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5975075310053857,"acs":208465,"articleLive":2,"columnArticles":1581,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.3620884053,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":348891,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3796835141350067,"acs":72485,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.6941245984,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":190909,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24497136084171683,"acs":83912,"articleLive":2,"columnArticles":922,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.9277203263,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":342538,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6445946228935379,"acs":215468,"articleLive":2,"columnArticles":1788,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7719204077,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":334269,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7987329325167163,"acs":284301,"articleLive":2,"columnArticles":2601,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.9287991279,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":355940,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7423571102069634,"acs":328058,"articleLive":2,"columnArticles":2004,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1857978433,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":441914,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7273995083710741,"acs":206548,"articleLive":2,"columnArticles":1286,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.4645565165,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":283954,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46619646498980283,"acs":164586,"articleLive":2,"columnArticles":1332,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.5506434827,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":353040,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7926989237694899,"acs":212716,"articleLive":2,"columnArticles":1542,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.3620884053,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":268344,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5790958991905889,"acs":168060,"articleLive":2,"columnArticles":1217,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3125510377,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":290211,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43937133887422036,"acs":157588,"articleLive":2,"columnArticles":1573,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.5777674672,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":358667,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5611068687214461,"acs":170471,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.0735208146,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":303812,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6165216265732038,"acs":123837,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":200864,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6407800514662961,"acs":155880,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.3494555946,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":243266,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6878108565825831,"acs":154331,"articleLive":2,"columnArticles":1214,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.295816246,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":224380,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5884478242355684,"acs":136810,"articleLive":2,"columnArticles":1278,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3727476689,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":232493,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5546714738608814,"acs":124922,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.406361858,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":225218,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5795964125560538,"acs":148379,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.8623361416,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":256004,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7181330912815728,"acs":141618,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.7205967924,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":197203,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6536907041055094,"acs":116774,"articleLive":2,"columnArticles":1012,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.1772406408,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":178638,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5629224418565627,"acs":83867,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":2.9851143011,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":148985,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5802504849743049,"acs":170495,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.064061899,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":293830,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.693373312212416,"acs":183841,"articleLive":2,"columnArticles":1094,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":265140,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5714720021281042,"acs":270684,"articleLive":2,"columnArticles":1918,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.2452478049,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":473661,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5823438390748432,"acs":71506,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.0926915615,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":122790,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6061171093347407,"acs":243473,"articleLive":2,"columnArticles":1618,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9873507556,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":401693,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48988182412703674,"acs":53185,"articleLive":2,"columnArticles":543,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.7637383951,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":108567,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4193725846158078,"acs":60986,"articleLive":2,"columnArticles":511,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.4361649936,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":145422,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584087839071228,"acs":122363,"articleLive":2,"columnArticles":901,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.2630197317,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":219128,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5309523716089739,"acs":135301,"articleLive":2,"columnArticles":1574,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4361886939,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":254827,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.689952747179453,"acs":134478,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.406361858,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":194909,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646028133483232,"acs":169436,"articleLive":2,"columnArticles":1154,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4037790269,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":364690,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6514011469475739,"acs":96096,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0506496061,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":147522,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6170167061077304,"acs":175213,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1353233559,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":283968,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48509432075578335,"acs":111578,"articleLive":2,"columnArticles":908,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.7612128453,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":230013,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.65156932991618,"acs":191693,"articleLive":2,"columnArticles":1122,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.867618123,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":294202,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5353661572161099,"acs":215078,"articleLive":2,"columnArticles":1746,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9237486786,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":401740,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44781971110062907,"acs":191777,"articleLive":2,"columnArticles":1639,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.9206247011,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":428246,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7585544330691,"acs":179232,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8609238878,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":236281,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7904427398514933,"acs":193317,"articleLive":2,"columnArticles":1368,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.1347306137,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":244568,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5896492758953971,"acs":150689,"articleLive":2,"columnArticles":1013,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2214294207,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":255557,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6965548710928587,"acs":125173,"articleLive":2,"columnArticles":1101,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0506496061,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":179703,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8026571587599926,"acs":99503,"articleLive":2,"columnArticles":751,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.8663395523,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":123967,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6690468246023802,"acs":150385,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.6039854597,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":224775,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7089789833569256,"acs":150758,"articleLive":2,"columnArticles":1939,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7543837899,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":212641,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4425920062352339,"acs":145372,"articleLive":2,"columnArticles":1073,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.2512895408,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":328456,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8584217711841267,"acs":235787,"articleLive":2,"columnArticles":1975,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.2409952944,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":274675,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44500653455812006,"acs":142330,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.0329678681,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":319838,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47601534055949557,"acs":102895,"articleLive":2,"columnArticles":1113,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.1911730311,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":216159,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5649771552337438,"acs":71473,"articleLive":2,"columnArticles":634,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.7336648167,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":126506,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4603930864197531,"acs":116537,"articleLive":2,"columnArticles":1085,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":1.9043832252,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":253125,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6559162315212537,"acs":118955,"articleLive":2,"columnArticles":804,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.7017651089,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":181357,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6351301624249063,"acs":148435,"articleLive":2,"columnArticles":1054,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.9505410786,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":233708,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8566564424199419,"acs":149699,"articleLive":2,"columnArticles":1372,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.3155712755,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":174748,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5878153365554639,"acs":79783,"articleLive":2,"columnArticles":553,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.6442418721,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":135728,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5987147552581544,"acs":81242,"articleLive":2,"columnArticles":594,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6762190171,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":135694,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28822639225181595,"acs":76184,"articleLive":2,"columnArticles":613,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.4567702553,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":264320,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6949232950608203,"acs":130369,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.7235940976,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":187602,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7015776375191283,"acs":128830,"articleLive":2,"columnArticles":751,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.7336648167,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":183629,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20791512890002586,"acs":15267,"articleLive":2,"columnArticles":174,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.8623361416,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":73429,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5586304329759827,"acs":13444,"articleLive":2,"columnArticles":178,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5368771169,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":24066,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7854962538155582,"acs":16984,"articleLive":2,"columnArticles":215,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.1962391719,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":21622,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7012619236883942,"acs":14115,"articleLive":2,"columnArticles":153,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.2742818789,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":20128,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7143515167467264,"acs":10856,"articleLive":2,"columnArticles":133,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":15197,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6457843638221769,"acs":12638,"articleLive":2,"columnArticles":150,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":19570,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4472719951681095,"acs":11108,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.3649190232,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":24835,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.4979083262111466,"acs":11069,"articleLive":2,"columnArticles":137,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":22231,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5527321244466008,"acs":9114,"articleLive":2,"columnArticles":118,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.8669929807,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":16489,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44036206358407276,"acs":9876,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.8034217671,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":22427,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5621712281771747,"acs":7374,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.8883353802,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":13117,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6718204118040586,"acs":9038,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.3201069813,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":13453,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6583262350936968,"acs":6183,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":9392,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5079128905721628,"acs":7510,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":14786,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6285684076971876,"acs":5945,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":9458,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.48672665916760405,"acs":8654,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.7446608131,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":17780,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5121732189183795,"acs":5133,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10022,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5187004851685807,"acs":8446,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":16283,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4674930595906773,"acs":7241,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":15489,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7148364242550531,"acs":6861,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.2214294207,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":9598,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5256301631010379,"acs":9926,"articleLive":2,"columnArticles":132,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.8663395523,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":18884,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5439098803097865,"acs":11588,"articleLive":2,"columnArticles":108,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.5093309599,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":21305,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.6984536082474226,"acs":8672,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":12416,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7366448917332626,"acs":22215,"articleLive":2,"columnArticles":184,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.8883353802,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":30157,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6009970918155381,"acs":7233,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.406361858,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12035,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6629110332164914,"acs":7943,"articleLive":2,"columnArticles":122,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.9759656084,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":11982,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.612211060177509,"acs":12554,"articleLive":2,"columnArticles":147,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.9166098111,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":20506,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6282828282828283,"acs":4354,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":6930,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30416803413193305,"acs":4634,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":15235,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5482600131319764,"acs":4175,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":7615,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5437258027784104,"acs":4775,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":8782,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5984201341048957,"acs":6515,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":10887,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7691746864975212,"acs":5275,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 033]变位词组","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":6858,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5735482220516757,"acs":4484,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":7818,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6647083508182963,"acs":4752,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7149,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5683150791016706,"acs":5137,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9039,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.44245503669650776,"acs":5486,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":12399,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.776658073588001,"acs":6628,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":8534,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5059671511284415,"acs":4282,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":8463,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5736148779542812,"acs":2961,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.4234560486,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5162,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.779050097592713,"acs":5987,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":7685,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8345323741007195,"acs":4988,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":5977,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6495440163781873,"acs":3490,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9711860341,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5373,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6372347707049966,"acs":5586,"articleLive":2,"columnArticles":105,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3640218312,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":8766,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8039361860742508,"acs":5392,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":6707,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7203196347031964,"acs":5048,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7008,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6886639676113361,"acs":5103,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7410,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6942315449778136,"acs":3442,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":4958,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7528801843317973,"acs":5228,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":6944,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.602513517463101,"acs":4123,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":6843,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41167254210732473,"acs":3153,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.4234560486,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":7659,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7476839938239835,"acs":5811,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":7772,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6430298146655923,"acs":5586,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":8687,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8560386473429952,"acs":4430,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5175,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8834818368745716,"acs":3867,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4377,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7217478653942743,"acs":5748,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":7964,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3580994076744785,"acs":2781,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":7766,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6062128825947921,"acs":2654,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4378,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.631152746903779,"acs":3975,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6298,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6791009086561454,"acs":4260,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6273,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5450954575378538,"acs":3312,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6076,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7686147186147186,"acs":3551,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":4620,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7180771156735103,"acs":2868,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.3640218312,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":3994,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6182892370922168,"acs":2407,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":3893,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6479246393876951,"acs":2201,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3397,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6524526198439242,"acs":2341,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3588,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6712792127921279,"acs":2183,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3252,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5010286141761735,"acs":5358,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":10694,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.721116209382901,"acs":38504,"articleLive":2,"columnArticles":408,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.7735545369,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53395,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.650345928685471,"acs":4888,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":7516,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.505063848524879,"acs":2294,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4542,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4197015680323723,"acs":6638,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":15816,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5257220216606499,"acs":3495,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":6648,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5707236842105263,"acs":4511,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":7904,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7135193133047211,"acs":4655,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6524,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.682210554418439,"acs":7666,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":11237,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5849024306744266,"acs":6834,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":11684,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6390148266143855,"acs":5215,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8161,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.851676206050695,"acs":5208,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6115,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8227468615326963,"acs":4391,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5337,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7871778755499685,"acs":6262,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":7955,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6477168048427424,"acs":4922,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":7599,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8621892055791389,"acs":5687,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":6596,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6860158311345647,"acs":4680,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":6822,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8506662582325012,"acs":5554,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6529,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.751235910618944,"acs":3799,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5057,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6325702224387075,"acs":3896,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6159,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7398018958355522,"acs":6946,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":9389,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6148639681486396,"acs":4633,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":7535,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5004277159965783,"acs":2925,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":5845,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7804927302100162,"acs":3865,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":4952,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6785565289945765,"acs":3253,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.5185304849,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":4794,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5730777159348588,"acs":2780,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.5185304849,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":4851,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.602187833511206,"acs":2257,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.4900060181,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":3748,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6521354933726068,"acs":8856,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6133051917,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":13580,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49162128194386256,"acs":2347,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.7235940976,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":4774,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5421356025253912,"acs":1975,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3643,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.752129471890971,"acs":3532,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4696,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7139661233620965,"acs":4468,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":2.0394823771,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6258,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7494043751353693,"acs":3460,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4617,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4897882470868312,"acs":3909,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.0918686795,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":7981,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5944501541623843,"acs":2892,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":4865,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4973011508300234,"acs":4883,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":9819,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5899581589958159,"acs":2256,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":3824,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6951173113506658,"acs":5481,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":7885,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.54875061244488,"acs":2240,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4082,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5399949533181932,"acs":2140,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":3963,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5928571428571429,"acs":1494,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2520,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5909580193756727,"acs":2196,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.4567702553,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3716,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8201211482749539,"acs":3114,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":3797,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6803534303534303,"acs":1309,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1924,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5659354838709677,"acs":2193,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":3875,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5836545875096376,"acs":2271,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":3891,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4180790960451977,"acs":1184,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":2832,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.31059966216216217,"acs":1471,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":4736,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6495726495726496,"acs":5244,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8073,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6391076115485564,"acs":1461,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2286,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6975047984644913,"acs":1817,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2605,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4820650019817677,"acs":4865,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10092,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7166716050096479,"acs":99168,"articleLive":2,"columnArticles":1630,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.924509025,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":138373,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6425357251444208,"acs":63399,"articleLive":2,"columnArticles":1181,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.3307781213,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":98670,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784440209736409,"acs":48871,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 01.03]URL化","frequency":2.0394823771,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":84487,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5490276996185831,"acs":43903,"articleLive":2,"columnArticles":839,"formTitle":"[面试题 01.04]回文排列","frequency":1.8034217671,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":79965,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.32892160484705185,"acs":35613,"articleLive":2,"columnArticles":611,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3307781213,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":108272,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4707821215560331,"acs":77986,"articleLive":2,"columnArticles":1218,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.0412772906,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":165652,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7497435239805078,"acs":70158,"articleLive":2,"columnArticles":1003,"formTitle":"[面试题 01.07]旋转矩阵","frequency":3.1267248506,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":93576,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.622767568685224,"acs":48191,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 01.08]零矩阵","frequency":0.9996374553,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":77382,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5487669609347697,"acs":36116,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 01.09]字符串轮转","frequency":2.1230732056,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":65813,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6786574853559438,"acs":67314,"articleLive":2,"columnArticles":721,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.7235940976,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":99187,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7798562131588811,"acs":68664,"articleLive":2,"columnArticles":984,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.6244386845,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88047,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8552193576528386,"acs":74505,"articleLive":2,"columnArticles":713,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.6568080393,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87118,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6500094777746185,"acs":27433,"articleLive":2,"columnArticles":393,"formTitle":"[面试题 02.04]分割链表","frequency":1.0291817016,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42204,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46709117085903573,"acs":39905,"articleLive":2,"columnArticles":561,"formTitle":"[面试题 02.05]链表求和","frequency":2.8944725831,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":85433,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4838134399563815,"acs":42593,"articleLive":2,"columnArticles":532,"formTitle":"[面试题 02.06]回文链表","frequency":0.4626968388,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":88036,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.681223120185264,"acs":57656,"articleLive":2,"columnArticles":513,"formTitle":"[面试题 02.07]链表相交","frequency":0.9437569969,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":84636,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5344737175198452,"acs":29558,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 02.08]环路检测","frequency":1.5653366358,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55303,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5336394061615035,"acs":12437,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 03.01]三合一","frequency":1.0291817016,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23306,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6142032845095429,"acs":27676,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.6252347774,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45060,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3874775789429775,"acs":9289,"articleLive":2,"columnArticles":146,"formTitle":"[面试题 03.03]堆盘子","frequency":1.0291817016,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":23973,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7143222870146494,"acs":25112,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 03.04]化栈为队","frequency":1.6568080393,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35155,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5408575916580328,"acs":16183,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 03.05]栈排序","frequency":1.3605422232,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":29921,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5889485191810773,"acs":11852,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.06]动物收容所","frequency":1.0291817016,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20124,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5308791208791209,"acs":19324,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6568080393,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36400,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7888221490236603,"acs":36640,"articleLive":2,"columnArticles":446,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1870248524,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46449,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8052815680836983,"acs":25554,"articleLive":2,"columnArticles":560,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.8663395523,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31733,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5870252632287146,"acs":34901,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.4626968388,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59454,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35278405058390866,"acs":27339,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.0598966468,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":77495,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5926991983644483,"acs":22033,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 04.06]后继者","frequency":0.4113903831,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37174,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7170369785705829,"acs":18169,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4234560486,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25339,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47575577164781374,"acs":7192,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0291817016,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15117,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7163856110407905,"acs":17545,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 04.10]检查子树","frequency":1.3605422232,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24491,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48637536072732845,"acs":19045,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 04.12]求和路径","frequency":2.0071693881,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39157,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.505784720527215,"acs":10361,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20485,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6963613550815558,"acs":8325,"articleLive":2,"columnArticles":139,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.4626968388,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11955,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3840853736700423,"acs":11985,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8663395523,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31204,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.37859025032938076,"acs":5747,"articleLive":2,"columnArticles":146,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15180,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5300789783229709,"acs":12618,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":1.0291817016,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":23804,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7055270655270656,"acs":12382,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.07]配对交换","frequency":0.9996374553,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17550,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5565438373570522,"acs":3942,"articleLive":2,"columnArticles":79,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0291817016,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7083,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3633260141362012,"acs":45338,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 08.01]三步问题","frequency":1.6895656358,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":124786,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36249596209755575,"acs":13466,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.4900060181,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37148,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6756486140508752,"acs":53308,"articleLive":2,"columnArticles":442,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":78899,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.821458569185261,"acs":22494,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 08.04]幂集","frequency":2.2207434884,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27383,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6780937870323345,"acs":24033,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35442,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.653517912077007,"acs":26342,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.8034217671,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40308,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8139427187232829,"acs":22849,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.8343265753,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28072,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7178514621314083,"acs":17601,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.4900060181,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24519,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8158447744466237,"acs":23294,"articleLive":2,"columnArticles":382,"formTitle":"[面试题 08.09]括号","frequency":2.70930723,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28552,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5581622678396871,"acs":14846,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 08.10]颜色填充","frequency":1.0291817016,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26598,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4948043365158823,"acs":35189,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.6568080393,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71117,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7621453228929864,"acs":18104,"articleLive":2,"columnArticles":311,"formTitle":"[面试题 08.12]八皇后","frequency":1.8663395523,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23754,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5027448322602508,"acs":7418,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.1598715277,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14755,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5362950742399246,"acs":4551,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.3307781213,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8486,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5564356435643565,"acs":59291,"articleLive":2,"columnArticles":2401,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.2253268274,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":106555,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7400120000827591,"acs":35767,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 10.02]变位词组","frequency":3.1068757688,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48333,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3935173874093982,"acs":14496,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8218717702,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":36837,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5563030125767768,"acs":20922,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.4113903831,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":37609,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45355155482815057,"acs":13856,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.4234560486,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30550,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6244280183034143,"acs":5322,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8523,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6634146341463415,"acs":8432,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 10.11]峰与谷","frequency":1.0598966468,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12710,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8281838503230547,"acs":27046,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 16.01]交换数字","frequency":1.0291817016,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32657,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7645194854332198,"acs":16165,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21144,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44118972510139703,"acs":9790,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22190,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4601764774178567,"acs":7927,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17226,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46043279729998016,"acs":11596,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.0291817016,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25185,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4247651270277618,"acs":14061,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 16.06]最小差","frequency":2.0394823771,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33103,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7327153610259269,"acs":21026,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.07]最大数值","frequency":1.3914088712,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28696,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37883389006984514,"acs":2495,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6586,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5456835356079689,"acs":2383,"articleLive":2,"columnArticles":41,"formTitle":"[面试题 16.09]运算","frequency":0.4626968388,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4367,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6801164977853286,"acs":11209,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.10]生存人数","frequency":1.3914088712,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16481,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44082354642015836,"acs":51836,"articleLive":2,"columnArticles":603,"formTitle":"[面试题 16.11]跳水板","frequency":1.6252347774,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117589,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.42738752959747434,"acs":2166,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5068,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5526427660478958,"acs":3900,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.14]最佳直线","frequency":1.0598966468,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7057,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5026236125126136,"acs":9962,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 16.15]珠玑妙算","frequency":1.0598966468,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":19820,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4570143379252179,"acs":16256,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.16]部分排序","frequency":1.6252347774,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35570,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.596997785251415,"acs":36390,"articleLive":2,"columnArticles":395,"formTitle":"[面试题 16.17]连续数列","frequency":1.9759656084,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":60955,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34354684830600607,"acs":15484,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.5185304849,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45071,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6147576394689093,"acs":21345,"articleLive":2,"columnArticles":386,"formTitle":"[面试题 16.19]水域大小","frequency":1.8995387239,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34721,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7202623247399367,"acs":9555,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.20]T9键盘","frequency":1.0598966468,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13266,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46464280866850655,"acs":10270,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22103,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5851837296128906,"acs":2978,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5089,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4726477024070022,"acs":11664,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.24]数对和","frequency":0.4626968388,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24678,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5453827566056509,"acs":34532,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.9267947577,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63317,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.39065402045516456,"acs":15775,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 16.26]计算器","frequency":2.4294598592,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40381,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5971213404037253,"acs":13400,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.3914088712,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22441,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6385899659401968,"acs":30561,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 17.04]消失的数字","frequency":1.6252347774,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":47857,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3892921960072595,"acs":6006,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15428,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45337301587301587,"acs":5027,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0291817016,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11088,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4099309730572256,"acs":9205,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.5185304849,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22455,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27240387292356233,"acs":8806,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7235940976,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32327,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5491445212959593,"acs":15085,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.8343265753,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27470,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.570184413445462,"acs":68547,"articleLive":2,"columnArticles":952,"formTitle":"[面试题 17.10]主要元素","frequency":2.8944725831,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120219,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6854310576836817,"acs":15281,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 17.11]单词距离","frequency":1.0598966468,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22294,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.631460801864007,"acs":22223,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 17.12]BiNode","frequency":0.9996374553,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35193,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5518352848309434,"acs":25167,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.1251939893,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45606,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5963610761135404,"acs":80467,"articleLive":2,"columnArticles":790,"formTitle":"[面试题 17.14]最小K个数","frequency":3.7100604696,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":134930,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40364262859955696,"acs":6560,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 17.15]最长单词","frequency":1.6568080393,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16252,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5170556111320662,"acs":63057,"articleLive":2,"columnArticles":1167,"formTitle":"[面试题 17.16]按摩师","frequency":1.7235940976,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":121954,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4488496302382909,"acs":8740,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 17.17]多次搜索","frequency":0.4626968388,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19472,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44267696852630384,"acs":7792,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 17.18]最短超串","frequency":1.6895656358,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17602,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5785098331161983,"acs":9325,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.4900060181,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16119,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5745619901029825,"acs":4296,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 17.20]连续中值","frequency":0.5796181768,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7477,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361240310077519,"acs":45133,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.5658128862,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70950,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37987411424725864,"acs":9596,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 17.22]单词转换","frequency":1.3914088712,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25261,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37650625236832136,"acs":4968,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.5185304849,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13195,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5223678073188314,"acs":12319,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.7496117871,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23583,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.504099519366695,"acs":1783,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.1251939893,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3537,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3449584387423202,"acs":3818,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.4234560486,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11068,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.29772547244540004,"acs":13155,"articleLive":2,"columnArticles":132,"formTitle":"[1044]最长重复子串","frequency":3.0613031916,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"ac","submitted":44185,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.5222021565816723,"acs":2793028,"articleLive":2,"columnArticles":15296,"formTitle":"[1]两数之和","frequency":4.7073908296,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5348557,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4114381222078388,"acs":1104792,"articleLive":2,"columnArticles":7841,"formTitle":"[2]两数相加","frequency":4.6380357527,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2685196,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38300015973352364,"acs":1388294,"articleLive":2,"columnArticles":8301,"formTitle":"[3]无重复字符的最长子串","frequency":4.5536933684,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3624787,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.41047052442188486,"acs":572858,"articleLive":2,"columnArticles":4276,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5883709069,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1395613,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3590068360984108,"acs":821408,"articleLive":2,"columnArticles":4463,"formTitle":"[5]最长回文子串","frequency":4.5051885636,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2288001,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5094397285080257,"acs":335058,"articleLive":2,"columnArticles":2727,"formTitle":"[6]Z 字形变换","frequency":3.8001722835,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":657699,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35073783407647097,"acs":914833,"articleLive":2,"columnArticles":5702,"formTitle":"[7]整数反转","frequency":4.6033582143,"frontendQuestionId":"7","leaf":true,"level":2,"nodeType":"def","questionId":"7","status":"ac","submitted":2608310,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21734388561509296,"acs":380630,"articleLive":2,"columnArticles":2919,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.653028649,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1751280,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5810584311740961,"acs":846232,"articleLive":2,"columnArticles":5361,"formTitle":"[9]回文数","frequency":3.8245251247,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1456363,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3158040764359916,"acs":224231,"articleLive":2,"columnArticles":1352,"formTitle":"[10]正则表达式匹配","frequency":4.3057208502,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":710032,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6225502600281185,"acs":592915,"articleLive":2,"columnArticles":3365,"formTitle":"[11]盛最多水的容器","frequency":4.2650939967,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":952397,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6641883883878528,"acs":248261,"articleLive":2,"columnArticles":1941,"formTitle":"[12]整数转罗马数字","frequency":3.4612212901,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":373781,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6300090336897713,"acs":513286,"articleLive":2,"columnArticles":4202,"formTitle":"[13]罗马数字转整数","frequency":4.1282275872,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":814728,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41429232900729396,"acs":687161,"articleLive":2,"columnArticles":4298,"formTitle":"[14]最长公共前缀","frequency":4.4695036968,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1658638,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.341077927813625,"acs":740619,"articleLive":2,"columnArticles":3476,"formTitle":"[15]三数之和","frequency":4.4348261583,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2171407,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4582629682008128,"acs":287099,"articleLive":2,"columnArticles":1575,"formTitle":"[16]最接近的三数之和","frequency":4.1562430761,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":626494,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5749218027659198,"acs":379925,"articleLive":2,"columnArticles":3425,"formTitle":"[17]电话号码的字母组合","frequency":3.647709739,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":660829,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.39480099566321947,"acs":246160,"articleLive":2,"columnArticles":1697,"formTitle":"[18]四数之和","frequency":3.4916557754,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":623504,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.432573837089435,"acs":595867,"articleLive":2,"columnArticles":4438,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.5477667172,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1377492,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4454350398391503,"acs":871099,"articleLive":2,"columnArticles":6161,"formTitle":"[20]有效的括号","frequency":4.3648180573,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1955614,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6669832117462062,"acs":802092,"articleLive":2,"columnArticles":3891,"formTitle":"[21]合并两个有序链表","frequency":4.1911793085,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1202567,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7729380618851277,"acs":393856,"articleLive":2,"columnArticles":2946,"formTitle":"[22]括号生成","frequency":4.4092263986,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":509557,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5621401277826766,"acs":363373,"articleLive":2,"columnArticles":2345,"formTitle":"[23]合并K个升序链表","frequency":3.8633066011,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":646410,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7044336551459355,"acs":352276,"articleLive":2,"columnArticles":2790,"formTitle":"[24]两两交换链表中的节点","frequency":3.0585055174,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":500084,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6583623388392306,"acs":255729,"articleLive":2,"columnArticles":2418,"formTitle":"[25]K 个一组翻转链表","frequency":4.2820230588,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":388432,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5365644884310274,"acs":906420,"articleLive":2,"columnArticles":5004,"formTitle":"[26]删除有序数组中的重复项","frequency":3.6737029378,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1689303,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5959761373028294,"acs":542262,"articleLive":2,"columnArticles":4540,"formTitle":"[27]移除元素","frequency":3.5539113741,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":909872,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40312309788569856,"acs":521888,"articleLive":2,"columnArticles":3551,"formTitle":"[28]实现 strStr()","frequency":3.4212393358,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1294612,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.22037957480778916,"acs":139134,"articleLive":2,"columnArticles":1103,"formTitle":"[29]两数相除","frequency":3.3570961051,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":631338,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3618477754363972,"acs":87747,"articleLive":2,"columnArticles":676,"formTitle":"[30]串联所有单词的子串","frequency":2.7637383951,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":242497,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3726070552375288,"acs":240573,"articleLive":2,"columnArticles":1941,"formTitle":"[31]下一个排列","frequency":3.7783659245,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":645648,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35752104366401344,"acs":210882,"articleLive":2,"columnArticles":1431,"formTitle":"[32]最长有效括号","frequency":3.5094815594,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":589845,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4301394359679827,"acs":411797,"articleLive":2,"columnArticles":2724,"formTitle":"[33]搜索旋转排序数组","frequency":3.5577668005,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":957357,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4227498837874084,"acs":395603,"articleLive":2,"columnArticles":3740,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.5015981918,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":935785,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.45932510511074537,"acs":596712,"articleLive":2,"columnArticles":4450,"formTitle":"[35]搜索插入位置","frequency":3.4528056801,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1299106,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6378234492313193,"acs":228351,"articleLive":2,"columnArticles":1624,"formTitle":"[36]有效的数独","frequency":3.3917616212,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":358016,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6704553599159041,"acs":112253,"articleLive":2,"columnArticles":954,"formTitle":"[37]解数独","frequency":2.8660615813,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":167428,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5970684154137773,"acs":253566,"articleLive":2,"columnArticles":2677,"formTitle":"[38]外观数列","frequency":2.4697929101,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":424685,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7275153184746368,"acs":379229,"articleLive":2,"columnArticles":2212,"formTitle":"[39]组合总和","frequency":3.7538717049,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":521266,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6158661816742137,"acs":224001,"articleLive":2,"columnArticles":1529,"formTitle":"[40]组合总和 II","frequency":3.1641924389,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":363717,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4201095292291293,"acs":180503,"articleLive":2,"columnArticles":1534,"formTitle":"[41]缺失的第一个正数","frequency":4.1588297304,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":429657,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5902202345388113,"acs":368468,"articleLive":2,"columnArticles":2705,"formTitle":"[42]接雨水","frequency":4.4705110252,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":624289,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44938190559398367,"acs":186196,"articleLive":2,"columnArticles":1255,"formTitle":"[43]字符串相乘","frequency":3.9044773842,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":414338,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3284674180781328,"acs":90545,"articleLive":2,"columnArticles":593,"formTitle":"[44]通配符匹配","frequency":2.7637383951,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":275659,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4353298278984517,"acs":238936,"articleLive":2,"columnArticles":1879,"formTitle":"[45]跳跃游戏 II","frequency":3.7075790787,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":548862,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7843233440361518,"acs":474867,"articleLive":2,"columnArticles":3054,"formTitle":"[46]全排列","frequency":3.9390915201,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":605448,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6411731668279512,"acs":243163,"articleLive":2,"columnArticles":1660,"formTitle":"[47]全排列 II","frequency":3.345545298,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":379247,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7362079059081027,"acs":250254,"articleLive":2,"columnArticles":2089,"formTitle":"[48]旋转图像","frequency":3.322846182,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":339923,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.667072843305314,"acs":258392,"articleLive":2,"columnArticles":1466,"formTitle":"[49]字母异位词分组","frequency":2.6762190171,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":387352,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3772080110549056,"acs":241306,"articleLive":2,"columnArticles":1436,"formTitle":"[50]Pow(x, n)","frequency":3.5520524993,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":639716,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.738066387842938,"acs":169942,"articleLive":2,"columnArticles":1689,"formTitle":"[51]N 皇后","frequency":3.6769075295,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":230253,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8221530313531182,"acs":79480,"articleLive":2,"columnArticles":648,"formTitle":"[52]N皇后 II","frequency":0.4626968388,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":96673,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5528136484449367,"acs":788074,"articleLive":2,"columnArticles":4202,"formTitle":"[53]最大子数组和","frequency":3.9448624401,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1425569,"title":"最大子数组和","titleSlug":"maximum-subarray"},{"acceptance":0.48281394173478803,"acs":208256,"articleLive":2,"columnArticles":2211,"formTitle":"[54]螺旋矩阵","frequency":3.7583251736,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":431338,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43392670764235186,"acs":374175,"articleLive":2,"columnArticles":2849,"formTitle":"[55]跳跃游戏","frequency":3.2933802907,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":862300,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4739320476476421,"acs":339378,"articleLive":2,"columnArticles":2607,"formTitle":"[56]合并区间","frequency":4.2795102842,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":716090,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4128376054810465,"acs":93639,"articleLive":2,"columnArticles":992,"formTitle":"[57]插入区间","frequency":1.8995387239,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":226818,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3849210007843894,"acs":271372,"articleLive":2,"columnArticles":2902,"formTitle":"[58]最后一个单词的长度","frequency":2.7523496151,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":705007,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7823063675847802,"acs":144456,"articleLive":2,"columnArticles":1766,"formTitle":"[59]螺旋矩阵 II","frequency":3.5482144891,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":184654,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5263442670921649,"acs":95332,"articleLive":2,"columnArticles":1023,"formTitle":"[60]排列序列","frequency":2.0926915615,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":181121,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41758457020958173,"acs":213174,"articleLive":2,"columnArticles":2182,"formTitle":"[61]旋转链表","frequency":2.4697929101,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":510493,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6651795800671678,"acs":347406,"articleLive":2,"columnArticles":2653,"formTitle":"[62]不同路径","frequency":3.2502924607,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":522274,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39520300404481007,"acs":201861,"articleLive":2,"columnArticles":1901,"formTitle":"[63]不同路径 II","frequency":2.5960693289,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":510778,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6893967375296302,"acs":294906,"articleLive":2,"columnArticles":2271,"formTitle":"[64]最小路径和","frequency":3.6227897004,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":427774,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2710616400293418,"acs":48777,"articleLive":2,"columnArticles":682,"formTitle":"[65]有效数字","frequency":1.9340106329,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":179948,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.462933613107728,"acs":414770,"articleLive":2,"columnArticles":3780,"formTitle":"[66]加一","frequency":2.8236214295,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":895960,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5409218974310419,"acs":211382,"articleLive":2,"columnArticles":1929,"formTitle":"[67]二进制求和","frequency":3.0188872931,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":390781,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5227467133400887,"acs":39723,"articleLive":2,"columnArticles":608,"formTitle":"[68]文本左右对齐","frequency":3.3905860494,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":75989,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39064837302097966,"acs":428026,"articleLive":2,"columnArticles":2165,"formTitle":"[69]Sqrt(x)","frequency":3.5777674672,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1095681,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5325767872598804,"acs":647313,"articleLive":2,"columnArticles":3939,"formTitle":"[70]爬楼梯","frequency":4.2957869431,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1215436,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4221458749631304,"acs":101616,"articleLive":2,"columnArticles":918,"formTitle":"[71]简化路径","frequency":3.2513925951,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":240713,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6151236718068448,"acs":196019,"articleLive":2,"columnArticles":1370,"formTitle":"[72]编辑距离","frequency":4.0352497648,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":318666,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6087830933391958,"acs":149536,"articleLive":2,"columnArticles":1112,"formTitle":"[73]矩阵置零","frequency":2.7160649256,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":245631,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.46546916030722574,"acs":188778,"articleLive":2,"columnArticles":1899,"formTitle":"[74]搜索二维矩阵","frequency":2.5707890111,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":405565,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5994081734858542,"acs":301615,"articleLive":2,"columnArticles":2088,"formTitle":"[75]颜色分类","frequency":2.8160625289,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":503188,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.43025204621219665,"acs":211792,"articleLive":2,"columnArticles":1460,"formTitle":"[76]最小覆盖子串","frequency":3.2933802907,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":492251,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7691198303287381,"acs":253848,"articleLive":2,"columnArticles":1506,"formTitle":"[77]组合","frequency":3.127987796,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":330050,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8021953099145342,"acs":346631,"articleLive":2,"columnArticles":2277,"formTitle":"[78]子集","frequency":3.3292778996,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":432103,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45955443991214306,"acs":248982,"articleLive":2,"columnArticles":1572,"formTitle":"[79]单词搜索","frequency":2.7855510965,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":541790,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6178527724889652,"acs":158035,"articleLive":2,"columnArticles":1407,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.7309772211,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":255781,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41436971929064403,"acs":133887,"articleLive":2,"columnArticles":1062,"formTitle":"[81]搜索旋转排序数组 II","frequency":2.1911730311,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":323110,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5315372150917911,"acs":203052,"articleLive":2,"columnArticles":1849,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.2452478049,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":382009,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.53751207174063,"acs":350646,"articleLive":2,"columnArticles":2188,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.7366299343,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":652350,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43447411176982265,"acs":200293,"articleLive":2,"columnArticles":1277,"formTitle":"[84]柱状图中最大的矩形","frequency":3.6692667888,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":461001,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5178379899926716,"acs":106700,"articleLive":2,"columnArticles":753,"formTitle":"[85]最大矩形","frequency":2.4361649936,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":206049,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325585720508415,"acs":129245,"articleLive":2,"columnArticles":1207,"formTitle":"[86]分隔链表","frequency":2.3045445898,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":204321,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48458228157768907,"acs":43578,"articleLive":2,"columnArticles":327,"formTitle":"[87]扰乱字符串","frequency":0.4900060181,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":89929,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5192976331912548,"acs":523640,"articleLive":2,"columnArticles":3648,"formTitle":"[88]合并两个有序数组","frequency":4.3301405188,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":1008362,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7127635885902603,"acs":64019,"articleLive":2,"columnArticles":531,"formTitle":"[89]格雷编码","frequency":2.4294598592,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":89818,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338910923814246,"acs":153427,"articleLive":2,"columnArticles":1339,"formTitle":"[90]子集 II","frequency":2.4143966112,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":242040,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.31343055352940247,"acs":178326,"articleLive":2,"columnArticles":1636,"formTitle":"[91]解码方法","frequency":3.1641924389,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":568949,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5497205995902283,"acs":234231,"articleLive":2,"columnArticles":2195,"formTitle":"[92]反转链表 II","frequency":3.6944497873,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":426091,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5470085470085471,"acs":171904,"articleLive":2,"columnArticles":1490,"formTitle":"[93]复原 IP 地址","frequency":3.9999209131,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":314262,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557382921286478,"acs":637169,"articleLive":2,"columnArticles":2601,"formTitle":"[94]二叉树的中序遍历","frequency":2.9892918005,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":843108,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.707250960018071,"acs":109585,"articleLive":2,"columnArticles":679,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.9475072798,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":154945,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.699549576921324,"acs":184197,"articleLive":2,"columnArticles":1456,"formTitle":"[96]不同的二叉搜索树","frequency":3.3821052234,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":263308,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4544553991553048,"acs":67897,"articleLive":2,"columnArticles":586,"formTitle":"[97]交错字符串","frequency":1.9166098111,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":149403,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3524747918309082,"acs":392106,"articleLive":2,"columnArticles":2174,"formTitle":"[98]验证二叉搜索树","frequency":3.4290895426,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1112437,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6084730122231635,"acs":80445,"articleLive":2,"columnArticles":659,"formTitle":"[99]恢复二叉搜索树","frequency":2.2512895408,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":132208,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.5995278932778932,"acs":276838,"articleLive":2,"columnArticles":2047,"formTitle":"[100]相同的树","frequency":2.589261719,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":461760,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5669790267817907,"acs":461894,"articleLive":2,"columnArticles":2527,"formTitle":"[101]对称二叉树","frequency":3.2696036119,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":814658,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421257354433678,"acs":446052,"articleLive":2,"columnArticles":2800,"formTitle":"[102]二叉树的层序遍历","frequency":4.2888513543,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":694649,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717124142326647,"acs":191060,"articleLive":2,"columnArticles":1714,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.6549861586,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":334189,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7671170290020124,"acs":572547,"articleLive":2,"columnArticles":2824,"formTitle":"[104]二叉树的最大深度","frequency":3.5777674672,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":746362,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7061509617317022,"acs":277583,"articleLive":2,"columnArticles":1592,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.4063671541,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":393093,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7217114277552641,"acs":149063,"articleLive":2,"columnArticles":995,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.3974241504,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":206541,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.7013631421960806,"acs":176120,"articleLive":2,"columnArticles":1424,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.6913478987,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":251111,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7618103280426333,"acs":211282,"articleLive":2,"columnArticles":1305,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.7719204077,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":277342,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7621718627981018,"acs":101503,"articleLive":2,"columnArticles":791,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.6762190171,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":133176,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5647445317891028,"acs":283988,"articleLive":2,"columnArticles":1613,"formTitle":"[110]平衡二叉树","frequency":2.8160625289,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":502861,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4908566333025324,"acs":303854,"articleLive":2,"columnArticles":2001,"formTitle":"[111]二叉树的最小深度","frequency":2.3620884053,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":619028,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5270652735318341,"acs":302059,"articleLive":2,"columnArticles":1895,"formTitle":"[112]路径总和","frequency":3.1182543256,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":573096,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6278829095209935,"acs":199609,"articleLive":2,"columnArticles":1404,"formTitle":"[113]路径总和 II","frequency":2.5658128862,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":317908,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7268795146860754,"acs":199141,"articleLive":2,"columnArticles":1503,"formTitle":"[114]二叉树展开为链表","frequency":2.1439007835,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":273967,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.520872850761794,"acs":68101,"articleLive":2,"columnArticles":736,"formTitle":"[115]不同的子序列","frequency":2.9539431367,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":130744,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7072288142724901,"acs":184888,"articleLive":2,"columnArticles":1407,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.6133051917,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":261426,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6212217559031752,"acs":102578,"articleLive":2,"columnArticles":867,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.3020460165,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":165123,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7367001597641892,"acs":243931,"articleLive":2,"columnArticles":1966,"formTitle":"[118]杨辉三角","frequency":3.3089230344,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":331113,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6735936821649335,"acs":162912,"articleLive":2,"columnArticles":1356,"formTitle":"[119]杨辉三角 II","frequency":2.2207434884,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":241855,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.68302636393734,"acs":195991,"articleLive":2,"columnArticles":1723,"formTitle":"[120]三角形最小路径和","frequency":2.19441232,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":286945,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5736885212147279,"acs":626901,"articleLive":2,"columnArticles":3781,"formTitle":"[121]买卖股票的最佳时机","frequency":4.2173601849,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1092755,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6921968490045909,"acs":513997,"articleLive":2,"columnArticles":2901,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.9135135239,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":742559,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5412822467189212,"acs":142741,"articleLive":2,"columnArticles":889,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.1020398576,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":263709,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44640341343638046,"acs":177440,"articleLive":2,"columnArticles":1203,"formTitle":"[124]二叉树中的最大路径和","frequency":4.1163997285,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":397488,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47154324059904396,"acs":304127,"articleLive":2,"columnArticles":2003,"formTitle":"[125]验证回文串","frequency":2.9879986411,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":644961,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.398400399900025,"acs":39850,"articleLive":2,"columnArticles":355,"formTitle":"[126]单词接龙 II","frequency":1.6895656358,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":100025,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4713178350006793,"acs":131821,"articleLive":2,"columnArticles":706,"formTitle":"[127]单词接龙","frequency":1.5653366358,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":279686,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.544660703122591,"acs":194293,"articleLive":2,"columnArticles":1291,"formTitle":"[128]最长连续序列","frequency":4.0078386108,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":356723,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6858491007259669,"acs":131980,"articleLive":2,"columnArticles":1225,"formTitle":"[129]求根节点到叶节点数字之和","frequency":2.8312403979,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":192433,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4487578371013164,"acs":142937,"articleLive":2,"columnArticles":1295,"formTitle":"[130]被围绕的区域","frequency":2.2701118544,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":318517,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7232777070871055,"acs":148358,"articleLive":2,"columnArticles":986,"formTitle":"[131]分割回文串","frequency":2.8944725831,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":205119,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49282973327173474,"acs":52271,"articleLive":2,"columnArticles":464,"formTitle":"[132]分割回文串 II","frequency":2.1870248524,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":106063,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6780391514597753,"acs":78660,"articleLive":2,"columnArticles":558,"formTitle":"[133]克隆图","frequency":1.5368771169,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":116011,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5666036825272182,"acs":138538,"articleLive":2,"columnArticles":1051,"formTitle":"[134]加油站","frequency":3.3905860494,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":244506,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4868828009168621,"acs":110667,"articleLive":2,"columnArticles":890,"formTitle":"[135]分发糖果","frequency":4.2453889256,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":227297,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190794720728602,"acs":558998,"articleLive":2,"columnArticles":2540,"formTitle":"[136]只出现一次的数字","frequency":3.8829324742,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":777380,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.720072199752649,"acs":107712,"articleLive":2,"columnArticles":809,"formTitle":"[137]只出现一次的数字 II","frequency":2.1230732056,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":149585,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6629207424263667,"acs":122936,"articleLive":2,"columnArticles":930,"formTitle":"[138]复制带随机指针的链表","frequency":3.2827123849,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":185446,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5196588970470418,"acs":220537,"articleLive":2,"columnArticles":1380,"formTitle":"[139]单词拆分","frequency":3.5520524993,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":424388,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.5022505463124994,"acs":57689,"articleLive":2,"columnArticles":604,"formTitle":"[140]单词拆分 II","frequency":0.9711860341,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":114861,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5131181914041668,"acs":590754,"articleLive":2,"columnArticles":3047,"formTitle":"[141]环形链表","frequency":3.3459787032,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1151302,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5544820644580268,"acs":334936,"articleLive":2,"columnArticles":1943,"formTitle":"[142]环形链表 II","frequency":3.2220459846,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":604052,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.625654103756519,"acs":141802,"articleLive":2,"columnArticles":1193,"formTitle":"[143]重排链表","frequency":4.0698921394,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":226646,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7048664977941533,"acs":465257,"articleLive":2,"columnArticles":2064,"formTitle":"[144]二叉树的前序遍历","frequency":1.9698516251,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":660064,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7521731825296464,"acs":340232,"articleLive":2,"columnArticles":1747,"formTitle":"[145]二叉树的后序遍历","frequency":3.3006636441,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":452332,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5244203681035674,"acs":261766,"articleLive":2,"columnArticles":1539,"formTitle":"[146]LRU 缓存机制","frequency":4.2071177286,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":499153,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6836363403415715,"acs":106717,"articleLive":2,"columnArticles":826,"formTitle":"[147]对链表进行插入排序","frequency":2.3045445898,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":156102,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6663332458944564,"acs":231157,"articleLive":2,"columnArticles":1375,"formTitle":"[148]排序链表","frequency":3.3292778996,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":346909,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.35004090949719135,"acs":50911,"articleLive":2,"columnArticles":547,"formTitle":"[149]直线上最多的点数","frequency":2.6133051917,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":145443,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5347892796068652,"acs":146044,"articleLive":2,"columnArticles":1154,"formTitle":"[150]逆波兰表达式求值","frequency":2.4697929101,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":273087,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48989216242711936,"acs":189892,"articleLive":2,"columnArticles":1574,"formTitle":"[151]翻转字符串里的单词","frequency":2.5286523063,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":387620,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4226092678463104,"acs":205517,"articleLive":2,"columnArticles":1368,"formTitle":"[152]乘积最大子数组","frequency":3.6586686483,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":486305,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5680515444270153,"acs":232491,"articleLive":2,"columnArticles":1635,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":1.3835847173,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":409278,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5310938732579542,"acs":121185,"articleLive":2,"columnArticles":959,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":1.7446608131,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":228180,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5753077473461538,"acs":314389,"articleLive":2,"columnArticles":1736,"formTitle":"[155]最小栈","frequency":3.3105451474,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":546471,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7216464606961283,"acs":7381,"articleLive":2,"columnArticles":136,"formTitle":"[156]上下翻转二叉树","frequency":0.4113903831,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":10228,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5363556338028169,"acs":6093,"articleLive":2,"columnArticles":89,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":11360,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5960806697108066,"acs":3133,"articleLive":2,"columnArticles":73,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.5185304849,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":5256,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5496957403651116,"acs":17886,"articleLive":2,"columnArticles":214,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.6252347774,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":32538,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6182226621992081,"acs":373451,"articleLive":2,"columnArticles":2174,"formTitle":"[160]相交链表","frequency":2.7576475004,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":604072,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33740811436461843,"acs":8308,"articleLive":2,"columnArticles":115,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.4900060181,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":24623,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4962992815353187,"acs":178566,"articleLive":2,"columnArticles":1200,"formTitle":"[162]寻找峰值","frequency":3.3013713832,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":359795,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3323442136498516,"acs":10304,"articleLive":2,"columnArticles":157,"formTitle":"[163]缺失的区间","frequency":1.3914088712,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":31004,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6091969654288129,"acs":62715,"articleLive":2,"columnArticles":529,"formTitle":"[164]最大间距","frequency":2.6244386845,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":102947,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5210270355659866,"acs":92351,"articleLive":2,"columnArticles":961,"formTitle":"[165]比较版本号","frequency":3.8908439079,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":177248,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33134865584342543,"acs":44187,"articleLive":2,"columnArticles":398,"formTitle":"[166]分数到小数","frequency":2.8944725831,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":133355,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.587196015338563,"acs":335047,"articleLive":2,"columnArticles":2207,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.2058058506,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":570588,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4338805649150477,"acs":90783,"articleLive":2,"columnArticles":803,"formTitle":"[168]Excel表列名称","frequency":2.7947885255,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":209235,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6652864065703293,"acs":426410,"articleLive":2,"columnArticles":2384,"formTitle":"[169]多数元素","frequency":3.2095536297,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":640942,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.42240145700533366,"acs":9741,"articleLive":2,"columnArticles":100,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":1.0918686795,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":23061,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174353234143703,"acs":114088,"articleLive":2,"columnArticles":976,"formTitle":"[171]Excel 表列序号","frequency":2.6133051917,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":159022,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4452338224914309,"acs":96512,"articleLive":2,"columnArticles":631,"formTitle":"[172]阶乘后的零","frequency":2.6133051917,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":216767,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.805706835163733,"acs":80333,"articleLive":2,"columnArticles":673,"formTitle":"[173]二叉搜索树迭代器","frequency":1.594767836,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":99705,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4804467954470316,"acs":40690,"articleLive":2,"columnArticles":427,"formTitle":"[174]地下城游戏","frequency":3.1772406408,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":84692,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7365644119703444,"acs":329740,"articleLive":2,"columnArticles":1561,"formTitle":"[175]组合两个表","frequency":4.3798190204,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":447673,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3544469729542666,"acs":270392,"articleLive":2,"columnArticles":1091,"formTitle":"[176]第二高的薪水","frequency":4.1041772938,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":762856,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4631078227627686,"acs":138830,"articleLive":2,"columnArticles":546,"formTitle":"[177]第N高的薪水","frequency":3.6944497873,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":299779,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6035929201893654,"acs":129793,"articleLive":2,"columnArticles":705,"formTitle":"[178]分数排名","frequency":2.6913478987,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":215034,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40958316659787186,"acs":129989,"articleLive":2,"columnArticles":1033,"formTitle":"[179]最大数","frequency":3.3211856037,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":317369,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4850921358652593,"acs":94901,"articleLive":2,"columnArticles":549,"formTitle":"[180]连续出现的数字","frequency":3.5777674672,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":195635,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.696893654826291,"acs":178848,"articleLive":2,"columnArticles":724,"formTitle":"[181]超过经理收入的员工","frequency":3.3032990389,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":256636,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7943558520944637,"acs":195966,"articleLive":2,"columnArticles":641,"formTitle":"[182]查找重复的电子邮箱","frequency":3.1772406408,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":246698,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.67392389810715,"acs":163314,"articleLive":2,"columnArticles":592,"formTitle":"[183]从不订购的客户","frequency":2.7637383951,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":242333,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4818201460611037,"acs":111498,"articleLive":2,"columnArticles":725,"formTitle":"[184]部门工资最高的员工","frequency":3.0100745928,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":231410,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.5011460369199202,"acs":77181,"articleLive":2,"columnArticles":680,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6102378523,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":154009,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7569362321477304,"acs":8321,"articleLive":2,"columnArticles":128,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.9996374553,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":10993,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5227230306814012,"acs":81216,"articleLive":2,"columnArticles":591,"formTitle":"[187]重复的DNA序列","frequency":3.3650295064,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":155371,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3977875693664698,"acs":98133,"articleLive":2,"columnArticles":764,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9851143011,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":246697,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4466331401199123,"acs":394591,"articleLive":2,"columnArticles":1983,"formTitle":"[189]轮转数组","frequency":3.6678779189,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":883479,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.701797852741249,"acs":143611,"articleLive":2,"columnArticles":901,"formTitle":"[190]颠倒二进制位","frequency":1.8883353802,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":204633,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7506121529619484,"acs":206612,"articleLive":2,"columnArticles":1305,"formTitle":"[191]位1的个数","frequency":1.3307781213,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":275258,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35731631382316315,"acs":22954,"articleLive":2,"columnArticles":181,"formTitle":"[192]统计词频","frequency":2.1544941029,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":64240,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.326634893536302,"acs":27551,"articleLive":2,"columnArticles":148,"formTitle":"[193]有效电话号码","frequency":1.6568080393,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":84348,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3462510264670583,"acs":10963,"articleLive":2,"columnArticles":75,"formTitle":"[194]转置文件","frequency":1.0291817016,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":31662,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43792536691513495,"acs":37835,"articleLive":2,"columnArticles":152,"formTitle":"[195]第十行","frequency":1.9759656084,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":86396,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6648649957328846,"acs":109847,"articleLive":2,"columnArticles":430,"formTitle":"[196]删除重复的电子邮箱","frequency":2.8623361416,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":165217,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334733471267714,"acs":102620,"articleLive":2,"columnArticles":559,"formTitle":"[197]上升的温度","frequency":2.9577848625,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":192362,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5205273150841707,"acs":434810,"articleLive":2,"columnArticles":2975,"formTitle":"[198]打家劫舍","frequency":3.6900347691,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":835326,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526289764298665,"acs":158380,"articleLive":2,"columnArticles":1748,"formTitle":"[199]二叉树的右视图","frequency":3.1136868563,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":242680,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5635772842995139,"acs":370126,"articleLive":2,"columnArticles":2329,"formTitle":"[200]岛屿数量","frequency":4.0886090323,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":656744,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.528116074262139,"acs":53251,"articleLive":2,"columnArticles":347,"formTitle":"[201]数字范围按位与","frequency":1.3914088712,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":100832,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6212569297879953,"acs":189274,"articleLive":2,"columnArticles":1531,"formTitle":"[202]快乐数","frequency":2.9851143011,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":304663,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5222846577089839,"acs":267779,"articleLive":2,"columnArticles":1864,"formTitle":"[203]移除链表元素","frequency":1.6895656358,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":512707,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37732953021976284,"acs":178721,"articleLive":2,"columnArticles":769,"formTitle":"[204]计数质数","frequency":2.7947885255,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":473647,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.49927341007429177,"acs":122312,"articleLive":2,"columnArticles":942,"formTitle":"[205]同构字符串","frequency":2.4987636499,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":244980,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7243979413215212,"acs":801994,"articleLive":2,"columnArticles":7771,"formTitle":"[206]反转链表","frequency":3.9728800089,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1107118,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.540650103126357,"acs":159375,"articleLive":2,"columnArticles":1034,"formTitle":"[207]课程表","frequency":3.2118222333,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":294784,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7181115306104016,"acs":159010,"articleLive":2,"columnArticles":1073,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.8660615813,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":221428,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4769251021789825,"acs":228243,"articleLive":2,"columnArticles":1598,"formTitle":"[209]长度最小的子数组","frequency":3.0412772906,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":478572,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5463885463612654,"acs":100141,"articleLive":2,"columnArticles":753,"formTitle":"[210]课程表 II","frequency":2.2450992954,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":183278,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.5111667461452869,"acs":51452,"articleLive":2,"columnArticles":561,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.4234560486,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":100656,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4643460888274166,"acs":66473,"articleLive":2,"columnArticles":599,"formTitle":"[212]单词搜索 II","frequency":1.6895656358,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":143154,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43427940633097023,"acs":189229,"articleLive":2,"columnArticles":1711,"formTitle":"[213]打家劫舍 II","frequency":2.9936815509,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":435731,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37433519705441154,"acs":32940,"articleLive":2,"columnArticles":334,"formTitle":"[214]最短回文串","frequency":2.5658128862,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":87996,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463391603727862,"acs":489419,"articleLive":2,"columnArticles":2531,"formTitle":"[215]数组中的第K个最大元素","frequency":4.0966593092,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":757217,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7358454949032065,"acs":113045,"articleLive":2,"columnArticles":1145,"formTitle":"[216]组合总和 III","frequency":3.1617268329,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":153626,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5555945719981993,"acs":431947,"articleLive":2,"columnArticles":2020,"formTitle":"[217]存在重复元素","frequency":4.4268229143,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":777450,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417853521942742,"acs":33666,"articleLive":2,"columnArticles":299,"formTitle":"[218]天际线问题","frequency":3.744738008,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":62139,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4221847204158981,"acs":121083,"articleLive":2,"columnArticles":1000,"formTitle":"[219]存在重复元素 II","frequency":2.3966341549,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":286801,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28692505116247863,"acs":68419,"articleLive":2,"columnArticles":451,"formTitle":"[220]存在重复元素 III","frequency":1.8663395523,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":238456,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4787435034968067,"acs":154570,"articleLive":2,"columnArticles":1102,"formTitle":"[221]最大正方形","frequency":3.5117586866,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":322866,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7847625696671361,"acs":132639,"articleLive":2,"columnArticles":973,"formTitle":"[222]完全二叉树的节点个数","frequency":2.0632850908,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":169018,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5249798647890074,"acs":43020,"articleLive":2,"columnArticles":532,"formTitle":"[223]矩形面积","frequency":3.3485453903,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":81946,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4175908954121413,"acs":76321,"articleLive":2,"columnArticles":695,"formTitle":"[224]基本计算器","frequency":3.1068757688,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":182765,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6746228791151664,"acs":150534,"articleLive":2,"columnArticles":4837,"formTitle":"[225]用队列实现栈","frequency":1.9458004417,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":223138,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7881156334004419,"acs":345662,"articleLive":2,"columnArticles":2070,"formTitle":"[226]翻转二叉树","frequency":3.6144486381,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":438593,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43715447759804926,"acs":93941,"articleLive":2,"columnArticles":753,"formTitle":"[227]基本计算器 II","frequency":3.1267248506,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":214892,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5766406286542869,"acs":61640,"articleLive":2,"columnArticles":701,"formTitle":"[228]汇总区间","frequency":0.4626968388,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":106895,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5342734214853693,"acs":71154,"articleLive":2,"columnArticles":668,"formTitle":"[229]求众数 II","frequency":2.826879292,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":133179,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7521835856684066,"acs":173786,"articleLive":2,"columnArticles":1192,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.797440042,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":231042,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5046840397381361,"acs":187100,"articleLive":2,"columnArticles":1337,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":370727,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6897170064892677,"acs":179623,"articleLive":2,"columnArticles":1410,"formTitle":"[232]用栈实现队列","frequency":2.5239920313,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":260430,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47705375752094065,"acs":36393,"articleLive":2,"columnArticles":441,"formTitle":"[233]数字 1 的个数","frequency":3.1772406408,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":76287,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.5020305383627234,"acs":343911,"articleLive":2,"columnArticles":2165,"formTitle":"[234]回文链表","frequency":3.4077719249,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":685040,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6678592472628864,"acs":189284,"articleLive":2,"columnArticles":1094,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.8350727012,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":283419,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6833093725581846,"acs":289456,"articleLive":2,"columnArticles":1564,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.4645565165,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":423609,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8568347218471735,"acs":257017,"articleLive":2,"columnArticles":1350,"formTitle":"[237]删除链表中的节点","frequency":2.5914224804,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":299961,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7249569429749438,"acs":152797,"articleLive":2,"columnArticles":964,"formTitle":"[238]除自身以外数组的乘积","frequency":2.4987636499,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":210767,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4968794229101036,"acs":217663,"articleLive":2,"columnArticles":1488,"formTitle":"[239]滑动窗口最大值","frequency":3.4916557754,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":438060,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4975362879770401,"acs":219818,"articleLive":2,"columnArticles":1119,"formTitle":"[240]搜索二维矩阵 II","frequency":3.2174713275,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":441813,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7353602420524027,"acs":34998,"articleLive":2,"columnArticles":321,"formTitle":"[241]为运算表达式设计优先级","frequency":2.7435845489,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":47593,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6472965905166034,"acs":327969,"articleLive":2,"columnArticles":1904,"formTitle":"[242]有效的字母异位词","frequency":2.2701118544,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":506675,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6572390572390573,"acs":9760,"articleLive":2,"columnArticles":118,"formTitle":"[243]最短单词距离","frequency":0.4365173332,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14850,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5598395146296115,"acs":5721,"articleLive":2,"columnArticles":68,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":10219,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5939680957128615,"acs":4766,"articleLive":2,"columnArticles":67,"formTitle":"[245]最短单词距离 III","frequency":1.0598966468,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":8024,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47659511031604057,"acs":6394,"articleLive":2,"columnArticles":118,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":13416,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5266315886642666,"acs":5705,"articleLive":2,"columnArticles":100,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10833,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46786125267137924,"acs":2846,"articleLive":2,"columnArticles":55,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":6083,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.641175306687772,"acs":6481,"articleLive":2,"columnArticles":114,"formTitle":"[249]移位字符串分组","frequency":1.0598966468,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":10108,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6371450898671529,"acs":4892,"articleLive":2,"columnArticles":85,"formTitle":"[250]统计同值子树","frequency":0.4113903831,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7678,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.55,"acs":4147,"articleLive":2,"columnArticles":76,"formTitle":"[251]展开二维向量","frequency":0.9996374553,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7540,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5639320956681719,"acs":13487,"articleLive":2,"columnArticles":170,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":23916,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.505285500830878,"acs":36184,"articleLive":2,"columnArticles":387,"formTitle":"[253]会议室 II","frequency":2.9237486786,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":71611,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687469762941461,"acs":5878,"articleLive":2,"columnArticles":84,"formTitle":"[254]因子的组合","frequency":1.0598966468,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":10335,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4768728004022122,"acs":5691,"articleLive":2,"columnArticles":70,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":11934,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6459192290497243,"acs":13003,"articleLive":2,"columnArticles":206,"formTitle":"[256]粉刷房子","frequency":0.4626968388,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":20131,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6867841123317948,"acs":158472,"articleLive":2,"columnArticles":1164,"formTitle":"[257]二叉树的所有路径","frequency":2.7045094469,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":230745,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6917129442441146,"acs":83828,"articleLive":2,"columnArticles":708,"formTitle":"[258]各位相加","frequency":2.4361649936,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":121189,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5617680662667809,"acs":7867,"articleLive":2,"columnArticles":95,"formTitle":"[259]较小的三数之和","frequency":0.5185304849,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":14004,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7404211540956865,"acs":79887,"articleLive":2,"columnArticles":710,"formTitle":"[260]只出现一次的数字 III","frequency":3.1478354054,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":107894,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4979876160990712,"acs":9651,"articleLive":2,"columnArticles":133,"formTitle":"[261]以图判树","frequency":1.4234560486,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":19380,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43097845834414744,"acs":41514,"articleLive":2,"columnArticles":393,"formTitle":"[262]行程和用户","frequency":2.9277203263,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":96325,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.514276301339776,"acs":112392,"articleLive":2,"columnArticles":875,"formTitle":"[263]丑数","frequency":1.8034217671,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":218544,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5808273826577222,"acs":107449,"articleLive":2,"columnArticles":665,"formTitle":"[264]丑数 II","frequency":2.6613267091,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":184993,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.598981638636013,"acs":7764,"articleLive":2,"columnArticles":171,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":12962,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6792504822265086,"acs":7395,"articleLive":2,"columnArticles":113,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10887,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44704610951008644,"acs":3723,"articleLive":2,"columnArticles":81,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":8328,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6515111755482809,"acs":198621,"articleLive":2,"columnArticles":1537,"formTitle":"[268]丢失的数字","frequency":2.3966341549,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":304862,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3446106928428476,"acs":7232,"articleLive":2,"columnArticles":115,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":20986,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5635902636916835,"acs":11114,"articleLive":2,"columnArticles":147,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.4113903831,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":19720,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.555786686838124,"acs":2939,"articleLive":2,"columnArticles":50,"formTitle":"[271]字符串的编码与解码","frequency":0.5483656333,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5288,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.648368456832087,"acs":3815,"articleLive":2,"columnArticles":85,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4900060181,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5884,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3664922761060196,"acs":29632,"articleLive":2,"columnArticles":359,"formTitle":"[273]整数转换英文表示","frequency":2.5914224804,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":80853,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44017470654759583,"acs":56437,"articleLive":2,"columnArticles":594,"formTitle":"[274]H 指数","frequency":2.9301397019,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":128215,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4609626227679544,"acs":52895,"articleLive":2,"columnArticles":439,"formTitle":"[275]H 指数 II","frequency":2.107756625,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":114749,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49917725268215624,"acs":7584,"articleLive":2,"columnArticles":142,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":15193,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5728746323780863,"acs":8376,"articleLive":2,"columnArticles":96,"formTitle":"[277]搜寻名人","frequency":0.4365173332,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":14621,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45276022013044326,"acs":229290,"articleLive":2,"columnArticles":1293,"formTitle":"[278]第一个错误的版本","frequency":3.8310651565,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":506427,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6362580325544448,"acs":223471,"articleLive":2,"columnArticles":1306,"formTitle":"[279]完全平方数","frequency":3.1502520914,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":351227,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6835231078365707,"acs":6123,"articleLive":2,"columnArticles":76,"formTitle":"[280]摆动排序","frequency":1.0291817016,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8958,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7569246699456381,"acs":2924,"articleLive":2,"columnArticles":73,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3863,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48401989481449753,"acs":20339,"articleLive":2,"columnArticles":172,"formTitle":"[282]给表达式添加运算符","frequency":1.4567702553,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":42021,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6403708993558253,"acs":571207,"articleLive":2,"columnArticles":3730,"formTitle":"[283]移动零","frequency":3.9370414989,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":891994,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7703998337736353,"acs":25954,"articleLive":2,"columnArticles":218,"formTitle":"[284]窥探迭代器","frequency":1.8663395523,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33689,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.635357168041746,"acs":9010,"articleLive":2,"columnArticles":114,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":14181,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5174380967794141,"acs":12789,"articleLive":2,"columnArticles":166,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":24716,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.655208431607747,"acs":194458,"articleLive":2,"columnArticles":1320,"formTitle":"[287]寻找重复数","frequency":2.6039854597,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":296788,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4431341421929924,"acs":3908,"articleLive":2,"columnArticles":63,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8819,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7538270303865537,"acs":55793,"articleLive":2,"columnArticles":854,"formTitle":"[289]生命游戏","frequency":1.6252347774,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":74013,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45565360378302744,"acs":89227,"articleLive":2,"columnArticles":1181,"formTitle":"[290]单词规律","frequency":2.1911730311,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":195822,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5256434699714013,"acs":2757,"articleLive":2,"columnArticles":61,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5245,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7077479351049877,"acs":119792,"articleLive":2,"columnArticles":795,"formTitle":"[292]Nim 游戏","frequency":2.1544941029,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":169258,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7127360385697067,"acs":5322,"articleLive":2,"columnArticles":88,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7467,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5819035049127438,"acs":3968,"articleLive":2,"columnArticles":59,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6819,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5226393611967758,"acs":69314,"articleLive":2,"columnArticles":546,"formTitle":"[295]数据流的中位数","frequency":3.1267248506,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":132623,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6205387980658531,"acs":2695,"articleLive":2,"columnArticles":50,"formTitle":"[296]最佳的碰头地点","frequency":1.0918686795,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4343,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5637750329775753,"acs":117533,"articleLive":2,"columnArticles":824,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.9539431367,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":208475,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5819310054690787,"acs":5533,"articleLive":2,"columnArticles":87,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":9508,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5642874840719241,"acs":63769,"articleLive":2,"columnArticles":727,"formTitle":"[299]猜数字游戏","frequency":2.4987636499,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":113008,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5216637150177554,"acs":400897,"articleLive":2,"columnArticles":2207,"formTitle":"[300]最长递增子序列","frequency":3.5396893852,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":768497,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5477888872307616,"acs":55061,"articleLive":2,"columnArticles":394,"formTitle":"[301]删除无效的括号","frequency":2.8944725831,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":100515,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6586879432624113,"acs":2229,"articleLive":2,"columnArticles":42,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3384,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7312872975277067,"acs":137248,"articleLive":2,"columnArticles":843,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.6252347774,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":187680,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5579335440007661,"acs":69918,"articleLive":2,"columnArticles":619,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.5368771169,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":125316,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3954287540957404,"acs":4948,"articleLive":2,"columnArticles":74,"formTitle":"[305]岛屿数量 II","frequency":0.4626968388,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":12513,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3384332925336597,"acs":18249,"articleLive":2,"columnArticles":274,"formTitle":"[306]累加数","frequency":2.2207434884,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":53922,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5310075126067716,"acs":25799,"articleLive":2,"columnArticles":250,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.4900060181,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":48585,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6169839679358717,"acs":2463,"articleLive":2,"columnArticles":51,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3992,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6160870373814394,"acs":132508,"articleLive":2,"columnArticles":1046,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.3764017239,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":215080,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3823887439728085,"acs":24188,"articleLive":2,"columnArticles":229,"formTitle":"[310]最小高度树","frequency":1.6252347774,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":63255,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7629253619101335,"acs":4058,"articleLive":2,"columnArticles":49,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0918686795,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":5319,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6847014504522795,"acs":60707,"articleLive":2,"columnArticles":414,"formTitle":"[312]戳气球","frequency":2.7543837899,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":88662,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6165215020590894,"acs":42966,"articleLive":2,"columnArticles":372,"formTitle":"[313]超级丑数","frequency":2.5914224804,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":69691,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5514047231270358,"acs":5417,"articleLive":2,"columnArticles":98,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9824,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41731483013782833,"acs":52956,"articleLive":2,"columnArticles":495,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.4987636499,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":126897,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47683265991499185,"acs":72696,"articleLive":2,"columnArticles":587,"formTitle":"[316]去除重复字母","frequency":3.1267248506,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":152456,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48237241916634205,"acs":4953,"articleLive":2,"columnArticles":69,"formTitle":"[317]离建筑物最近的距离","frequency":0.4626968388,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":10268,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.7365999707901271,"acs":50435,"articleLive":2,"columnArticles":492,"formTitle":"[318]最大单词长度乘积","frequency":2.4361649936,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":68470,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5706411474275528,"acs":48658,"articleLive":2,"columnArticles":443,"formTitle":"[319]灯泡开关","frequency":2.826879292,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":85269,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6817702845100105,"acs":3235,"articleLive":2,"columnArticles":57,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4745,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4233467772620044,"acs":27816,"articleLive":2,"columnArticles":240,"formTitle":"[321]拼接最大数","frequency":1.4914477937,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":65705,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44789692216437094,"acs":339797,"articleLive":2,"columnArticles":1985,"formTitle":"[322]零钱兑换","frequency":3.4539235857,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":758650,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6319255105715315,"acs":12284,"articleLive":2,"columnArticles":166,"formTitle":"[323]无向图中连通分量的数目","frequency":1.7589897586,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":19439,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3798753339269813,"acs":27729,"articleLive":2,"columnArticles":181,"formTitle":"[324]摆动排序 II","frequency":1.9458004417,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":72995,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5348679756262694,"acs":10270,"articleLive":2,"columnArticles":125,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.0291817016,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":19201,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5047437800087298,"acs":144546,"articleLive":2,"columnArticles":614,"formTitle":"[326]3 的幂","frequency":2.4987636499,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":286375,"title":"3 的幂","titleSlug":"power-of-three"},{"acceptance":0.41816030855994557,"acs":25803,"articleLive":2,"columnArticles":215,"formTitle":"[327]区间和的个数","frequency":1.7235940976,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":61706,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6547938185907259,"acs":138005,"articleLive":2,"columnArticles":1145,"formTitle":"[328]奇偶链表","frequency":3.0036321018,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":210761,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.49029399466049084,"acs":60971,"articleLive":2,"columnArticles":534,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.5316938562,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":124356,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5322129619475819,"acs":19413,"articleLive":2,"columnArticles":154,"formTitle":"[330]按要求补齐数组","frequency":1.0918686795,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":36476,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47937013338231843,"acs":46973,"articleLive":2,"columnArticles":521,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.9996374553,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":97989,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4509840442043832,"acs":43584,"articleLive":2,"columnArticles":355,"formTitle":"[332]重新安排行程","frequency":1.0918686795,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":96642,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46964334331609037,"acs":5175,"articleLive":2,"columnArticles":89,"formTitle":"[333]最大 BST 子树","frequency":0.5185304849,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":11019,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41133415983215715,"acs":51759,"articleLive":2,"columnArticles":336,"formTitle":"[334]递增的三元子序列","frequency":2.2207434884,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":125832,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.43038073645532016,"acs":16515,"articleLive":2,"columnArticles":148,"formTitle":"[335]路径交叉","frequency":1.9698516251,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":38373,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4009865486539908,"acs":22924,"articleLive":2,"columnArticles":198,"formTitle":"[336]回文对","frequency":1.0918686795,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":57169,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6072106504141166,"acs":142669,"articleLive":2,"columnArticles":998,"formTitle":"[337]打家劫舍 III","frequency":3.2933802907,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":234958,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7866544632379261,"acs":173617,"articleLive":2,"columnArticles":1476,"formTitle":"[338]比特位计数","frequency":2.295816246,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":220703,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8189841145322613,"acs":4176,"articleLive":2,"columnArticles":65,"formTitle":"[339]嵌套列表权重和","frequency":0.5483656333,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":5099,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49695166740120467,"acs":13531,"articleLive":2,"columnArticles":200,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.4234560486,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":27228,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7260371671174626,"acs":53954,"articleLive":2,"columnArticles":506,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.8034217671,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":74313,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5179389720724419,"acs":92117,"articleLive":2,"columnArticles":805,"formTitle":"[342]4的幂","frequency":1.6568080393,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":177853,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6097615179096149,"acs":123470,"articleLive":2,"columnArticles":1150,"formTitle":"[343]整数拆分","frequency":3.2839373499,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":202489,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7744401976286788,"acs":416789,"articleLive":2,"columnArticles":2200,"formTitle":"[344]反转字符串","frequency":2.9798486368,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":538181,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5399822175138571,"acs":114176,"articleLive":2,"columnArticles":1083,"formTitle":"[345]反转字符串中的元音字母","frequency":2.7947885255,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":211444,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7089724732086573,"acs":13496,"articleLive":2,"columnArticles":147,"formTitle":"[346]数据流中的移动平均值","frequency":0.4626968388,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":19036,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6234054446400413,"acs":224166,"articleLive":2,"columnArticles":1669,"formTitle":"[347]前 K 个高频元素","frequency":3.3292778996,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":359583,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6019142919295193,"acs":5534,"articleLive":2,"columnArticles":86,"formTitle":"[348]设计井字棋","frequency":0.4900060181,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":9194,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7385515609095054,"acs":236530,"articleLive":2,"columnArticles":1656,"formTitle":"[349]两个数组的交集","frequency":3.4341312917,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":320262,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5524241658389218,"acs":281970,"articleLive":2,"columnArticles":1594,"formTitle":"[350]两个数组的交集 II","frequency":3.3022314725,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":510423,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5918692283197113,"acs":5576,"articleLive":2,"columnArticles":103,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9421,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6780148569622254,"acs":21449,"articleLive":2,"columnArticles":353,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.8343265753,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31635,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.43044302706429927,"acs":2497,"articleLive":2,"columnArticles":52,"formTitle":"[353]贪吃蛇","frequency":0.4626968388,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5801,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4583578539551763,"acs":74771,"articleLive":2,"columnArticles":581,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.6244386845,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":163128,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4091375553524988,"acs":29104,"articleLive":2,"columnArticles":486,"formTitle":"[355]设计推特","frequency":1.6895656358,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":71135,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35419659347424587,"acs":1726,"articleLive":2,"columnArticles":43,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4873,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5203739882779793,"acs":26103,"articleLive":2,"columnArticles":416,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.8663395523,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":50162,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35295434198746645,"acs":4731,"articleLive":2,"columnArticles":62,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.5796181768,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":13404,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7286527514231499,"acs":5376,"articleLive":2,"columnArticles":63,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":7378,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6032692307692308,"acs":3137,"articleLive":2,"columnArticles":64,"formTitle":"[360]有序转化数组","frequency":0.5185304849,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":5200,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.564729397293973,"acs":3673,"articleLive":2,"columnArticles":71,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6504,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6898173268222102,"acs":3814,"articleLive":2,"columnArticles":71,"formTitle":"[362]敲击计数器","frequency":0.4626968388,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5529,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.48787430099334417,"acs":33938,"articleLive":2,"columnArticles":223,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":69563,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7312633832976445,"acs":2049,"articleLive":2,"columnArticles":50,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2802,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3688317625910494,"acs":35496,"articleLive":2,"columnArticles":494,"formTitle":"[365]水壶问题","frequency":2.5914224804,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":96239,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7665177146504948,"acs":4803,"articleLive":2,"columnArticles":127,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.4626968388,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":6266,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.44766037804368747,"acs":123270,"articleLive":2,"columnArticles":982,"formTitle":"[367]有效的完全平方数","frequency":2.2207434884,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":275365,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.459359438066782,"acs":43816,"articleLive":2,"columnArticles":466,"formTitle":"[368]最大整除子集","frequency":2.2828752695,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":95385,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6186686876342049,"acs":4898,"articleLive":2,"columnArticles":139,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7917,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7399328859060402,"acs":3969,"articleLive":2,"columnArticles":60,"formTitle":"[370]区间加法","frequency":0.9996374553,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":5364,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6128655738661648,"acs":84011,"articleLive":2,"columnArticles":527,"formTitle":"[371]两整数之和","frequency":3.0173262562,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":137079,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.57472657121903,"acs":36048,"articleLive":2,"columnArticles":373,"formTitle":"[372]超级次方","frequency":1.0918686795,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":62722,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4069830094471784,"acs":22660,"articleLive":2,"columnArticles":240,"formTitle":"[373]查找和最小的K对数字","frequency":1.8663395523,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":55678,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5176477347812347,"acs":90094,"articleLive":2,"columnArticles":616,"formTitle":"[374]猜数字大小","frequency":0.9996374553,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":174045,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.6007793557325943,"acs":34689,"articleLive":2,"columnArticles":273,"formTitle":"[375]猜数字大小 II","frequency":2.6762190171,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"ac","submitted":57740,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4673356374850057,"acs":85321,"articleLive":2,"columnArticles":899,"formTitle":"[376]摆动序列","frequency":1.7735545369,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":182569,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5127406405571062,"acs":71273,"articleLive":2,"columnArticles":602,"formTitle":"[377]组合总和 Ⅳ","frequency":1.8995387239,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":139004,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6288017962849561,"acs":86254,"articleLive":2,"columnArticles":606,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.2828752695,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":137172,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.628665056916178,"acs":3645,"articleLive":2,"columnArticles":78,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5798,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5058927251747073,"acs":39019,"articleLive":2,"columnArticles":252,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":2.1911730311,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":77129,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.43902883525028347,"acs":21681,"articleLive":2,"columnArticles":181,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.5483656333,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":49384,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6376679654783147,"acs":17511,"articleLive":2,"columnArticles":139,"formTitle":"[382]链表随机节点","frequency":1.3307781213,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":27461,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6422305143699986,"acs":116692,"articleLive":2,"columnArticles":1258,"formTitle":"[383]赎金信","frequency":1.1828233549,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":181698,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.6069578618416359,"acs":85070,"articleLive":2,"columnArticles":403,"formTitle":"[384]打乱数组","frequency":2.6613267091,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":140158,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41956311201979984,"acs":7798,"articleLive":2,"columnArticles":94,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18586,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7495614170077868,"acs":24354,"articleLive":2,"columnArticles":258,"formTitle":"[386]字典序排数","frequency":2.4987636499,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":32491,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5387529976019184,"acs":247126,"articleLive":2,"columnArticles":1364,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.8944725831,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":458700,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5354789272030651,"acs":6988,"articleLive":2,"columnArticles":132,"formTitle":"[388]文件的最长绝对路径","frequency":1.0291817016,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":13050,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6898748737874004,"acs":107953,"articleLive":2,"columnArticles":1077,"formTitle":"[389]找不同","frequency":0.4365173332,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":156482,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46717156293898493,"acs":7649,"articleLive":2,"columnArticles":103,"formTitle":"[390]消除游戏","frequency":1.8034217671,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":16373,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.4674729665175663,"acs":21529,"articleLive":2,"columnArticles":196,"formTitle":"[391]完美矩形","frequency":2.1544941029,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":46054,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5164640741278835,"acs":159967,"articleLive":2,"columnArticles":1719,"formTitle":"[392]判断子序列","frequency":2.3774764808,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":309735,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39280260274882145,"acs":11832,"articleLive":2,"columnArticles":142,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":30122,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5543206168018424,"acs":132864,"articleLive":2,"columnArticles":1404,"formTitle":"[394]字符串解码","frequency":3.8424082908,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":239688,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5201556537836715,"acs":55072,"articleLive":2,"columnArticles":450,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.5914224804,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":105876,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.43723930337561817,"acs":10168,"articleLive":2,"columnArticles":170,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":23255,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.43181375241402525,"acs":48744,"articleLive":2,"columnArticles":563,"formTitle":"[397]整数替换","frequency":3.0173262562,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":112882,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6640173109733262,"acs":15957,"articleLive":2,"columnArticles":134,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":24031,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5910572404675576,"acs":45155,"articleLive":2,"columnArticles":557,"formTitle":"[399]除法求值","frequency":1.1962391719,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":76397,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4544409837826227,"acs":42313,"articleLive":2,"columnArticles":482,"formTitle":"[400]第 N 位数字","frequency":2.1120195695,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":93110,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6153567944938242,"acs":56147,"articleLive":2,"columnArticles":683,"formTitle":"[401]二进制手表","frequency":1.3914088712,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":91243,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32659202265682963,"acs":86719,"articleLive":2,"columnArticles":639,"formTitle":"[402]移掉 K 位数字","frequency":2.9237486786,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":265527,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4555560884370054,"acs":47494,"articleLive":2,"columnArticles":471,"formTitle":"[403]青蛙过河","frequency":2.0729826067,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":104255,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5894055621320289,"acs":113025,"articleLive":2,"columnArticles":1246,"formTitle":"[404]左叶子之和","frequency":3.1136868563,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":191761,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5596958528560301,"acs":48140,"articleLive":2,"columnArticles":484,"formTitle":"[405]数字转换为十六进制数","frequency":2.6244386845,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":86011,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7396385617320004,"acs":130436,"articleLive":2,"columnArticles":857,"formTitle":"[406]根据身高重建队列","frequency":2.6487447615,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":176351,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5798954895489549,"acs":25302,"articleLive":2,"columnArticles":252,"formTitle":"[407]接雨水 II","frequency":3.1601081333,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":43632,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3315534379364167,"acs":4036,"articleLive":2,"columnArticles":84,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":12173,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5558228522530959,"acs":103278,"articleLive":2,"columnArticles":1422,"formTitle":"[409]最长回文串","frequency":2.8066969722,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":185811,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5690312841180197,"acs":42217,"articleLive":2,"columnArticles":351,"formTitle":"[410]分割数组的最大值","frequency":3.0851623896,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":74191,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.4962292609351433,"acs":987,"articleLive":2,"columnArticles":26,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1989,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7098108629502198,"acs":107070,"articleLive":2,"columnArticles":615,"formTitle":"[412]Fizz Buzz","frequency":2.4669442299,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":150843,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6899289993151339,"acs":79584,"articleLive":2,"columnArticles":1040,"formTitle":"[413]等差数列划分","frequency":2.6322236522,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":115351,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39399884884106867,"acs":93780,"articleLive":2,"columnArticles":1207,"formTitle":"[414]第三大的数","frequency":2.7947885255,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":238021,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5409915668262132,"acs":163776,"articleLive":2,"columnArticles":1172,"formTitle":"[415]字符串相加","frequency":3.9287991279,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":302733,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5098165407529605,"acs":194079,"articleLive":2,"columnArticles":1118,"formTitle":"[416]分割等和子集","frequency":3.1772406408,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":380684,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4862181106339985,"acs":30799,"articleLive":2,"columnArticles":362,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.1870248524,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":63344,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.368205283935621,"acs":2425,"articleLive":2,"columnArticles":35,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6586,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.790126100404473,"acs":33209,"articleLive":2,"columnArticles":436,"formTitle":"[419]甲板上的战舰","frequency":0.0346775385,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":42030,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.21213648142816008,"acs":2947,"articleLive":2,"columnArticles":55,"formTitle":"[420]强密码检验器","frequency":2.0729826067,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13892,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6209972716829408,"acs":34597,"articleLive":2,"columnArticles":316,"formTitle":"[421]数组中两个数的最大异或值","frequency":1.3307781213,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":55712,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.43301997649823737,"acs":2211,"articleLive":2,"columnArticles":55,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":5106,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.6120187861533719,"acs":33751,"articleLive":2,"columnArticles":393,"formTitle":"[423]从英文中重建数字","frequency":1.8000531727,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":55147,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5327046353486741,"acs":54680,"articleLive":2,"columnArticles":475,"formTitle":"[424]替换后的最长重复字符","frequency":2.5914224804,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":102646,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6182495344506518,"acs":1660,"articleLive":2,"columnArticles":35,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2685,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6753037125138052,"acs":7949,"articleLive":2,"columnArticles":126,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.0291817016,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11771,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6176347680735479,"acs":4434,"articleLive":2,"columnArticles":74,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":7179,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6606334841628959,"acs":2920,"articleLive":2,"columnArticles":57,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4420,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7050123342417942,"acs":65447,"articleLive":2,"columnArticles":526,"formTitle":"[429]N 叉树的层序遍历","frequency":1.8034217671,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":92831,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5888208758769632,"acs":46077,"articleLive":2,"columnArticles":699,"formTitle":"[430]扁平化多级双向链表","frequency":2.1544941029,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":78253,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7271364317841079,"acs":970,"articleLive":2,"columnArticles":32,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1334,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3823196681570867,"acs":7097,"articleLive":2,"columnArticles":98,"formTitle":"[432]全 O(1) 的数据结构","frequency":2.1544941029,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":18563,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5330962630232703,"acs":17090,"articleLive":2,"columnArticles":241,"formTitle":"[433]最小基因变化","frequency":1.3914088712,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":32058,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.39826857981607405,"acs":66477,"articleLive":2,"columnArticles":909,"formTitle":"[434]字符串中的单词数","frequency":3.1601081333,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":166915,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5064893031685924,"acs":109543,"articleLive":2,"columnArticles":964,"formTitle":"[435]无重叠区间","frequency":2.7719204077,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":216279,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4898868529087814,"acs":9785,"articleLive":2,"columnArticles":164,"formTitle":"[436]寻找右区间","frequency":0.4626968388,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":19974,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742674200267753,"acs":134262,"articleLive":2,"columnArticles":1088,"formTitle":"[437]路径总和 III","frequency":2.8944725831,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":233797,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5365254707767868,"acs":132400,"articleLive":2,"columnArticles":1146,"formTitle":"[438]找到字符串中所有字母异位词","frequency":1.9015303597,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":246773,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5912195121951219,"acs":3030,"articleLive":2,"columnArticles":71,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":5125,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38229207088345624,"acs":17733,"articleLive":2,"columnArticles":134,"formTitle":"[440]字典序的第K小数字","frequency":3.158112284,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":46386,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45875149800928056,"acs":80771,"articleLive":2,"columnArticles":776,"formTitle":"[441]排列硬币","frequency":2.6244386845,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":176067,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6977480543307786,"acs":47158,"articleLive":2,"columnArticles":475,"formTitle":"[442]数组中重复的数据","frequency":3.0100745928,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":67586,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4774365605301438,"acs":59078,"articleLive":2,"columnArticles":717,"formTitle":"[443]压缩字符串","frequency":2.8623361416,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":123740,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.25588255470947385,"acs":3730,"articleLive":2,"columnArticles":57,"formTitle":"[444]序列重建","frequency":0.5483656333,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14577,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5907148864592094,"acs":87795,"articleLive":2,"columnArticles":990,"formTitle":"[445]两数相加 II","frequency":2.0071693881,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":148625,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5506497834055315,"acs":19830,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.3155712755,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":36012,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6634907059719642,"acs":49651,"articleLive":2,"columnArticles":386,"formTitle":"[447]回旋镖的数量","frequency":2.2828752695,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":74833,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6510369468969267,"acs":150870,"articleLive":2,"columnArticles":1184,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3620884053,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":231738,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.561497858779006,"acs":16914,"articleLive":2,"columnArticles":151,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.4900060181,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":30123,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.49028258986574275,"acs":72452,"articleLive":2,"columnArticles":716,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.275762864,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":147776,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7118461789147792,"acs":87372,"articleLive":2,"columnArticles":1003,"formTitle":"[451]根据字符出现频率排序","frequency":3.1772406408,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":122740,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.507930727905569,"acs":107405,"articleLive":2,"columnArticles":943,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5833448921,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":211456,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6116151677923736,"acs":57501,"articleLive":2,"columnArticles":693,"formTitle":"[453]最小操作次数使数组元素相等","frequency":2.826879292,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":94015,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6087928052576963,"acs":88001,"articleLive":2,"columnArticles":554,"formTitle":"[454]四数相加 II","frequency":2.9851143011,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":144550,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5759086358714528,"acs":169134,"articleLive":2,"columnArticles":1384,"formTitle":"[455]分发饼干","frequency":3.1314241074,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":293682,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3627365427683971,"acs":59442,"articleLive":2,"columnArticles":473,"formTitle":"[456]132 模式","frequency":2.0071693881,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":163871,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43545742063956894,"acs":29740,"articleLive":2,"columnArticles":338,"formTitle":"[457]环形数组是否存在循环","frequency":2.3494555946,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":68296,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6982289442824067,"acs":23221,"articleLive":2,"columnArticles":212,"formTitle":"[458]可怜的小猪","frequency":1.6396650422,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":33257,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5095414812600032,"acs":86913,"articleLive":2,"columnArticles":697,"formTitle":"[459]重复的子字符串","frequency":2.0729826067,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":170571,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43444600016472334,"acs":36924,"articleLive":2,"columnArticles":427,"formTitle":"[460]LFU 缓存","frequency":2.6244386845,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":84991,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8130208450704225,"acs":180389,"articleLive":2,"columnArticles":1441,"formTitle":"[461]汉明距离","frequency":1.7446608131,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":221875,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6096248281280692,"acs":15518,"articleLive":2,"columnArticles":148,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.3605422232,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":25455,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7050629497918528,"acs":83667,"articleLive":2,"columnArticles":1011,"formTitle":"[463]岛屿的周长","frequency":2.4697929101,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":118666,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3546648117554995,"acs":12237,"articleLive":2,"columnArticles":118,"formTitle":"[464]我能赢吗","frequency":1.1598715277,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":34503,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5351149782473587,"acs":1722,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.8430683946,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3218,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.372982158028887,"acs":11853,"articleLive":2,"columnArticles":184,"formTitle":"[466]统计重复个数","frequency":1.6048050577,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31779,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44226284861486803,"acs":9483,"articleLive":2,"columnArticles":123,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.9996374553,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":21442,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2531570235637635,"acs":27224,"articleLive":2,"columnArticles":321,"formTitle":"[468]验证IP地址","frequency":2.463474173,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":107538,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4318738101713353,"acs":1588,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.6815479423,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3677,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5475550132063808,"acs":68204,"articleLive":2,"columnArticles":351,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.0412772906,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":124561,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6019880715705765,"acs":1514,"articleLive":2,"columnArticles":26,"formTitle":"[471]编码最短长度的字符串","frequency":2.0729826067,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2515,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3900884566782045,"acs":7100,"articleLive":2,"columnArticles":88,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":18201,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4212379103231777,"acs":23214,"articleLive":2,"columnArticles":199,"formTitle":"[473]火柴拼正方形","frequency":2.2207434884,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":55109,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6154309870617224,"acs":81672,"articleLive":2,"columnArticles":653,"formTitle":"[474]一和零","frequency":2.0926915615,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":132707,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.40172925749903887,"acs":49111,"articleLive":2,"columnArticles":555,"formTitle":"[475]供暖器","frequency":2.5073187539,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":122249,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7123005995541222,"acs":65818,"articleLive":2,"columnArticles":886,"formTitle":"[476]数字的补数","frequency":2.1230732056,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":92402,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039017013232514,"acs":39933,"articleLive":2,"columnArticles":340,"formTitle":"[477]汉明距离总和","frequency":0.4626968388,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":66125,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4451258688160738,"acs":7621,"articleLive":2,"columnArticles":55,"formTitle":"[478]在圆内随机生成点","frequency":0.9996374553,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":17121,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4310985771054993,"acs":3363,"articleLive":2,"columnArticles":34,"formTitle":"[479]最大回文数乘积","frequency":1.0918686795,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7801,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.447314245667314,"acs":30637,"articleLive":2,"columnArticles":417,"formTitle":"[480]滑动窗口中位数","frequency":2.2207434884,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":68491,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5480305289937714,"acs":6247,"articleLive":2,"columnArticles":106,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":11399,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4726276159893699,"acs":42683,"articleLive":2,"columnArticles":453,"formTitle":"[482]密钥格式化","frequency":1.3914088712,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":90310,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5898798182617617,"acs":16099,"articleLive":2,"columnArticles":121,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":27292,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6326611308817714,"acs":1600,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2529,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6085975778866599,"acs":131664,"articleLive":2,"columnArticles":1068,"formTitle":"[485]最大连续 1 的个数","frequency":2.8600812983,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":216340,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5871010799660236,"acs":48383,"articleLive":2,"columnArticles":415,"formTitle":"[486]预测赢家","frequency":2.3155712755,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":82410,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5782784517619873,"acs":7007,"articleLive":2,"columnArticles":131,"formTitle":"[487]最大连续1的个数 II","frequency":1.3605422232,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":12117,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5262380333293937,"acs":17810,"articleLive":2,"columnArticles":174,"formTitle":"[488]祖玛游戏","frequency":2.9362148701,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":33844,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7346063912704599,"acs":1885,"articleLive":2,"columnArticles":26,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2566,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4857067406087014,"acs":7357,"articleLive":2,"columnArticles":89,"formTitle":"[490]迷宫","frequency":0.4113903831,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":15147,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5410236822001527,"acs":53115,"articleLive":2,"columnArticles":450,"formTitle":"[491]递增子序列","frequency":2.1870248524,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":98175,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6051084452212601,"acs":45699,"articleLive":2,"columnArticles":439,"formTitle":"[492]构造矩形","frequency":2.1870248524,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":75522,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34699670716475534,"acs":27504,"articleLive":2,"columnArticles":277,"formTitle":"[493]翻转对","frequency":1.0918686795,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":79263,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4916559314356974,"acs":167164,"articleLive":2,"columnArticles":1128,"formTitle":"[494]目标和","frequency":2.826879292,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":340002,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6066549302231758,"acs":66163,"articleLive":2,"columnArticles":952,"formTitle":"[495]提莫攻击","frequency":2.7223455643,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":109062,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7049343624884509,"acs":146491,"articleLive":2,"columnArticles":1499,"formTitle":"[496]下一个更大元素 I","frequency":2.7045094469,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":207808,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4052126874846324,"acs":3296,"articleLive":2,"columnArticles":41,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.5483656333,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":8134,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.47828468425403087,"acs":48026,"articleLive":2,"columnArticles":502,"formTitle":"[498]对角线遍历","frequency":2.6244386845,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":100413,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3775094953879544,"acs":2783,"articleLive":2,"columnArticles":51,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7372,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7444572943698522,"acs":52785,"articleLive":2,"columnArticles":772,"formTitle":"[500]键盘行","frequency":2.2512895408,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":70904,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5173994096628864,"acs":73271,"articleLive":2,"columnArticles":600,"formTitle":"[501]二叉搜索树中的众数","frequency":2.3846147794,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":141614,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4409905937683715,"acs":30005,"articleLive":2,"columnArticles":365,"formTitle":"[502]IPO","frequency":2.2828752695,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":68040,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6400629967651841,"acs":112982,"articleLive":2,"columnArticles":1063,"formTitle":"[503]下一个更大元素 II","frequency":2.5499126148,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":176517,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5036930066037878,"acs":33484,"articleLive":2,"columnArticles":359,"formTitle":"[504]七进制数","frequency":0.4113903831,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":66477,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4902847172654453,"acs":6182,"articleLive":2,"columnArticles":72,"formTitle":"[505]迷宫 II","frequency":0.6124079997,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12609,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.6535017459750377,"acs":56705,"articleLive":2,"columnArticles":731,"formTitle":"[506]相对名次","frequency":1.2893095868,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":86771,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4193154985858481,"acs":32320,"articleLive":2,"columnArticles":259,"formTitle":"[507]完美数","frequency":0.9711860341,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":77078,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6796635755876644,"acs":15758,"articleLive":2,"columnArticles":231,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.3605422232,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":23185,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6707044790401185,"acs":285979,"articleLive":2,"columnArticles":1681,"formTitle":"[509]斐波那契数","frequency":2.9879986411,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":426386,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6095890410958904,"acs":3560,"articleLive":2,"columnArticles":58,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5840,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7301425315508385,"acs":21464,"articleLive":2,"columnArticles":117,"formTitle":"[511]游戏玩法分析 I","frequency":1.3605422232,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":29397,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5385126514990431,"acs":20261,"articleLive":2,"columnArticles":160,"formTitle":"[512]游戏玩法分析 II","frequency":0.4626968388,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":37624,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7318299127442547,"acs":59549,"articleLive":2,"columnArticles":666,"formTitle":"[513]找树左下角的值","frequency":0.9996374553,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":81370,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.4987857826182942,"acs":20334,"articleLive":2,"columnArticles":253,"formTitle":"[514]自由之路","frequency":0.4900060181,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":40767,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.648578171435231,"acs":44521,"articleLive":2,"columnArticles":476,"formTitle":"[515]在每个树行中找最大值","frequency":0.9996374553,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":68644,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6576910014624443,"acs":94891,"articleLive":2,"columnArticles":682,"formTitle":"[516]最长回文子序列","frequency":3.089387867,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":144279,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5087385138091683,"acs":19765,"articleLive":2,"columnArticles":170,"formTitle":"[517]超级洗衣机","frequency":2.9301397019,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38851,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6636456302074101,"acs":119796,"articleLive":2,"columnArticles":745,"formTitle":"[518]零钱兑换 II","frequency":3.0944530283,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":180512,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.47024952015355087,"acs":19355,"articleLive":2,"columnArticles":190,"formTitle":"[519]随机翻转矩阵","frequency":1.3210893748,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":41159,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5760818319582421,"acs":68427,"articleLive":2,"columnArticles":1049,"formTitle":"[520]检测大写字母","frequency":2.1544941029,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"ac","submitted":118780,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7128973853772831,"acs":26775,"articleLive":2,"columnArticles":271,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.4365173332,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":37558,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36198914829010903,"acs":7272,"articleLive":2,"columnArticles":115,"formTitle":"[522]最长特殊序列 II","frequency":1.4234560486,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":20089,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.275992814279708,"acs":72208,"articleLive":2,"columnArticles":625,"formTitle":"[523]连续的子数组和","frequency":1.1598715277,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":261630,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49645408427373433,"acs":76724,"articleLive":2,"columnArticles":792,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.6613267091,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":154544,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5373299748110831,"acs":47997,"articleLive":2,"columnArticles":541,"formTitle":"[525]连续数组","frequency":2.6586438723,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":89325,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344328153081721,"acs":34735,"articleLive":2,"columnArticles":398,"formTitle":"[526]优美的排列","frequency":3.0506496061,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":47295,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5775716694772344,"acs":2055,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3558,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.479049959986281,"acs":33522,"articleLive":2,"columnArticles":267,"formTitle":"[528]按权重随机选择","frequency":2.5316938562,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":69976,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6435161335643703,"acs":41223,"articleLive":2,"columnArticles":481,"formTitle":"[529]扫雷游戏","frequency":1.594767836,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":64059,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6213518545037949,"acs":86778,"articleLive":2,"columnArticles":695,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.2993162117,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":139660,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6623586429725363,"acs":4100,"articleLive":2,"columnArticles":80,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":6190,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37891608242438035,"acs":26645,"articleLive":2,"columnArticles":296,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.4113903831,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":70319,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5291452733313199,"acs":1752,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3311,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6748207507380852,"acs":16000,"articleLive":2,"columnArticles":150,"formTitle":"[534]游戏玩法分析 III","frequency":0.4626968388,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":23710,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8442585551330799,"acs":16653,"articleLive":2,"columnArticles":109,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.9996374553,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19725,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5356978350990327,"acs":3489,"articleLive":2,"columnArticles":57,"formTitle":"[536]从字符串生成二叉树","frequency":1.0918686795,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6513,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.71316442546315,"acs":12357,"articleLive":2,"columnArticles":190,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":17327,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7107599841460457,"acs":120149,"articleLive":2,"columnArticles":923,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.5093309599,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":169043,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.6006046226848308,"acs":15695,"articleLive":2,"columnArticles":218,"formTitle":"[539]最小时间差","frequency":1.8995387239,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":26132,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5832971152279024,"acs":42947,"articleLive":2,"columnArticles":444,"formTitle":"[540]有序数组中的单一元素","frequency":2.1544941029,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":73628,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6023794983481837,"acs":81870,"articleLive":2,"columnArticles":864,"formTitle":"[541]反转字符串 II","frequency":2.5960693289,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":135911,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45765887377375397,"acs":78656,"articleLive":2,"columnArticles":720,"formTitle":"[542]01 矩阵","frequency":2.6133051917,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":171866,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5565664329271389,"acs":164378,"articleLive":2,"columnArticles":1322,"formTitle":"[543]二叉树的直径","frequency":3.2408550897,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":295343,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7136941733215025,"acs":2413,"articleLive":2,"columnArticles":57,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3381,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.423779437105112,"acs":3689,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8705,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6264510610565761,"acs":15380,"articleLive":2,"columnArticles":123,"formTitle":"[546]移除盒子","frequency":0.5483656333,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24551,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188016890638021,"acs":176731,"articleLive":2,"columnArticles":1235,"formTitle":"[547]省份数量","frequency":1.9543169299,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":285602,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3549260570714434,"acs":1704,"articleLive":2,"columnArticles":42,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.9437569969,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4801,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4899413243922883,"acs":2338,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4772,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4381395348837209,"acs":14130,"articleLive":2,"columnArticles":195,"formTitle":"[550]游戏玩法分析 IV","frequency":1.0918686795,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":32250,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5676110125159121,"acs":61088,"articleLive":2,"columnArticles":776,"formTitle":"[551]学生出勤记录 I","frequency":2.2828752695,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":107623,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5771425887216103,"acs":24573,"articleLive":2,"columnArticles":289,"formTitle":"[552]学生出勤记录 II","frequency":2.2512895408,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42577,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6059967429830444,"acs":6326,"articleLive":2,"columnArticles":98,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10439,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5040907103009099,"acs":47258,"articleLive":2,"columnArticles":494,"formTitle":"[554]砖墙","frequency":2.0729826067,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":93749,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3440448113207547,"acs":1167,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3392,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32940648948312407,"acs":16162,"articleLive":2,"columnArticles":241,"formTitle":"[556]下一个更大元素 III","frequency":2.1544941029,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":49064,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7434793943647849,"acs":185368,"articleLive":2,"columnArticles":1551,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3874935822,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":249325,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.50467596390484,"acs":3076,"articleLive":2,"columnArticles":42,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":6095,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7399949455010884,"acs":90770,"articleLive":2,"columnArticles":804,"formTitle":"[559]N 叉树的最大深度","frequency":1.8609238878,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":122663,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4461930163611566,"acs":169465,"articleLive":2,"columnArticles":1032,"formTitle":"[560]和为 K 的子数组","frequency":3.7943254078,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":379802,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7764632120639677,"acs":95359,"articleLive":2,"columnArticles":790,"formTitle":"[561]数组拆分 I","frequency":1.6568080393,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":122812,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4722128662849444,"acs":4206,"articleLive":2,"columnArticles":69,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.4900060181,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8907,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6540802438891611,"acs":60074,"articleLive":2,"columnArticles":602,"formTitle":"[563]二叉树的坡度","frequency":2.3155712755,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":91845,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.18190586419753085,"acs":4715,"articleLive":2,"columnArticles":84,"formTitle":"[564]寻找最近的回文数","frequency":1.0291817016,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":25920,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6070635801490407,"acs":15315,"articleLive":2,"columnArticles":151,"formTitle":"[565]数组嵌套","frequency":1.4234560486,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":25228,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6790445518893978,"acs":79912,"articleLive":2,"columnArticles":754,"formTitle":"[566]重塑矩阵","frequency":2.4361649936,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":117683,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4337443641017137,"acs":138626,"articleLive":2,"columnArticles":1251,"formTitle":"[567]字符串的排列","frequency":3.0821119327,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":319603,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5058209554395825,"acs":1260,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2491,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5646044205742615,"acs":10933,"articleLive":2,"columnArticles":167,"formTitle":"[569]员工薪水中位数","frequency":1.9698516251,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":19364,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6590135668587503,"acs":14524,"articleLive":2,"columnArticles":120,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.4626968388,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":22039,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4775468308955607,"acs":7444,"articleLive":2,"columnArticles":101,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.5796181768,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":15588,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47379980700414137,"acs":94271,"articleLive":2,"columnArticles":815,"formTitle":"[572]另一棵树的子树","frequency":2.7947885255,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":198968,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6568509615384616,"acs":1093,"articleLive":2,"columnArticles":35,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1664,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6493122865318933,"acs":14068,"articleLive":2,"columnArticles":121,"formTitle":"[574]当选者","frequency":0.4365173332,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":21666,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7119193403543146,"acs":87203,"articleLive":2,"columnArticles":842,"formTitle":"[575]分糖果","frequency":3.0506496061,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":122490,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4682179440357559,"acs":26923,"articleLive":2,"columnArticles":291,"formTitle":"[576]出界的路径数","frequency":2.2207434884,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":57501,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.6986351599103687,"acs":17148,"articleLive":2,"columnArticles":93,"formTitle":"[577]员工奖金","frequency":1.6252347774,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":24545,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4855803255484784,"acs":10978,"articleLive":2,"columnArticles":125,"formTitle":"[578]查询回答率最高的问题","frequency":1.0918686795,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":22608,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40996444700682233,"acs":8533,"articleLive":2,"columnArticles":139,"formTitle":"[579]查询员工的累计薪水","frequency":0.4900060181,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":20814,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.522587221424269,"acs":11279,"articleLive":2,"columnArticles":87,"formTitle":"[580]统计各专业学生人数","frequency":1.4567702553,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":21583,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40602122391498185,"acs":106097,"articleLive":2,"columnArticles":910,"formTitle":"[581]最短无序连续子数组","frequency":2.8944725831,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":261309,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4168430533663589,"acs":9256,"articleLive":2,"columnArticles":144,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":22205,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6262728332685581,"acs":56399,"articleLive":2,"columnArticles":533,"formTitle":"[583]两个字符串的删除操作","frequency":3.2630197317,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":90055,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7736865964841586,"acs":15360,"articleLive":2,"columnArticles":65,"formTitle":"[584]寻找用户推荐人","frequency":0.4900060181,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":19853,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.575147195537651,"acs":9280,"articleLive":2,"columnArticles":115,"formTitle":"[585]2016年的投资","frequency":0.4900060181,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":16135,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7432481751824818,"acs":16292,"articleLive":2,"columnArticles":92,"formTitle":"[586]订单最多的客户","frequency":1.0598966468,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":21920,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.39024804621134895,"acs":2297,"articleLive":2,"columnArticles":39,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5886,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42466783655051393,"acs":1694,"articleLive":2,"columnArticles":31,"formTitle":"[588]设计内存文件系统","frequency":1.6461560426,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3989,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7465898205252033,"acs":94304,"articleLive":2,"columnArticles":607,"formTitle":"[589]N 叉树的前序遍历","frequency":1.5368771169,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":126313,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7631897773510721,"acs":66773,"articleLive":2,"columnArticles":502,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":87492,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34179446500969507,"acs":1939,"articleLive":2,"columnArticles":43,"formTitle":"[591]标签验证器","frequency":1.2742818789,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5673,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5274713271436373,"acs":4829,"articleLive":2,"columnArticles":115,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":9155,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4428774300964693,"acs":9044,"articleLive":2,"columnArticles":145,"formTitle":"[593]有效的正方形","frequency":1.6252347774,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":20421,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5659404923784982,"acs":59516,"articleLive":2,"columnArticles":543,"formTitle":"[594]最长和谐子序列","frequency":2.4361649936,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":105163,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7907918036933974,"acs":109410,"articleLive":2,"columnArticles":253,"formTitle":"[595]大的国家","frequency":1.7735545369,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":138355,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4314746009278918,"acs":87793,"articleLive":2,"columnArticles":314,"formTitle":"[596]超过5名学生的课","frequency":2.3155712755,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":203472,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.441801090866891,"acs":11421,"articleLive":2,"columnArticles":88,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.4900060181,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":25851,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5710790643306648,"acs":42016,"articleLive":2,"columnArticles":493,"formTitle":"[598]范围求和 II","frequency":2.4294598592,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":73573,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220868240670221,"acs":31533,"articleLive":2,"columnArticles":302,"formTitle":"[599]两个列表的最小索引总和","frequency":0.5185304849,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":60398,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4821660260961101,"acs":19696,"articleLive":2,"columnArticles":239,"formTitle":"[600]不含连续1的非负整数","frequency":2.463474173,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40849,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5053154318509597,"acs":33986,"articleLive":2,"columnArticles":406,"formTitle":"[601]体育馆的人流量","frequency":1.8995387239,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":67257,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6188473735006205,"acs":8977,"articleLive":2,"columnArticles":99,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":1.1251939893,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":14506,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.668890977443609,"acs":14234,"articleLive":2,"columnArticles":123,"formTitle":"[603]连续空余座位","frequency":1.0598966468,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":21280,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.374076179647527,"acs":2632,"articleLive":2,"columnArticles":62,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":7036,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33232445693257834,"acs":116498,"articleLive":2,"columnArticles":1336,"formTitle":"[605]种花问题","frequency":2.559517222,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":350555,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5732228360957643,"acs":31126,"articleLive":2,"columnArticles":339,"formTitle":"[606]根据二叉树创建字符串","frequency":0.4365173332,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":54300,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6616997524632335,"acs":13633,"articleLive":2,"columnArticles":96,"formTitle":"[607]销售员","frequency":1.0918686795,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":20603,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6266155695822062,"acs":8339,"articleLive":2,"columnArticles":109,"formTitle":"[608]树节点","frequency":1.0918686795,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":13308,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4873369148119724,"acs":6985,"articleLive":2,"columnArticles":110,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":14333,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6634020618556701,"acs":11583,"articleLive":2,"columnArticles":81,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":17460,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5325436801511098,"acs":54132,"articleLive":2,"columnArticles":420,"formTitle":"[611]有效三角形的个数","frequency":4.0025671174,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":101648,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6641827312489875,"acs":8200,"articleLive":2,"columnArticles":71,"formTitle":"[612]平面上的最近距离","frequency":1.0598966468,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":12346,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8151534526854219,"acs":12749,"articleLive":2,"columnArticles":88,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":15640,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3515025267137291,"acs":9112,"articleLive":2,"columnArticles":75,"formTitle":"[614]二级关注者","frequency":1.4234560486,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":25923,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42448388265121334,"acs":5860,"articleLive":2,"columnArticles":95,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13805,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46722437258084654,"acs":3742,"articleLive":2,"columnArticles":63,"formTitle":"[616]给字符串添加加粗标签","frequency":1.3914088712,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":8009,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7869267647790614,"acs":211906,"articleLive":2,"columnArticles":1394,"formTitle":"[617]合并二叉树","frequency":3.0811167493,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":269283,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6203201970443349,"acs":5037,"articleLive":2,"columnArticles":51,"formTitle":"[618]学生地理信息报告","frequency":0.4626968388,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":8120,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46368653421633554,"acs":12603,"articleLive":2,"columnArticles":87,"formTitle":"[619]只出现一次的最大数字","frequency":1.0291817016,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":27180,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7727038385227077,"acs":98920,"articleLive":2,"columnArticles":336,"formTitle":"[620]有趣的电影","frequency":2.0071693881,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":128018,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5738787369696636,"acs":83349,"articleLive":2,"columnArticles":542,"formTitle":"[621]任务调度器","frequency":3.1209511625,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":145238,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4403842485184524,"acs":71562,"articleLive":2,"columnArticles":469,"formTitle":"[622]设计循环队列","frequency":1.9759656084,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":162499,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5463154507424264,"acs":11884,"articleLive":2,"columnArticles":200,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":21753,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.42352725942188074,"acs":2315,"articleLive":2,"columnArticles":54,"formTitle":"[624]数组列表中的最大距离","frequency":0.8430683946,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5466,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3443446088794926,"acs":2606,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7568,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6839776037100924,"acs":48375,"articleLive":2,"columnArticles":382,"formTitle":"[626]换座位","frequency":1.0291817016,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":70726,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8092650382007963,"acs":90246,"articleLive":2,"columnArticles":368,"formTitle":"[627]变更性别","frequency":0.9996374553,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":111516,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5243096772589697,"acs":84363,"articleLive":2,"columnArticles":804,"formTitle":"[628]三个数的最大乘积","frequency":1.3914088712,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":160903,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.5218532434523152,"acs":18889,"articleLive":2,"columnArticles":172,"formTitle":"[629]K个逆序对数组","frequency":2.7435845489,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":36196,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.4631809630936912,"acs":23883,"articleLive":2,"columnArticles":226,"formTitle":"[630]课程表 III","frequency":1.2441318713,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":51563,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2939068100358423,"acs":1148,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3906,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5991093366093366,"acs":19507,"articleLive":2,"columnArticles":247,"formTitle":"[632]最小区间","frequency":0.4900060181,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32560,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39530561287162896,"acs":98473,"articleLive":2,"columnArticles":803,"formTitle":"[633]平方数之和","frequency":1.3914088712,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":249106,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43839367204137514,"acs":1441,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3287,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5524484063988276,"acs":4524,"articleLive":2,"columnArticles":74,"formTitle":"[635]设计日志存储系统","frequency":0.6468704038,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":8189,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5575166112956811,"acs":10740,"articleLive":2,"columnArticles":124,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":19264,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6908587164022773,"acs":81788,"articleLive":2,"columnArticles":701,"formTitle":"[637]二叉树的层平均值","frequency":1.3605422232,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":118386,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6460242754520684,"acs":28688,"articleLive":2,"columnArticles":274,"formTitle":"[638]大礼包","frequency":2.3494555946,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":44407,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37633597615937897,"acs":20458,"articleLive":2,"columnArticles":275,"formTitle":"[639]解码方法 II","frequency":2.3846147794,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":54361,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42655761185028834,"acs":11317,"articleLive":2,"columnArticles":227,"formTitle":"[640]求解方程","frequency":0.4365173332,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":26531,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5316579264001453,"acs":23419,"articleLive":2,"columnArticles":268,"formTitle":"[641]设计循环双端队列","frequency":0.9711860341,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":44049,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49761273209549073,"acs":2814,"articleLive":2,"columnArticles":60,"formTitle":"[642]设计搜索自动补全系统","frequency":0.6815479423,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5655,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4482788216497432,"acs":67899,"articleLive":2,"columnArticles":617,"formTitle":"[643]子数组最大平均数 I","frequency":1.3914088712,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":151466,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.40522022838499183,"acs":1242,"articleLive":2,"columnArticles":26,"formTitle":"[644]子数组最大平均数 II","frequency":1.407279701,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":3065,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4292864004554134,"acs":72394,"articleLive":2,"columnArticles":736,"formTitle":"[645]错误的集合","frequency":1.8343265753,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":168638,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5806125397284022,"acs":24114,"articleLive":2,"columnArticles":221,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":41532,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6586994592306064,"acs":136912,"articleLive":2,"columnArticles":1001,"formTitle":"[647]回文子串","frequency":2.8944725831,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":207852,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.589326910888579,"acs":23246,"articleLive":2,"columnArticles":306,"formTitle":"[648]单词替换","frequency":0.5185304849,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":39445,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4798969649456826,"acs":29995,"articleLive":2,"columnArticles":316,"formTitle":"[649]Dota2 参议院","frequency":1.3914088712,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":62503,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5678160410274588,"acs":51263,"articleLive":2,"columnArticles":672,"formTitle":"[650]只有两个键的键盘","frequency":2.3155712755,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":90281,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5824239778844755,"acs":4003,"articleLive":2,"columnArticles":67,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6873,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5711239201990388,"acs":36958,"articleLive":2,"columnArticles":264,"formTitle":"[652]寻找重复的子树","frequency":2.8944725831,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":64711,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6011297119362647,"acs":46932,"articleLive":2,"columnArticles":480,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":78073,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.809673220843211,"acs":69674,"articleLive":2,"columnArticles":697,"formTitle":"[654]最大二叉树","frequency":2.2207434884,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":86052,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.6004890267175572,"acs":10069,"articleLive":2,"columnArticles":154,"formTitle":"[655]输出二叉树","frequency":1.594767836,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16768,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.31007488087134105,"acs":911,"articleLive":2,"columnArticles":26,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2938,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832088581726303,"acs":84314,"articleLive":2,"columnArticles":651,"formTitle":"[657]机器人能否返回原点","frequency":0.4626968388,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":107652,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.454559302927825,"acs":29840,"articleLive":2,"columnArticles":266,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.594767836,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":65646,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.541841626100851,"acs":29163,"articleLive":2,"columnArticles":267,"formTitle":"[659]分割数组为连续子序列","frequency":0.4113903831,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":53822,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6371976647206005,"acs":764,"articleLive":2,"columnArticles":26,"formTitle":"[660]移除 9","frequency":0.6815479423,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1199,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5634517766497462,"acs":17760,"articleLive":2,"columnArticles":227,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":31520,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40927917315803475,"acs":32313,"articleLive":2,"columnArticles":312,"formTitle":"[662]二叉树最大宽度","frequency":2.2512895408,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":78951,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.45875788452207666,"acs":1891,"articleLive":2,"columnArticles":38,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":4122,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6540022025155046,"acs":22567,"articleLive":2,"columnArticles":193,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34506,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2715339927775161,"acs":77823,"articleLive":2,"columnArticles":978,"formTitle":"[665]非递减数列","frequency":1.7958602944,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":286605,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6196369636963697,"acs":2253,"articleLive":2,"columnArticles":81,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3636,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6242316522254314,"acs":8429,"articleLive":2,"columnArticles":127,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13503,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5129635930588635,"acs":7538,"articleLive":2,"columnArticles":81,"formTitle":"[668]乘法表中第k小的数","frequency":1.0918686795,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14695,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6651889005743872,"acs":41112,"articleLive":2,"columnArticles":344,"formTitle":"[669]修剪二叉搜索树","frequency":0.4365173332,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":61805,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45519463554820166,"acs":20908,"articleLive":2,"columnArticles":311,"formTitle":"[670]最大交换","frequency":2.463474173,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":45932,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4851555772057864,"acs":55773,"articleLive":2,"columnArticles":699,"formTitle":"[671]二叉树中第二小的节点","frequency":2.559517222,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":114959,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5464834276475343,"acs":4056,"articleLive":2,"columnArticles":47,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.4626968388,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":7422,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4364267847485127,"acs":51645,"articleLive":2,"columnArticles":433,"formTitle":"[673]最长递增子序列的个数","frequency":3.4309303671,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":118336,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.5034912190551039,"acs":99942,"articleLive":2,"columnArticles":837,"formTitle":"[674]最长连续递增序列","frequency":2.0632850908,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":198498,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4016624040920716,"acs":3141,"articleLive":2,"columnArticles":52,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.5483656333,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7820,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5948666331152491,"acs":8274,"articleLive":2,"columnArticles":142,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":13909,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6667622033139274,"acs":37222,"articleLive":2,"columnArticles":558,"formTitle":"[677]键值映射","frequency":1.594767836,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":55825,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38571583035989054,"acs":46375,"articleLive":2,"columnArticles":494,"formTitle":"[678]有效的括号字符串","frequency":3.2677510047,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":120231,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5403622097170484,"acs":27271,"articleLive":2,"columnArticles":268,"formTitle":"[679]24 点游戏","frequency":3.3485453903,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":50468,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40085391233452766,"acs":93417,"articleLive":2,"columnArticles":881,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":1.7735545369,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":233045,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5028001400070004,"acs":2873,"articleLive":2,"columnArticles":67,"formTitle":"[681]最近时刻","frequency":0.5796181768,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5714,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6944932504821084,"acs":48618,"articleLive":2,"columnArticles":545,"formTitle":"[682]棒球比赛","frequency":1.0291817016,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":70005,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.44175276095475596,"acs":2480,"articleLive":2,"columnArticles":53,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5614,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6668363636363637,"acs":64183,"articleLive":2,"columnArticles":645,"formTitle":"[684]冗余连接","frequency":0.9996374553,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":96250,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4286771051658242,"acs":20862,"articleLive":2,"columnArticles":262,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":48666,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3997756207014292,"acs":40979,"articleLive":2,"columnArticles":554,"formTitle":"[686]重复叠加字符串匹配","frequency":0.58766651,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":102505,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4436917305676615,"acs":40214,"articleLive":2,"columnArticles":285,"formTitle":"[687]最长同值路径","frequency":1.8034217671,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":90635,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5128725882563766,"acs":8586,"articleLive":2,"columnArticles":112,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.6895656358,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16741,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.5617252359831685,"acs":19757,"articleLive":2,"columnArticles":265,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.9657984419,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":35172,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.649047243206675,"acs":57564,"articleLive":2,"columnArticles":586,"formTitle":"[690]员工的重要性","frequency":1.0291817016,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":88690,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4877230806084561,"acs":4072,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":1.1598715277,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":8349,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.574806558954416,"acs":71687,"articleLive":2,"columnArticles":782,"formTitle":"[692]前K个高频单词","frequency":1.8995387239,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":124715,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6087165064207383,"acs":27920,"articleLive":2,"columnArticles":318,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":45867,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5381507560891147,"acs":4662,"articleLive":2,"columnArticles":89,"formTitle":"[694]不同岛屿的数量","frequency":0.4626968388,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8663,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6678961015736766,"acs":149395,"articleLive":2,"columnArticles":1477,"formTitle":"[695]岛屿的最大面积","frequency":3.2759156484,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":223680,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6333816789464524,"acs":54588,"articleLive":2,"columnArticles":493,"formTitle":"[696]计数二进制子串","frequency":1.6568080393,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":86185,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.603799846892616,"acs":69408,"articleLive":2,"columnArticles":883,"formTitle":"[697]数组的度","frequency":0.5185304849,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":114952,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4492645292186124,"acs":33658,"articleLive":2,"columnArticles":240,"formTitle":"[698]划分为k个相等的子集","frequency":2.8544672485,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":74918,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.48230731943771205,"acs":2985,"articleLive":2,"columnArticles":44,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":6189,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7739995646901526,"acs":124463,"articleLive":2,"columnArticles":820,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.7142377129,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":160805,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7213800141556795,"acs":87652,"articleLive":2,"columnArticles":651,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.1962391719,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":121506,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7438408569242541,"acs":4861,"articleLive":2,"columnArticles":86,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6535,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5138405383458888,"acs":63912,"articleLive":2,"columnArticles":586,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6895656358,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":124381,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.548862426035503,"acs":371031,"articleLive":2,"columnArticles":1796,"formTitle":"[704]二分查找","frequency":4.6727132912,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":676000,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6427949151035648,"acs":72308,"articleLive":2,"columnArticles":455,"formTitle":"[705]设计哈希集合","frequency":2.7543837899,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":112490,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6415779624524619,"acs":63769,"articleLive":2,"columnArticles":419,"formTitle":"[706]设计哈希映射","frequency":1.3020460165,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":99394,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3251742417435726,"acs":76002,"articleLive":2,"columnArticles":517,"formTitle":"[707]设计链表","frequency":2.8218717702,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":233727,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34792294587865286,"acs":2655,"articleLive":2,"columnArticles":56,"formTitle":"[708]循环有序列表的插入","frequency":0.4900060181,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7631,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7729102663320904,"acs":98873,"articleLive":2,"columnArticles":720,"formTitle":"[709]转换成小写字母","frequency":0.7901059423,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":127923,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.36105928377971713,"acs":5999,"articleLive":2,"columnArticles":70,"formTitle":"[710]黑名单中的随机数","frequency":0.4900060181,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":16615,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5611353711790393,"acs":771,"articleLive":2,"columnArticles":26,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1374,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.676175382989963,"acs":16640,"articleLive":2,"columnArticles":190,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.9711860341,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":24609,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4256776492580909,"acs":29147,"articleLive":2,"columnArticles":258,"formTitle":"[713]乘积小于K的子数组","frequency":2.0394823771,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":68472,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7267125391255481,"acs":111211,"articleLive":2,"columnArticles":758,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":1.9043832252,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":153033,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4097193129451194,"acs":2934,"articleLive":2,"columnArticles":51,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":7161,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4636149030072873,"acs":4517,"articleLive":2,"columnArticles":83,"formTitle":"[716]最大栈","frequency":0.4900060181,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9743,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5113965888185589,"acs":32802,"articleLive":2,"columnArticles":403,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":64142,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5649750588464869,"acs":92648,"articleLive":2,"columnArticles":628,"formTitle":"[718]最长重复子数组","frequency":2.8643134819,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":163986,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37641437308868503,"acs":9847,"articleLive":2,"columnArticles":92,"formTitle":"[719]找出第 k 小的距离对","frequency":2.3693845124,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":26160,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4842845940275099,"acs":22850,"articleLive":2,"columnArticles":309,"formTitle":"[720]词典中最长的单词","frequency":1.3307781213,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":47183,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.47089065104612937,"acs":30226,"articleLive":2,"columnArticles":346,"formTitle":"[721]账户合并","frequency":0.9996374553,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":64189,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3224378411158278,"acs":5317,"articleLive":2,"columnArticles":76,"formTitle":"[722]删除注释","frequency":2.1815227752,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":16490,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.723729649728663,"acs":1467,"articleLive":2,"columnArticles":42,"formTitle":"[723]粉碎糖果","frequency":0.7545149972,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":2027,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4696206812628997,"acs":148580,"articleLive":2,"columnArticles":925,"formTitle":"[724]寻找数组的中心下标","frequency":1.9458004417,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":316383,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6083124336838044,"acs":50451,"articleLive":2,"columnArticles":647,"formTitle":"[725]分隔链表","frequency":2.6586438723,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":82936,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524463434513077,"acs":22368,"articleLive":2,"columnArticles":408,"formTitle":"[726]原子的数量","frequency":3.0255499868,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":40489,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40772316950852555,"acs":3252,"articleLive":2,"columnArticles":55,"formTitle":"[727]最小窗口子序列","frequency":1.9698516251,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":7976,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7576002725027676,"acs":35586,"articleLive":2,"columnArticles":325,"formTitle":"[728]自除数","frequency":0.4626968388,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":46972,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5197852348993288,"acs":9681,"articleLive":2,"columnArticles":119,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":18625,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4956604446558079,"acs":4169,"articleLive":2,"columnArticles":52,"formTitle":"[730]统计不同回文子序列","frequency":1.7958602944,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8411,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5034841278619622,"acs":4552,"articleLive":2,"columnArticles":50,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":9041,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6169519152404238,"acs":3785,"articleLive":2,"columnArticles":59,"formTitle":"[732]我的日程安排表 III","frequency":1.4567702553,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":6135,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5802051570502383,"acs":78395,"articleLive":2,"columnArticles":661,"formTitle":"[733]图像渲染","frequency":2.9237486786,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":135116,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4773688663282572,"acs":2257,"articleLive":2,"columnArticles":41,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4728,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41014222590444627,"acs":23762,"articleLive":2,"columnArticles":300,"formTitle":"[735]行星碰撞","frequency":2.8218717702,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":57936,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46945798680814455,"acs":1637,"articleLive":2,"columnArticles":48,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3487,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46708185053380785,"acs":4200,"articleLive":2,"columnArticles":74,"formTitle":"[737]句子相似性 II","frequency":0.4626968388,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8992,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5017922757969728,"acs":44656,"articleLive":2,"columnArticles":616,"formTitle":"[738]单调递增的数字","frequency":1.7235940976,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":88993,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6829790730155749,"acs":232762,"articleLive":2,"columnArticles":1638,"formTitle":"[739]每日温度","frequency":3.6979961418,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":340804,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6279389122383587,"acs":60360,"articleLive":2,"columnArticles":669,"formTitle":"[740]删除并获得点数","frequency":2.8384669071,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":96124,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36989907854322074,"acs":4215,"articleLive":2,"columnArticles":49,"formTitle":"[741]摘樱桃","frequency":1.6461560426,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11395,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4942462600690449,"acs":1718,"articleLive":2,"columnArticles":49,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3476,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5255619454622852,"acs":62966,"articleLive":2,"columnArticles":563,"formTitle":"[743]网络延迟时间","frequency":2.70930723,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":119807,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45934963574197435,"acs":44200,"articleLive":2,"columnArticles":398,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.3872462842,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":96223,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.40105210420841686,"acs":3202,"articleLive":2,"columnArticles":58,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7984,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5978273347159617,"acs":156235,"articleLive":2,"columnArticles":1465,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.3299427804,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":261338,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41995270601882834,"acs":47062,"articleLive":2,"columnArticles":429,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":112065,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6820592714478267,"acs":38964,"articleLive":2,"columnArticles":495,"formTitle":"[748]最短补全词","frequency":0.8566444923,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":57127,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5045395590142672,"acs":1556,"articleLive":2,"columnArticles":37,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":3084,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.717654986522911,"acs":2130,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.7198374588,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2968,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.4952413324269205,"acs":1457,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2942,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302282346147617,"acs":75294,"articleLive":2,"columnArticles":632,"formTitle":"[752]打开转盘锁","frequency":0.9172864201,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":142003,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5973531844499587,"acs":3611,"articleLive":2,"columnArticles":48,"formTitle":"[753]破解保险箱","frequency":1.0598966468,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":6045,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43253480753480755,"acs":8450,"articleLive":2,"columnArticles":100,"formTitle":"[754]到达终点数字","frequency":0.5185304849,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19536,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4980151569830386,"acs":1380,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2771,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5569836214740673,"acs":4897,"articleLive":2,"columnArticles":72,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8792,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4246508606690484,"acs":2615,"articleLive":2,"columnArticles":40,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":6158,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4658987964281092,"acs":3600,"articleLive":2,"columnArticles":71,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7727,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6715260545905707,"acs":2165,"articleLive":2,"columnArticles":50,"formTitle":"[759]员工空闲时间","frequency":0.4365173332,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":3224,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8389490573606098,"acs":4183,"articleLive":2,"columnArticles":95,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4986,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5939930276213462,"acs":2215,"articleLive":2,"columnArticles":35,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3729,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7024138704132725,"acs":18798,"articleLive":2,"columnArticles":163,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26762,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7631191012759035,"acs":90074,"articleLive":2,"columnArticles":1062,"formTitle":"[763]划分字母区间","frequency":2.9539431367,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":118034,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49830776173285196,"acs":4417,"articleLive":2,"columnArticles":59,"formTitle":"[764]最大加号标志","frequency":0.5185304849,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8864,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6640091870762571,"acs":30067,"articleLive":2,"columnArticles":454,"formTitle":"[765]情侣牵手","frequency":1.8663395523,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":45281,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7074566214599123,"acs":56755,"articleLive":2,"columnArticles":650,"formTitle":"[766]托普利茨矩阵","frequency":0.4113903831,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":80224,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47787671785183566,"acs":41484,"articleLive":2,"columnArticles":504,"formTitle":"[767]重构字符串","frequency":2.7435845489,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":86809,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5138670419736733,"acs":6207,"articleLive":2,"columnArticles":90,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4365173332,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":12079,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5851443944680315,"acs":13920,"articleLive":2,"columnArticles":169,"formTitle":"[769]最多能完成排序的块","frequency":0.4900060181,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":23789,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5641137855579869,"acs":1289,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2285,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512193533682806,"acs":156861,"articleLive":2,"columnArticles":1166,"formTitle":"[771]宝石与石头","frequency":1.0291817016,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":184278,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4972988757482844,"acs":6812,"articleLive":2,"columnArticles":131,"formTitle":"[772]基本计算器 III","frequency":0.5185304849,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13698,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7101108595971908,"acs":24469,"articleLive":2,"columnArticles":347,"formTitle":"[773]滑动谜题","frequency":2.3155712755,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":34458,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5928290766208252,"acs":1207,"articleLive":2,"columnArticles":23,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.8430683946,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":2036,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.458907649896623,"acs":5327,"articleLive":2,"columnArticles":84,"formTitle":"[775]全局倒置与局部倒置","frequency":0.5796181768,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11608,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5693233082706767,"acs":1893,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3325,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32434801665570895,"acs":5920,"articleLive":2,"columnArticles":64,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.1251939893,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":18252,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5929216393521993,"acs":24493,"articleLive":2,"columnArticles":355,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":41309,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43677672076105206,"acs":19513,"articleLive":2,"columnArticles":243,"formTitle":"[779]第K个语法符号","frequency":1.6895656358,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":44675,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2876757378936118,"acs":3499,"articleLive":2,"columnArticles":54,"formTitle":"[780]到达终点","frequency":0.6124079997,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":12163,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6135796512028676,"acs":44506,"articleLive":2,"columnArticles":679,"formTitle":"[781]森林中的兔子","frequency":2.1544941029,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":72535,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.41415701415701417,"acs":1609,"articleLive":2,"columnArticles":34,"formTitle":"[782]变为棋盘","frequency":0.7545149972,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3885,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.596509734866104,"acs":71815,"articleLive":2,"columnArticles":697,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.0291817016,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":120392,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6909475088967971,"acs":49704,"articleLive":2,"columnArticles":574,"formTitle":"[784]字母大小写全排列","frequency":2.0394823771,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":71936,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5161666764896564,"acs":43789,"articleLive":2,"columnArticles":434,"formTitle":"[785]判断二分图","frequency":1.9340106329,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":84835,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.6746417878528657,"acs":25237,"articleLive":2,"columnArticles":257,"formTitle":"[786]第 K 个最小的素数分数","frequency":1.0509966236,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":37408,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3891587851224008,"acs":45179,"articleLive":2,"columnArticles":427,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.8218717702,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":116094,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.609051904900158,"acs":18880,"articleLive":2,"columnArticles":196,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30999,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6917595528388847,"acs":21163,"articleLive":2,"columnArticles":301,"formTitle":"[789]逃脱阻碍者","frequency":2.3846147794,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30593,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4528322090159546,"acs":4229,"articleLive":2,"columnArticles":74,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.4900060181,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":9339,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6960285132382892,"acs":12303,"articleLive":2,"columnArticles":215,"formTitle":"[791]自定义字符串排序","frequency":1.0598966468,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":17676,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4654428158057018,"acs":9812,"articleLive":2,"columnArticles":107,"formTitle":"[792]匹配子序列的单词数","frequency":1.0291817016,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":21081,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3942647266563074,"acs":5582,"articleLive":2,"columnArticles":71,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":14158,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3894761407940256,"acs":28371,"articleLive":2,"columnArticles":461,"formTitle":"[794]有效的井字游戏","frequency":0.0778423327,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":72844,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5303412641192021,"acs":8827,"articleLive":2,"columnArticles":100,"formTitle":"[795]区间子数组个数","frequency":1.8663395523,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":16644,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5392672333174006,"acs":25949,"articleLive":2,"columnArticles":324,"formTitle":"[796]旋转字符串","frequency":2.3342438623,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":48119,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7894256480873617,"acs":49302,"articleLive":2,"columnArticles":595,"formTitle":"[797]所有可能的路径","frequency":2.1625198281,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":62453,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4715472162411566,"acs":1533,"articleLive":2,"columnArticles":38,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3251,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.41341866820077666,"acs":5749,"articleLive":2,"columnArticles":75,"formTitle":"[799]香槟塔","frequency":1.3605422232,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13906,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7103825136612022,"acs":1560,"articleLive":2,"columnArticles":38,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2196,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4207343887423043,"acs":7654,"articleLive":2,"columnArticles":91,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.6568080393,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":18192,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5775055481580116,"acs":32528,"articleLive":2,"columnArticles":341,"formTitle":"[802]找到最终的安全状态","frequency":2.4669442299,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":56325,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48043770397389135,"acs":12513,"articleLive":2,"columnArticles":128,"formTitle":"[803]打砖块","frequency":0.6124079997,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":26045,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7738164815897136,"acs":41044,"articleLive":2,"columnArticles":420,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.0291817016,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":53041,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2980596119223845,"acs":2980,"articleLive":2,"columnArticles":45,"formTitle":"[805]数组的均值分割","frequency":0.5483656333,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9998,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6548801603936936,"acs":14372,"articleLive":2,"columnArticles":168,"formTitle":"[806]写字符串需要的行数","frequency":0.4626968388,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21946,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8894759301782121,"acs":43772,"articleLive":2,"columnArticles":617,"formTitle":"[807]保持城市天际线","frequency":1.1814939917,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":49211,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.48316811235026846,"acs":4679,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.5796181768,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9684,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4206528765352295,"acs":5206,"articleLive":2,"columnArticles":99,"formTitle":"[809]情感丰富的文字","frequency":0.4900060181,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":12376,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7309195102891378,"acs":16836,"articleLive":2,"columnArticles":135,"formTitle":"[810]黑板异或游戏","frequency":0.5185304849,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":23034,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7057550843790567,"acs":16310,"articleLive":2,"columnArticles":208,"formTitle":"[811]子域名访问计数","frequency":0.9996374553,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":23110,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.631959154853077,"acs":11635,"articleLive":2,"columnArticles":109,"formTitle":"[812]最大三角形面积","frequency":0.4626968388,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":18411,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5538259153694365,"acs":7578,"articleLive":2,"columnArticles":89,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13683,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000199265564064,"acs":24591,"articleLive":2,"columnArticles":380,"formTitle":"[814]二叉树剪枝","frequency":1.3605422232,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":35129,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4330039679452268,"acs":27827,"articleLive":2,"columnArticles":324,"formTitle":"[815]公交路线","frequency":3.5070416411,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":64265,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5133610850006715,"acs":3823,"articleLive":2,"columnArticles":70,"formTitle":"[816]模糊坐标","frequency":0.5483656333,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7447,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5923176919528662,"acs":14125,"articleLive":2,"columnArticles":176,"formTitle":"[817]链表组件","frequency":0.4900060181,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23847,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43536488480308705,"acs":3836,"articleLive":2,"columnArticles":47,"formTitle":"[818]赛车","frequency":0.6124079997,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8811,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4223510768565872,"acs":23454,"articleLive":2,"columnArticles":265,"formTitle":"[819]最常见的单词","frequency":0.3872462842,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":55532,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5094125834195782,"acs":57097,"articleLive":2,"columnArticles":627,"formTitle":"[820]单词的压缩编码","frequency":0.4626968388,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":112084,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6943734015345269,"acs":27150,"articleLive":2,"columnArticles":371,"formTitle":"[821]字符的最短距离","frequency":1.3307781213,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":39100,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5080474719557796,"acs":3125,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":6151,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4279001074113856,"acs":3187,"articleLive":2,"columnArticles":56,"formTitle":"[823]带因子的二叉树","frequency":0.6124079997,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7448,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6172175783011342,"acs":17795,"articleLive":2,"columnArticles":248,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28831,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39591308567423306,"acs":7343,"articleLive":2,"columnArticles":101,"formTitle":"[825]适龄的朋友","frequency":1.0291817016,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":18547,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3808199832296218,"acs":8629,"articleLive":2,"columnArticles":124,"formTitle":"[826]安排工作以达到最大收益","frequency":1.7235940976,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":22659,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39134036144578316,"acs":10394,"articleLive":2,"columnArticles":202,"formTitle":"[827]最大人工岛","frequency":1.0918686795,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":26560,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.5007094211123723,"acs":3529,"articleLive":2,"columnArticles":57,"formTitle":"[828]统计子串中的唯一字符","frequency":0.5185304849,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":7048,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.367776728074319,"acs":9343,"articleLive":2,"columnArticles":110,"formTitle":"[829]连续整数求和","frequency":1.0291817016,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":25404,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429387352590705,"acs":52854,"articleLive":2,"columnArticles":594,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":97348,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40701935483870966,"acs":7886,"articleLive":2,"columnArticles":78,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":19375,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955365398212441,"acs":87762,"articleLive":2,"columnArticles":959,"formTitle":"[832]翻转图像","frequency":0.4626968388,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":110318,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4371430806539936,"acs":5588,"articleLive":2,"columnArticles":84,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12783,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.52686188609638,"acs":13710,"articleLive":2,"columnArticles":134,"formTitle":"[834]树中距离之和","frequency":1.1598715277,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":26022,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5758423394787031,"acs":4529,"articleLive":2,"columnArticles":52,"formTitle":"[835]图像重叠","frequency":0.5185304849,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7865,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4806800807290074,"acs":39298,"articleLive":2,"columnArticles":675,"formTitle":"[836]矩形重叠","frequency":1.6568080393,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":81755,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39581492489356573,"acs":19710,"articleLive":2,"columnArticles":247,"formTitle":"[837]新 21 点","frequency":1.1251939893,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49796,"title":"新 21 点","titleSlug":"new-21-game"},{"acceptance":0.5013922165382374,"acs":7743,"articleLive":2,"columnArticles":138,"formTitle":"[838]推多米诺","frequency":2.463474173,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":15443,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747805734347572,"acs":19646,"articleLive":2,"columnArticles":276,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":34180,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3607156748346947,"acs":9274,"articleLive":2,"columnArticles":117,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25710,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6594678762439916,"acs":58446,"articleLive":2,"columnArticles":578,"formTitle":"[841]钥匙和房间","frequency":1.3605422232,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":88626,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4871980108195289,"acs":28999,"articleLive":2,"columnArticles":324,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0394823771,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":59522,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38569089305957927,"acs":3062,"articleLive":2,"columnArticles":37,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7939,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5078326889561089,"acs":101402,"articleLive":2,"columnArticles":1084,"formTitle":"[844]比较含退格的字符串","frequency":1.2474274187,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":199676,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4219658803433588,"acs":39031,"articleLive":2,"columnArticles":574,"formTitle":"[845]数组中的最长山脉","frequency":1.8663395523,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":92498,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5147147807910226,"acs":9357,"articleLive":2,"columnArticles":131,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":18179,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.678818464144551,"acs":19235,"articleLive":2,"columnArticles":160,"formTitle":"[847]访问所有节点的最短路径","frequency":2.8944725831,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":28336,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4481341215592093,"acs":9703,"articleLive":2,"columnArticles":107,"formTitle":"[848]字母移位","frequency":1.4234560486,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":21652,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42815173693433667,"acs":16614,"articleLive":2,"columnArticles":200,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38804,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4476466575716235,"acs":2625,"articleLive":2,"columnArticles":45,"formTitle":"[850]矩形面积 II","frequency":2.1815227752,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5864,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.6281874136415023,"acs":25005,"articleLive":2,"columnArticles":269,"formTitle":"[851]喧闹和富有","frequency":0.7756574338,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":39805,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7143808042087029,"acs":89079,"articleLive":2,"columnArticles":768,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":124694,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3883423770348328,"acs":11093,"articleLive":2,"columnArticles":140,"formTitle":"[853]车队","frequency":1.6252347774,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":28565,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36276147299769346,"acs":4561,"articleLive":2,"columnArticles":75,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12573,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4113788783255951,"acs":5582,"articleLive":2,"columnArticles":65,"formTitle":"[855]考场就座","frequency":0.4900060181,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":13569,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6288742984997983,"acs":17145,"articleLive":2,"columnArticles":233,"formTitle":"[856]括号的分数","frequency":2.7435845489,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":27263,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4715271786022433,"acs":3279,"articleLive":2,"columnArticles":52,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4900060181,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6954,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5573294629898403,"acs":3072,"articleLive":2,"columnArticles":51,"formTitle":"[858]镜面反射","frequency":1.8745249135,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5512,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.345791446285334,"acs":59232,"articleLive":2,"columnArticles":750,"formTitle":"[859]亲密字符串","frequency":2.3649190232,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":171294,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5858579161191547,"acs":97195,"articleLive":2,"columnArticles":842,"formTitle":"[860]柠檬水找零","frequency":1.3020460165,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":165902,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.809237607010278,"acs":32045,"articleLive":2,"columnArticles":454,"formTitle":"[861]翻转矩阵后的得分","frequency":1.1251939893,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39599,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19613600197234238,"acs":17502,"articleLive":2,"columnArticles":138,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3846147794,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":89234,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6062421083303655,"acs":37450,"articleLive":2,"columnArticles":581,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.6442418721,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":61774,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.46106269328085464,"acs":3280,"articleLive":2,"columnArticles":47,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.5796181768,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":7114,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6637203967343634,"acs":9837,"articleLive":2,"columnArticles":142,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.4365173332,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14821,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22755976544880469,"acs":8072,"articleLive":2,"columnArticles":96,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":35472,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6689850813919866,"acs":85604,"articleLive":2,"columnArticles":769,"formTitle":"[867]转置矩阵","frequency":1.0291817016,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":127961,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6258250373773839,"acs":17162,"articleLive":2,"columnArticles":250,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":27423,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6423409130971267,"acs":32796,"articleLive":2,"columnArticles":470,"formTitle":"[869]重新排序得到 2 的幂","frequency":1.8995387239,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":51057,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.43722704551433833,"acs":16619,"articleLive":2,"columnArticles":216,"formTitle":"[870]优势洗牌","frequency":1.3307781213,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":38010,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3466631355932203,"acs":10472,"articleLive":2,"columnArticles":135,"formTitle":"[871]最低加油次数","frequency":2.0729826067,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":30208,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6518216924110141,"acs":62116,"articleLive":2,"columnArticles":745,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":95296,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5188177891040184,"acs":16694,"articleLive":2,"columnArticles":125,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.9340106329,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":32177,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4192644483362522,"acs":21546,"articleLive":2,"columnArticles":242,"formTitle":"[874]模拟行走机器人","frequency":1.4567702553,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":51390,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48286806201113647,"acs":51424,"articleLive":2,"columnArticles":409,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.8883353802,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":106497,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7058595664616504,"acs":178574,"articleLive":2,"columnArticles":1865,"formTitle":"[876]链表的中间结点","frequency":2.4721734101,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":252988,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7579970104633782,"acs":70994,"articleLive":2,"columnArticles":498,"formTitle":"[877]石子游戏","frequency":1.2742818789,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":93660,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2860410521880455,"acs":4752,"articleLive":2,"columnArticles":67,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":16613,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5526610993393992,"acs":22170,"articleLive":2,"columnArticles":187,"formTitle":"[879]盈利计划","frequency":1.9698516251,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":40115,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2550229329869708,"acs":6283,"articleLive":2,"columnArticles":83,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24637,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5379215758269528,"acs":49811,"articleLive":2,"columnArticles":606,"formTitle":"[881]救生艇","frequency":3.5442072707,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":92599,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.49213911386374465,"acs":2066,"articleLive":2,"columnArticles":34,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":4198,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.692722208767256,"acs":11441,"articleLive":2,"columnArticles":123,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16516,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6634290676358022,"acs":20628,"articleLive":2,"columnArticles":269,"formTitle":"[884]两句话中的不常见单词","frequency":1.0598966468,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":31093,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6991356839072576,"acs":5096,"articleLive":2,"columnArticles":75,"formTitle":"[885]螺旋矩阵 III","frequency":1.1598715277,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":7289,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.43870911772360544,"acs":10114,"articleLive":2,"columnArticles":135,"formTitle":"[886]可能的二分法","frequency":1.8343265753,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":23054,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2906228403593642,"acs":53828,"articleLive":2,"columnArticles":355,"formTitle":"[887]鸡蛋掉落","frequency":2.70930723,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":185216,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6409237305557459,"acs":56118,"articleLive":2,"columnArticles":478,"formTitle":"[888]公平的糖果交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":87558,"title":"公平的糖果交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6749899152884228,"acs":16733,"articleLive":2,"columnArticles":164,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.9340106329,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":24790,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.727805032441842,"acs":9198,"articleLive":2,"columnArticles":132,"formTitle":"[890]查找和替换模式","frequency":0.5483656333,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12638,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3311088866644422,"acs":2977,"articleLive":2,"columnArticles":40,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8991,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6383367560336869,"acs":33881,"articleLive":2,"columnArticles":692,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":53077,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7245843464546231,"acs":11026,"articleLive":2,"columnArticles":111,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":15217,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7750362036315027,"acs":13915,"articleLive":2,"columnArticles":131,"formTitle":"[894]所有可能的满二叉树","frequency":0.4626968388,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17954,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5571887605113831,"acs":8150,"articleLive":2,"columnArticles":91,"formTitle":"[895]最大频率栈","frequency":2.0729826067,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":14627,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5849099612491452,"acs":61584,"articleLive":2,"columnArticles":735,"formTitle":"[896]单调数列","frequency":0.3872462842,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":105288,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.743005396909778,"acs":64293,"articleLive":2,"columnArticles":739,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":86531,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3413187997843924,"acs":5699,"articleLive":2,"columnArticles":41,"formTitle":"[898]子数组按位或操作","frequency":0.4365173332,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16697,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5411307934967241,"acs":4460,"articleLive":2,"columnArticles":53,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8242,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4989162828501761,"acs":3683,"articleLive":2,"columnArticles":57,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7382,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5501314405888539,"acs":20927,"articleLive":2,"columnArticles":253,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":38040,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.33838242169237964,"acs":3619,"articleLive":2,"columnArticles":83,"formTitle":"[902]最大为 N 的数字组合","frequency":1.1251939893,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10695,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5367142102482831,"acs":3048,"articleLive":2,"columnArticles":44,"formTitle":"[903]DI 序列的有效排列","frequency":0.8917161188,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5679,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.448437287212311,"acs":26343,"articleLive":2,"columnArticles":370,"formTitle":"[904]水果成篮","frequency":2.2207434884,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":58744,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7008747697974217,"acs":60892,"articleLive":2,"columnArticles":640,"formTitle":"[905]按奇偶排序数组","frequency":1.3914088712,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":86880,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2873019626389217,"acs":2430,"articleLive":2,"columnArticles":44,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8458,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3222284864947978,"acs":12574,"articleLive":2,"columnArticles":137,"formTitle":"[907]子数组的最小值之和","frequency":2.0071693881,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":39022,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6990799492385786,"acs":22035,"articleLive":2,"columnArticles":206,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":31520,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45990180032733224,"acs":16579,"articleLive":2,"columnArticles":199,"formTitle":"[909]蛇梯棋","frequency":2.2207434884,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":36049,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3210470332516302,"acs":6942,"articleLive":2,"columnArticles":70,"formTitle":"[910]最小差值 II","frequency":0.4626968388,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21623,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.5424080225104195,"acs":25638,"articleLive":2,"columnArticles":319,"formTitle":"[911]在线选举","frequency":1.0079638981,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":47267,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5575060649545369,"acs":259911,"articleLive":2,"columnArticles":1182,"formTitle":"[912]排序数组","frequency":3.8980916294,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":466203,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40255905511811024,"acs":2045,"articleLive":2,"columnArticles":35,"formTitle":"[913]猫和老鼠","frequency":0.8917161188,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":5080,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889504045839947,"acs":50231,"articleLive":2,"columnArticles":632,"formTitle":"[914]卡牌分组","frequency":1.0291817016,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":129145,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4682059398566242,"acs":10058,"articleLive":2,"columnArticles":125,"formTitle":"[915]分割数组","frequency":0.4900060181,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":21482,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4466763578696974,"acs":6760,"articleLive":2,"columnArticles":80,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":15134,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5690123389286821,"acs":31220,"articleLive":2,"columnArticles":463,"formTitle":"[917]仅仅反转字母","frequency":1.3914088712,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":54867,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3608080055357428,"acs":27114,"articleLive":2,"columnArticles":274,"formTitle":"[918]环形子数组的最大和","frequency":2.5316938562,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":75148,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6434643995749203,"acs":6055,"articleLive":2,"columnArticles":108,"formTitle":"[919]完全二叉树插入器","frequency":0.5185304849,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":9410,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4874726343955242,"acs":2004,"articleLive":2,"columnArticles":21,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":4111,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.743417656169334,"acs":23040,"articleLive":2,"columnArticles":341,"formTitle":"[921]使括号有效的最少添加","frequency":1.0291817016,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":30992,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140476651811665,"acs":92130,"articleLive":2,"columnArticles":861,"formTitle":"[922]按奇偶排序数组 II","frequency":1.3605422232,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":129025,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3436362704392844,"acs":6704,"articleLive":2,"columnArticles":88,"formTitle":"[923]三数之和的多种可能","frequency":1.0918686795,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":19509,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3579990659540242,"acs":6899,"articleLive":2,"columnArticles":99,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.5796181768,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":19271,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38708905083274725,"acs":51736,"articleLive":2,"columnArticles":693,"formTitle":"[925]长按键入","frequency":1.3914088712,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":133654,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5337800111669458,"acs":7648,"articleLive":2,"columnArticles":141,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.4365173332,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":14328,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.34159341686927247,"acs":3653,"articleLive":2,"columnArticles":77,"formTitle":"[927]三等分","frequency":1.1962391719,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10694,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42300821722043586,"acs":2368,"articleLive":2,"columnArticles":46,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5598,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6450516879924817,"acs":26769,"articleLive":2,"columnArticles":238,"formTitle":"[929]独特的电子邮件地址","frequency":0.4900060181,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":41499,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.545272286460276,"acs":35085,"articleLive":2,"columnArticles":351,"formTitle":"[930]和相同的二元子数组","frequency":2.8574861187,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":64344,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6713729561380742,"acs":25868,"articleLive":2,"columnArticles":328,"formTitle":"[931]下降路径最小和","frequency":0.9437569969,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":38530,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6378100465504064,"acs":9180,"articleLive":2,"columnArticles":88,"formTitle":"[932]漂亮数组","frequency":1.0598966468,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":14393,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7275848142164781,"acs":39633,"articleLive":2,"columnArticles":343,"formTitle":"[933]最近的请求次数","frequency":2.0394823771,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":54472,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4708265802269044,"acs":26145,"articleLive":2,"columnArticles":291,"formTitle":"[934]最短的桥","frequency":0.4113903831,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":55530,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4801875045777485,"acs":6556,"articleLive":2,"columnArticles":88,"formTitle":"[935]骑士拨号器","frequency":1.0291817016,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13653,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37893768682455736,"acs":1648,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4349,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5875430019916712,"acs":12980,"articleLive":2,"columnArticles":137,"formTitle":"[937]重新排列日志文件","frequency":1.0598966468,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":22092,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8199771875509206,"acs":100644,"articleLive":2,"columnArticles":833,"formTitle":"[938]二叉搜索树的范围和","frequency":0.9711860341,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":122740,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45889992360580595,"acs":6007,"articleLive":2,"columnArticles":65,"formTitle":"[939]最小面积矩形","frequency":1.0291817016,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":13090,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4245939675174014,"acs":5307,"articleLive":2,"columnArticles":67,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12499,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3930049656108318,"acs":63712,"articleLive":2,"columnArticles":637,"formTitle":"[941]有效的山脉数组","frequency":1.3605422232,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":162115,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.731699075354038,"acs":23819,"articleLive":2,"columnArticles":225,"formTitle":"[942]增减字符串匹配","frequency":0.4626968388,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":32553,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4549710209540794,"acs":2041,"articleLive":2,"columnArticles":46,"formTitle":"[943]最短超级串","frequency":0.6124079997,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4486,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6869364450407164,"acs":22017,"articleLive":2,"columnArticles":189,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":32051,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4853685163489189,"acs":36457,"articleLive":2,"columnArticles":545,"formTitle":"[945]使数组唯一的最小增量","frequency":0.4900060181,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":75112,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6278561791978071,"acs":29319,"articleLive":2,"columnArticles":336,"formTitle":"[946]验证栈序列","frequency":1.8663395523,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":46697,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125894659570563,"acs":26704,"articleLive":2,"columnArticles":343,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43592,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3936716549781876,"acs":7129,"articleLive":2,"columnArticles":103,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":18109,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37295273748245206,"acs":8767,"articleLive":2,"columnArticles":126,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6895656358,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23507,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7776524550718099,"acs":10342,"articleLive":2,"columnArticles":161,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.9996374553,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":13299,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.663195991091314,"acs":11911,"articleLive":2,"columnArticles":181,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":17960,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.36246540344901,"acs":3405,"articleLive":2,"columnArticles":66,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":9394,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5511924414316322,"acs":15693,"articleLive":2,"columnArticles":186,"formTitle":"[953]验证外星语词典","frequency":0.4626968388,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":28471,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3043902042805507,"acs":7495,"articleLive":2,"columnArticles":109,"formTitle":"[954]二倍数对数组","frequency":1.4567702553,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24623,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.332948199499326,"acs":3458,"articleLive":2,"columnArticles":56,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10386,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.44092039800995025,"acs":4254,"articleLive":2,"columnArticles":54,"formTitle":"[956]最高的广告牌","frequency":0.6468704038,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9648,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3609412455359327,"acs":14756,"articleLive":2,"columnArticles":148,"formTitle":"[957]N 天后的牢房","frequency":2.2557365619,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":40882,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5372236513800507,"acs":27775,"articleLive":2,"columnArticles":267,"formTitle":"[958]二叉树的完全性检验","frequency":1.8995387239,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":51701,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7440853048983672,"acs":20097,"articleLive":2,"columnArticles":308,"formTitle":"[959]由斜杠划分区域","frequency":0.4900060181,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":27009,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5592192033764178,"acs":2120,"articleLive":2,"columnArticles":35,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3791,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6772271961705523,"acs":38199,"articleLive":2,"columnArticles":328,"formTitle":"[961]在长度 2N 的数组中找出重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":56405,"title":"在长度 2N 的数组中找出重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44635427738467615,"acs":14698,"articleLive":2,"columnArticles":148,"formTitle":"[962]最大宽度坡","frequency":1.1251939893,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":32929,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5117781155015197,"acs":2694,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":1.3605422232,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5264,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43980828869467153,"acs":1560,"articleLive":2,"columnArticles":29,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3547,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6842835665548745,"acs":35502,"articleLive":2,"columnArticles":419,"formTitle":"[965]单值二叉树","frequency":1.3914088712,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":51882,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40836254381572357,"acs":3262,"articleLive":2,"columnArticles":54,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7988,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.47105247998156574,"acs":8177,"articleLive":2,"columnArticles":165,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":17359,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.5020617612022359,"acs":27395,"articleLive":2,"columnArticles":355,"formTitle":"[968]监控二叉树","frequency":1.4234560486,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":54565,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6482323430273575,"acs":16539,"articleLive":2,"columnArticles":207,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":25514,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4128248567206142,"acs":11453,"articleLive":2,"columnArticles":129,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27743,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44464820588055504,"acs":7274,"articleLive":2,"columnArticles":113,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":16359,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40253612503686226,"acs":1365,"articleLive":2,"columnArticles":29,"formTitle":"[972]相等的有理数","frequency":0.797440042,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3391,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6424386754439183,"acs":70949,"articleLive":2,"columnArticles":660,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3605422232,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":110437,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4663057835644872,"acs":39539,"articleLive":2,"columnArticles":400,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.107756625,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":84792,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4507195221286994,"acs":3320,"articleLive":2,"columnArticles":52,"formTitle":"[975]奇偶跳","frequency":0.5185304849,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7366,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5979974618743412,"acs":55603,"articleLive":2,"columnArticles":521,"formTitle":"[976]三角形的最大周长","frequency":1.6252347774,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":92982,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7024846324031621,"acs":214961,"articleLive":2,"columnArticles":1622,"formTitle":"[977]有序数组的平方","frequency":3.1502520914,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":306001,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47333204864679684,"acs":44213,"articleLive":2,"columnArticles":607,"formTitle":"[978]最长湍流子数组","frequency":0.4365173332,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":93408,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7142290923503766,"acs":9010,"articleLive":2,"columnArticles":143,"formTitle":"[979]在二叉树中分配硬币","frequency":1.3605422232,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12615,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7348068982268642,"acs":15126,"articleLive":2,"columnArticles":228,"formTitle":"[980]不同路径 III","frequency":2.3494555946,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20585,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5305477780170866,"acs":22170,"articleLive":2,"columnArticles":319,"formTitle":"[981]基于时间的键值存储","frequency":2.5658128862,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":41787,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5504735039290751,"acs":2732,"articleLive":2,"columnArticles":32,"formTitle":"[982]按位与为零的三元组","frequency":0.5483656333,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4963,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335734597156398,"acs":33421,"articleLive":2,"columnArticles":462,"formTitle":"[983]最低票价","frequency":1.6895656358,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":52750,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41976395983794257,"acs":9532,"articleLive":2,"columnArticles":154,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":1.3605422232,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22708,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6017587030469711,"acs":16629,"articleLive":2,"columnArticles":192,"formTitle":"[985]查询后的偶数和","frequency":0.4900060181,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27634,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6820561742911656,"acs":30743,"articleLive":2,"columnArticles":289,"formTitle":"[986]区间列表的交集","frequency":1.6895656358,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":45074,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5329354456488349,"acs":24288,"articleLive":2,"columnArticles":426,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5914224804,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":45574,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.5011243815901254,"acs":10028,"articleLive":2,"columnArticles":123,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.4626968388,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":20011,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.46987704392021973,"acs":54915,"articleLive":2,"columnArticles":623,"formTitle":"[989]数组形式的整数加法","frequency":0.9996374553,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":116871,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5081866058231808,"acs":35414,"articleLive":2,"columnArticles":525,"formTitle":"[990]等式方程的可满足性","frequency":0.4900060181,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":69687,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.521383075523203,"acs":9168,"articleLive":2,"columnArticles":114,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17584,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4553327001508464,"acs":24450,"articleLive":2,"columnArticles":279,"formTitle":"[992]K 个不同整数的子数组","frequency":1.3914088712,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":53697,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.557195921416771,"acs":52952,"articleLive":2,"columnArticles":834,"formTitle":"[993]二叉树的堂兄弟节点","frequency":1.3914088712,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":95033,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5109970494724195,"acs":62521,"articleLive":2,"columnArticles":1501,"formTitle":"[994]腐烂的橘子","frequency":2.1230732056,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":122351,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.538996839087501,"acs":21997,"articleLive":2,"columnArticles":254,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.5185304849,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40811,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49450314868182305,"acs":4633,"articleLive":2,"columnArticles":96,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9369,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5360037550185656,"acs":63949,"articleLive":2,"columnArticles":686,"formTitle":"[997]找到小镇的法官","frequency":1.1718119681,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":119307,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6177733476460665,"acs":8057,"articleLive":2,"columnArticles":121,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":13042,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6911074012242626,"acs":31048,"articleLive":2,"columnArticles":579,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44925,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.41154462854088725,"acs":3850,"articleLive":2,"columnArticles":43,"formTitle":"[1000]合并石头的最低成本","frequency":1.5653366358,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9355,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2973400052673163,"acs":2258,"articleLive":2,"columnArticles":58,"formTitle":"[1001]网格照明","frequency":0.6468704038,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7594,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7313079817154622,"acs":59674,"articleLive":2,"columnArticles":630,"formTitle":"[1002]查找共用字符","frequency":2.2828752695,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":81599,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5788849347568209,"acs":12688,"articleLive":2,"columnArticles":191,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21918,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5954605922251966,"acs":72514,"articleLive":2,"columnArticles":760,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4987636499,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":121778,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5207102528434662,"acs":63636,"articleLive":2,"columnArticles":1012,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.8166467783,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":122210,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6269049384962007,"acs":44798,"articleLive":2,"columnArticles":611,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":71459,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46648999232861427,"acs":6689,"articleLive":2,"columnArticles":89,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":14339,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7217686026806347,"acs":18740,"articleLive":2,"columnArticles":242,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.594767836,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":25964,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5885934436379897,"acs":17111,"articleLive":2,"columnArticles":244,"formTitle":"[1009]十进制整数的反码","frequency":1.0291817016,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":29071,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45571666270501543,"acs":19172,"articleLive":2,"columnArticles":256,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.4626968388,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":42070,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6256128346832753,"acs":64186,"articleLive":2,"columnArticles":615,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.3307781213,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":102597,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3386458333333333,"acs":3251,"articleLive":2,"columnArticles":68,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.1962391719,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9600,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39457317766266664,"acs":48598,"articleLive":2,"columnArticles":937,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.6895656358,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":123166,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5564448997886918,"acs":43450,"articleLive":2,"columnArticles":496,"formTitle":"[1014]最佳观光组合","frequency":0.9711860341,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":78085,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35766625190100926,"acs":5174,"articleLive":2,"columnArticles":44,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.6124079997,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14466,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5844666383340417,"acs":5501,"articleLive":2,"columnArticles":88,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.5483656333,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9412,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5632390360724443,"acs":3763,"articleLive":2,"columnArticles":58,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6681,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5157331184157504,"acs":44794,"articleLive":2,"columnArticles":385,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":86855,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.6001115137998327,"acs":21526,"articleLive":2,"columnArticles":284,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.5185304849,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":35870,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5510410861745783,"acs":10877,"articleLive":2,"columnArticles":167,"formTitle":"[1020]飞地的数量","frequency":0.9437569969,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":19739,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830853871505665,"acs":59639,"articleLive":2,"columnArticles":678,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":76159,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7073195187165775,"acs":21163,"articleLive":2,"columnArticles":283,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.4626968388,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":29920,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.567365828170486,"acs":7601,"articleLive":2,"columnArticles":174,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":13397,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5558178859713493,"acs":34842,"articleLive":2,"columnArticles":397,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":62686,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7090816410125707,"acs":77899,"articleLive":2,"columnArticles":663,"formTitle":"[1025]除数博弈","frequency":0.9996374553,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":109859,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6762914075390278,"acs":10657,"articleLive":2,"columnArticles":185,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15758,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4342368564671639,"acs":14322,"articleLive":2,"columnArticles":129,"formTitle":"[1027]最长等差数列","frequency":1.4234560486,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":32982,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320892919427974,"acs":20989,"articleLive":2,"columnArticles":439,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.7958602944,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28670,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6598591286848284,"acs":17706,"articleLive":2,"columnArticles":192,"formTitle":"[1029]两地调度","frequency":0.4626968388,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26833,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7095779137319418,"acs":41406,"articleLive":2,"columnArticles":456,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.5483656333,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":58353,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5736417428725121,"acs":5332,"articleLive":2,"columnArticles":87,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":9295,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.4095129267247536,"acs":2867,"articleLive":2,"columnArticles":47,"formTitle":"[1032]字符流","frequency":1.0918686795,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":7001,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3935096903928163,"acs":11350,"articleLive":2,"columnArticles":171,"formTitle":"[1033]移动石子直到连续","frequency":0.5185304849,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28843,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.5603417586329654,"acs":28332,"articleLive":2,"columnArticles":459,"formTitle":"[1034]边界着色","frequency":1.2214294207,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":50562,"title":"边界着色","titleSlug":"coloring-a-border"},{"acceptance":0.6396854609335787,"acs":38234,"articleLive":2,"columnArticles":411,"formTitle":"[1035]不相交的线","frequency":0.4626968388,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":59770,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.30220061412487204,"acs":3543,"articleLive":2,"columnArticles":59,"formTitle":"[1036]逃离大迷宫","frequency":1.1598715277,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11724,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43936188219363576,"acs":10383,"articleLive":2,"columnArticles":134,"formTitle":"[1037]有效的回旋镖","frequency":1.4234560486,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":23632,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7955400011569388,"acs":27505,"articleLive":2,"columnArticles":343,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.9996374553,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":34574,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5578041404977901,"acs":4796,"articleLive":2,"columnArticles":65,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8598,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.522483537158984,"acs":2777,"articleLive":2,"columnArticles":32,"formTitle":"[1040]移动石子直到连续 II","frequency":0.6815479423,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5315,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4874036655657017,"acs":7526,"articleLive":2,"columnArticles":123,"formTitle":"[1041]困于环中的机器人","frequency":1.4567702553,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":15441,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5339963199859808,"acs":12189,"articleLive":2,"columnArticles":160,"formTitle":"[1042]不邻接植花","frequency":0.4900060181,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22826,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.692230155396892,"acs":8241,"articleLive":2,"columnArticles":104,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.3914088712,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11905,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.6411558789209967,"acs":9341,"articleLive":2,"columnArticles":117,"formTitle":"[1045]买下所有产品的客户","frequency":0.4626968388,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":14569,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6589833318872854,"acs":68357,"articleLive":2,"columnArticles":954,"formTitle":"[1046]最后一块石头的重量","frequency":0.9711860341,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":103731,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7242876543363692,"acs":116267,"articleLive":2,"columnArticles":1035,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.5286523063,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":160526,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.46395921978346044,"acs":11013,"articleLive":2,"columnArticles":157,"formTitle":"[1048]最长字符串链","frequency":2.6586438723,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":23737,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6508782936010038,"acs":47725,"articleLive":2,"columnArticles":443,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.9711860341,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":73324,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7605412589102332,"acs":12590,"articleLive":2,"columnArticles":60,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.3605422232,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":16554,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7562610970937296,"acs":32371,"articleLive":2,"columnArticles":385,"formTitle":"[1051]高度检查器","frequency":0.9711860341,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":42804,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5801952580195258,"acs":49920,"articleLive":2,"columnArticles":773,"formTitle":"[1052]爱生气的书店老板","frequency":1.0918686795,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":86040,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45969482694454783,"acs":6176,"articleLive":2,"columnArticles":98,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13435,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.38204838345014697,"acs":8449,"articleLive":2,"columnArticles":112,"formTitle":"[1054]距离相等的条形码","frequency":0.4626968388,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":22115,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5944556226246367,"acs":5318,"articleLive":2,"columnArticles":98,"formTitle":"[1055]形成字符串的最短路径","frequency":1.0918686795,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":8946,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4178633975481611,"acs":3579,"articleLive":2,"columnArticles":70,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8565,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4712474196402241,"acs":3196,"articleLive":2,"columnArticles":42,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6782,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3474178403755869,"acs":1406,"articleLive":2,"columnArticles":37,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":4047,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36511976047904193,"acs":2439,"articleLive":2,"columnArticles":40,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6680,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5293886377039513,"acs":5386,"articleLive":2,"columnArticles":80,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":10174,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6090492076730609,"acs":2921,"articleLive":2,"columnArticles":64,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4796,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5458431603773585,"acs":3703,"articleLive":2,"columnArticles":52,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6784,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.715057636887608,"acs":1985,"articleLive":2,"columnArticles":43,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2776,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6489129036408079,"acs":5044,"articleLive":2,"columnArticles":72,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7773,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5427323767935122,"acs":2610,"articleLive":2,"columnArticles":73,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4809,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47729741472952425,"acs":2197,"articleLive":2,"columnArticles":43,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4603,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.417027417027417,"acs":867,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2079,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8666015744187465,"acs":14201,"articleLive":2,"columnArticles":69,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":16387,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8186014935505771,"acs":12058,"articleLive":2,"columnArticles":60,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14730,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.47928994082840237,"acs":8586,"articleLive":2,"columnArticles":76,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":17914,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5875472198290145,"acs":35462,"articleLive":2,"columnArticles":683,"formTitle":"[1071]字符串的最大公因子","frequency":0.9711860341,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":60356,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5888049901510177,"acs":3587,"articleLive":2,"columnArticles":59,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":6092,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3410246382479468,"acs":2616,"articleLive":2,"columnArticles":56,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7671,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687212185618137,"acs":18878,"articleLive":2,"columnArticles":194,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":28230,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6942751126424596,"acs":10478,"articleLive":2,"columnArticles":78,"formTitle":"[1075]项目员工 I","frequency":0.4365173332,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":15092,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49417249417249415,"acs":11236,"articleLive":2,"columnArticles":94,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":22737,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7226084660741001,"acs":8211,"articleLive":2,"columnArticles":91,"formTitle":"[1077]项目员工 III","frequency":0.4626968388,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":11363,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6196916956737941,"acs":12462,"articleLive":2,"columnArticles":196,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":20110,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7368356675432696,"acs":12048,"articleLive":2,"columnArticles":199,"formTitle":"[1079]活字印刷","frequency":0.5185304849,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":16351,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4965643117887052,"acs":4625,"articleLive":2,"columnArticles":102,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":9314,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5724105832229422,"acs":15988,"articleLive":2,"columnArticles":161,"formTitle":"[1081]不同字符的最小子序列","frequency":1.6252347774,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":27931,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7606389464699427,"acs":12476,"articleLive":2,"columnArticles":99,"formTitle":"[1082]销售分析 I ","frequency":1.0598966468,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":16402,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278894358881713,"acs":11688,"articleLive":2,"columnArticles":109,"formTitle":"[1083]销售分析 II","frequency":1.4567702553,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":22141,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5359571004500623,"acs":11194,"articleLive":2,"columnArticles":105,"formTitle":"[1084]销售分析III","frequency":0.4626968388,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":20886,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7717081125152874,"acs":3786,"articleLive":2,"columnArticles":75,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4906,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6857801100729554,"acs":5358,"articleLive":2,"columnArticles":85,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7813,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5387618516452872,"acs":1932,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3586,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4566022213081037,"acs":1110,"articleLive":2,"columnArticles":36,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2431,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5839925150973888,"acs":20598,"articleLive":2,"columnArticles":306,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":35271,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5525089844269933,"acs":4151,"articleLive":2,"columnArticles":86,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7513,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3799593022571956,"acs":32303,"articleLive":2,"columnArticles":327,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.4669442299,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":85017,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.49350199272223183,"acs":2848,"articleLive":2,"columnArticles":56,"formTitle":"[1092]最短公共超序列","frequency":1.8745249135,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5771,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37039841014479036,"acs":3914,"articleLive":2,"columnArticles":63,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10567,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.5928449744463373,"acs":31320,"articleLive":2,"columnArticles":438,"formTitle":"[1094]拼车","frequency":2.2512895408,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":52830,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37251712483507743,"acs":20611,"articleLive":2,"columnArticles":397,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":55329,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5466998754669987,"acs":1756,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3212,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5221835251362811,"acs":6897,"articleLive":2,"columnArticles":123,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9340106329,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":13208,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47473200612557426,"acs":8060,"articleLive":2,"columnArticles":107,"formTitle":"[1098]小众书籍","frequency":0.5483656333,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":16978,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5857988165680473,"acs":5346,"articleLive":2,"columnArticles":99,"formTitle":"[1099]小于 K 的两数之和","frequency":0.4365173332,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":9126,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6984146491335873,"acs":5683,"articleLive":2,"columnArticles":115,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0598966468,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":8137,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6741164241164241,"acs":2594,"articleLive":2,"columnArticles":64,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3848,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.37463622841621935,"acs":5793,"articleLive":2,"columnArticles":70,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":15463,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6372009611031793,"acs":36597,"articleLive":2,"columnArticles":1119,"formTitle":"[1103]分糖果 II","frequency":1.3914088712,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":57434,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7605556713928273,"acs":29181,"articleLive":2,"columnArticles":685,"formTitle":"[1104]二叉树寻路","frequency":2.2207434884,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":38368,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5618094642484887,"acs":5390,"articleLive":2,"columnArticles":71,"formTitle":"[1105]填充书架","frequency":1.1962391719,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9594,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5814408770555991,"acs":4455,"articleLive":2,"columnArticles":131,"formTitle":"[1106]解析布尔表达式","frequency":0.8430683946,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7662,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41169271847360517,"acs":7401,"articleLive":2,"columnArticles":98,"formTitle":"[1107]每日新用户统计","frequency":1.0918686795,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":17977,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8388425758124924,"acs":69431,"articleLive":2,"columnArticles":703,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":82770,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5833625639226836,"acs":63198,"articleLive":2,"columnArticles":623,"formTitle":"[1109]航班预订统计","frequency":2.5316938562,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":108334,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6301503412181231,"acs":12281,"articleLive":2,"columnArticles":222,"formTitle":"[1110]删点成林","frequency":0.9996374553,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":19489,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713584442556405,"acs":24513,"articleLive":2,"columnArticles":405,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.5653366358,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31779,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6470634360542618,"acs":8252,"articleLive":2,"columnArticles":96,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12753,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5400582924575247,"acs":7597,"articleLive":2,"columnArticles":53,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":14067,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6535472851059735,"acs":81498,"articleLive":2,"columnArticles":600,"formTitle":"[1114]按序打印","frequency":3.2253268274,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":124701,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5613935807693727,"acs":45634,"articleLive":2,"columnArticles":493,"formTitle":"[1115]交替打印 FooBar","frequency":0.9996374553,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":81287,"title":"交替打印 FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5212165755171743,"acs":24112,"articleLive":2,"columnArticles":381,"formTitle":"[1116]打印零与奇偶数","frequency":2.5658128862,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":46261,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.523508731814674,"acs":18316,"articleLive":2,"columnArticles":261,"formTitle":"[1117]H2O 生成","frequency":1.8343265753,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":34987,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.635725037631711,"acs":2534,"articleLive":2,"columnArticles":42,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3986,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8671977412523949,"acs":8600,"articleLive":2,"columnArticles":152,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9917,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6159056150316802,"acs":2819,"articleLive":2,"columnArticles":52,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4577,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5712861415752741,"acs":1146,"articleLive":2,"columnArticles":20,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":2006,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7068496589815474,"acs":67572,"articleLive":2,"columnArticles":900,"formTitle":"[1122]数组的相对排序","frequency":1.9759656084,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":95596,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7051911468812877,"acs":8762,"articleLive":2,"columnArticles":115,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.4900060181,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":12425,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3212410948631421,"acs":13708,"articleLive":2,"columnArticles":148,"formTitle":"[1124]表现良好的最长时间段","frequency":0.4900060181,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":42672,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4926889333538556,"acs":3201,"articleLive":2,"columnArticles":52,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6497,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6902700474129045,"acs":6697,"articleLive":2,"columnArticles":99,"formTitle":"[1126]查询活跃业务","frequency":0.4365173332,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9702,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.42424242424242425,"acs":4452,"articleLive":2,"columnArticles":78,"formTitle":"[1127]用户购买平台","frequency":1.1962391719,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":10494,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449384100153796,"acs":37913,"articleLive":2,"columnArticles":488,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.9996374553,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":69573,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3839539882646837,"acs":6609,"articleLive":2,"columnArticles":121,"formTitle":"[1129]颜色交替的最短路径","frequency":1.1251939893,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":17213,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6319312618643221,"acs":6325,"articleLive":2,"columnArticles":114,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.4900060181,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":10009,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45811076750070284,"acs":3259,"articleLive":2,"columnArticles":49,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":7114,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39206420642064205,"acs":5227,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.6124079997,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":13332,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6440989977500511,"acs":3149,"articleLive":2,"columnArticles":68,"formTitle":"[1133]最大唯一数","frequency":0.4900060181,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4889,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7724425887265136,"acs":3330,"articleLive":2,"columnArticles":56,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4311,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5408420570031329,"acs":7078,"articleLive":2,"columnArticles":79,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4900060181,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":13087,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.574901680371827,"acs":3216,"articleLive":2,"columnArticles":56,"formTitle":"[1136]平行课程","frequency":0.5185304849,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5594,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6095559317451837,"acs":94700,"articleLive":2,"columnArticles":962,"formTitle":"[1137]第 N 个泰波那契数","frequency":2.1513032897,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":155359,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43620759562102984,"acs":6455,"articleLive":2,"columnArticles":144,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14798,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.48111370716510904,"acs":9884,"articleLive":2,"columnArticles":158,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":1.6895656358,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20544,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6515758790307888,"acs":7153,"articleLive":2,"columnArticles":99,"formTitle":"[1140]石子游戏 II","frequency":0.9996374553,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10978,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5086340751893851,"acs":10810,"articleLive":2,"columnArticles":70,"formTitle":"[1141]查询近30天活跃用户数","frequency":1.0291817016,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":21253,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3721756290083868,"acs":7544,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":20270,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6384412642705836,"acs":182644,"articleLive":2,"columnArticles":1213,"formTitle":"[1143]最长公共子序列","frequency":3.2335776993,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":286078,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44294125015658276,"acs":10608,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.5796181768,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23949,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4696806360328797,"acs":6971,"articleLive":2,"columnArticles":110,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14842,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.29086809470124014,"acs":4644,"articleLive":2,"columnArticles":67,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15966,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5617819760020424,"acs":4401,"articleLive":2,"columnArticles":88,"formTitle":"[1147]段式回文","frequency":2.107756625,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7834,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7119414289320879,"acs":8460,"articleLive":2,"columnArticles":38,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11883,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44250636322802817,"acs":5911,"articleLive":2,"columnArticles":49,"formTitle":"[1149]文章浏览 II","frequency":0.4900060181,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":13358,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.5999293369450006,"acs":5094,"articleLive":2,"columnArticles":90,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":1.0291817016,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8491,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4959796437659033,"acs":4873,"articleLive":2,"columnArticles":74,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":1.0291817016,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9825,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.39044438736193166,"acs":1520,"articleLive":2,"columnArticles":37,"formTitle":"[1152]用户网站访问行为分析","frequency":0.5796181768,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3893,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.36924047969703344,"acs":1755,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4753,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.6501618122977346,"acs":44198,"articleLive":2,"columnArticles":530,"formTitle":"[1154]一年中的第几天","frequency":1.3196088143,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":67980,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4803802315628238,"acs":10663,"articleLive":2,"columnArticles":135,"formTitle":"[1155]掷骰子的N种方法","frequency":1.4914477937,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":22197,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43153964775586395,"acs":5317,"articleLive":2,"columnArticles":97,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.4900060181,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":12321,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.322606436138317,"acs":3228,"articleLive":2,"columnArticles":49,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":10006,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.551528464213802,"acs":6026,"articleLive":2,"columnArticles":64,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":10926,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4931649675625579,"acs":4257,"articleLive":2,"columnArticles":89,"formTitle":"[1159]市场分析 II","frequency":1.0598966468,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8632,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6872805833108291,"acs":61080,"articleLive":2,"columnArticles":928,"formTitle":"[1160]拼写单词","frequency":1.3605422232,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":88872,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.632980229989237,"acs":11174,"articleLive":2,"columnArticles":183,"formTitle":"[1161]最大层内元素和","frequency":1.0291817016,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17653,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4710633208199614,"acs":39778,"articleLive":2,"columnArticles":504,"formTitle":"[1162]地图分析","frequency":0.4365173332,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":84443,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26773187840997664,"acs":6183,"articleLive":2,"columnArticles":106,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":23094,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6094565847998453,"acs":6303,"articleLive":2,"columnArticles":91,"formTitle":"[1164]指定日期的产品价格","frequency":1.4234560486,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":10342,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8355536608760524,"acs":7840,"articleLive":2,"columnArticles":120,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9383,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4771118452100047,"acs":3033,"articleLive":2,"columnArticles":53,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":6357,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.44762897342365815,"acs":2577,"articleLive":2,"columnArticles":39,"formTitle":"[1167]连接棒材的最低费用","frequency":0.4900060181,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5757,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5676296782665792,"acs":1729,"articleLive":2,"columnArticles":32,"formTitle":"[1168]水资源分配优化","frequency":0.8430683946,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":3046,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32257175660160736,"acs":7024,"articleLive":2,"columnArticles":83,"formTitle":"[1169]查询无效交易","frequency":0.5185304849,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21775,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6160550056932644,"acs":14067,"articleLive":2,"columnArticles":224,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.5185304849,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22834,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47601014487718446,"acs":13701,"articleLive":2,"columnArticles":166,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":2.0729826067,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":28783,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2639293243650236,"acs":2629,"articleLive":2,"columnArticles":59,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9961,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.754673495518566,"acs":8841,"articleLive":2,"columnArticles":81,"formTitle":"[1173]即时食物配送 I","frequency":0.4626968388,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11715,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.621800069500753,"acs":5368,"articleLive":2,"columnArticles":67,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8633,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49080100125156445,"acs":7843,"articleLive":2,"columnArticles":123,"formTitle":"[1175]质数排列","frequency":1.0291817016,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":15980,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4543190196273787,"acs":4560,"articleLive":2,"columnArticles":70,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":10037,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2693280499114746,"acs":6389,"articleLive":2,"columnArticles":98,"formTitle":"[1177]构建回文串检测","frequency":1.1251939893,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23722,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4626195732155997,"acs":18861,"articleLive":2,"columnArticles":185,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40770,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6370165852528334,"acs":32993,"articleLive":2,"columnArticles":197,"formTitle":"[1179]重新格式化部门表","frequency":2.3966341549,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":51793,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.774768353528154,"acs":3261,"articleLive":2,"columnArticles":76,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4209,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3730004847309743,"acs":1539,"articleLive":2,"columnArticles":30,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4126,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.4173641884129329,"acs":2543,"articleLive":2,"columnArticles":45,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":6093,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5890052356020943,"acs":675,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1146,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5836448209984217,"acs":14053,"articleLive":2,"columnArticles":275,"formTitle":"[1184]公交站间的距离","frequency":0.4626968388,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":24078,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6027301365068254,"acs":12054,"articleLive":2,"columnArticles":221,"formTitle":"[1185]一周中的第几天","frequency":0.4365173332,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":19999,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39762865792129165,"acs":7881,"articleLive":2,"columnArticles":115,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.0291817016,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19820,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44379627552165135,"acs":1978,"articleLive":2,"columnArticles":35,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4457,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6992760712189395,"acs":3574,"articleLive":2,"columnArticles":68,"formTitle":"[1188]设计有限阻塞队列","frequency":1.407279701,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":5111,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.645549507135501,"acs":21939,"articleLive":2,"columnArticles":345,"formTitle":"[1189]“气球” 的最大数量","frequency":1.0291817016,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":33985,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.650686174594089,"acs":46608,"articleLive":2,"columnArticles":626,"formTitle":"[1190]反转每对括号间的子串","frequency":2.1439007835,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":71629,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2663087824779901,"acs":6201,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":23285,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5016174250593056,"acs":4652,"articleLive":2,"columnArticles":54,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":9274,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6042881138227448,"acs":6116,"articleLive":2,"columnArticles":76,"formTitle":"[1193]每月交易 I","frequency":0.5796181768,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":10121,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5131717597471022,"acs":3896,"articleLive":2,"columnArticles":67,"formTitle":"[1194]锦标赛优胜者","frequency":0.4365173332,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7592,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6379706251895498,"acs":14725,"articleLive":2,"columnArticles":284,"formTitle":"[1195]交替打印字符串","frequency":1.9759656084,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":23081,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6875232083178611,"acs":3703,"articleLive":2,"columnArticles":62,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.5483656333,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5386,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3748653500897666,"acs":5220,"articleLive":2,"columnArticles":63,"formTitle":"[1197]进击的骑士","frequency":0.5185304849,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13925,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.740236148955495,"acs":4075,"articleLive":2,"columnArticles":63,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5505,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43746462931522356,"acs":773,"articleLive":2,"columnArticles":19,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1767,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6840225156960381,"acs":18957,"articleLive":2,"columnArticles":269,"formTitle":"[1200]最小绝对差","frequency":1.3914088712,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":27714,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2501262871575675,"acs":6437,"articleLive":2,"columnArticles":90,"formTitle":"[1201]丑数 III","frequency":1.9340106329,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":25735,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032150512026673,"acs":27469,"articleLive":2,"columnArticles":302,"formTitle":"[1202]交换字符串中的元素","frequency":0.4900060181,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":54587,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6189206860131771,"acs":12306,"articleLive":2,"columnArticles":146,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19883,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7297946439293863,"acs":6077,"articleLive":2,"columnArticles":85,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":8327,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46787293928427826,"acs":5818,"articleLive":2,"columnArticles":87,"formTitle":"[1205]每月交易II","frequency":0.5483656333,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":12435,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6143358005453837,"acs":7885,"articleLive":2,"columnArticles":98,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12835,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7297036657816722,"acs":61290,"articleLive":2,"columnArticles":848,"formTitle":"[1207]独一无二的出现次数","frequency":1.6252347774,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":83993,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4972126887138691,"acs":50126,"articleLive":2,"columnArticles":632,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":100814,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5237235791922352,"acs":13058,"articleLive":2,"columnArticles":166,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.4900060181,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":24933,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4527215918434468,"acs":2753,"articleLive":2,"columnArticles":56,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.797440042,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":6081,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6590482409599216,"acs":8074,"articleLive":2,"columnArticles":65,"formTitle":"[1211]查询结果的质量和占比","frequency":0.4113903831,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":12251,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5143389199255121,"acs":5524,"articleLive":2,"columnArticles":104,"formTitle":"[1212]查询球队积分","frequency":0.4900060181,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10740,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7761267954432888,"acs":6268,"articleLive":2,"columnArticles":134,"formTitle":"[1213]三个有序数组的交集","frequency":0.4900060181,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":8076,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6384200452409953,"acs":3669,"articleLive":2,"columnArticles":75,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.5483656333,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5747,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4128757108042242,"acs":2033,"articleLive":2,"columnArticles":43,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4924,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5392388009430785,"acs":1601,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2969,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.695889009269291,"acs":23123,"articleLive":2,"columnArticles":371,"formTitle":"[1217]玩筹码","frequency":0.9711860341,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":33228,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.514326587869276,"acs":37031,"articleLive":2,"columnArticles":357,"formTitle":"[1218]最长定差子序列","frequency":2.826879292,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":71999,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6298201773727277,"acs":12854,"articleLive":2,"columnArticles":182,"formTitle":"[1219]黄金矿工","frequency":1.3605422232,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":20409,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5289095847885138,"acs":4089,"articleLive":2,"columnArticles":79,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7731,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439688883159296,"acs":78560,"articleLive":2,"columnArticles":1135,"formTitle":"[1221]分割平衡字符串","frequency":2.5316938562,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":93084,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6754823325384782,"acs":6232,"articleLive":2,"columnArticles":136,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.5185304849,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":9226,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4762942779291553,"acs":3496,"articleLive":2,"columnArticles":60,"formTitle":"[1223]掷骰子模拟","frequency":0.8430683946,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7340,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3258178898775674,"acs":4870,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.2742818789,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14947,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5403781327861644,"acs":3687,"articleLive":2,"columnArticles":86,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.9996374553,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6823,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.594077232883203,"acs":12538,"articleLive":2,"columnArticles":140,"formTitle":"[1226]哲学家进餐","frequency":2.1870248524,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":21105,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6643904272647538,"acs":10605,"articleLive":2,"columnArticles":167,"formTitle":"[1227]飞机座位分配概率","frequency":1.0291817016,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15962,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5378686327077749,"acs":3210,"articleLive":2,"columnArticles":57,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5968,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.43373669631141565,"acs":2975,"articleLive":2,"columnArticles":54,"formTitle":"[1229]安排会议日程","frequency":0.4626968388,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":6859,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.5009087096323221,"acs":3583,"articleLive":2,"columnArticles":70,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":7153,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5702335858585859,"acs":3613,"articleLive":2,"columnArticles":50,"formTitle":"[1231]分享巧克力","frequency":0.4900060181,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":6336,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46895115744205984,"acs":34459,"articleLive":2,"columnArticles":428,"formTitle":"[1232]缀点成线","frequency":0.4626968388,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":73481,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4860050890585242,"acs":8595,"articleLive":2,"columnArticles":123,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17685,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3473981087208981,"acs":6282,"articleLive":2,"columnArticles":97,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.6568080393,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":18083,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4673984487971605,"acs":7111,"articleLive":2,"columnArticles":124,"formTitle":"[1235]规划兼职工作","frequency":1.8745249135,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":15214,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5702554744525548,"acs":1250,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2192,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7115925138822239,"acs":10380,"articleLive":2,"columnArticles":138,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14587,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6632344033918837,"acs":3285,"articleLive":2,"columnArticles":77,"formTitle":"[1238]循环码排列","frequency":0.6468704038,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4953,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49144493234407477,"acs":35702,"articleLive":2,"columnArticles":390,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":72647,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49668995954394995,"acs":2701,"articleLive":2,"columnArticles":41,"formTitle":"[1240]铺瓷砖","frequency":1.407279701,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5438,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5932000683410217,"acs":6944,"articleLive":2,"columnArticles":69,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11706,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4698379869010686,"acs":1363,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9437569969,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2901,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5384462547188555,"acs":2710,"articleLive":2,"columnArticles":62,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":5033,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6244630341397241,"acs":2762,"articleLive":2,"columnArticles":46,"formTitle":"[1244]力扣排行榜","frequency":0.5483656333,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4423,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5119500271591526,"acs":3770,"articleLive":2,"columnArticles":69,"formTitle":"[1245]树的直径","frequency":0.6124079997,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7364,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4809135920779428,"acs":3011,"articleLive":2,"columnArticles":43,"formTitle":"[1246]删除回文子数组","frequency":0.8430683946,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6261,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6214477915600184,"acs":9469,"articleLive":2,"columnArticles":163,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":15237,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5623409669211196,"acs":36686,"articleLive":2,"columnArticles":495,"formTitle":"[1248]统计「优美子数组」","frequency":1.4234560486,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":65238,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5783280764154531,"acs":25853,"articleLive":2,"columnArticles":358,"formTitle":"[1249]移除无效的括号","frequency":0.9996374553,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":44703,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5668863900736719,"acs":2924,"articleLive":2,"columnArticles":41,"formTitle":"[1250]检查「好数组」","frequency":0.5483656333,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":5158,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7717886832931081,"acs":8634,"articleLive":2,"columnArticles":101,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":11187,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7488435702505933,"acs":18617,"articleLive":2,"columnArticles":329,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24861,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39491817398794143,"acs":5502,"articleLive":2,"columnArticles":85,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13932,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6054382620580513,"acs":16833,"articleLive":2,"columnArticles":262,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.4113903831,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":27803,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6875135252109933,"acs":3177,"articleLive":2,"columnArticles":70,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4621,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6661143330571665,"acs":1608,"articleLive":2,"columnArticles":40,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2414,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5679267572356763,"acs":1923,"articleLive":2,"columnArticles":44,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3386,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5581593523647209,"acs":1310,"articleLive":2,"columnArticles":47,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2347,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4839390386869871,"acs":2064,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4265,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6037676183592339,"acs":13365,"articleLive":2,"columnArticles":266,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":22136,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7300602778020442,"acs":8357,"articleLive":2,"columnArticles":114,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11447,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5286238120182594,"acs":14128,"articleLive":2,"columnArticles":205,"formTitle":"[1262]可被三整除的最大和","frequency":1.4567702553,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":26726,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.42642822851656265,"acs":3553,"articleLive":2,"columnArticles":64,"formTitle":"[1263]推箱子","frequency":1.1962391719,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":8332,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5676977416247458,"acs":5304,"articleLive":2,"columnArticles":90,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":9343,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9185298621745789,"acs":2999,"articleLive":2,"columnArticles":76,"formTitle":"[1265]逆序打印不可变链表","frequency":0.6468704038,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3265,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8244988382774086,"acs":30518,"articleLive":2,"columnArticles":462,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":37014,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6087978716822372,"acs":9840,"articleLive":2,"columnArticles":154,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":16163,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5872058336095459,"acs":8858,"articleLive":2,"columnArticles":152,"formTitle":"[1268]搜索推荐系统","frequency":0.9996374553,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":15085,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4909114369123079,"acs":30437,"articleLive":2,"columnArticles":324,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":62001,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.803921568627451,"acs":6437,"articleLive":2,"columnArticles":88,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":8007,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.509313038253555,"acs":2543,"articleLive":2,"columnArticles":46,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4993,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5252679938744257,"acs":1715,"articleLive":2,"columnArticles":34,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3265,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5455442288720815,"acs":1659,"articleLive":2,"columnArticles":49,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":3041,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.608259587020649,"acs":1031,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1695,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5454026270702456,"acs":8595,"articleLive":2,"columnArticles":176,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.4113903831,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15759,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5037388021026135,"acs":6804,"articleLive":2,"columnArticles":101,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13507,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7280300321773329,"acs":20363,"articleLive":2,"columnArticles":250,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.6568080393,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":27970,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.603206106870229,"acs":3951,"articleLive":2,"columnArticles":60,"formTitle":"[1278]分割回文串 III","frequency":1.5653366358,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6550,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6250925240562546,"acs":1689,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2702,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.50539912520503,"acs":7395,"articleLive":2,"columnArticles":75,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":14632,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831294223018361,"acs":46407,"articleLive":2,"columnArticles":631,"formTitle":"[1281]整数的各位积和之差","frequency":1.0291817016,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55825,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8108563932787807,"acs":12981,"articleLive":2,"columnArticles":243,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":16009,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.42045454545454547,"acs":7548,"articleLive":2,"columnArticles":104,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.5185304849,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17952,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6670734683915059,"acs":2733,"articleLive":2,"columnArticles":62,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.797440042,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4097,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8137535816618912,"acs":4828,"articleLive":2,"columnArticles":66,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5933,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6508098456829486,"acs":5103,"articleLive":2,"columnArticles":101,"formTitle":"[1286]字母组合迭代器","frequency":0.5483656333,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7841,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6017173051519155,"acs":16398,"articleLive":2,"columnArticles":228,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":1.0291817016,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":27252,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5650188377668683,"acs":14847,"articleLive":2,"columnArticles":181,"formTitle":"[1288]删除被覆盖区间","frequency":1.4234560486,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":26277,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6235785953177257,"acs":7458,"articleLive":2,"columnArticles":109,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":11960,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8076582621855458,"acs":56570,"articleLive":2,"columnArticles":732,"formTitle":"[1290]二进制链表转整数","frequency":0.4365173332,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":70042,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5200919284072707,"acs":7468,"articleLive":2,"columnArticles":167,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":14359,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4759806081974438,"acs":6480,"articleLive":2,"columnArticles":100,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13614,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36488963664214147,"acs":14531,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.6586438723,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":39823,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6548367645792058,"acs":7602,"articleLive":2,"columnArticles":81,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11609,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8080836168542267,"acs":49403,"articleLive":2,"columnArticles":656,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.4626968388,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":61136,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45417789757412397,"acs":8088,"articleLive":2,"columnArticles":130,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17808,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.46154360620652757,"acs":6901,"articleLive":2,"columnArticles":96,"formTitle":"[1297]子串的最大出现次数","frequency":1.0598966468,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14952,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5907036797934151,"acs":2745,"articleLive":2,"columnArticles":96,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4647,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7876786027075044,"acs":31478,"articleLive":2,"columnArticles":447,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":39963,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4647792129768699,"acs":24756,"articleLive":2,"columnArticles":375,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.5185304849,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":53264,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36052186037247286,"acs":3620,"articleLive":2,"columnArticles":87,"formTitle":"[1301]最大得分的路径数目","frequency":0.4626968388,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":10041,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8207425877586005,"acs":21066,"articleLive":2,"columnArticles":311,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.9996374553,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":25667,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8230012087722328,"acs":9532,"articleLive":2,"columnArticles":89,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11582,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7233543086303023,"acs":22186,"articleLive":2,"columnArticles":399,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":30671,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7486846471062236,"acs":15795,"articleLive":2,"columnArticles":237,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.4900060181,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":21097,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5760341754256562,"acs":18743,"articleLive":2,"columnArticles":289,"formTitle":"[1306]跳跃游戏 III","frequency":0.9711860341,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":32538,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33060299756012546,"acs":1897,"articleLive":2,"columnArticles":58,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5738,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7522863862032924,"acs":5758,"articleLive":2,"columnArticles":63,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7654,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7543092134044973,"acs":17242,"articleLive":2,"columnArticles":300,"formTitle":"[1309]解码字母到整数映射","frequency":0.4626968388,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22858,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7143643681652491,"acs":37627,"articleLive":2,"columnArticles":506,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52672,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3830703012912482,"acs":5874,"articleLive":2,"columnArticles":90,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":15334,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6691586635229168,"acs":11636,"articleLive":2,"columnArticles":156,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.5185304849,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":17389,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8328195619422877,"acs":35932,"articleLive":2,"columnArticles":552,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":43145,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7479141835518475,"acs":13805,"articleLive":2,"columnArticles":222,"formTitle":"[1314]矩阵区域和","frequency":1.7235940976,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":18458,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8112170973194881,"acs":13437,"articleLive":2,"columnArticles":279,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16564,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4415681580128685,"acs":2951,"articleLive":2,"columnArticles":63,"formTitle":"[1316]不同的循环子字符串","frequency":0.6815479423,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6683,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6169979832901181,"acs":10708,"articleLive":2,"columnArticles":203,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":17355,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6577036310107949,"acs":6702,"articleLive":2,"columnArticles":123,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.1251939893,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":10190,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6181731229076997,"acs":32315,"articleLive":2,"columnArticles":522,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":52275,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5934090909090909,"acs":2611,"articleLive":2,"columnArticles":62,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4400,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.618200435172149,"acs":4830,"articleLive":2,"columnArticles":88,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.5185304849,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7813,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5956490654682872,"acs":5832,"articleLive":2,"columnArticles":67,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9791,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7536506456031945,"acs":25857,"articleLive":2,"columnArticles":501,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.4113903831,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":34309,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5900122722552629,"acs":6250,"articleLive":2,"columnArticles":125,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10593,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7289310232101994,"acs":11149,"articleLive":2,"columnArticles":195,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":15295,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47337049078804766,"acs":6115,"articleLive":2,"columnArticles":97,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12918,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.689714879372042,"acs":5975,"articleLive":2,"columnArticles":56,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8663,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.466215210596815,"acs":6265,"articleLive":2,"columnArticles":125,"formTitle":"[1328]破坏回文串","frequency":0.4900060181,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13438,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7710641856575371,"acs":7376,"articleLive":2,"columnArticles":168,"formTitle":"[1329]将矩阵按对角线排序","frequency":1.0291817016,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9566,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.38403990024937656,"acs":1232,"articleLive":2,"columnArticles":32,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.9996374553,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3208,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5325174387034793,"acs":12749,"articleLive":2,"columnArticles":219,"formTitle":"[1331]数组序号转换","frequency":1.4234560486,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":23941,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6910686133388169,"acs":10082,"articleLive":2,"columnArticles":141,"formTitle":"[1332]删除回文子序列","frequency":0.4365173332,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14589,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5489695422214116,"acs":6020,"articleLive":2,"columnArticles":126,"formTitle":"[1333]餐厅过滤器","frequency":1.1251939893,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10966,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.49811532600850106,"acs":6211,"articleLive":2,"columnArticles":97,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":1.5275963078,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":12469,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5891764705882353,"acs":3756,"articleLive":2,"columnArticles":61,"formTitle":"[1335]工作计划的最低难度","frequency":0.5483656333,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6375,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4325027085590466,"acs":1996,"articleLive":2,"columnArticles":50,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4615,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7043948899080956,"acs":40085,"articleLive":2,"columnArticles":645,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.2207434884,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":56907,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6399919775371039,"acs":9573,"articleLive":2,"columnArticles":143,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14958,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.401893716304988,"acs":8871,"articleLive":2,"columnArticles":142,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.4626968388,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":22073,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5746083063914449,"acs":4621,"articleLive":2,"columnArticles":100,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":8042,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4398360260429226,"acs":3648,"articleLive":2,"columnArticles":51,"formTitle":"[1341]电影评分","frequency":0.4900060181,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":8294,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8189029918404351,"acs":43356,"articleLive":2,"columnArticles":651,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.4626968388,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":52944,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5483817701453104,"acs":13284,"articleLive":2,"columnArticles":226,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":24224,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5965023559260602,"acs":6583,"articleLive":2,"columnArticles":124,"formTitle":"[1344]时钟指针的夹角","frequency":1.0291817016,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":11036,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3639249808924687,"acs":6190,"articleLive":2,"columnArticles":115,"formTitle":"[1345]跳跃游戏 IV","frequency":0.5796181768,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":17009,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4332350301320682,"acs":16894,"articleLive":2,"columnArticles":287,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":38995,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7435828637867812,"acs":8314,"articleLive":2,"columnArticles":128,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":11181,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.31068130336295524,"acs":3566,"articleLive":2,"columnArticles":58,"formTitle":"[1348]推文计数","frequency":1.4234560486,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11478,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5063765941485371,"acs":3375,"articleLive":2,"columnArticles":99,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6665,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8464522232734153,"acs":8947,"articleLive":2,"columnArticles":89,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10570,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7534899474995767,"acs":31144,"articleLive":2,"columnArticles":567,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.4626968388,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":41333,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4493499968598882,"acs":7155,"articleLive":2,"columnArticles":80,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15923,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28638738570628847,"acs":12278,"articleLive":2,"columnArticles":162,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.8995387239,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":42872,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2818097014925373,"acs":3021,"articleLive":2,"columnArticles":74,"formTitle":"[1354]多次求和构造目标数组","frequency":0.7198374588,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10720,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6634359856182586,"acs":4244,"articleLive":2,"columnArticles":63,"formTitle":"[1355]活动参与者","frequency":0.5483656333,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6397,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7307140182249408,"acs":46830,"articleLive":2,"columnArticles":523,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":1.0291817016,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":64088,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5321285140562249,"acs":4505,"articleLive":2,"columnArticles":45,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.4365173332,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":8466,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4962400186060935,"acs":6401,"articleLive":2,"columnArticles":121,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12899,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5550433339479993,"acs":3010,"articleLive":2,"columnArticles":73,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5423,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5069677774717709,"acs":9204,"articleLive":2,"columnArticles":150,"formTitle":"[1360]日期之间隔几天","frequency":1.3307781213,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":18155,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.3998212867355044,"acs":8054,"articleLive":2,"columnArticles":213,"formTitle":"[1361]验证二叉树","frequency":0.4626968388,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":20144,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5303684645777819,"acs":5772,"articleLive":2,"columnArticles":74,"formTitle":"[1362]最接近的因数","frequency":0.5483656333,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10883,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3679472201223284,"acs":5354,"articleLive":2,"columnArticles":102,"formTitle":"[1363]形成三的最大倍数","frequency":0.5796181768,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14551,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6837881219903692,"acs":3834,"articleLive":2,"columnArticles":71,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5607,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8246529246444652,"acs":87734,"articleLive":2,"columnArticles":1111,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.4900060181,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":106389,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5406311493331389,"acs":7418,"articleLive":2,"columnArticles":144,"formTitle":"[1366]通过投票对团队排名","frequency":0.4626968388,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13721,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4191815452678148,"acs":15918,"articleLive":2,"columnArticles":233,"formTitle":"[1367]二叉树中的列表","frequency":0.4365173332,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":37974,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5366753175795657,"acs":3929,"articleLive":2,"columnArticles":96,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7321,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6051838456901748,"acs":3012,"articleLive":2,"columnArticles":44,"formTitle":"[1369]获取最近第二次的活动","frequency":0.5185304849,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4977,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7903092415716672,"acs":48736,"articleLive":2,"columnArticles":583,"formTitle":"[1370]上升下降字符串","frequency":0.4900060181,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61667,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5810767419458418,"acs":21716,"articleLive":2,"columnArticles":280,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.0598966468,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":37372,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.518045201751272,"acs":8756,"articleLive":2,"columnArticles":172,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16902,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40473641958790474,"acs":9075,"articleLive":2,"columnArticles":191,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.3914088712,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":22422,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7406312053741181,"acs":17530,"articleLive":2,"columnArticles":233,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23669,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5788998516798866,"acs":8977,"articleLive":2,"columnArticles":177,"formTitle":"[1375]二进制字符串前缀一致的次数","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15507,"title":"二进制字符串前缀一致的次数","titleSlug":"number-of-times-binary-string-is-prefix-aligned"},{"acceptance":0.5072964669738863,"acs":7926,"articleLive":2,"columnArticles":162,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15624,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.327772470052179,"acs":4460,"articleLive":2,"columnArticles":136,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.4900060181,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13607,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8643323575771222,"acs":7677,"articleLive":2,"columnArticles":64,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8882,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8386897880539499,"acs":10882,"articleLive":2,"columnArticles":171,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12975,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7272575669140332,"acs":17444,"articleLive":2,"columnArticles":268,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":23986,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7314194028995473,"acs":12764,"articleLive":2,"columnArticles":176,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.5185304849,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":17451,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.7022670312143996,"acs":12329,"articleLive":2,"columnArticles":188,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":17556,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3258744147617736,"acs":4733,"articleLive":2,"columnArticles":92,"formTitle":"[1383]最大的团队表现值","frequency":1.2742818789,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14524,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.543873113328217,"acs":2126,"articleLive":2,"columnArticles":49,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3909,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6986294828327205,"acs":14630,"articleLive":2,"columnArticles":222,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":20941,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3177390720214961,"acs":6622,"articleLive":2,"columnArticles":134,"formTitle":"[1386]安排电影院座位","frequency":1.0918686795,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20841,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6942081814499798,"acs":10284,"articleLive":2,"columnArticles":189,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14814,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.547730267097856,"acs":4573,"articleLive":2,"columnArticles":56,"formTitle":"[1388]3n 块披萨","frequency":0.5185304849,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":8349,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8308628223802588,"acs":29091,"articleLive":2,"columnArticles":495,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.4365173332,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":35013,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3641258887494772,"acs":6965,"articleLive":2,"columnArticles":123,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":19128,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.40167581623808146,"acs":6951,"articleLive":2,"columnArticles":210,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.5185304849,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":17305,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.41140597455810185,"acs":8635,"articleLive":2,"columnArticles":156,"formTitle":"[1392]最长快乐前缀","frequency":1.1251939893,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":20989,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8565629228687416,"acs":4431,"articleLive":2,"columnArticles":66,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":5173,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.665432144035789,"acs":18147,"articleLive":2,"columnArticles":295,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":27271,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7394799523620484,"acs":14902,"articleLive":2,"columnArticles":214,"formTitle":"[1395]统计作战单位数","frequency":0.4626968388,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":20152,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4061388048285724,"acs":12213,"articleLive":2,"columnArticles":167,"formTitle":"[1396]设计地铁系统","frequency":0.4113903831,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":30071,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.38383484954513647,"acs":1097,"articleLive":2,"columnArticles":38,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2858,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7584887613582019,"acs":4758,"articleLive":2,"columnArticles":75,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6273,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6708758731864589,"acs":9988,"articleLive":2,"columnArticles":161,"formTitle":"[1399]统计最大组的数目","frequency":0.4626968388,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14888,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.608399209486166,"acs":6157,"articleLive":2,"columnArticles":103,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":10120,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41891755184623164,"acs":4141,"articleLive":2,"columnArticles":96,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9885,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7542819010899384,"acs":10173,"articleLive":2,"columnArticles":186,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13487,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6896883536131115,"acs":22219,"articleLive":2,"columnArticles":374,"formTitle":"[1403]非递增顺序的最小子序列","frequency":1.0598966468,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":32216,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4937745740498034,"acs":7535,"articleLive":2,"columnArticles":160,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":15260,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5093652004407153,"acs":6010,"articleLive":2,"columnArticles":145,"formTitle":"[1405]最长快乐字符串","frequency":1.4567702553,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11799,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5694705427213441,"acs":5152,"articleLive":2,"columnArticles":85,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":9047,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6693539832396308,"acs":6310,"articleLive":2,"columnArticles":71,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9427,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6145134593605714,"acs":14108,"articleLive":2,"columnArticles":214,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22958,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8081328751431844,"acs":8466,"articleLive":2,"columnArticles":140,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10476,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.475746848021862,"acs":7660,"articleLive":2,"columnArticles":121,"formTitle":"[1410]HTML 实体解析器","frequency":0.6468704038,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":16101,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5511016541972682,"acs":8029,"articleLive":2,"columnArticles":146,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.1962391719,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14569,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5492125984251969,"acs":3069,"articleLive":2,"columnArticles":73,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5588,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6951874815470919,"acs":11773,"articleLive":2,"columnArticles":245,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.4365173332,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":16935,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6050203315608382,"acs":7737,"articleLive":2,"columnArticles":154,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3914088712,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12788,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6865893547427891,"acs":6927,"articleLive":2,"columnArticles":187,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.5483656333,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":10089,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.41170704383139617,"acs":2940,"articleLive":2,"columnArticles":55,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7141,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5211197487841305,"acs":13608,"articleLive":2,"columnArticles":190,"formTitle":"[1417]重新格式化字符串","frequency":0.4626968388,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":26113,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7315345233153452,"acs":26434,"articleLive":2,"columnArticles":420,"formTitle":"[1418]点菜展示表","frequency":2.5658128862,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":36135,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.42123830461680045,"acs":8239,"articleLive":2,"columnArticles":159,"formTitle":"[1419]数青蛙","frequency":1.0598966468,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19559,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.6030769230769231,"acs":2548,"articleLive":2,"columnArticles":47,"formTitle":"[1420]生成数组","frequency":0.7545149972,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4225,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.742096884239254,"acs":3263,"articleLive":2,"columnArticles":41,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4397,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5413005272407733,"acs":11088,"articleLive":2,"columnArticles":202,"formTitle":"[1422]分割字符串的最大得分","frequency":0.9996374553,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":20484,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554326154782741,"acs":36422,"articleLive":2,"columnArticles":532,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":65705,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.40176315346173286,"acs":7155,"articleLive":2,"columnArticles":157,"formTitle":"[1424]对角线遍历 II","frequency":0.9711860341,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17809,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.443827479338843,"acs":3437,"articleLive":2,"columnArticles":75,"formTitle":"[1425]带限制的子序列和","frequency":0.5185304849,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7744,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.6997389033942559,"acs":1608,"articleLive":2,"columnArticles":55,"formTitle":"[1426]数元素","frequency":1.407279701,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2298,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6433666191155493,"acs":1353,"articleLive":2,"columnArticles":51,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":2103,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5960863020572001,"acs":1188,"articleLive":2,"columnArticles":22,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1993,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5007490636704119,"acs":1337,"articleLive":2,"columnArticles":51,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2670,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5720369056068133,"acs":806,"articleLive":2,"columnArticles":31,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1409,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8460764161139248,"acs":79851,"articleLive":2,"columnArticles":1049,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":94378,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3972040850493889,"acs":4745,"articleLive":2,"columnArticles":103,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11946,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6406489133761861,"acs":6279,"articleLive":2,"columnArticles":112,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9801,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4690218356115746,"acs":2642,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5633,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6224461623412479,"acs":4509,"articleLive":2,"columnArticles":51,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":7244,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8224264116672899,"acs":46185,"articleLive":2,"columnArticles":658,"formTitle":"[1436]旅行终点站","frequency":0.9996374553,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":56157,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5836156131116785,"acs":11199,"articleLive":2,"columnArticles":191,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":19189,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4824003392705683,"acs":34125,"articleLive":2,"columnArticles":481,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.3914088712,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":70740,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5425101214574899,"acs":5092,"articleLive":2,"columnArticles":70,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":1.0598966468,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":9386,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6997126436781609,"acs":2922,"articleLive":2,"columnArticles":42,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":4176,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.649114392408099,"acs":18947,"articleLive":2,"columnArticles":382,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":29189,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915493592198023,"acs":35144,"articleLive":2,"columnArticles":378,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44399,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4117317653646927,"acs":5882,"articleLive":2,"columnArticles":146,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14286,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5292319449751623,"acs":2770,"articleLive":2,"columnArticles":64,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5234,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.856,"acs":4387,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":5125,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.6109608072535829,"acs":50133,"articleLive":2,"columnArticles":680,"formTitle":"[1446]连续字符","frequency":0.5606901669,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":82056,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.612729545236035,"acs":6373,"articleLive":2,"columnArticles":84,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":10401,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7133835943037566,"acs":11071,"articleLive":2,"columnArticles":180,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":1.0291817016,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":15519,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275250635941942,"acs":16775,"articleLive":2,"columnArticles":207,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26732,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8027013054155357,"acs":24842,"articleLive":2,"columnArticles":352,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"ac","submitted":30948,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5250740375123396,"acs":10638,"articleLive":2,"columnArticles":161,"formTitle":"[1451]重新排列句子中的单词","frequency":0.4626968388,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":20260,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.5011010521164668,"acs":6144,"articleLive":2,"columnArticles":92,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12261,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36741214057507987,"acs":1725,"articleLive":2,"columnArticles":36,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.7198374588,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4695,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39430512394305123,"acs":5456,"articleLive":2,"columnArticles":86,"formTitle":"[1454]活跃用户","frequency":0.5483656333,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":13837,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6277212992809323,"acs":12658,"articleLive":2,"columnArticles":224,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":20165,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.524992140836215,"acs":15030,"articleLive":2,"columnArticles":226,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.4365173332,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":28629,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6296434991012583,"acs":8407,"articleLive":2,"columnArticles":147,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":13352,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44340634094041964,"acs":5790,"articleLive":2,"columnArticles":92,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":13058,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5992941176470589,"acs":2547,"articleLive":2,"columnArticles":51,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":4250,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7425113882114757,"acs":16137,"articleLive":2,"columnArticles":328,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21733,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5067632850241546,"acs":6294,"articleLive":2,"columnArticles":90,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12420,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.43644170295113693,"acs":7217,"articleLive":2,"columnArticles":141,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":16536,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5944973544973545,"acs":2809,"articleLive":2,"columnArticles":68,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4725,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7670107033639144,"acs":28091,"articleLive":2,"columnArticles":399,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.0291817016,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":36624,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.31316725978647686,"acs":6688,"articleLive":2,"columnArticles":85,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.4365173332,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":21356,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4841726618705036,"acs":6730,"articleLive":2,"columnArticles":127,"formTitle":"[1466]重新规划路线","frequency":0.4900060181,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13900,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6162873399715505,"acs":1733,"articleLive":2,"columnArticles":50,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2812,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7006614038830808,"acs":3284,"articleLive":2,"columnArticles":56,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4687,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7992667277726856,"acs":2616,"articleLive":2,"columnArticles":97,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":3273,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8422747108547712,"acs":55201,"articleLive":2,"columnArticles":746,"formTitle":"[1470]重新排列数组","frequency":0.4626968388,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":65538,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.546524064171123,"acs":7665,"articleLive":2,"columnArticles":110,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.5796181768,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":14025,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6203593605496103,"acs":9391,"articleLive":2,"columnArticles":151,"formTitle":"[1472]设计浏览器历史记录","frequency":1.3605422232,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":15138,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6734352193697948,"acs":15687,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23294,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7158358765683283,"acs":2111,"articleLive":2,"columnArticles":72,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2949,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7206757284926391,"acs":16595,"articleLive":2,"columnArticles":256,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":23027,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.864302287040106,"acs":13038,"articleLive":2,"columnArticles":123,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":15085,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2898269448487789,"acs":5376,"articleLive":2,"columnArticles":104,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":1.0291817016,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":18549,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5843629734656675,"acs":2885,"articleLive":2,"columnArticles":61,"formTitle":"[1478]安排邮筒","frequency":0.5483656333,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4937,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5673151750972762,"acs":2187,"articleLive":2,"columnArticles":44,"formTitle":"[1479]周内每天的销售情况","frequency":0.5185304849,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3855,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8691968109639586,"acs":131918,"articleLive":2,"columnArticles":1339,"formTitle":"[1480]一维数组的动态和","frequency":1.6568080393,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":151770,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5156265071862641,"acs":10691,"articleLive":2,"columnArticles":153,"formTitle":"[1481]不同整数的最少数目","frequency":1.3914088712,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20734,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5873322301893731,"acs":31945,"articleLive":2,"columnArticles":418,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":54390,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3020191649555099,"acs":3530,"articleLive":2,"columnArticles":76,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11688,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8119891008174387,"acs":894,"articleLive":2,"columnArticles":27,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1101,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6558073654390935,"acs":4167,"articleLive":2,"columnArticles":48,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":6354,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586570754829336,"acs":72098,"articleLive":2,"columnArticles":704,"formTitle":"[1486]数组异或操作","frequency":0.4113903831,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":83966,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3134578637444917,"acs":8038,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":1.1251939893,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25643,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.24358035986581275,"acs":7987,"articleLive":2,"columnArticles":120,"formTitle":"[1488]避免洪水泛滥","frequency":3.1946809154,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":32790,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.689194729136164,"acs":11768,"articleLive":2,"columnArticles":129,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.5483656333,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":17075,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8528628495339547,"acs":1281,"articleLive":2,"columnArticles":32,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1502,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6714433589959242,"acs":20757,"articleLive":2,"columnArticles":309,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":30914,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6523321764158131,"acs":7706,"articleLive":2,"columnArticles":89,"formTitle":"[1492]n 的第 k 个因子","frequency":1.3605422232,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":11813,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5736703873933027,"acs":8737,"articleLive":2,"columnArticles":165,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.0291817016,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":15230,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37513530230400494,"acs":2426,"articleLive":2,"columnArticles":38,"formTitle":"[1494]并行课程 II","frequency":1.3605422232,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6467,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5418952618453865,"acs":4346,"articleLive":2,"columnArticles":42,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":8020,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5356335624336916,"acs":11612,"articleLive":2,"columnArticles":175,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21679,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3942196531791908,"acs":8866,"articleLive":2,"columnArticles":118,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":1.0291817016,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":22490,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33497387288856484,"acs":5513,"articleLive":2,"columnArticles":72,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":16458,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37662337662337664,"acs":2958,"articleLive":2,"columnArticles":64,"formTitle":"[1499]满足不等式的最大值","frequency":0.5483656333,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7854,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30204323363932484,"acs":1020,"articleLive":2,"columnArticles":32,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":3377,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5952222073935673,"acs":4460,"articleLive":2,"columnArticles":65,"formTitle":"[1501]可以放心投资的国家","frequency":0.4900060181,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7493,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7163787033526513,"acs":26453,"articleLive":2,"columnArticles":313,"formTitle":"[1502]判断能否形成等差数列","frequency":1.6568080393,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":36926,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5155723416618245,"acs":8873,"articleLive":2,"columnArticles":90,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.4365173332,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":17210,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.599406753878917,"acs":7881,"articleLive":2,"columnArticles":138,"formTitle":"[1504]统计全 1 子矩形","frequency":1.0291817016,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":13148,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36345296241240177,"acs":3423,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9418,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8370273794002607,"acs":642,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":767,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5868931494562171,"acs":10469,"articleLive":2,"columnArticles":135,"formTitle":"[1507]转变日期格式","frequency":0.4900060181,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":17838,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5534956250541454,"acs":6389,"articleLive":2,"columnArticles":58,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11543,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5516835182094827,"acs":5620,"articleLive":2,"columnArticles":83,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.5185304849,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":10187,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5798969072164949,"acs":5400,"articleLive":2,"columnArticles":67,"formTitle":"[1510]石子游戏 IV","frequency":1.0598966468,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9312,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6804698972099853,"acs":4634,"articleLive":2,"columnArticles":65,"formTitle":"[1511]消费者下单频率","frequency":0.4900060181,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6810,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8481942889137738,"acs":60595,"articleLive":2,"columnArticles":774,"formTitle":"[1512]好数对的数目","frequency":1.4234560486,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":71440,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3824528678968756,"acs":11482,"articleLive":2,"columnArticles":162,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":30022,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.33658097879037696,"acs":8982,"articleLive":2,"columnArticles":158,"formTitle":"[1514]概率最大的路径","frequency":0.9996374553,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":26686,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34394641937145803,"acs":3338,"articleLive":2,"columnArticles":61,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9705,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5892018779342723,"acs":251,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":426,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.6627659574468086,"acs":3738,"articleLive":2,"columnArticles":38,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":5640,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.7031770922555906,"acs":53362,"articleLive":2,"columnArticles":802,"formTitle":"[1518]换酒问题","frequency":0.1818749481,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":75887,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.30105374077976815,"acs":5714,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.4626968388,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18980,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33591032083494393,"acs":2607,"articleLive":2,"columnArticles":73,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7761,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3932488249537103,"acs":2761,"articleLive":2,"columnArticles":54,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":7021,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7081824764663287,"acs":978,"articleLive":2,"columnArticles":32,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1381,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5747151150290261,"acs":10692,"articleLive":2,"columnArticles":180,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":18604,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4340020295058934,"acs":5560,"articleLive":2,"columnArticles":109,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.4365173332,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12811,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6585476895060324,"acs":5786,"articleLive":2,"columnArticles":115,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8786,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6207595870206489,"acs":3367,"articleLive":2,"columnArticles":53,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5424,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49226739835370414,"acs":3947,"articleLive":2,"columnArticles":42,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":8018,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851698551309878,"acs":31110,"articleLive":2,"columnArticles":371,"formTitle":"[1528]重新排列字符串","frequency":1.3914088712,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":39622,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6934405289653618,"acs":9229,"articleLive":2,"columnArticles":138,"formTitle":"[1529]最少的后缀翻转次数","frequency":0.5185304849,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13309,"title":"最少的后缀翻转次数","titleSlug":"minimum-suffix-flips"},{"acceptance":0.5705563947633434,"acs":9065,"articleLive":2,"columnArticles":151,"formTitle":"[1530]好叶子节点对的数量","frequency":1.0918686795,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15888,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3436414751116256,"acs":2078,"articleLive":2,"columnArticles":36,"formTitle":"[1531]压缩字符串 II","frequency":2.1625198281,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":6047,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6174189699741499,"acs":3105,"articleLive":2,"columnArticles":52,"formTitle":"[1532]最近的三笔订单","frequency":1.5275963078,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":5029,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6062176165803109,"acs":351,"articleLive":2,"columnArticles":19,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":579,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7861867873618243,"acs":18065,"articleLive":2,"columnArticles":167,"formTitle":"[1534]统计好三元组","frequency":1.0598966468,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":22978,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45439983982380616,"acs":13617,"articleLive":2,"columnArticles":185,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.4626968388,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29967,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4438149197355996,"acs":4230,"articleLive":2,"columnArticles":81,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.6815479423,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9531,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36875790139064474,"acs":4667,"articleLive":2,"columnArticles":95,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12656,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6051502145922747,"acs":141,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":233,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5395965521369568,"acs":18029,"articleLive":2,"columnArticles":265,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.0918686795,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":33412,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3190075321222862,"acs":5040,"articleLive":2,"columnArticles":90,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15799,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4659129605666417,"acs":6841,"articleLive":2,"columnArticles":104,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":14683,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3883495145631068,"acs":2640,"articleLive":2,"columnArticles":51,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6798,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5533344532168655,"acs":3294,"articleLive":2,"columnArticles":46,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5953,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5501765398195371,"acs":21036,"articleLive":2,"columnArticles":335,"formTitle":"[1544]整理字符串","frequency":1.4234560486,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":38235,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5549768105601142,"acs":7778,"articleLive":2,"columnArticles":104,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0598966468,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":14015,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4179427687548337,"acs":5404,"articleLive":2,"columnArticles":82,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12930,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5383625128733265,"acs":4182,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":0.5796181768,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7768,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7105751391465677,"acs":383,"articleLive":2,"columnArticles":16,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":539,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.666177908113392,"acs":2726,"articleLive":2,"columnArticles":53,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":4092,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6561744055696501,"acs":22243,"articleLive":2,"columnArticles":299,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":33898,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8178831096196868,"acs":11699,"articleLive":2,"columnArticles":163,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":14304,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5128994585412464,"acs":9662,"articleLive":2,"columnArticles":130,"formTitle":"[1552]两球之间的磁力","frequency":1.0291817016,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18838,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29772296720032687,"acs":8015,"articleLive":2,"columnArticles":126,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.0918686795,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26921,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7108571428571429,"acs":622,"articleLive":2,"columnArticles":22,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":875,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4382372881355932,"acs":3232,"articleLive":2,"columnArticles":61,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7375,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5748164605873262,"acs":11901,"articleLive":2,"columnArticles":183,"formTitle":"[1556]千位分隔数","frequency":2.3155712755,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":20704,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.775453997762286,"acs":9010,"articleLive":2,"columnArticles":128,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":1.3914088712,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":11619,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6237373737373737,"acs":4693,"articleLive":2,"columnArticles":77,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.5483656333,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7524,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37605100249468726,"acs":4070,"articleLive":2,"columnArticles":71,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":10823,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5717458907152376,"acs":9009,"articleLive":2,"columnArticles":93,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15757,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7784766337505503,"acs":12377,"articleLive":2,"columnArticles":180,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.0291817016,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15899,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.31057410452563095,"acs":4344,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13987,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38205552491266775,"acs":4156,"articleLive":2,"columnArticles":67,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10878,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5623123123123123,"acs":749,"articleLive":2,"columnArticles":27,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1332,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7291873634015498,"acs":3670,"articleLive":2,"columnArticles":46,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.4626968388,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":5033,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4451475671363999,"acs":8371,"articleLive":2,"columnArticles":126,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.4626968388,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18805,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.40867114983898467,"acs":17259,"articleLive":2,"columnArticles":261,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.5653366358,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":42232,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45975650997632733,"acs":2719,"articleLive":2,"columnArticles":49,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5914,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47228863290589,"acs":2173,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4601,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8945028294260308,"acs":2213,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.4626968388,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2474,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7597309965355614,"acs":3728,"articleLive":2,"columnArticles":46,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4907,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8012064928364487,"acs":20188,"articleLive":2,"columnArticles":336,"formTitle":"[1572]矩阵对角线元素的和","frequency":1.0598966468,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":25197,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2975501113585746,"acs":4676,"articleLive":2,"columnArticles":67,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15715,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3314175008072328,"acs":5132,"articleLive":2,"columnArticles":90,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.4900060181,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":15485,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5956730769230769,"acs":4956,"articleLive":2,"columnArticles":71,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":8320,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4766718706011824,"acs":18625,"articleLive":2,"columnArticles":267,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":39073,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32816569515068833,"acs":5292,"articleLive":2,"columnArticles":85,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.7198374588,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":16126,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5850203471900273,"acs":11357,"articleLive":2,"columnArticles":212,"formTitle":"[1578]使绳子变成彩色的最短时间","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19413,"title":"使绳子变成彩色的最短时间","titleSlug":"minimum-time-to-make-rope-colorful"},{"acceptance":0.6196253886403276,"acs":16342,"articleLive":2,"columnArticles":298,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26374,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6262425447316103,"acs":315,"articleLive":2,"columnArticles":23,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":503,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8065525876460768,"acs":3865,"articleLive":2,"columnArticles":55,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4792,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6691415917676176,"acs":10274,"articleLive":2,"columnArticles":122,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.4900060181,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":15354,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853053089327776,"acs":18911,"articleLive":2,"columnArticles":246,"formTitle":"[1583]统计不开心的朋友","frequency":2.6244386845,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27595,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6637122247890246,"acs":28156,"articleLive":2,"columnArticles":357,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6568080393,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":42422,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4310710498409332,"acs":2439,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5658,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6278409090909091,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":704,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8304385584020842,"acs":3825,"articleLive":2,"columnArticles":44,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4606,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8392595477899579,"acs":45247,"articleLive":2,"columnArticles":721,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.1870248524,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":53913,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29655768399827165,"acs":4118,"articleLive":2,"columnArticles":60,"formTitle":"[1589]所有排列中的最大和","frequency":0.6815479423,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13886,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2715856638609829,"acs":4001,"articleLive":2,"columnArticles":60,"formTitle":"[1590]使数组和能被 P 整除","frequency":1.1598715277,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":14732,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5856536101934875,"acs":1241,"articleLive":2,"columnArticles":37,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2119,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4456704897537642,"acs":8199,"articleLive":2,"columnArticles":130,"formTitle":"[1592]重新排列单词间的空格","frequency":0.4900060181,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":18397,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5403188216649576,"acs":5796,"articleLive":2,"columnArticles":95,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":1.0291817016,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10727,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31452305929533086,"acs":4392,"articleLive":2,"columnArticles":102,"formTitle":"[1594]矩阵的最大非负积","frequency":0.5483656333,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13964,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46838131193959415,"acs":1985,"articleLive":2,"columnArticles":40,"formTitle":"[1595]连通两组点的最小成本","frequency":0.7198374588,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4238,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7538677918424754,"acs":2680,"articleLive":2,"columnArticles":47,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3555,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6625514403292181,"acs":322,"articleLive":2,"columnArticles":21,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":486,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6729502091331003,"acs":11745,"articleLive":2,"columnArticles":157,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":17453,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.420863309352518,"acs":3978,"articleLive":2,"columnArticles":70,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9452,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.675924836216704,"acs":17230,"articleLive":2,"columnArticles":209,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25491,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4913005654632449,"acs":2259,"articleLive":2,"columnArticles":41,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4598,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7482935153583617,"acs":877,"articleLive":2,"columnArticles":35,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":1172,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.843931216627433,"acs":58795,"articleLive":2,"columnArticles":470,"formTitle":"[1603]设计停车系统","frequency":1.0291817016,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":69668,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4147577539022907,"acs":4092,"articleLive":2,"columnArticles":69,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":1.0598966468,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9866,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7395156526875369,"acs":3756,"articleLive":2,"columnArticles":75,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":5079,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34988132911392406,"acs":1769,"articleLive":2,"columnArticles":38,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":5056,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5403171390013495,"acs":3203,"articleLive":2,"columnArticles":44,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5928,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392572944297082,"acs":10604,"articleLive":2,"columnArticles":177,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":16588,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5117205657746198,"acs":7706,"articleLive":2,"columnArticles":143,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":15059,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.4456033287101248,"acs":16064,"articleLive":2,"columnArticles":154,"formTitle":"[1610]可见点的最大数目","frequency":0.854933745,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":36050,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6100055279159757,"acs":2207,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3618,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7308248914616498,"acs":505,"articleLive":2,"columnArticles":22,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":691,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.73262438283327,"acs":1929,"articleLive":2,"columnArticles":38,"formTitle":"[1613]找到遗失的ID","frequency":0.5796181768,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2633,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8209427396393546,"acs":18165,"articleLive":2,"columnArticles":302,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.5185304849,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":22127,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.5020296505471232,"acs":5689,"articleLive":2,"columnArticles":68,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11332,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2772067394299036,"acs":5232,"articleLive":2,"columnArticles":97,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.4567702553,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18874,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6261872455902306,"acs":1846,"articleLive":2,"columnArticles":35,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2948,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5781990521327014,"acs":366,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":633,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.671573137074517,"acs":8030,"articleLive":2,"columnArticles":138,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11957,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37366395895681914,"acs":2622,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":7017,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4418169047061578,"acs":1887,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4271,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15518663075147052,"acs":2823,"articleLive":2,"columnArticles":60,"formTitle":"[1622]奇妙序列","frequency":1.9698516251,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":18191,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.784650870203397,"acs":3742,"articleLive":2,"columnArticles":48,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4769,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6211371173162877,"acs":12924,"articleLive":2,"columnArticles":223,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":1.0291817016,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":20807,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5474660956459672,"acs":3068,"articleLive":2,"columnArticles":69,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5604,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.39059111907231076,"acs":4143,"articleLive":2,"columnArticles":87,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.5185304849,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10607,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3848699052489096,"acs":2559,"articleLive":2,"columnArticles":40,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6649,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8377896613190731,"acs":470,"articleLive":2,"columnArticles":21,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":561,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5238701464035647,"acs":9053,"articleLive":2,"columnArticles":105,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":17281,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7625135214868719,"acs":7754,"articleLive":2,"columnArticles":122,"formTitle":"[1630]等差子数组","frequency":1.4234560486,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":10169,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49350908727781106,"acs":27181,"articleLive":2,"columnArticles":313,"formTitle":"[1631]最小体力消耗路径","frequency":1.5275963078,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":55077,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3239143985040515,"acs":1559,"articleLive":2,"columnArticles":28,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4813,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6554039419536496,"acs":3026,"articleLive":2,"columnArticles":31,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4617,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5472589792060492,"acs":579,"articleLive":2,"columnArticles":29,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":1058,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5456,"acs":1364,"articleLive":2,"columnArticles":38,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2500,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7068207600680658,"acs":9969,"articleLive":2,"columnArticles":196,"formTitle":"[1636]按照频率将数组升序排序","frequency":1.3914088712,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":14104,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8087840700466036,"acs":5727,"articleLive":2,"columnArticles":80,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":7081,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7145513714551371,"acs":3074,"articleLive":2,"columnArticles":52,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.6468704038,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4302,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.3997084548104956,"acs":1371,"articleLive":2,"columnArticles":33,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3430,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6547441629408842,"acs":13180,"articleLive":2,"columnArticles":226,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":20130,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.773286358860251,"acs":12511,"articleLive":2,"columnArticles":290,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.0598966468,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":16179,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4520152290928187,"acs":6886,"articleLive":2,"columnArticles":111,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":15234,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45633856759862124,"acs":2383,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5222,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5556420233463035,"acs":1428,"articleLive":2,"columnArticles":29,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2570,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40307692307692305,"acs":917,"articleLive":2,"columnArticles":26,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2275,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5341035066223233,"acs":36616,"articleLive":2,"columnArticles":365,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4669442299,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":68556,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5180683311432326,"acs":7885,"articleLive":2,"columnArticles":118,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.0598966468,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":15220,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2808821338101624,"acs":3770,"articleLive":2,"columnArticles":94,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.1598715277,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":13422,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4745222929936306,"acs":2682,"articleLive":2,"columnArticles":68,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5652,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7987206823027718,"acs":1873,"articleLive":2,"columnArticles":36,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4626968388,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":2345,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6580547112462006,"acs":866,"articleLive":2,"columnArticles":25,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6815479423,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1316,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6507229320780095,"acs":7741,"articleLive":2,"columnArticles":191,"formTitle":"[1652]拆炸弹","frequency":1.0291817016,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11896,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5154179408766565,"acs":4045,"articleLive":2,"columnArticles":93,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7848,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.28132371305675036,"acs":4055,"articleLive":2,"columnArticles":54,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.4234560486,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":14414,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.37910146390711763,"acs":2253,"articleLive":2,"columnArticles":34,"formTitle":"[1655]分配重复整数","frequency":0.5796181768,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5943,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7822512844465204,"acs":8374,"articleLive":2,"columnArticles":98,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10705,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4650974682520424,"acs":5750,"articleLive":2,"columnArticles":82,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.4626968388,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12363,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3061002854660544,"acs":9865,"articleLive":2,"columnArticles":159,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":1.0918686795,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":32228,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41347851677457326,"acs":1405,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.9996374553,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3398,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7246153846153847,"acs":471,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":650,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7324825427401879,"acs":3042,"articleLive":2,"columnArticles":60,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":1.0918686795,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":4153,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128784522227145,"acs":22016,"articleLive":2,"columnArticles":313,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":27084,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5730176839703366,"acs":8036,"articleLive":2,"columnArticles":135,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.4900060181,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":14024,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5487662716145327,"acs":5649,"articleLive":2,"columnArticles":109,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10294,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6584297017650639,"acs":5409,"articleLive":2,"columnArticles":87,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.5483656333,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8215,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.7,"acs":287,"articleLive":2,"columnArticles":14,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":410,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6040707535740247,"acs":2493,"articleLive":2,"columnArticles":35,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":4127,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.444398511781728,"acs":7525,"articleLive":2,"columnArticles":140,"formTitle":"[1668]最大重复子字符串","frequency":0.4900060181,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16933,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7537123462028001,"acs":14212,"articleLive":2,"columnArticles":263,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":18856,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5268070327762101,"acs":4854,"articleLive":2,"columnArticles":85,"formTitle":"[1670]设计前中后队列","frequency":0.4900060181,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":9214,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46762895351305456,"acs":2203,"articleLive":2,"columnArticles":46,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6124079997,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4711,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8491091196626251,"acs":40269,"articleLive":2,"columnArticles":462,"formTitle":"[1672]最富有客户的资产总量","frequency":0.4626968388,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":47425,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3607090366543446,"acs":8099,"articleLive":2,"columnArticles":178,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.4900060181,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":22453,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.37006993006993005,"acs":2646,"articleLive":2,"columnArticles":55,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.5796181768,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":7150,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4345072598084646,"acs":2813,"articleLive":2,"columnArticles":47,"formTitle":"[1675]数组的最小偏移量","frequency":0.6815479423,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6474,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7688253012048193,"acs":1021,"articleLive":2,"columnArticles":27,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1328,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3772416041734594,"acs":2314,"articleLive":2,"columnArticles":38,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":6134,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8280549136876444,"acs":18276,"articleLive":2,"columnArticles":301,"formTitle":"[1678]设计 Goal 解析器","frequency":0.4626968388,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":22071,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49757379700768295,"acs":7383,"articleLive":2,"columnArticles":121,"formTitle":"[1679]K 和数对的最大数目","frequency":0.4365173332,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14838,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4707233065442021,"acs":5740,"articleLive":2,"columnArticles":74,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":12194,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38618965786595844,"acs":2472,"articleLive":2,"columnArticles":50,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6401,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5304709141274239,"acs":383,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":722,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8974239962868414,"acs":3867,"articleLive":2,"columnArticles":42,"formTitle":"[1683]无效的推文","frequency":0.4626968388,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4309,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8270565581478662,"acs":18469,"articleLive":2,"columnArticles":380,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":22331,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6097236589330575,"acs":4126,"articleLive":2,"columnArticles":92,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6767,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4757486979166667,"acs":2923,"articleLive":2,"columnArticles":51,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":6144,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39664378337147216,"acs":1040,"articleLive":2,"columnArticles":26,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2622,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.806369622983017,"acs":20939,"articleLive":2,"columnArticles":280,"formTitle":"[1688]比赛中的配对次数","frequency":1.0291817016,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":25967,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8651491540516474,"acs":15545,"articleLive":2,"columnArticles":206,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17968,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5223476297968397,"acs":4628,"articleLive":2,"columnArticles":109,"formTitle":"[1690]石子游戏 VII","frequency":0.5796181768,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8860,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.49307425933051174,"acs":2563,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5198,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.657051282051282,"acs":205,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":312,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8055293748036444,"acs":2564,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":3183,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6371510324027531,"acs":8239,"articleLive":2,"columnArticles":143,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12931,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4719273649776354,"acs":7069,"articleLive":2,"columnArticles":143,"formTitle":"[1695]删除子数组的最大得分","frequency":0.4365173332,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":14979,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3954280436414016,"acs":6850,"articleLive":2,"columnArticles":121,"formTitle":"[1696]跳跃游戏 VI","frequency":0.5796181768,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":17323,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5314588614888223,"acs":2306,"articleLive":2,"columnArticles":45,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4339,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5125581395348837,"acs":551,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.8917161188,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":1075,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8020439061317184,"acs":2119,"articleLive":2,"columnArticles":45,"formTitle":"[1699]两人之间的通话次数","frequency":0.5796181768,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2642,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7037563603711464,"acs":9405,"articleLive":2,"columnArticles":195,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.4626968388,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":13364,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6147398843930636,"acs":4254,"articleLive":2,"columnArticles":85,"formTitle":"[1701]平均等待时间","frequency":0.4900060181,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6920,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4788732394366197,"acs":3162,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6603,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38908594815825376,"acs":1426,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.7545149972,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3665,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7805496828752643,"acs":12922,"articleLive":2,"columnArticles":201,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16555,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34846654007710454,"acs":6056,"articleLive":2,"columnArticles":126,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":17379,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5929271085103677,"acs":4661,"articleLive":2,"columnArticles":118,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7861,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.503100613154961,"acs":14441,"articleLive":2,"columnArticles":152,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28704,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7054930509596293,"acs":1066,"articleLive":2,"columnArticles":26,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1511,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.71729070256626,"acs":1705,"articleLive":2,"columnArticles":43,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.5483656333,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2377,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6956357758620689,"acs":12911,"articleLive":2,"columnArticles":203,"formTitle":"[1710]卡车上的最大单元数","frequency":0.4365173332,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":18560,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35889404394620944,"acs":30478,"articleLive":2,"columnArticles":363,"formTitle":"[1711]大餐计数","frequency":2.6012072943,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":84922,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2644219892919086,"acs":7013,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.5483656333,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":26522,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49427676272606014,"acs":15934,"articleLive":2,"columnArticles":173,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.6981497206,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":32237,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6022988505747127,"acs":262,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":435,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7259927797833935,"acs":2011,"articleLive":2,"columnArticles":39,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2770,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6685998959030411,"acs":8992,"articleLive":2,"columnArticles":200,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":13449,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43913684987089635,"acs":2381,"articleLive":2,"columnArticles":52,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.6124079997,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5422,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4985142857142857,"acs":2181,"articleLive":2,"columnArticles":51,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.5796181768,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4375,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37641083521444696,"acs":667,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1772,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8688512585812357,"acs":47461,"articleLive":2,"columnArticles":500,"formTitle":"[1720]解码异或后的数组","frequency":0.4626968388,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":54625,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6448211920529802,"acs":12171,"articleLive":2,"columnArticles":188,"formTitle":"[1721]交换链表中的节点","frequency":1.0291817016,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":18875,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5165158847043972,"acs":4910,"articleLive":2,"columnArticles":119,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9506,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5054485554992397,"acs":23934,"articleLive":2,"columnArticles":179,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.4567702553,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":47352,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5579399141630901,"acs":390,"articleLive":2,"columnArticles":14,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":699,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7890462307371928,"acs":11367,"articleLive":2,"columnArticles":155,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":14406,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48809622563251764,"acs":5884,"articleLive":2,"columnArticles":114,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":12055,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5779105441627644,"acs":3579,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.5796181768,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6193,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3631025957972806,"acs":1175,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3236,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6226228698444061,"acs":2521,"articleLive":2,"columnArticles":25,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":4049,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5256064690026954,"acs":780,"articleLive":2,"columnArticles":25,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1484,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46216857081267515,"acs":2144,"articleLive":2,"columnArticles":33,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4639,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7887153408402955,"acs":13028,"articleLive":2,"columnArticles":220,"formTitle":"[1732]找到最高海拔","frequency":0.4626968388,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":16518,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.46605876393110435,"acs":2300,"articleLive":2,"columnArticles":56,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4935,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7235352990992379,"acs":28194,"articleLive":2,"columnArticles":370,"formTitle":"[1734]解码异或后的排列","frequency":0.4900060181,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38967,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4899817850637523,"acs":1076,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2196,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44865779555418817,"acs":29165,"articleLive":2,"columnArticles":358,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8995387239,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":65005,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31894425259003456,"acs":3879,"articleLive":2,"columnArticles":106,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":12162,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537431941923775,"acs":28817,"articleLive":2,"columnArticles":391,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":44080,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47472712006717044,"acs":2827,"articleLive":2,"columnArticles":61,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5955,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.6499162479061976,"acs":776,"articleLive":2,"columnArticles":26,"formTitle":"[1740]找到二叉树中的距离","frequency":0.797440042,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":1194,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8388908388908389,"acs":2390,"articleLive":2,"columnArticles":33,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2849,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7102811056299428,"acs":9071,"articleLive":2,"columnArticles":135,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12771,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6965688681561503,"acs":22697,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.4591545118,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32584,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36284457328857694,"acs":28537,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78648,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48471792109869394,"acs":3600,"articleLive":2,"columnArticles":75,"formTitle":"[1745]回文串分割 IV","frequency":0.6124079997,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7427,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5742481203007519,"acs":1222,"articleLive":2,"columnArticles":47,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.0918686795,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":2128,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6933392936969155,"acs":1551,"articleLive":2,"columnArticles":37,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2237,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7430374616409009,"acs":12833,"articleLive":2,"columnArticles":249,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":17271,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5360824742268041,"acs":4056,"articleLive":2,"columnArticles":94,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7566,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45354209445585214,"acs":3534,"articleLive":2,"columnArticles":81,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7792,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4785491419656786,"acs":2454,"articleLive":2,"columnArticles":36,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.6815479423,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":5128,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6700524687205704,"acs":9961,"articleLive":2,"columnArticles":119,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.4626968388,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14866,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.629985443959243,"acs":6492,"articleLive":2,"columnArticles":136,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":10305,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4236965017634163,"acs":4445,"articleLive":2,"columnArticles":93,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.5796181768,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10491,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.41802976263682207,"acs":3399,"articleLive":2,"columnArticles":58,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.3162872142,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":8131,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8100303951367781,"acs":533,"articleLive":2,"columnArticles":16,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":658,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9224620303756994,"acs":3462,"articleLive":2,"columnArticles":37,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3753,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6429884673240849,"acs":7694,"articleLive":2,"columnArticles":117,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11966,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4348289649044869,"acs":4894,"articleLive":2,"columnArticles":101,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":11255,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5459944249181917,"acs":4505,"articleLive":2,"columnArticles":80,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":8251,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4392434988179669,"acs":2787,"articleLive":2,"columnArticles":43,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.8430683946,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6345,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.726161369193154,"acs":1188,"articleLive":2,"columnArticles":25,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1636,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.5884172750897166,"acs":4755,"articleLive":2,"columnArticles":89,"formTitle":"[1763]最长的美好子字符串","frequency":0.4900060181,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":8081,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4749195532841189,"acs":2509,"articleLive":2,"columnArticles":62,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.5483656333,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5283,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5467726195455179,"acs":3922,"articleLive":2,"columnArticles":90,"formTitle":"[1765]地图中的最高点","frequency":1.0291817016,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":7173,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37945755901557005,"acs":1511,"articleLive":2,"columnArticles":29,"formTitle":"[1766]互质树","frequency":1.407279701,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3982,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7942811755361397,"acs":1000,"articleLive":2,"columnArticles":25,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1259,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7600217996851156,"acs":12551,"articleLive":2,"columnArticles":224,"formTitle":"[1768]交替合并字符串","frequency":0.4365173332,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":16514,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8546367913244558,"acs":10718,"articleLive":2,"columnArticles":187,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12541,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.37263826863620747,"acs":4339,"articleLive":2,"columnArticles":110,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11644,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36807668898356666,"acs":2419,"articleLive":2,"columnArticles":48,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6572,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5070754716981132,"acs":430,"articleLive":2,"columnArticles":13,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":848,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.843414078367266,"acs":17026,"articleLive":2,"columnArticles":213,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":20187,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5460424211070875,"acs":6333,"articleLive":2,"columnArticles":92,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11598,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4761148183455142,"acs":4495,"articleLive":2,"columnArticles":98,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9441,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4619081951453977,"acs":1922,"articleLive":2,"columnArticles":45,"formTitle":"[1776]车队 II","frequency":0.7198374588,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4161,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7864603993124422,"acs":5948,"articleLive":2,"columnArticles":65,"formTitle":"[1777]每家商店的产品价格","frequency":1.0291817016,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7563,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5023584905660378,"acs":213,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":424,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6470086381571931,"acs":6067,"articleLive":2,"columnArticles":76,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.4626968388,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":9377,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6686129778561198,"acs":6069,"articleLive":2,"columnArticles":118,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":9077,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5254734270006108,"acs":4301,"articleLive":2,"columnArticles":62,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.6468704038,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8185,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29642689233662434,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4254,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7942636514065086,"acs":1440,"articleLive":2,"columnArticles":34,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1813,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.423149990953501,"acs":9355,"articleLive":2,"columnArticles":111,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":22108,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3534093924117803,"acs":6660,"articleLive":2,"columnArticles":68,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18845,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3427813062849559,"acs":3616,"articleLive":2,"columnArticles":94,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.5185304849,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10549,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6526952695269527,"acs":11866,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.9996374553,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18180,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6517647058823529,"acs":277,"articleLive":2,"columnArticles":19,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":425,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7131667288325252,"acs":1912,"articleLive":2,"columnArticles":35,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2681,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6348980341723315,"acs":13823,"articleLive":2,"columnArticles":159,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":21772,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8089107478663388,"acs":11184,"articleLive":2,"columnArticles":154,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":13826,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.512133013780707,"acs":6838,"articleLive":2,"columnArticles":110,"formTitle":"[1792]最大平均通过率","frequency":1.8995387239,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13352,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4189699133095359,"acs":4108,"articleLive":2,"columnArticles":100,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9805,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5861111111111111,"acs":211,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":360,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7850631136044881,"acs":2239,"articleLive":2,"columnArticles":32,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.4900060181,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2852,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.49199144024382335,"acs":7587,"articleLive":2,"columnArticles":137,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":15421,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5704373423044575,"acs":5426,"articleLive":2,"columnArticles":83,"formTitle":"[1797]设计一个验证系统","frequency":1.0291817016,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":9512,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5260291526509691,"acs":3284,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":1.1598715277,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6243,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5199415326790562,"acs":2490,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.3605422232,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4789,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.679940236455762,"acs":10467,"articleLive":2,"columnArticles":175,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":15394,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3836681222707424,"acs":4393,"articleLive":2,"columnArticles":114,"formTitle":"[1801]积压订单中的订单总数","frequency":0.6124079997,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11450,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.264244971480036,"acs":4401,"articleLive":2,"columnArticles":110,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16655,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40764094955489616,"acs":2198,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5392,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5820610687022901,"acs":610,"articleLive":2,"columnArticles":37,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.6815479423,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":1048,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4777253459169799,"acs":11946,"articleLive":2,"columnArticles":162,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":25006,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6635432283858071,"acs":5311,"articleLive":2,"columnArticles":83,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":8004,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5861399592351743,"acs":6039,"articleLive":2,"columnArticles":92,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10303,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26870892516429934,"acs":2535,"articleLive":2,"columnArticles":48,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9434,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6255910165484634,"acs":2117,"articleLive":2,"columnArticles":36,"formTitle":"[1809]没有广告的剧集","frequency":0.4626968388,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3384,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6153846153846154,"acs":216,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":351,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6603665521191294,"acs":1153,"articleLive":2,"columnArticles":33,"formTitle":"[1811]寻找面试候选人","frequency":0.5796181768,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1746,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7924944812362031,"acs":8975,"articleLive":2,"columnArticles":221,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.4900060181,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":11325,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5012156686177398,"acs":5566,"articleLive":2,"columnArticles":85,"formTitle":"[1813]句子相似性 III","frequency":1.0598966468,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":11105,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.35107939992682036,"acs":3838,"articleLive":2,"columnArticles":87,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10932,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29483828814113033,"acs":1805,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":6122,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.734783690479893,"acs":47251,"articleLive":2,"columnArticles":641,"formTitle":"[1816]截断句子","frequency":0.8363731366,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":64306,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6974550241333919,"acs":6358,"articleLive":2,"columnArticles":105,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.5185304849,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":9116,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3718257567169255,"acs":26239,"articleLive":2,"columnArticles":341,"formTitle":"[1818]绝对差值和","frequency":2.6012072943,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":70568,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3806393785479534,"acs":2548,"articleLive":2,"columnArticles":35,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.6468704038,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6694,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.48986486486486486,"acs":145,"articleLive":2,"columnArticles":9,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":296,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9007271577616187,"acs":2849,"articleLive":2,"columnArticles":25,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":3163,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8030084327281015,"acs":21140,"articleLive":2,"columnArticles":210,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":26326,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7218109953287819,"acs":10044,"articleLive":2,"columnArticles":128,"formTitle":"[1823]找出游戏的获胜者","frequency":1.6568080393,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":13915,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6500733257291836,"acs":7979,"articleLive":2,"columnArticles":159,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":12274,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28428198433420365,"acs":2722,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9575,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4267352185089974,"acs":332,"articleLive":2,"columnArticles":24,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":778,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7915492957746478,"acs":10959,"articleLive":2,"columnArticles":154,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":13845,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8659405537459284,"acs":8507,"articleLive":2,"columnArticles":107,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9824,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6906229720960415,"acs":4257,"articleLive":2,"columnArticles":88,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":6164,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.49069003285870755,"acs":896,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1826,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7407903549899532,"acs":1106,"articleLive":2,"columnArticles":29,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1493,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8235359794562608,"acs":14752,"articleLive":2,"columnArticles":231,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":17913,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6831154029786382,"acs":44354,"articleLive":2,"columnArticles":393,"formTitle":"[1833]雪糕的最大数量","frequency":1.4234560486,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":64929,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3559741657696448,"acs":6614,"articleLive":2,"columnArticles":137,"formTitle":"[1834]单线程 CPU","frequency":0.6124079997,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18580,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5151057401812689,"acs":3751,"articleLive":2,"columnArticles":62,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.797440042,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7282,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7339331619537275,"acs":571,"articleLive":2,"columnArticles":33,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.5483656333,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":778,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7949147806649902,"acs":8535,"articleLive":2,"columnArticles":103,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4626968388,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10737,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42886004126547456,"acs":29931,"articleLive":2,"columnArticles":314,"formTitle":"[1838]最高频元素的频数","frequency":3.2305297528,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":69792,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5661241514680625,"acs":6922,"articleLive":2,"columnArticles":134,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":12227,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3899323816679189,"acs":2076,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5324,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5261768587769468,"acs":1196,"articleLive":2,"columnArticles":39,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2273,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6462264150943396,"acs":137,"articleLive":2,"columnArticles":15,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":212,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5022392834293026,"acs":785,"articleLive":2,"columnArticles":27,"formTitle":"[1843]可疑银行账户","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1563,"title":"可疑银行账户","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7992961391160336,"acs":7722,"articleLive":2,"columnArticles":129,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9661,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.508498300339932,"acs":7629,"articleLive":2,"columnArticles":74,"formTitle":"[1845]座位预约管理系统","frequency":0.4900060181,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":15003,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6331718580224557,"acs":27971,"articleLive":2,"columnArticles":379,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.1544941029,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":44176,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3627737226277372,"acs":2485,"articleLive":2,"columnArticles":47,"formTitle":"[1847]最近的房间","frequency":0.797440042,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6850,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6810073452256034,"acs":8437,"articleLive":2,"columnArticles":108,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":12389,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3286395511921459,"acs":5858,"articleLive":2,"columnArticles":113,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.5483656333,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17825,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6110441282855076,"acs":2534,"articleLive":2,"columnArticles":51,"formTitle":"[1850]邻位交换的最小次数","frequency":0.6468704038,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4147,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40480210091915214,"acs":2158,"articleLive":2,"columnArticles":52,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.797440042,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5331,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.5784313725490197,"acs":413,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":714,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.638327853452325,"acs":1359,"articleLive":2,"columnArticles":21,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":2129,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7750155763239875,"acs":12439,"articleLive":2,"columnArticles":133,"formTitle":"[1854]人口最多的年份","frequency":1.3914088712,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":16050,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6686970822927453,"acs":10978,"articleLive":2,"columnArticles":107,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":16417,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35492627099992663,"acs":4838,"articleLive":2,"columnArticles":85,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.4626968388,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":13631,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45714285714285713,"acs":2384,"articleLive":2,"columnArticles":35,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5215,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6407185628742516,"acs":428,"articleLive":2,"columnArticles":25,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":668,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7654381017212876,"acs":7871,"articleLive":2,"columnArticles":158,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":10283,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.76938018717994,"acs":4357,"articleLive":2,"columnArticles":79,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5663,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6210022233624081,"acs":3631,"articleLive":2,"columnArticles":73,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5847,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31539986781229346,"acs":2386,"articleLive":2,"columnArticles":45,"formTitle":"[1862]向下取整数对和","frequency":0.6124079997,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7565,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8881558079045867,"acs":14000,"articleLive":2,"columnArticles":164,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.9711860341,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":15763,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3909191583610188,"acs":4589,"articleLive":2,"columnArticles":111,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.5796181768,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11739,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5104695138824832,"acs":5534,"articleLive":2,"columnArticles":67,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.6124079997,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10841,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6051165146909828,"acs":2389,"articleLive":2,"columnArticles":51,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.783399074,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3948,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.74364896073903,"acs":644,"articleLive":2,"columnArticles":18,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":866,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5233441910966341,"acs":482,"articleLive":2,"columnArticles":20,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":921,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7735401354245037,"acs":13366,"articleLive":2,"columnArticles":154,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.4626968388,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":17279,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45049135107177746,"acs":7839,"articleLive":2,"columnArticles":76,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.5185304849,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":17401,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2756636589512227,"acs":6324,"articleLive":2,"columnArticles":132,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":22941,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6158536585365854,"acs":2222,"articleLive":2,"columnArticles":32,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3608,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8192090395480226,"acs":2610,"articleLive":2,"columnArticles":37,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":3186,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8742632612966601,"acs":445,"articleLive":2,"columnArticles":24,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":509,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.722636815920398,"acs":581,"articleLive":2,"columnArticles":24,"formTitle":"[1875]将工资相同的雇员分组","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":804,"title":"将工资相同的雇员分组","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7259901239544493,"acs":7204,"articleLive":2,"columnArticles":120,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":9923,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8182003724774856,"acs":32071,"articleLive":2,"columnArticles":412,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.8600812983,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":39197,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.43333333333333335,"acs":2262,"articleLive":2,"columnArticles":58,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5220,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41682321018576496,"acs":1997,"articleLive":2,"columnArticles":40,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4791,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7706824247045367,"acs":8086,"articleLive":2,"columnArticles":112,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10492,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3568963597907158,"acs":6412,"articleLive":2,"columnArticles":66,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17966,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.28199426111908177,"acs":3931,"articleLive":2,"columnArticles":118,"formTitle":"[1882]使用服务器处理任务","frequency":0.6815479423,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13940,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.38286786160900377,"acs":1837,"articleLive":2,"columnArticles":31,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.8430683946,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4798,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.694325634445395,"acs":2435,"articleLive":2,"columnArticles":43,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.3155712755,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3507,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5256975036710719,"acs":358,"articleLive":2,"columnArticles":18,"formTitle":"[1885]统计数对","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":681,"title":"统计数对","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.571597516507342,"acs":5800,"articleLive":2,"columnArticles":86,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.4113903831,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":10147,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6472472710014239,"acs":5455,"articleLive":2,"columnArticles":72,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.4900060181,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8428,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3237441911927418,"acs":2926,"articleLive":2,"columnArticles":69,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":9038,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2724458204334365,"acs":2288,"articleLive":2,"columnArticles":43,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.6815479423,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8398,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7323232323232324,"acs":1305,"articleLive":2,"columnArticles":23,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1782,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.3448275862068966,"acs":1800,"articleLive":2,"columnArticles":25,"formTitle":"[1891]割绳子","frequency":0.4900060181,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":5220,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3586374695863747,"acs":737,"articleLive":2,"columnArticles":18,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":2055,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5906260840986689,"acs":32348,"articleLive":2,"columnArticles":425,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.1230732056,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":54769,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45758336148241086,"acs":37930,"articleLive":2,"columnArticles":522,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":2.0394823771,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":82892,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5378358392901158,"acs":2182,"articleLive":2,"columnArticles":42,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":4057,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5074285714285715,"acs":888,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1750,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.536085698647275,"acs":6856,"articleLive":2,"columnArticles":87,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.4365173332,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12789,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31349793021880545,"acs":4241,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13528,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6353761348897535,"acs":3919,"articleLive":2,"columnArticles":45,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6168,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.44356435643564357,"acs":1344,"articleLive":2,"columnArticles":37,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1251939893,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":3030,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6201117318435754,"acs":1554,"articleLive":2,"columnArticles":47,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":2506,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.47580645161290325,"acs":118,"articleLive":2,"columnArticles":5,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":248,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6380558428128231,"acs":8638,"articleLive":2,"columnArticles":112,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":13538,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.28717910336052693,"acs":3837,"articleLive":2,"columnArticles":74,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13361,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5950191570881226,"acs":6212,"articleLive":2,"columnArticles":134,"formTitle":"[1905]统计子岛屿","frequency":1.3914088712,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":10440,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4239043824701195,"acs":2660,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.1251939893,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6275,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5867126833477135,"acs":680,"articleLive":2,"columnArticles":25,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1159,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6707692307692308,"acs":218,"articleLive":2,"columnArticles":11,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":325,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.320186598812553,"acs":5285,"articleLive":2,"columnArticles":81,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.4626968388,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":16506,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.674341560377671,"acs":4071,"articleLive":2,"columnArticles":66,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.4900060181,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":6037,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5662884443117349,"acs":3793,"articleLive":2,"columnArticles":79,"formTitle":"[1911]最大子序列交替和","frequency":1.3914088712,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6698,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.25,"acs":2040,"articleLive":2,"columnArticles":46,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":8160,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8324589317966802,"acs":9679,"articleLive":2,"columnArticles":114,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.9996374553,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":11627,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44508746547415495,"acs":3384,"articleLive":2,"columnArticles":74,"formTitle":"[1914]循环轮转矩阵","frequency":1.2742818789,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7603,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3959801618376403,"acs":3034,"articleLive":2,"columnArticles":61,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7662,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5498687664041995,"acs":1257,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.5093309599,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2286,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.29054520358868186,"acs":421,"articleLive":2,"columnArticles":11,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1449,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5289421157684631,"acs":265,"articleLive":2,"columnArticles":6,"formTitle":"[1918]第 K 小的子数组和·","frequency":1.1962391719,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":501,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3962765957446808,"acs":596,"articleLive":2,"columnArticles":19,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1504,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.8928325938886459,"acs":14288,"articleLive":2,"columnArticles":124,"formTitle":"[1920]基于排列构建数组","frequency":2.1544941029,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":16003,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34763744427934623,"acs":5849,"articleLive":2,"columnArticles":95,"formTitle":"[1921]消灭怪物的最大数量","frequency":1.0918686795,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16825,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36213113547722425,"acs":4921,"articleLive":2,"columnArticles":81,"formTitle":"[1922]统计好数字的数目","frequency":0.5185304849,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13589,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2396507601987054,"acs":1592,"articleLive":2,"columnArticles":34,"formTitle":"[1923]最长公共子路径","frequency":1.9458004417,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6643,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.39226519337016574,"acs":71,"articleLive":2,"columnArticles":6,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":181,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6928176795580111,"acs":5643,"articleLive":2,"columnArticles":73,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.6568080393,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":8145,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34665866003259843,"acs":4041,"articleLive":2,"columnArticles":68,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":11657,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41558991739038337,"acs":1962,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.5483656333,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4721,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.40996835443037977,"acs":2591,"articleLive":2,"columnArticles":46,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.2207434884,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":6320,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.8917159763313609,"acs":16577,"articleLive":2,"columnArticles":144,"formTitle":"[1929]数组串联","frequency":1.3307781213,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":18590,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4839893262174783,"acs":5804,"articleLive":2,"columnArticles":106,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.0918686795,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11992,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5646008403361344,"acs":2150,"articleLive":2,"columnArticles":65,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.7545149972,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3808,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3300813008130081,"acs":1218,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.7352356726,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3690,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5063063063063064,"acs":562,"articleLive":2,"columnArticles":28,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.7545149972,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":1110,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7588028169014085,"acs":431,"articleLive":2,"columnArticles":16,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":568,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7333655239014969,"acs":7594,"articleLive":2,"columnArticles":107,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":10355,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45081842982722037,"acs":5949,"articleLive":2,"columnArticles":69,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":13196,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2491560252458535,"acs":3395,"articleLive":2,"columnArticles":65,"formTitle":"[1937]扣分后的最大得分","frequency":1.4567702553,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13626,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3551103368176539,"acs":1223,"articleLive":2,"columnArticles":43,"formTitle":"[1938]查询最大基因差","frequency":1.5093309599,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3444,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6376237623762376,"acs":644,"articleLive":2,"columnArticles":17,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":1010,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7866666666666666,"acs":472,"articleLive":2,"columnArticles":29,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":600,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7654562020044253,"acs":5881,"articleLive":2,"columnArticles":103,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":1.0291817016,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":7683,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.39898605830164763,"acs":3148,"articleLive":2,"columnArticles":74,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7890,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.41350638815656054,"acs":2039,"articleLive":2,"columnArticles":57,"formTitle":"[1943]描述绘画结果","frequency":0.6815479423,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4931,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5829979879275654,"acs":2318,"articleLive":2,"columnArticles":66,"formTitle":"[1944]队列中可以看到的人数","frequency":1.0291817016,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3976,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6598689002184996,"acs":7248,"articleLive":2,"columnArticles":90,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.4900060181,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":10984,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3060747663551402,"acs":5633,"articleLive":2,"columnArticles":83,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":1.0598966468,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":18404,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5453850076491585,"acs":4278,"articleLive":2,"columnArticles":93,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7844,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5188347564038172,"acs":1033,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.9996374553,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1991,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5247252747252747,"acs":382,"articleLive":2,"columnArticles":15,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":728,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5270655270655271,"acs":185,"articleLive":2,"columnArticles":8,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":351,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7063037249283668,"acs":493,"articleLive":2,"columnArticles":16,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":698,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5435262296248843,"acs":7636,"articleLive":2,"columnArticles":85,"formTitle":"[1952]三除数","frequency":0.4626968388,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":14049,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.33237990465713235,"acs":4532,"articleLive":2,"columnArticles":86,"formTitle":"[1953]你可以工作的最大周数","frequency":0.5483656333,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13635,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.47944311507504894,"acs":4408,"articleLive":2,"columnArticles":73,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.5185304849,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":9194,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4978933870672284,"acs":2718,"articleLive":2,"columnArticles":44,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.9996374553,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5459,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4046511627906977,"acs":174,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.8343265753,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":430,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6081188343349586,"acs":5363,"articleLive":2,"columnArticles":63,"formTitle":"[1957]删除字符使字符串变好","frequency":0.4365173332,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8819,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42600969305331177,"acs":2637,"articleLive":2,"columnArticles":48,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6190,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.42152704135737007,"acs":1590,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3772,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28577319587628863,"acs":693,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.6252347774,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2425,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5348934977578476,"acs":7634,"articleLive":2,"columnArticles":72,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.4900060181,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":14272,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4375274644792735,"acs":5974,"articleLive":2,"columnArticles":82,"formTitle":"[1962]移除石子使总数最小","frequency":1.4567702553,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13654,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6193599160545645,"acs":4722,"articleLive":2,"columnArticles":61,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.4626968388,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7624,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3901577584177066,"acs":3314,"articleLive":2,"columnArticles":50,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8494,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7651775486827033,"acs":668,"articleLive":2,"columnArticles":17,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":873,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.723404255319149,"acs":68,"articleLive":2,"columnArticles":8,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":94,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.782117278424351,"acs":6989,"articleLive":2,"columnArticles":75,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8936,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3631914578080973,"acs":4898,"articleLive":2,"columnArticles":71,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13486,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2828301710440228,"acs":3026,"articleLive":2,"columnArticles":44,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.1738745544,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10699,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4782079870261504,"acs":2359,"articleLive":2,"columnArticles":53,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.783399074,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4933,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.4972375690607735,"acs":1170,"articleLive":2,"columnArticles":31,"formTitle":"[1971]寻找图中是否存在路径","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":2353,"title":"寻找图中是否存在路径","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4343283582089552,"acs":291,"articleLive":2,"columnArticles":12,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.6815479423,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":670,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.6047904191616766,"acs":101,"articleLive":2,"columnArticles":11,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":167,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7332384566729918,"acs":4637,"articleLive":2,"columnArticles":66,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.9996374553,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":6324,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38808296367342043,"acs":3237,"articleLive":2,"columnArticles":47,"formTitle":"[1975]最大方阵和","frequency":1.4914477937,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8341,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.30187492135397004,"acs":2399,"articleLive":2,"columnArticles":54,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":7947,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.25535823637477034,"acs":834,"articleLive":2,"columnArticles":17,"formTitle":"[1977]划分数字的方案数","frequency":1.407279701,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3266,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5399159663865546,"acs":514,"articleLive":2,"columnArticles":15,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.4900060181,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":952,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7916986278019262,"acs":9289,"articleLive":2,"columnArticles":117,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":11733,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5851552969878953,"acs":6236,"articleLive":2,"columnArticles":111,"formTitle":"[1980]找出不同的二进制字符串","frequency":1.0598966468,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10657,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30436706060797575,"acs":4816,"articleLive":2,"columnArticles":86,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.7958602944,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15823,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.46818416968442833,"acs":905,"articleLive":2,"columnArticles":19,"formTitle":"[1982]从子集的和还原数组","frequency":1.2742818789,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1933,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6370370370370371,"acs":86,"articleLive":2,"columnArticles":4,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":135,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5770785726841272,"acs":6566,"articleLive":2,"columnArticles":72,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":11378,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4149423064526526,"acs":6437,"articleLive":2,"columnArticles":92,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":15513,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.28600143575017944,"acs":3984,"articleLive":2,"columnArticles":80,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.5185304849,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13930,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.47247000922792987,"acs":1536,"articleLive":2,"columnArticles":27,"formTitle":"[1987]不同的好子序列数目","frequency":0.9996374553,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3251,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6689774696707106,"acs":386,"articleLive":2,"columnArticles":10,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.2742818789,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":577,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5949367088607594,"acs":94,"articleLive":2,"columnArticles":3,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":158,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.5493975903614458,"acs":456,"articleLive":2,"columnArticles":12,"formTitle":"[1990]统计实验的数量","frequency":0.5483656333,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":830,"title":"统计实验的数量","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6581252737625931,"acs":6010,"articleLive":2,"columnArticles":83,"formTitle":"[1991]找到数组的中间位置","frequency":0.4365173332,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":9132,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5943804034582133,"acs":3300,"articleLive":2,"columnArticles":68,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5552,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3864734299516908,"acs":2000,"articleLive":2,"columnArticles":46,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":5175,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37377416643317457,"acs":1334,"articleLive":2,"columnArticles":38,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3569,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5646409822937983,"acs":6346,"articleLive":2,"columnArticles":50,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":11239,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2554782774390244,"acs":5363,"articleLive":2,"columnArticles":101,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":20992,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3401511783014673,"acs":2295,"articleLive":2,"columnArticles":38,"formTitle":"[1997]访问完所有房间的第一天","frequency":1.3162872142,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6747,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4229658160808859,"acs":1757,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.7198374588,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":4154,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6126760563380281,"acs":87,"articleLive":2,"columnArticles":9,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":142,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7702625570776256,"acs":8097,"articleLive":2,"columnArticles":121,"formTitle":"[2000]反转单词前缀","frequency":0.4626968388,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":10512,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3625348933895587,"acs":6104,"articleLive":2,"columnArticles":132,"formTitle":"[2001]可互换矩形的组数","frequency":0.6124079997,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16837,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5823406789755807,"acs":3911,"articleLive":2,"columnArticles":90,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6716,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3948969578017664,"acs":2012,"articleLive":2,"columnArticles":43,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":5095,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4024896265560166,"acs":194,"articleLive":2,"columnArticles":8,"formTitle":"[2004]The Number of Seniors and Juniors to Join the Company","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","questionId":"2152","status":"","submitted":482,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6181818181818182,"acs":34,"articleLive":2,"columnArticles":3,"formTitle":"[2005]斐波那契树的移除子树游戏","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":55,"title":"斐波那契树的移除子树游戏","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8494686271655263,"acs":5835,"articleLive":2,"columnArticles":79,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":6869,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3197104370933749,"acs":3489,"articleLive":2,"columnArticles":68,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.4626968388,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":10913,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4267680854507202,"acs":2637,"articleLive":2,"columnArticles":47,"formTitle":"[2008]出租车的最大盈利","frequency":1.6895656358,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":6179,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41471658866354655,"acs":1595,"articleLive":2,"columnArticles":44,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3846,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6468401486988847,"acs":174,"articleLive":2,"columnArticles":9,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"","submitted":269,"title":"The Number of Seniors and Juniors to Join the Company II","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company-ii"},{"acceptance":0.8773638968481375,"acs":9186,"articleLive":2,"columnArticles":95,"formTitle":"[2011]执行操作后的变量值","frequency":1.3605422232,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":10470,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36415247364152475,"acs":4490,"articleLive":2,"columnArticles":81,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12330,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.34307709472274905,"acs":3075,"articleLive":2,"columnArticles":56,"formTitle":"[2013]检测正方形","frequency":0.5185304849,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8963,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5312183597705029,"acs":1574,"articleLive":2,"columnArticles":26,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2963,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.6814159292035398,"acs":77,"articleLive":2,"columnArticles":5,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":113,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5559275474289639,"acs":6476,"articleLive":2,"columnArticles":87,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.4626968388,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":11649,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.35603042375950744,"acs":3932,"articleLive":2,"columnArticles":99,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":11044,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.41043344840813195,"acs":2140,"articleLive":2,"columnArticles":53,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.6468704038,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":5214,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3575402635431918,"acs":1221,"articleLive":2,"columnArticles":35,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.6468704038,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3415,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7606382978723404,"acs":286,"articleLive":2,"columnArticles":9,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":376,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.6633663366336634,"acs":134,"articleLive":2,"columnArticles":9,"formTitle":"[2021]街上最亮的位置","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":202,"title":"街上最亮的位置","titleSlug":"brightest-position-on-street"},{"acceptance":0.6526908635794744,"acs":4172,"articleLive":2,"columnArticles":55,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":6392,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.75139146567718,"acs":3240,"articleLive":2,"columnArticles":55,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":4312,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4915194964154572,"acs":2811,"articleLive":2,"columnArticles":70,"formTitle":"[2024]考试的最大困扰度","frequency":0.4900060181,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5719,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2640858566500575,"acs":1378,"articleLive":2,"columnArticles":45,"formTitle":"[2025]分割数组的最多方案数","frequency":0.6815479423,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":5218,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8599348534201955,"acs":528,"articleLive":2,"columnArticles":15,"formTitle":"[2026]Low-Quality Problems","frequency":1.0598966468,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":614,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5620807214340702,"acs":5111,"articleLive":2,"columnArticles":59,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":9093,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4289051391427991,"acs":4223,"articleLive":2,"columnArticles":63,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9846,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.23649754500818332,"acs":2312,"articleLive":2,"columnArticles":68,"formTitle":"[2029]石子游戏 IX","frequency":0.6124079997,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9776,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.35135135135135137,"acs":1326,"articleLive":2,"columnArticles":41,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.5483656333,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3774,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.547486033519553,"acs":98,"articleLive":2,"columnArticles":5,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":2.0071693881,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":179,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6633056544088572,"acs":6710,"articleLive":2,"columnArticles":115,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":10116,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3972907940468764,"acs":4458,"articleLive":2,"columnArticles":92,"formTitle":"[2033]获取单值网格的最小操作数","frequency":1.0291817016,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":11221,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.30480811645346273,"acs":3455,"articleLive":2,"columnArticles":71,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":11335,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3212053213656035,"acs":2004,"articleLive":2,"columnArticles":47,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.5796181768,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":6239,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.4896551724137931,"acs":71,"articleLive":2,"columnArticles":7,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":145,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8329441732116324,"acs":3924,"articleLive":2,"columnArticles":56,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":4711,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5073004542504866,"acs":3127,"articleLive":2,"columnArticles":66,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":6164,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.36429906542056073,"acs":1949,"articleLive":2,"columnArticles":45,"formTitle":"[2039]网络空闲的时刻","frequency":0.5483656333,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":5350,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.32435465768799104,"acs":1156,"articleLive":2,"columnArticles":21,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3564,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6325581395348837,"acs":272,"articleLive":2,"columnArticles":13,"formTitle":"[2041]面试中被录取的候选人","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":430,"title":"面试中被录取的候选人","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6676812891674128,"acs":7458,"articleLive":2,"columnArticles":119,"formTitle":"[2042]检查句子中的数字是否递增","frequency":1.3605422232,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":11170,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5925135764158262,"acs":6110,"articleLive":2,"columnArticles":72,"formTitle":"[2043]简易银行系统","frequency":0.4900060181,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":10312,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7414698162729659,"acs":5085,"articleLive":2,"columnArticles":97,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.4113903831,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6858,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.33218489807637097,"acs":2314,"articleLive":2,"columnArticles":61,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.5796181768,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":6966,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.7142857142857143,"acs":170,"articleLive":2,"columnArticles":18,"formTitle":"[2046]Sort Linked List Already Sorted Using Absolute Values","frequency":0.0,"frontendQuestionId":"2046","leaf":true,"level":2,"nodeType":"def","questionId":"1992","status":"","submitted":238,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.2868064404031044,"acs":4952,"articleLive":2,"columnArticles":106,"formTitle":"[2047]句子中的有效单词数","frequency":0.4626968388,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":17266,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4155751125665166,"acs":4061,"articleLive":2,"columnArticles":93,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9772,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.39598893499308435,"acs":2863,"articleLive":2,"columnArticles":94,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":7230,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5593356549691937,"acs":2088,"articleLive":2,"columnArticles":70,"formTitle":"[2050]并行课程 III","frequency":0.4626968388,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3733,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.6812080536912751,"acs":203,"articleLive":2,"columnArticles":8,"formTitle":"[2051]The Category of Each Member in the Store","frequency":0.0,"frontendQuestionId":"2051","leaf":true,"level":2,"nodeType":"def","questionId":"2194","status":"","submitted":298,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5180722891566265,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":83,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7499556344276841,"acs":4226,"articleLive":2,"columnArticles":66,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":5635,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3315673859671792,"acs":2566,"articleLive":2,"columnArticles":60,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":7739,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3841485183862906,"acs":2152,"articleLive":2,"columnArticles":69,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.9996374553,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":5602,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6113243761996161,"acs":637,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":1042,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7744854946689809,"acs":6247,"articleLive":2,"columnArticles":42,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":8066,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5726003103524717,"acs":5166,"articleLive":2,"columnArticles":74,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":9022,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.4265629992544467,"acs":4005,"articleLive":2,"columnArticles":93,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":9389,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.36232952451161077,"acs":983,"articleLive":2,"columnArticles":21,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2713,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5192307692307693,"acs":54,"articleLive":2,"columnArticles":5,"formTitle":"[2061]Number of Spaces Cleaning Robot Cleaned","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":104,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.6064944134078212,"acs":5211,"articleLive":2,"columnArticles":93,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.4626968388,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":8592,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.4837360594795539,"acs":4164,"articleLive":2,"columnArticles":100,"formTitle":"[2063]所有子字符串中的元音","frequency":0.4626968388,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":8608,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.4146341463414634,"acs":3315,"articleLive":2,"columnArticles":72,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":7995,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5335660580021482,"acs":1987,"articleLive":2,"columnArticles":57,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3724,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8333333333333334,"acs":180,"articleLive":2,"columnArticles":10,"formTitle":"[2066]Account Balance","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":216,"title":"Account Balance","titleSlug":"account-balance"},{"acceptance":0.4158415841584158,"acs":42,"articleLive":2,"columnArticles":4,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":101,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.7388832487309644,"acs":3639,"articleLive":2,"columnArticles":64,"formTitle":"[2068]检查两个字符串是否几乎相等","frequency":0.0,"frontendQuestionId":"2068","leaf":true,"level":1,"nodeType":"def","questionId":"2177","status":"ac","submitted":4925,"title":"检查两个字符串是否几乎相等","titleSlug":"check-whether-two-strings-are-almost-equivalent"},{"acceptance":0.18996984605618156,"acs":2394,"articleLive":2,"columnArticles":76,"formTitle":"[2069]模拟行走机器人 II","frequency":0.0,"frontendQuestionId":"2069","leaf":true,"level":2,"nodeType":"def","questionId":"2178","status":"notac","submitted":12602,"title":"模拟行走机器人 II","titleSlug":"walking-robot-simulation-ii"},{"acceptance":0.4260933751614689,"acs":2309,"articleLive":2,"columnArticles":78,"formTitle":"[2070]每一个查询的最大美丽值","frequency":0.0,"frontendQuestionId":"2070","leaf":true,"level":2,"nodeType":"def","questionId":"2179","status":"","submitted":5419,"title":"每一个查询的最大美丽值","titleSlug":"most-beautiful-item-for-each-query"},{"acceptance":0.36241830065359476,"acs":1109,"articleLive":2,"columnArticles":28,"formTitle":"[2071]你可以安排的最多任务数目","frequency":0.4626968388,"frontendQuestionId":"2071","leaf":true,"level":3,"nodeType":"def","questionId":"2180","status":"","submitted":3060,"title":"你可以安排的最多任务数目","titleSlug":"maximum-number-of-tasks-you-can-assign"},{"acceptance":0.7002967359050445,"acs":236,"articleLive":2,"columnArticles":6,"formTitle":"[2072]The Winner University","frequency":0.0,"frontendQuestionId":"2072","leaf":true,"level":1,"nodeType":"def","questionId":"2214","status":"","submitted":337,"title":"The Winner University","titleSlug":"the-winner-university"},{"acceptance":0.6165369074603331,"acs":6256,"articleLive":2,"columnArticles":94,"formTitle":"[2073]买票需要的时间","frequency":0.0,"frontendQuestionId":"2073","leaf":true,"level":1,"nodeType":"def","questionId":"2195","status":"","submitted":10147,"title":"买票需要的时间","titleSlug":"time-needed-to-buy-tickets"},{"acceptance":0.414915747867693,"acs":3989,"articleLive":2,"columnArticles":115,"formTitle":"[2074]反转偶数长度组的节点","frequency":0.9996374553,"frontendQuestionId":"2074","leaf":true,"level":2,"nodeType":"def","questionId":"2196","status":"","submitted":9614,"title":"反转偶数长度组的节点","titleSlug":"reverse-nodes-in-even-length-groups"},{"acceptance":0.45701104431706974,"acs":3269,"articleLive":2,"columnArticles":65,"formTitle":"[2075]解码斜向换位密码","frequency":0.4900060181,"frontendQuestionId":"2075","leaf":true,"level":2,"nodeType":"def","questionId":"2197","status":"","submitted":7153,"title":"解码斜向换位密码","titleSlug":"decode-the-slanted-ciphertext"},{"acceptance":0.49370277078085645,"acs":2548,"articleLive":2,"columnArticles":68,"formTitle":"[2076]处理含限制条件的好友请求","frequency":0.0,"frontendQuestionId":"2076","leaf":true,"level":3,"nodeType":"def","questionId":"2198","status":"","submitted":5161,"title":"处理含限制条件的好友请求","titleSlug":"process-restricted-friend-requests"},{"acceptance":0.64,"acs":48,"articleLive":2,"columnArticles":4,"formTitle":"[2077]Paths in Maze That Lead to Same Room","frequency":0.0,"frontendQuestionId":"2077","leaf":true,"level":2,"nodeType":"def","questionId":"2218","status":"","submitted":75,"title":"Paths in Maze That Lead to Same Room","titleSlug":"paths-in-maze-that-lead-to-same-room"},{"acceptance":0.752360717658168,"acs":6374,"articleLive":2,"columnArticles":84,"formTitle":"[2078]两栋颜色不同且距离最远的房子","frequency":0.3201069813,"frontendQuestionId":"2078","leaf":true,"level":1,"nodeType":"def","questionId":"2199","status":"","submitted":8472,"title":"两栋颜色不同且距离最远的房子","titleSlug":"two-furthest-houses-with-different-colors"},{"acceptance":0.7713596366732898,"acs":5435,"articleLive":2,"columnArticles":101,"formTitle":"[2079]给植物浇水","frequency":0.0,"frontendQuestionId":"2079","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"","submitted":7046,"title":"给植物浇水","titleSlug":"watering-plants"},{"acceptance":0.2675309047150202,"acs":4891,"articleLive":2,"columnArticles":134,"formTitle":"[2080]区间内查询数字的频率","frequency":0.4113903831,"frontendQuestionId":"2080","leaf":true,"level":2,"nodeType":"def","questionId":"1294","status":"","submitted":18282,"title":"区间内查询数字的频率","titleSlug":"range-frequency-queries"},{"acceptance":0.4030808729139923,"acs":2198,"articleLive":2,"columnArticles":64,"formTitle":"[2081]k 镜像数字的和","frequency":0.0,"frontendQuestionId":"2081","leaf":true,"level":3,"nodeType":"def","questionId":"2202","status":"","submitted":5453,"title":"k 镜像数字的和","titleSlug":"sum-of-k-mirror-numbers"},{"acceptance":0.7585301837270341,"acs":289,"articleLive":2,"columnArticles":9,"formTitle":"[2082]富有客户的数量","frequency":0.0,"frontendQuestionId":"2082","leaf":true,"level":1,"nodeType":"def","questionId":"2223","status":"","submitted":381,"title":"富有客户的数量","titleSlug":"the-number-of-rich-customers"},{"acceptance":0.6885245901639344,"acs":84,"articleLive":2,"columnArticles":8,"formTitle":"[2083]求以相同字母开头和结尾的子串总数","frequency":0.0,"frontendQuestionId":"2083","leaf":true,"level":2,"nodeType":"def","questionId":"2225","status":"","submitted":122,"title":"求以相同字母开头和结尾的子串总数","titleSlug":"substrings-that-begin-and-end-with-the-same-letter"},{"acceptance":0.8058823529411765,"acs":137,"articleLive":2,"columnArticles":8,"formTitle":"[2084]Drop Type 1 Orders for Customers With Type 0 Orders","frequency":0.0,"frontendQuestionId":"2084","leaf":true,"level":2,"nodeType":"def","questionId":"2224","status":"","submitted":170,"title":"Drop Type 1 Orders for Customers With Type 0 Orders","titleSlug":"drop-type-1-orders-for-customers-with-type-0-orders"},{"acceptance":0.7364102564102564,"acs":3590,"articleLive":2,"columnArticles":55,"formTitle":"[2085]统计出现过一次的公共字符串","frequency":0.0,"frontendQuestionId":"2085","leaf":true,"level":1,"nodeType":"def","questionId":"2190","status":"ac","submitted":4875,"title":"统计出现过一次的公共字符串","titleSlug":"count-common-words-with-one-occurrence"},{"acceptance":0.4480088495575221,"acs":2835,"articleLive":2,"columnArticles":67,"formTitle":"[2086]从房屋收集雨水需要的最少水桶数","frequency":0.0,"frontendQuestionId":"2086","leaf":true,"level":2,"nodeType":"def","questionId":"2191","status":"ac","submitted":6328,"title":"从房屋收集雨水需要的最少水桶数","titleSlug":"minimum-number-of-buckets-required-to-collect-rainwater-from-houses"},{"acceptance":0.46367211757400123,"acs":2240,"articleLive":2,"columnArticles":57,"formTitle":"[2087]网格图中机器人回家的最小代价","frequency":0.0,"frontendQuestionId":"2087","leaf":true,"level":2,"nodeType":"def","questionId":"2192","status":"ac","submitted":4831,"title":"网格图中机器人回家的最小代价","titleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid"},{"acceptance":0.6160354552780016,"acs":1529,"articleLive":2,"columnArticles":42,"formTitle":"[2088]统计农场中肥沃金字塔的数目","frequency":0.0,"frontendQuestionId":"2088","leaf":true,"level":3,"nodeType":"def","questionId":"2193","status":"","submitted":2482,"title":"统计农场中肥沃金字塔的数目","titleSlug":"count-fertile-pyramids-in-a-land"},{"acceptance":0.844162188568637,"acs":6912,"articleLive":2,"columnArticles":76,"formTitle":"[2089]找出数组排序后的目标下标","frequency":0.0503937192,"frontendQuestionId":"2089","leaf":true,"level":1,"nodeType":"def","questionId":"2210","status":"","submitted":8188,"title":"找出数组排序后的目标下标","titleSlug":"find-target-indices-after-sorting-array"},{"acceptance":0.3465039705597521,"acs":5367,"articleLive":2,"columnArticles":89,"formTitle":"[2090]半径为 k 的子数组平均值","frequency":0.1125198712,"frontendQuestionId":"2090","leaf":true,"level":2,"nodeType":"def","questionId":"2211","status":"","submitted":15489,"title":"半径为 k 的子数组平均值","titleSlug":"k-radius-subarray-averages"},{"acceptance":0.5711820534943917,"acs":5296,"articleLive":2,"columnArticles":107,"formTitle":"[2091]从数组中移除最大值和最小值","frequency":0.0,"frontendQuestionId":"2091","leaf":true,"level":2,"nodeType":"def","questionId":"2212","status":"","submitted":9272,"title":"从数组中移除最大值和最小值","titleSlug":"removing-minimum-and-maximum-from-array"},{"acceptance":0.2630430334856441,"acs":3857,"articleLive":2,"columnArticles":107,"formTitle":"[2092]找出知晓秘密的所有专家","frequency":0.2299611348,"frontendQuestionId":"2092","leaf":true,"level":3,"nodeType":"def","questionId":"2213","status":"","submitted":14663,"title":"找出知晓秘密的所有专家","titleSlug":"find-all-people-with-secret"},{"acceptance":0.6607142857142857,"acs":37,"articleLive":2,"columnArticles":3,"formTitle":"[2093]Minimum Cost to Reach City With Discounts","frequency":0.0,"frontendQuestionId":"2093","leaf":true,"level":2,"nodeType":"def","questionId":"2230","status":"","submitted":56,"title":"Minimum Cost to Reach City With Discounts","titleSlug":"minimum-cost-to-reach-city-with-discounts"},{"acceptance":0.5496581504138179,"acs":6110,"articleLive":2,"columnArticles":104,"formTitle":"[2094]找出 3 位偶数","frequency":0.1471974097,"frontendQuestionId":"2094","leaf":true,"level":1,"nodeType":"def","questionId":"2215","status":"","submitted":11116,"title":"找出 3 位偶数","titleSlug":"finding-3-digit-even-numbers"},{"acceptance":0.5963640184951661,"acs":5675,"articleLive":2,"columnArticles":87,"formTitle":"[2095]删除链表的中间节点","frequency":0.0,"frontendQuestionId":"2095","leaf":true,"level":2,"nodeType":"def","questionId":"2216","status":"","submitted":9516,"title":"删除链表的中间节点","titleSlug":"delete-the-middle-node-of-a-linked-list"},{"acceptance":0.40069547938400396,"acs":4033,"articleLive":2,"columnArticles":152,"formTitle":"[2096]从二叉树一个节点到另一个节点每一步的方向","frequency":0.2646386732,"frontendQuestionId":"2096","leaf":true,"level":2,"nodeType":"def","questionId":"2217","status":"","submitted":10065,"title":"从二叉树一个节点到另一个节点每一步的方向","titleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another"},{"acceptance":0.3350838214502121,"acs":1659,"articleLive":2,"columnArticles":44,"formTitle":"[2097]合法重新排列数对","frequency":0.6124079997,"frontendQuestionId":"2097","leaf":true,"level":3,"nodeType":"def","questionId":"2201","status":"","submitted":4951,"title":"合法重新排列数对","titleSlug":"valid-arrangement-of-pairs"},{"acceptance":0.5714285714285714,"acs":32,"articleLive":2,"columnArticles":2,"formTitle":"[2098]Subsequence of Size K With the Largest Even Sum","frequency":1.4567702553,"frontendQuestionId":"2098","leaf":true,"level":2,"nodeType":"def","questionId":"2242","status":"","submitted":56,"title":"Subsequence of Size K With the Largest Even Sum","titleSlug":"subsequence-of-size-k-with-the-largest-even-sum"},{"acceptance":0.49301870985758167,"acs":3531,"articleLive":2,"columnArticles":84,"formTitle":"[2099]找到和最大的长度为 K 的子序列","frequency":0.5483656333,"frontendQuestionId":"2099","leaf":true,"level":1,"nodeType":"def","questionId":"2204","status":"ac","submitted":7162,"title":"找到和最大的长度为 K 的子序列","titleSlug":"find-subsequence-of-length-k-with-the-largest-sum"},{"acceptance":0.3507366614218281,"acs":2452,"articleLive":2,"columnArticles":52,"formTitle":"[2100]适合打劫银行的日子","frequency":0.0,"frontendQuestionId":"2100","leaf":true,"level":2,"nodeType":"def","questionId":"2205","status":"ac","submitted":6991,"title":"适合打劫银行的日子","titleSlug":"find-good-days-to-rob-the-bank"},{"acceptance":0.36738836265223274,"acs":2172,"articleLive":2,"columnArticles":58,"formTitle":"[2101]引爆最多的炸弹","frequency":0.0,"frontendQuestionId":"2101","leaf":true,"level":2,"nodeType":"def","questionId":"2206","status":"notac","submitted":5912,"title":"引爆最多的炸弹","titleSlug":"detonate-the-maximum-bombs"},{"acceptance":0.5228690228690228,"acs":1509,"articleLive":2,"columnArticles":54,"formTitle":"[2102]序列顺序查询","frequency":0.0,"frontendQuestionId":"2102","leaf":true,"level":3,"nodeType":"def","questionId":"2207","status":"","submitted":2886,"title":"序列顺序查询","titleSlug":"sequentially-ordinal-rank-tracker"},{"acceptance":0.8171741265609653,"acs":5824,"articleLive":2,"columnArticles":104,"formTitle":"[2103]环和杆","frequency":0.21344821,"frontendQuestionId":"2103","leaf":true,"level":1,"nodeType":"def","questionId":"2226","status":"","submitted":7127,"title":"环和杆","titleSlug":"rings-and-rods"},{"acceptance":0.5558441558441558,"acs":4922,"articleLive":2,"columnArticles":86,"formTitle":"[2104]子数组范围和","frequency":0.0,"frontendQuestionId":"2104","leaf":true,"level":2,"nodeType":"def","questionId":"2227","status":"","submitted":8855,"title":"子数组范围和","titleSlug":"sum-of-subarray-ranges"},{"acceptance":0.5483128834355828,"acs":4290,"articleLive":2,"columnArticles":74,"formTitle":"[2105]给植物浇水 II","frequency":0.3201069813,"frontendQuestionId":"2105","leaf":true,"level":2,"nodeType":"def","questionId":"2228","status":"","submitted":7824,"title":"给植物浇水 II","titleSlug":"watering-plants-ii"},{"acceptance":0.31394979345408325,"acs":2964,"articleLive":2,"columnArticles":72,"formTitle":"[2106]摘水果","frequency":1.4567702553,"frontendQuestionId":"2106","leaf":true,"level":3,"nodeType":"def","questionId":"2229","status":"","submitted":9441,"title":"摘水果","titleSlug":"maximum-fruits-harvested-after-at-most-k-steps"},{"acceptance":0.5932203389830508,"acs":35,"articleLive":2,"columnArticles":5,"formTitle":"[2107]Number of Unique Flavors After Sharing K Candies","frequency":0.0,"frontendQuestionId":"2107","leaf":true,"level":2,"nodeType":"def","questionId":"2247","status":"","submitted":59,"title":"Number of Unique Flavors After Sharing K Candies","titleSlug":"number-of-unique-flavors-after-sharing-k-candies"},{"acceptance":0.827575938058368,"acs":5558,"articleLive":2,"columnArticles":72,"formTitle":"[2108]找出数组中的第一个回文字符串","frequency":0.0,"frontendQuestionId":"2108","leaf":true,"level":1,"nodeType":"def","questionId":"2231","status":"ac","submitted":6716,"title":"找出数组中的第一个回文字符串","titleSlug":"find-first-palindromic-string-in-the-array"},{"acceptance":0.6048442119627019,"acs":5319,"articleLive":2,"columnArticles":67,"formTitle":"[2109]向字符串添加空格","frequency":0.0,"frontendQuestionId":"2109","leaf":true,"level":2,"nodeType":"def","questionId":"2232","status":"ac","submitted":8794,"title":"向字符串添加空格","titleSlug":"adding-spaces-to-a-string"},{"acceptance":0.49240554395291436,"acs":5187,"articleLive":2,"columnArticles":97,"formTitle":"[2110]股票平滑下跌阶段的数目","frequency":0.0,"frontendQuestionId":"2110","leaf":true,"level":2,"nodeType":"def","questionId":"2233","status":"ac","submitted":10534,"title":"股票平滑下跌阶段的数目","titleSlug":"number-of-smooth-descent-periods-of-a-stock"},{"acceptance":0.30775460619558614,"acs":3040,"articleLive":2,"columnArticles":76,"formTitle":"[2111]使数组 K 递增的最少操作次数","frequency":0.0,"frontendQuestionId":"2111","leaf":true,"level":3,"nodeType":"def","questionId":"2234","status":"notac","submitted":9878,"title":"使数组 K 递增的最少操作次数","titleSlug":"minimum-operations-to-make-the-array-k-increasing"},{"acceptance":0.7678571428571429,"acs":43,"articleLive":2,"columnArticles":3,"formTitle":"[2112]The Airport With the Most Traffic","frequency":0.0,"frontendQuestionId":"2112","leaf":true,"level":2,"nodeType":"def","questionId":"2252","status":"","submitted":56,"title":"The Airport With the Most Traffic","titleSlug":"the-airport-with-the-most-traffic"},{"acceptance":0.875,"acs":7,"articleLive":2,"columnArticles":3,"formTitle":"[2113]Elements in Array After Removing and Replacing Elements","frequency":0.0,"frontendQuestionId":"2113","leaf":true,"level":2,"nodeType":"def","questionId":"2258","status":"","submitted":8,"title":"Elements in Array After Removing and Replacing Elements","titleSlug":"elements-in-array-after-removing-and-replacing-elements"},{"acceptance":0.8450158292069161,"acs":83278,"articleLive":2,"columnArticles":640,"formTitle":"[LCP 01]猜数字","frequency":0.4626968388,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":98552,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6914172236752882,"acs":14275,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 02]分式化简","frequency":1.0291817016,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20646,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22132167225845364,"acs":11742,"articleLive":2,"columnArticles":188,"formTitle":"[LCP 03]机器人大冒险","frequency":1.0918686795,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":53054,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.38205199115044247,"acs":2763,"articleLive":2,"columnArticles":63,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7232,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.202268253819477,"acs":2158,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10669,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8391407587387487,"acs":45588,"articleLive":2,"columnArticles":689,"formTitle":"[LCP 06]拿硬币","frequency":0.4900060181,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":54327,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7668980225618768,"acs":40993,"articleLive":2,"columnArticles":492,"formTitle":"[LCP 07]传递信息","frequency":3.5430296917,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":53453,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2926708484648399,"acs":5319,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 08]剧情触发时间","frequency":1.1598715277,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":18174,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2798258463541667,"acs":6877,"articleLive":2,"columnArticles":112,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.2207434884,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24576,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5977188655980271,"acs":1939,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.9607573463,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3244,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6937160293696958,"acs":7275,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 11]期望个数统计","frequency":0.4626968388,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10487,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.41548833601813734,"acs":6964,"articleLive":2,"columnArticles":115,"formTitle":"[LCP 12]小张刷题计划","frequency":0.5185304849,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16761,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6115813774528664,"acs":9537,"articleLive":2,"columnArticles":85,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15594,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.215344114328695,"acs":2863,"articleLive":2,"columnArticles":44,"formTitle":"[LCP 14]切分数组","frequency":1.5653366358,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13295,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5809815950920245,"acs":947,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.0598966468,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1630,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3138248847926267,"acs":681,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.9996374553,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2170,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7983537766300839,"acs":24733,"articleLive":2,"columnArticles":269,"formTitle":"[LCP 17]速算机器人","frequency":1.0291817016,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":30980,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28985008832127057,"acs":18542,"articleLive":2,"columnArticles":246,"formTitle":"[LCP 18]早餐组合","frequency":1.6568080393,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":63971,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5171519020187867,"acs":19930,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.4914477937,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38538,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.3183046268152651,"acs":1885,"articleLive":2,"columnArticles":34,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5922,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3317972350230415,"acs":936,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2821,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3358931431067113,"acs":9229,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27476,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.34086978008401286,"acs":2759,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":8094,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28630338733431515,"acs":972,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3395,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.34060539950913554,"acs":1249,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3667,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.34496567505720827,"acs":603,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 26]导航装置","frequency":1.1251939893,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1748,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32819605861546236,"acs":1299,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3958,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2884803001876173,"acs":11532,"articleLive":2,"columnArticles":189,"formTitle":"[LCP 28]采购方案","frequency":0.4900060181,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":39975,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.19204394254716659,"acs":5629,"articleLive":2,"columnArticles":133,"formTitle":"[LCP 29]乐团站位","frequency":1.7235940976,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":29311,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.35459139222861125,"acs":6105,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":17217,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25634343711425045,"acs":1869,"articleLive":2,"columnArticles":38,"formTitle":"[LCP 31]变换的迷宫","frequency":1.9607573463,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7291,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.41231544832553113,"acs":1145,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 32]批量处理任务","frequency":1.5093309599,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2777,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22482789251610039,"acs":5062,"articleLive":2,"columnArticles":88,"formTitle":"[LCP 33]蓄水","frequency":1.0291817016,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":22515,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4989809153233278,"acs":2693,"articleLive":2,"columnArticles":63,"formTitle":"[LCP 34]二叉树染色","frequency":1.9340106329,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5397,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4132701421800948,"acs":1308,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 35]电动车游城市","frequency":1.2343245059,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3165,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2716436637390213,"acs":866,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.8944725831,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3188,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1991262359163026,"acs":866,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 37]最小矩形面积","frequency":0.6815479423,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4349,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5755555555555556,"acs":518,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":900,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5131673449844386,"acs":4287,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 39]无人机方阵","frequency":0.4626968388,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":8354,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.2526705908000872,"acs":3477,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":13761,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.43210253280439426,"acs":1416,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.6124079997,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3277,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2076271186440678,"acs":1127,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5428,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.41619047619047617,"acs":437,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1050,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8163222269084774,"acs":3871,"articleLive":2,"columnArticles":51,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":4742,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.20444968818472947,"acs":1213,"articleLive":2,"columnArticles":31,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5933,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3892644135188867,"acs":979,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2515,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36454018227009116,"acs":880,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2414,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.17130089374379345,"acs":345,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 48]无限棋局","frequency":0.8917161188,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":2014,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.24416909620991253,"acs":335,"articleLive":2,"columnArticles":10,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1372,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5423213380638622,"acs":5350,"articleLive":2,"columnArticles":114,"formTitle":"[LCS 01]下载插件","frequency":1.8663395523,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":9865,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6737873433986509,"acs":4195,"articleLive":2,"columnArticles":81,"formTitle":"[LCS 02]完成一半题目","frequency":1.0598966468,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":6226,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41057830829388764,"acs":1995,"articleLive":2,"columnArticles":64,"formTitle":"[LCS 03]主题空间","frequency":1.0918686795,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4859,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6785485720073852,"acs":442128,"articleLive":2,"columnArticles":3004,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1857978433,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":651579,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40316361770294445,"acs":290685,"articleLive":2,"columnArticles":2300,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.6048988113,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":721010,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7601534410875993,"acs":328552,"articleLive":2,"columnArticles":2148,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.4290895426,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":432218,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7498802600816638,"acs":342876,"articleLive":2,"columnArticles":2322,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.598184673,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":457241,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6993912161677689,"acs":204837,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.1192953959,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":292879,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7131469921339193,"acs":305709,"articleLive":2,"columnArticles":1895,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.526280694,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":428676,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3609239605876465,"acs":291689,"articleLive":2,"columnArticles":1988,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.7100604696,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":808173,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44677026628189154,"acs":217981,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.2452478049,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":487904,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4923266067491945,"acs":290325,"articleLive":2,"columnArticles":1770,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":3.9833037145,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":589700,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4524955396274544,"acs":189454,"articleLive":2,"columnArticles":1242,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.826879292,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":418687,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5281292299212982,"acs":195477,"articleLive":2,"columnArticles":1844,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.6102378523,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":370131,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5704116084093043,"acs":171314,"articleLive":2,"columnArticles":1408,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.8600812983,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":300334,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31384477169132624,"acs":90129,"articleLive":2,"columnArticles":522,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.3416595397,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":287177,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7479253112033195,"acs":214137,"articleLive":2,"columnArticles":1340,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":1.5368771169,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":286308,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.34142535505724136,"acs":135875,"articleLive":2,"columnArticles":827,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":397964,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7780495791359285,"acs":161576,"articleLive":2,"columnArticles":1178,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":2.9505410786,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":207668,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5975128114001399,"acs":208477,"articleLive":2,"columnArticles":1581,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.3620884053,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":348908,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3796937936380731,"acs":72490,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.6941245984,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":190917,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2449656984381842,"acs":83913,"articleLive":2,"columnArticles":922,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.9277203263,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":342550,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.644596676488625,"acs":215479,"articleLive":2,"columnArticles":1789,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.7719204077,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":334285,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7987369260893872,"acs":284316,"articleLive":2,"columnArticles":2601,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.9287991279,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":355957,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7423570114562804,"acs":328078,"articleLive":2,"columnArticles":2004,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1857978433,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":441941,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7274011001007135,"acs":206563,"articleLive":2,"columnArticles":1287,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.4645565165,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":283974,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46621803423088143,"acs":164609,"articleLive":2,"columnArticles":1332,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.5506434827,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":353073,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7926934241562671,"acs":212728,"articleLive":2,"columnArticles":1542,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.3620884053,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":268361,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5790920742547649,"acs":168078,"articleLive":2,"columnArticles":1217,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3125510377,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":290244,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4393672424752707,"acs":157594,"articleLive":2,"columnArticles":1573,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.5777674672,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":358684,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5610989886224136,"acs":170486,"articleLive":2,"columnArticles":1135,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":3.0735208146,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":303843,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6165238732930757,"acs":123843,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":200873,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6407766990291263,"acs":155892,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.3494555946,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":243286,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6878125083558384,"acs":154341,"articleLive":2,"columnArticles":1214,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.295816246,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":224394,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5884462871052926,"acs":136822,"articleLive":2,"columnArticles":1279,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3727476689,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":232514,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5546838927366364,"acs":124937,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.406361858,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":225240,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5796017374185585,"acs":148385,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.8623361416,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":256012,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7181421762498732,"acs":141632,"articleLive":2,"columnArticles":985,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.7205967924,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":197220,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6536988939142896,"acs":116782,"articleLive":2,"columnArticles":1012,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.1772406408,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":178648,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5629312427846538,"acs":83870,"articleLive":2,"columnArticles":596,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":2.9851143011,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":148988,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5802443506670297,"acs":170499,"articleLive":2,"columnArticles":1182,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.064061899,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":293840,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6933694885594355,"acs":183849,"articleLive":2,"columnArticles":1094,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":265153,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5714744124284602,"acs":270700,"articleLive":2,"columnArticles":1918,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.2452478049,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":473687,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5823120831874404,"acs":71512,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.0926915615,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":122807,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6061150676202116,"acs":243494,"articleLive":2,"columnArticles":1619,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9873507556,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":401729,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4899530343493876,"acs":53204,"articleLive":2,"columnArticles":544,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.7637383951,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":108590,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4193683689396492,"acs":60990,"articleLive":2,"columnArticles":511,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.4361649936,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":145433,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5584273354506626,"acs":122376,"articleLive":2,"columnArticles":901,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.2630197317,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":219144,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5309589019595533,"acs":135317,"articleLive":2,"columnArticles":1574,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4361886939,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":254854,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6899635233096825,"acs":134487,"articleLive":2,"columnArticles":1108,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.406361858,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":194919,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646073022801803,"acs":169446,"articleLive":2,"columnArticles":1154,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4037790269,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":364708,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513579276268969,"acs":96102,"articleLive":2,"columnArticles":560,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0506496061,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":147541,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6170244232231894,"acs":175230,"articleLive":2,"columnArticles":1183,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1353233559,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":283992,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48509470956747053,"acs":111581,"articleLive":2,"columnArticles":908,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.7612128453,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":230019,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.651585033019397,"acs":191710,"articleLive":2,"columnArticles":1122,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.867618123,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":294221,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5353871732074946,"acs":215110,"articleLive":2,"columnArticles":1746,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.9237486786,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":401784,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44781862544800777,"acs":191794,"articleLive":2,"columnArticles":1639,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.9206247011,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":428285,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7585548756231538,"acs":179245,"articleLive":2,"columnArticles":1260,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8609238878,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":236298,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.790447219292005,"acs":193326,"articleLive":2,"columnArticles":1368,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.1347306137,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":244578,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5896367421041099,"acs":150697,"articleLive":2,"columnArticles":1013,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":1.2214294207,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":255576,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6965651934408715,"acs":125186,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0506496061,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":179719,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8026667096867867,"acs":99509,"articleLive":2,"columnArticles":751,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.8663395523,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":123973,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6690571309090586,"acs":150392,"articleLive":2,"columnArticles":935,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.6039854597,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":224782,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7089630848812603,"acs":150761,"articleLive":2,"columnArticles":1939,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7543837899,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":212650,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4425971985862024,"acs":145383,"articleLive":2,"columnArticles":1074,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.2512895408,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":328477,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8584117831218283,"acs":235804,"articleLive":2,"columnArticles":1975,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.2409952944,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":274698,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44501066084749047,"acs":142342,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.0329678681,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":319862,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4760160062914903,"acs":102898,"articleLive":2,"columnArticles":1113,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.1911730311,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":216165,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5649874712471049,"acs":71476,"articleLive":2,"columnArticles":634,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.7336648167,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":126509,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46041207467273404,"acs":116557,"articleLive":2,"columnArticles":1085,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":1.9043832252,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":253158,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6559150456530369,"acs":118962,"articleLive":2,"columnArticles":804,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.7017651089,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":181368,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6351387777630403,"acs":148444,"articleLive":2,"columnArticles":1054,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.9505410786,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":233719,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8566417760993333,"acs":149711,"articleLive":2,"columnArticles":1372,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.3155712755,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":174765,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5878114547570984,"acs":79786,"articleLive":2,"columnArticles":553,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.6442418721,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":135734,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5987103905674281,"acs":81245,"articleLive":2,"columnArticles":594,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6762190171,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":135700,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2882186930171677,"acs":76186,"articleLive":2,"columnArticles":613,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.4567702553,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":264334,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.694922391369238,"acs":130373,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.7235940976,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":187608,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7015834812628644,"acs":128843,"articleLive":2,"columnArticles":751,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.7336648167,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":183646,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20801448762288607,"acs":15277,"articleLive":2,"columnArticles":175,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.8623361416,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":73442,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5586072215066273,"acs":13444,"articleLive":2,"columnArticles":178,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5368771169,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":24067,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7855194414905914,"acs":16990,"articleLive":2,"columnArticles":215,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":1.1962391719,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":21629,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7012619236883942,"acs":14115,"articleLive":2,"columnArticles":153,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":1.2742818789,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":20128,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7142199421204946,"acs":10859,"articleLive":2,"columnArticles":133,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":15204,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6457183731861843,"acs":12638,"articleLive":2,"columnArticles":150,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":19572,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.44713550048278083,"acs":11114,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":2.3649190232,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":24856,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.49788631048749776,"acs":11071,"articleLive":2,"columnArticles":137,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":22236,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5527671697884464,"acs":9119,"articleLive":2,"columnArticles":118,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.8669929807,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":16497,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4402958474425236,"acs":9882,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.8034217671,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":22444,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5620760612758174,"acs":7375,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.8883353802,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":13121,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6718691936083241,"acs":9040,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.3201069813,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":13455,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6582925271449862,"acs":6184,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":9394,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.507602892478205,"acs":7511,"articleLive":2,"columnArticles":107,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":14797,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6278897920405363,"acs":5948,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":9473,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.48672964462438145,"acs":8656,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.7446608131,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":17784,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5121732189183795,"acs":5133,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":10022,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5187004851685807,"acs":8446,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":16283,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4674930595906773,"acs":7241,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":15489,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7147616073287528,"acs":6866,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":1.2214294207,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":9606,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5256749602964531,"acs":9930,"articleLive":2,"columnArticles":132,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.8663395523,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":18890,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5439230408259034,"acs":11591,"articleLive":2,"columnArticles":108,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.5093309599,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":21310,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.698526451405105,"acs":8675,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":12419,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7365158296038455,"acs":22217,"articleLive":2,"columnArticles":184,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.8883353802,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":30165,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6011296619320542,"acs":7237,"articleLive":2,"columnArticles":125,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.406361858,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":12039,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6629672897196262,"acs":7945,"articleLive":2,"columnArticles":122,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.9759656084,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":11984,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6120311738918656,"acs":12565,"articleLive":2,"columnArticles":147,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.9166098111,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":20530,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6284066330209085,"acs":4358,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":6935,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30424512827242306,"acs":4637,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":15241,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5482600131319764,"acs":4175,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":7615,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5438816163915765,"acs":4778,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":8785,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5988260111895809,"acs":6529,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":10903,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7689393939393939,"acs":5278,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 033]变位词组","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":6864,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5739252455670366,"acs":4499,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":7839,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.664756046414092,"acs":4755,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":7153,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5682848612186221,"acs":5139,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":9043,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4425899048540558,"acs":5489,"articleLive":2,"columnArticles":104,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":12402,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7767104029990628,"acs":6630,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":8536,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5060255198487713,"acs":4283,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":8464,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5736974627154755,"acs":2962,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.4234560486,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":5163,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.779050097592713,"acs":5987,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":7685,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8345877236996153,"acs":4990,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":5979,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6495440163781873,"acs":3490,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.9711860341,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":5373,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6372347707049966,"acs":5586,"articleLive":2,"columnArticles":105,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3640218312,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":8766,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8039361860742508,"acs":5392,"articleLive":2,"columnArticles":113,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":6707,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7203196347031964,"acs":5048,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":7008,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6885113268608414,"acs":5106,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":7416,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6942765014107215,"acs":3445,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":4962,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7529157667386609,"acs":5229,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":6945,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6025116822429907,"acs":4126,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":6848,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41167254210732473,"acs":3153,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.4234560486,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":7659,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7475565843621399,"acs":5813,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":7776,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6431941088482338,"acs":5590,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":8691,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8560942630867298,"acs":4432,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":5177,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8834818368745716,"acs":3867,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":4377,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7217478653942743,"acs":5748,"articleLive":2,"columnArticles":101,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":7964,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3581724581724582,"acs":2783,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":7770,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6062128825947921,"acs":2654,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":4378,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6312113033814891,"acs":3976,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":6299,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6793054006691095,"acs":4264,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":6277,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5450954575378538,"acs":3312,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":6076,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7689647719904906,"acs":3558,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":4627,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7181476846057572,"acs":2869,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.3640218312,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":3995,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6183264887063655,"acs":2409,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":3896,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6479246393876951,"acs":2201,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":3397,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.652549456673168,"acs":2342,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":3589,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6713802643713496,"acs":2184,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":3253,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5010286141761735,"acs":5358,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":10694,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7211214323170275,"acs":38505,"articleLive":2,"columnArticles":408,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":1.7735545369,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":53396,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6502724976738004,"acs":4892,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":7523,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5045064849417454,"acs":2295,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":4549,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4196688155732524,"acs":6640,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 072]求平方根","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":15822,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5256988277727682,"acs":3498,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":6654,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5707779886148008,"acs":4512,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":7905,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7134538768004903,"acs":4656,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.3872462842,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":6526,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6824648764004979,"acs":7675,"articleLive":2,"columnArticles":90,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":11246,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5849443969204449,"acs":6838,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":11690,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6390590541533938,"acs":5216,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":8162,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8514220333442302,"acs":5209,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 079]所有子集","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":6118,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8228132609102828,"acs":4393,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":5339,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7871778755499685,"acs":6262,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":7955,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6482939632545932,"acs":4940,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":7620,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8622309790845711,"acs":5689,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":6598,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6860073260073261,"acs":4682,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":6825,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8507348438456828,"acs":5557,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":6532,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7513332016590955,"acs":3804,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.9437569969,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":5063,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6324841797825734,"acs":3898,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.594767836,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":6163,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.739542309739223,"acs":6948,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":9395,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6145184792687773,"acs":4639,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.9996374553,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":7549,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5004274234911951,"acs":2927,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":5849,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7804927302100162,"acs":3865,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":4952,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6781848459616986,"acs":3258,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.5185304849,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":4804,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5729874408070825,"acs":2783,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.5185304849,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":4857,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.601545842217484,"acs":2257,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.4900060181,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":3752,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6520076481835564,"acs":8866,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.6133051917,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":13598,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4917277486910995,"acs":2348,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.7235940976,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":4775,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5421356025253912,"acs":1975,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":3643,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.752129471890971,"acs":3532,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":4696,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7139891408495689,"acs":4471,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":2.0394823771,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":6262,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7494043751353693,"acs":3460,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":4617,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4897882470868312,"acs":3909,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":1.0918686795,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":7981,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5944501541623843,"acs":2892,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":4865,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4973011508300234,"acs":4883,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":2.1544941029,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":9819,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5899581589958159,"acs":2256,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.4626968388,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":3824,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.695106490872211,"acs":5483,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":1.3307781213,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":7888,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.54875061244488,"acs":2240,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 106]二分图","frequency":1.0291817016,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":4082,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5402067053188808,"acs":2143,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":3967,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5926219754065847,"acs":1494,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":2521,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5908602150537634,"acs":2198,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":1.4567702553,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":3720,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8201685097419694,"acs":3115,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":3798,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6803534303534303,"acs":1309,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1924,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5661252900232019,"acs":2196,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":3879,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5837615621788284,"acs":2272,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.0598966468,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":3892,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4180790960451977,"acs":1184,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.4113903831,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":2832,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.31014126080539745,"acs":1471,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4365173332,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":4743,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6496160515234085,"acs":5245,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":8074,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6391076115485564,"acs":1461,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":2286,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6976208749040675,"acs":1818,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":2606,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.48212340299098744,"acs":4868,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.3605422232,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":10097,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7166548639313225,"acs":99175,"articleLive":2,"columnArticles":1630,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.924509025,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":138386,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6425574607807369,"acs":63405,"articleLive":2,"columnArticles":1181,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.3307781213,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":98676,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5784521428317809,"acs":48874,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 01.03]URL化","frequency":2.0394823771,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":84491,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5490227951933777,"acs":43907,"articleLive":2,"columnArticles":839,"formTitle":"[面试题 01.04]回文排列","frequency":1.8034217671,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":79973,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.32892172708381434,"acs":35614,"articleLive":2,"columnArticles":611,"formTitle":"[面试题 01.05]一次编辑","frequency":1.3307781213,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":108275,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4707782016611937,"acs":77991,"articleLive":2,"columnArticles":1218,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.0412772906,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":165664,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7497461983179627,"acs":70159,"articleLive":2,"columnArticles":1003,"formTitle":"[面试题 01.07]旋转矩阵","frequency":3.1267248506,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":93577,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6227643957407216,"acs":48192,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 01.08]零矩阵","frequency":0.9996374553,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":77384,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5487738171209773,"acs":36117,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 01.09]字符串轮转","frequency":2.1230732056,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":65814,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6786769227667275,"acs":67320,"articleLive":2,"columnArticles":721,"formTitle":"[面试题 02.01]移除重复节点","frequency":1.7235940976,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":99193,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7798637137989779,"acs":68667,"articleLive":2,"columnArticles":984,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.6244386845,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":88050,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8552210195250175,"acs":74506,"articleLive":2,"columnArticles":713,"formTitle":"[面试题 02.03]删除中间节点","frequency":1.6568080393,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":87119,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.65001777040635,"acs":27434,"articleLive":2,"columnArticles":393,"formTitle":"[面试题 02.04]分割链表","frequency":1.0291817016,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":42205,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4670974085258796,"acs":39906,"articleLive":2,"columnArticles":561,"formTitle":"[面试题 02.05]链表求和","frequency":2.8944725831,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":85434,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48380318484359736,"acs":42595,"articleLive":2,"columnArticles":532,"formTitle":"[面试题 02.06]回文链表","frequency":0.4626968388,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":88042,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6812167749557,"acs":57665,"articleLive":2,"columnArticles":513,"formTitle":"[面试题 02.07]链表相交","frequency":0.9437569969,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":84650,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5344737175198452,"acs":29558,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 02.08]环路检测","frequency":1.5653366358,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":55303,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5336594156262067,"acs":12438,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 03.01]三合一","frequency":1.0291817016,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":23307,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6141709568613527,"acs":27677,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.6252347774,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":45064,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38740617180984155,"acs":9290,"articleLive":2,"columnArticles":146,"formTitle":"[面试题 03.03]堆盘子","frequency":1.0291817016,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":23980,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7143304130162703,"acs":25113,"articleLive":2,"columnArticles":359,"formTitle":"[面试题 03.04]化栈为队","frequency":1.6568080393,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":35156,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.540749156280282,"acs":16183,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 03.05]栈排序","frequency":1.3605422232,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":29927,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5889485191810773,"acs":11852,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 03.06]动物收容所","frequency":1.0291817016,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":20124,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5308903112380847,"acs":19326,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6568080393,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":36403,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7888266953713671,"acs":36641,"articleLive":2,"columnArticles":446,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1870248524,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":46450,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8052877040398311,"acs":25555,"articleLive":2,"columnArticles":561,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.8663395523,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":31734,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5870252632287146,"acs":34901,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.4626968388,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":59454,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35280075357755786,"acs":27341,"articleLive":2,"columnArticles":347,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.0598966468,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":77497,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5926991983644483,"acs":22033,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 04.06]后继者","frequency":0.4113903831,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":37174,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7170369785705829,"acs":18169,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.4234560486,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":25339,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4756742464304601,"acs":7196,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.0291817016,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":15128,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7163856110407905,"acs":17545,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 04.10]检查子树","frequency":1.3605422232,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":24491,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4863884774503294,"acs":19046,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 04.12]求和路径","frequency":2.0071693881,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":39158,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5057594689574385,"acs":10362,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":20488,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6963613550815558,"acs":8325,"articleLive":2,"columnArticles":139,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.4626968388,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11955,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38408792335544234,"acs":11987,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8663395523,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":31209,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3785653119030367,"acs":5747,"articleLive":2,"columnArticles":146,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":15181,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5301184575317147,"acs":12620,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 05.06]整数转换","frequency":1.0291817016,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":23806,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7055270655270656,"acs":12382,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.07]配对交换","frequency":0.9996374553,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":17550,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5565438373570522,"acs":3942,"articleLive":2,"columnArticles":79,"formTitle":"[面试题 05.08]绘制直线","frequency":1.0291817016,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":7083,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36329915077711905,"acs":45347,"articleLive":2,"columnArticles":493,"formTitle":"[面试题 08.01]三步问题","frequency":1.6895656358,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":124820,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36251312282968584,"acs":13467,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.4900060181,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":37149,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6756564939673527,"acs":53312,"articleLive":2,"columnArticles":442,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":78904,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.821458569185261,"acs":22494,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 08.04]幂集","frequency":2.2207434884,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":27383,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6781119512470376,"acs":24035,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":35444,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6535026791029966,"acs":26344,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":1.8034217671,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":40312,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8139427187232829,"acs":22849,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.8343265753,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":28072,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7178336935687778,"acs":17602,"articleLive":2,"columnArticles":257,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.4900060181,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":24521,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8158447744466237,"acs":23294,"articleLive":2,"columnArticles":382,"formTitle":"[面试题 08.09]括号","frequency":2.70930723,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":28552,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5581622678396871,"acs":14846,"articleLive":2,"columnArticles":235,"formTitle":"[面试题 08.10]颜色填充","frequency":1.0291817016,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":26598,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49479056818661155,"acs":35190,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 08.11]硬币","frequency":1.6568080393,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":71121,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7621453228929864,"acs":18104,"articleLive":2,"columnArticles":311,"formTitle":"[面试题 08.12]八皇后","frequency":1.8663395523,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":23754,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5027448322602508,"acs":7418,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 08.13]堆箱子","frequency":1.1598715277,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14755,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5362950742399246,"acs":4551,"articleLive":2,"columnArticles":81,"formTitle":"[面试题 08.14]布尔运算","frequency":1.3307781213,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8486,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5564189189189189,"acs":59292,"articleLive":2,"columnArticles":2401,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.2253268274,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":106560,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7400120000827591,"acs":35767,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 10.02]变位词组","frequency":3.1068757688,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":48333,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3935503135264258,"acs":14498,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8218717702,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":36839,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5563148098909865,"acs":20923,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.4113903831,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":37610,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45355155482815057,"acs":13856,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.4234560486,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":30550,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6244280183034143,"acs":5322,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":8523,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6634675896790434,"acs":8434,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 10.11]峰与谷","frequency":1.0598966468,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12712,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8281838503230547,"acs":27046,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 16.01]交换数字","frequency":1.0291817016,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":32657,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7645835303015978,"acs":16174,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":21154,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44118972510139703,"acs":9790,"articleLive":2,"columnArticles":237,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":22190,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4601764774178567,"acs":7927,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":17226,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46043279729998016,"acs":11596,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.0291817016,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":25185,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4247825036249396,"acs":14062,"articleLive":2,"columnArticles":209,"formTitle":"[面试题 16.06]最小差","frequency":2.0394823771,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":33104,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7327246750531414,"acs":21027,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.07]最大数值","frequency":1.3914088712,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":28697,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37883389006984514,"acs":2495,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6586,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.545662623025864,"acs":2384,"articleLive":2,"columnArticles":41,"formTitle":"[面试题 16.09]运算","frequency":0.4626968388,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4369,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6801164977853286,"acs":11209,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 16.10]生存人数","frequency":1.3914088712,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":16481,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44082354642015836,"acs":51836,"articleLive":2,"columnArticles":603,"formTitle":"[面试题 16.11]跳水板","frequency":1.6252347774,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":117589,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.42738752959747434,"acs":2166,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":5068,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5526427660478958,"acs":3900,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 16.14]最佳直线","frequency":1.0598966468,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":7057,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5026737967914439,"acs":9964,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 16.15]珠玑妙算","frequency":1.0598966468,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":19822,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4570320186658421,"acs":16258,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.16]部分排序","frequency":1.6252347774,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":35573,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5969620419277583,"acs":36392,"articleLive":2,"columnArticles":395,"formTitle":"[面试题 16.17]连续数列","frequency":1.9759656084,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":60962,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34356141285055025,"acs":15485,"articleLive":2,"columnArticles":319,"formTitle":"[面试题 16.18]模式匹配","frequency":0.5185304849,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":45072,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6147510295769375,"acs":21346,"articleLive":2,"columnArticles":386,"formTitle":"[面试题 16.19]水域大小","frequency":1.8995387239,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":34723,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7201537533916189,"acs":9555,"articleLive":2,"columnArticles":187,"formTitle":"[面试题 16.20]T9键盘","frequency":1.0598966468,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":13268,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46464280866850655,"acs":10270,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":22103,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5851837296128906,"acs":2978,"articleLive":2,"columnArticles":63,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":5089,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47264991896272285,"acs":11665,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.24]数对和","frequency":0.4626968388,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":24680,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5453899365109448,"acs":34533,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.9267947577,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":63318,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3906207442989081,"acs":15776,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 16.26]计算器","frequency":2.4294598592,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":40387,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.597139292398182,"acs":13401,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.3914088712,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":22442,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.638544147758138,"acs":30562,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 17.04]消失的数字","frequency":1.6252347774,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":47862,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3892921960072595,"acs":6006,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":15428,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45337301587301587,"acs":5027,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":1.0291817016,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":11088,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4099309730572256,"acs":9205,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.5185304849,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":22455,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27237582730252985,"acs":8807,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7235940976,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":32334,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5491701848886301,"acs":15089,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.8343265753,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":27476,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5701701851574587,"acs":68547,"articleLive":2,"columnArticles":952,"formTitle":"[面试题 17.10]主要元素","frequency":2.8944725831,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":120222,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6854310576836817,"acs":15281,"articleLive":2,"columnArticles":282,"formTitle":"[面试题 17.11]单词距离","frequency":1.0598966468,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":22294,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.631460801864007,"acs":22223,"articleLive":2,"columnArticles":309,"formTitle":"[面试题 17.12]BiNode","frequency":0.9996374553,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":35193,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5518451114960423,"acs":25168,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 17.13]恢复空格","frequency":1.1251939893,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45607,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5963610761135404,"acs":80467,"articleLive":2,"columnArticles":790,"formTitle":"[面试题 17.14]最小K个数","frequency":3.7100604696,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":134930,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40364262859955696,"acs":6560,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 17.15]最长单词","frequency":1.6568080393,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":16252,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.517058452153522,"acs":63062,"articleLive":2,"columnArticles":1167,"formTitle":"[面试题 17.16]按摩师","frequency":1.7235940976,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":121963,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4488496302382909,"acs":8740,"articleLive":2,"columnArticles":193,"formTitle":"[面试题 17.17]多次搜索","frequency":0.4626968388,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":19472,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44267696852630384,"acs":7792,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 17.18]最短超串","frequency":1.6895656358,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":17602,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5785098331161983,"acs":9325,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.4900060181,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":16119,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5745619901029825,"acs":4296,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 17.20]连续中值","frequency":0.5796181768,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7477,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6361201939339272,"acs":45134,"articleLive":2,"columnArticles":543,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.5658128862,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70952,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3798590768743567,"acs":9596,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 17.22]单词转换","frequency":1.3914088712,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":25262,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37655350106092755,"acs":4969,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.5185304849,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":13196,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5223678073188314,"acs":12319,"articleLive":2,"columnArticles":132,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.7496117871,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":23583,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.504099519366695,"acs":1783,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.1251939893,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3537,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3449584387423202,"acs":3818,"articleLive":2,"columnArticles":59,"formTitle":"[面试题 17.26]稀疏相似度","frequency":1.4234560486,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":11068,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file