From bb165af9aedb6bdab1f540cffc365386deb7f5c5 Mon Sep 17 00:00:00 2001 From: "huangge1199@hotmail.com" Date: Fri, 12 Nov 2021 13:41:11 +0800 Subject: [PATCH] =?UTF-8?q?375:=E7=8C=9C=E6=95=B0=E5=AD=97=E5=A4=A7?= =?UTF-8?q?=E5=B0=8F=20II?= 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 e88d73f..0d7f950 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.5546115303111322,"acs":28004,"articleLive":2,"columnArticles":370,"formTitle":"[598]范围求和 II","frequency":0.9571023971,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":50493,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5215909750670877,"acs":2650222,"articleLive":2,"columnArticles":14735,"formTitle":"[1]两数之和","frequency":4.6658386845,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5081035,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4098129569973351,"acs":1051553,"articleLive":2,"columnArticles":7438,"formTitle":"[2]两数相加","frequency":4.6249749808,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2565934,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.38177631212981605,"acs":1310866,"articleLive":2,"columnArticles":7820,"formTitle":"[3]无重复字符的最长子串","frequency":4.5276526524,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3433597,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40947358815149115,"acs":542937,"articleLive":2,"columnArticles":4033,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.367858678,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1325939,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3566112795722821,"acs":776658,"articleLive":2,"columnArticles":4202,"formTitle":"[5]最长回文子串","frequency":4.4847704623,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2177884,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5081210940929516,"acs":318315,"articleLive":2,"columnArticles":2587,"formTitle":"[6]Z 字形变换","frequency":3.5705948235,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":626455,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3516105118527587,"acs":873660,"articleLive":2,"columnArticles":5485,"formTitle":"[7]整数反转","frequency":4.525634166,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2484738,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21723070146354193,"acs":362966,"articleLive":2,"columnArticles":2790,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.4078638524,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1670878,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5825384755081531,"acs":805134,"articleLive":2,"columnArticles":5103,"formTitle":"[9]回文数","frequency":3.5942544868,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1382113,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31574079409474587,"acs":213700,"articleLive":2,"columnArticles":1282,"formTitle":"[10]正则表达式匹配","frequency":4.2153373713,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":676821,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6252305475664516,"acs":562388,"articleLive":2,"columnArticles":3181,"formTitle":"[11]盛最多水的容器","frequency":4.0786388983,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":899489,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6643275773022254,"acs":236676,"articleLive":2,"columnArticles":1851,"formTitle":"[12]整数转罗马数字","frequency":3.6750738935,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":356264,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6311215552122036,"acs":488531,"articleLive":2,"columnArticles":4017,"formTitle":"[13]罗马数字转整数","frequency":3.960769868,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":774068,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41148719305539805,"acs":653203,"articleLive":2,"columnArticles":4082,"formTitle":"[14]最长公共前缀","frequency":4.3687608713,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1587420,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3381460826423278,"acs":694923,"articleLive":2,"columnArticles":3286,"formTitle":"[15]三数之和","frequency":4.4015546975,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2055097,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4584613161449897,"acs":272845,"articleLive":2,"columnArticles":1499,"formTitle":"[16]最接近的三数之和","frequency":4.0092759816,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":595132,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.573713583550296,"acs":357641,"articleLive":2,"columnArticles":3231,"formTitle":"[17]电话号码的字母组合","frequency":3.6894875187,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":623379,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3957058557132107,"acs":232421,"articleLive":2,"columnArticles":1609,"formTitle":"[18]四数之和","frequency":3.3989082631,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":587358,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4305390000132358,"acs":552983,"articleLive":2,"columnArticles":4129,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.574141178,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1284397,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4452365420215535,"acs":824473,"articleLive":2,"columnArticles":5830,"formTitle":"[20]有效的括号","frequency":4.256201075,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1851764,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671555819844719,"acs":755058,"articleLive":2,"columnArticles":3645,"formTitle":"[21]合并两个有序链表","frequency":4.0195165168,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1131757,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727922941900341,"acs":371142,"articleLive":2,"columnArticles":2775,"formTitle":"[22]括号生成","frequency":4.2800370253,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":480261,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5607994323402558,"acs":343004,"articleLive":2,"columnArticles":2204,"formTitle":"[23]合并K个升序链表","frequency":3.7732659197,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":611634,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7034983973172254,"acs":332505,"articleLive":2,"columnArticles":2620,"formTitle":"[24]两两交换链表中的节点","frequency":2.8339298987,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":472645,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6577795528458598,"acs":242103,"articleLive":2,"columnArticles":2295,"formTitle":"[25]K 个一组翻转链表","frequency":4.3443073607,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":368061,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5376329351747148,"acs":855324,"articleLive":2,"columnArticles":4741,"formTitle":"[26]删除有序数组中的重复项","frequency":3.55647884,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1590907,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5964416656023378,"acs":509023,"articleLive":2,"columnArticles":4295,"formTitle":"[27]移除元素","frequency":3.3123337301,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":853433,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40442900585870795,"acs":492601,"articleLive":2,"columnArticles":3360,"formTitle":"[28]实现 strStr()","frequency":3.1014718636,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1218016,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21984448013536112,"acs":133049,"articleLive":2,"columnArticles":1052,"formTitle":"[29]两数相除","frequency":2.3869715586,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":605196,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.36009142600369853,"acs":83341,"articleLive":2,"columnArticles":627,"formTitle":"[30]串联所有单词的子串","frequency":2.7030243282,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":231444,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37279174619890737,"acs":226553,"articleLive":2,"columnArticles":1834,"formTitle":"[31]下一个排列","frequency":3.4743297092,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":607720,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3569174806955476,"acs":200558,"articleLive":2,"columnArticles":1355,"formTitle":"[32]最长有效括号","frequency":3.7182212247,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":561917,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4284856168847001,"acs":386626,"articleLive":2,"columnArticles":2560,"formTitle":"[33]搜索旋转排序数组","frequency":3.3266531625,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":902308,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42300190426889017,"acs":366076,"articleLive":2,"columnArticles":3487,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.5178320211,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":865424,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4614499637534291,"acs":548700,"articleLive":2,"columnArticles":4165,"formTitle":"[35]搜索插入位置","frequency":3.5074584841,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1189078,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6391288177449829,"acs":214808,"articleLive":2,"columnArticles":1524,"formTitle":"[36]有效的数独","frequency":3.3900338305,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":336095,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707312447849503,"acs":106107,"articleLive":2,"columnArticles":895,"formTitle":"[37]解数独","frequency":2.886219629,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":158196,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5964487861635982,"acs":246056,"articleLive":2,"columnArticles":2621,"formTitle":"[38]外观数列","frequency":1.5050354565,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":412535,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7274497146311724,"acs":354970,"articleLive":2,"columnArticles":2058,"formTitle":"[39]组合总和","frequency":3.5164850382,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":487965,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.619734954493074,"acs":210814,"articleLive":2,"columnArticles":1451,"formTitle":"[40]组合总和 II","frequency":2.9745737387,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":340168,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41992950992848765,"acs":172523,"articleLive":2,"columnArticles":1470,"formTitle":"[41]缺失的第一个正数","frequency":3.994969586,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":410838,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5859841925463746,"acs":347866,"articleLive":2,"columnArticles":2574,"formTitle":"[42]接雨水","frequency":4.1587996198,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":593644,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4489915643396112,"acs":177560,"articleLive":2,"columnArticles":1198,"formTitle":"[43]字符串相乘","frequency":3.685462518,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":395464,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32814057310922473,"acs":87247,"articleLive":2,"columnArticles":568,"formTitle":"[44]通配符匹配","frequency":2.5984906005,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":265883,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4319206189034645,"acs":218297,"articleLive":2,"columnArticles":1741,"formTitle":"[45]跳跃游戏 II","frequency":3.6383320679,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":505410,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.783273766474508,"acs":446206,"articleLive":2,"columnArticles":2858,"formTitle":"[46]全排列","frequency":3.9425311717,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":569668,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6393888989838279,"acs":228719,"articleLive":2,"columnArticles":1569,"formTitle":"[47]全排列 II","frequency":3.1850680706,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":357715,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.735471733609256,"acs":234564,"articleLive":2,"columnArticles":1960,"formTitle":"[48]旋转图像","frequency":3.2582502596,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":318930,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6657905345041728,"acs":244441,"articleLive":2,"columnArticles":1384,"formTitle":"[49]字母异位词分组","frequency":2.6284946513,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":367144,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37617865509862375,"acs":226244,"articleLive":2,"columnArticles":1341,"formTitle":"[50]Pow(x, n)","frequency":3.4539125034,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":601427,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7380526743902831,"acs":160601,"articleLive":2,"columnArticles":1604,"formTitle":"[51]N 皇后","frequency":3.5121870725,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":217601,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8219450140095115,"acs":76565,"articleLive":2,"columnArticles":624,"formTitle":"[52]N皇后 II","frequency":0.8756739138,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":93151,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5531372990757218,"acs":731669,"articleLive":2,"columnArticles":3955,"formTitle":"[53]最大子序和","frequency":3.6325398392,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1322762,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48201649290532056,"acs":197741,"articleLive":2,"columnArticles":2092,"formTitle":"[54]螺旋矩阵","frequency":3.7524400197,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":410237,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.433072163918665,"acs":346841,"articleLive":2,"columnArticles":2664,"formTitle":"[55]跳跃游戏","frequency":3.5178320211,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":800885,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4713990861684518,"acs":318382,"articleLive":2,"columnArticles":2454,"formTitle":"[56]合并区间","frequency":4.1770670532,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":675398,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41222471868811483,"acs":89717,"articleLive":2,"columnArticles":961,"formTitle":"[57]插入区间","frequency":1.8521106446,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":217641,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37946246317687726,"acs":258398,"articleLive":2,"columnArticles":2766,"formTitle":"[58]最后一个单词的长度","frequency":2.6098098529,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":680958,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7877907657710417,"acs":134520,"articleLive":2,"columnArticles":1651,"formTitle":"[59]螺旋矩阵 II","frequency":3.246499539,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":170756,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5253424268258028,"acs":92434,"articleLive":2,"columnArticles":984,"formTitle":"[60]排列序列","frequency":1.9491276429,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":175950,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4176513398369463,"acs":204300,"articleLive":2,"columnArticles":2074,"formTitle":"[61]旋转链表","frequency":2.7706176193,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":489164,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6631866149998892,"acs":329111,"articleLive":2,"columnArticles":2539,"formTitle":"[62]不同路径","frequency":3.0879672694,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":496257,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39290656869367513,"acs":190786,"articleLive":2,"columnArticles":1808,"formTitle":"[63]不同路径 II","frequency":2.8513065305,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":485576,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6885190775990084,"acs":280513,"articleLive":2,"columnArticles":2168,"formTitle":"[64]最小路径和","frequency":3.4294673849,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":407415,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2702877114433543,"acs":47329,"articleLive":2,"columnArticles":658,"formTitle":"[65]有效数字","frequency":2.5347889085,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":175106,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4642582005909405,"acs":395327,"articleLive":2,"columnArticles":3640,"formTitle":"[66]加一","frequency":1.8338911484,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":851524,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5417858558587514,"acs":202279,"articleLive":2,"columnArticles":1855,"formTitle":"[67]二进制求和","frequency":2.9781848938,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":373356,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5236360681932051,"acs":38670,"articleLive":2,"columnArticles":591,"formTitle":"[68]文本左右对齐","frequency":3.3070754033,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":73849,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3913793053546982,"acs":405676,"articleLive":2,"columnArticles":2050,"formTitle":"[69]Sqrt(x)","frequency":3.3856265955,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1036529,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5310384483095119,"acs":606764,"articleLive":2,"columnArticles":3758,"formTitle":"[70]爬楼梯","frequency":4.3209007291,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1142599,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42193114388872754,"acs":97345,"articleLive":2,"columnArticles":859,"formTitle":"[71]简化路径","frequency":3.1014718636,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":230713,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6144598286517599,"acs":185326,"articleLive":2,"columnArticles":1289,"formTitle":"[72]编辑距离","frequency":4.1683955799,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":301608,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6059620525977083,"acs":140299,"articleLive":2,"columnArticles":1035,"formTitle":"[73]矩阵置零","frequency":2.5984906005,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":231531,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4633257225883452,"acs":178575,"articleLive":2,"columnArticles":1801,"formTitle":"[74]搜索二维矩阵","frequency":2.3123100298,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":385420,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5975879180878738,"acs":283473,"articleLive":2,"columnArticles":1953,"formTitle":"[75]颜色分类","frequency":2.3263908031,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":474362,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42783895538628947,"acs":196592,"articleLive":2,"columnArticles":1340,"formTitle":"[76]最小覆盖子串","frequency":3.5291736851,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":459500,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699674850631433,"acs":234673,"articleLive":2,"columnArticles":1388,"formTitle":"[77]组合","frequency":3.3939065021,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":304783,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8016619345995692,"acs":327527,"articleLive":2,"columnArticles":2137,"formTitle":"[78]子集","frequency":3.3407015527,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":408560,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4590697474761271,"acs":235276,"articleLive":2,"columnArticles":1475,"formTitle":"[79]单词搜索","frequency":2.8835533874,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":512506,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6171255504381266,"acs":152617,"articleLive":2,"columnArticles":1362,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.5203869083,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":247303,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41461934505075937,"acs":128447,"articleLive":2,"columnArticles":1023,"formTitle":"[81]搜索旋转排序数组 II","frequency":1.7104716115,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":309795,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5309680111265647,"acs":190883,"articleLive":2,"columnArticles":1745,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.4267885189,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":359500,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538157598200953,"acs":331920,"articleLive":2,"columnArticles":2026,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.932709107,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":616771,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4339793898860302,"acs":190773,"articleLive":2,"columnArticles":1211,"formTitle":"[84]柱状图中最大的矩形","frequency":3.481808315,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":439590,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5155892571834344,"acs":101651,"articleLive":2,"columnArticles":712,"formTitle":"[85]最大矩形","frequency":2.677266304,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":197155,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6325303978188255,"acs":123654,"articleLive":2,"columnArticles":1143,"formTitle":"[86]分隔链表","frequency":2.4356622582,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":195491,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48595033767183554,"acs":42526,"articleLive":2,"columnArticles":317,"formTitle":"[87]扰乱字符串","frequency":0.8756739138,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":87511,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5180375453940328,"acs":491858,"articleLive":2,"columnArticles":3454,"formTitle":"[88]合并两个有序数组","frequency":4.1698000745,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":949464,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7107340036031847,"acs":61148,"articleLive":2,"columnArticles":500,"formTitle":"[89]格雷编码","frequency":2.0968885246,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":86035,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338637877247713,"acs":144668,"articleLive":2,"columnArticles":1268,"formTitle":"[90]子集 II","frequency":2.4304476664,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":228232,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3107867906708245,"acs":170125,"articleLive":2,"columnArticles":1569,"formTitle":"[91]解码方法","frequency":2.7422066175,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":547401,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5493694148883473,"acs":221809,"articleLive":2,"columnArticles":2091,"formTitle":"[92]反转链表 II","frequency":3.626680476,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":403752,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5427722971612643,"acs":161757,"articleLive":2,"columnArticles":1395,"formTitle":"[93]复原 IP 地址","frequency":3.8205945306,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":298020,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556170306595464,"acs":596271,"articleLive":2,"columnArticles":2452,"formTitle":"[94]二叉树的中序遍历","frequency":3.0284467286,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":789118,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7038388143033425,"acs":104380,"articleLive":2,"columnArticles":649,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.7404585181,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":148301,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.69970773088446,"acs":171893,"articleLive":2,"columnArticles":1360,"formTitle":"[96]不同的二叉搜索树","frequency":2.9572617855,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":245664,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45504803783642395,"acs":64367,"articleLive":2,"columnArticles":571,"formTitle":"[97]交错字符串","frequency":2.1590203057,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":141451,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3509844596255352,"acs":366989,"articleLive":2,"columnArticles":2044,"formTitle":"[98]验证二叉搜索树","frequency":3.3762488056,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1045599,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.610795362281186,"acs":75228,"articleLive":2,"columnArticles":616,"formTitle":"[99]恢复二叉搜索树","frequency":2.4894502279,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":123164,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6010580210270758,"acs":261438,"articleLive":2,"columnArticles":1955,"formTitle":"[100]相同的树","frequency":2.8236523159,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":434963,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5650145818205048,"acs":433395,"articleLive":2,"columnArticles":2365,"formTitle":"[101]对称二叉树","frequency":3.18080449,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":767051,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419456623180788,"acs":418901,"articleLive":2,"columnArticles":2636,"formTitle":"[102]二叉树的层序遍历","frequency":4.1195026021,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":652549,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5713836458208852,"acs":181692,"articleLive":2,"columnArticles":1655,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8966288821,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":317986,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7663254876352176,"acs":539815,"articleLive":2,"columnArticles":2664,"formTitle":"[104]二叉树的最大深度","frequency":3.4920050922,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":704420,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7051286208387376,"acs":260954,"articleLive":2,"columnArticles":1513,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.4135029651,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":370080,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216363401729256,"acs":139799,"articleLive":2,"columnArticles":934,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2582502596,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":193725,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6990072613163102,"acs":168848,"articleLive":2,"columnArticles":1364,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.7437631591,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":241554,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7607340983357398,"acs":200210,"articleLive":2,"columnArticles":1242,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.6098098529,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":263180,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7625447185087554,"acs":97197,"articleLive":2,"columnArticles":754,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7706176193,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":127464,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5640770042859606,"acs":268222,"articleLive":2,"columnArticles":1539,"formTitle":"[110]平衡二叉树","frequency":2.8688319184,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":475506,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48783231871773136,"acs":284877,"articleLive":2,"columnArticles":1875,"formTitle":"[111]二叉树的最小深度","frequency":2.0731569885,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":583965,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5264005139364412,"acs":283513,"articleLive":2,"columnArticles":1771,"formTitle":"[112]路径总和","frequency":3.22016051,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":538588,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6274354844625845,"acs":188161,"articleLive":2,"columnArticles":1317,"formTitle":"[113]路径总和 II","frequency":3.0210883437,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":299889,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7263505488643045,"acs":186529,"articleLive":2,"columnArticles":1398,"formTitle":"[114]二叉树展开为链表","frequency":2.0449557758,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":256803,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5213069444556688,"acs":64506,"articleLive":2,"columnArticles":700,"formTitle":"[115]不同的子序列","frequency":2.9393670985,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":123739,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7052550141836301,"acs":169556,"articleLive":2,"columnArticles":1294,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5922099618,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":240418,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6170249990280315,"acs":95223,"articleLive":2,"columnArticles":811,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.4130221531,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":154326,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7333682337600607,"acs":228343,"articleLive":2,"columnArticles":1846,"formTitle":"[118]杨辉三角","frequency":3.3438510128,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":311362,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6703987757040581,"acs":152446,"articleLive":2,"columnArticles":1263,"formTitle":"[119]杨辉三角 II","frequency":2.4022701741,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":227396,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6819159521231454,"acs":186414,"articleLive":2,"columnArticles":1640,"formTitle":"[120]三角形最小路径和","frequency":2.2103888985,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":273368,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733481687672762,"acs":591560,"articleLive":2,"columnArticles":3550,"formTitle":"[121]买卖股票的最佳时机","frequency":4.0164726734,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1031764,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6903051003831374,"acs":484842,"articleLive":2,"columnArticles":2747,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.8491508927,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":702359,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5382660009078529,"acs":136367,"articleLive":2,"columnArticles":844,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.0239804416,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":253345,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.44519076265221835,"acs":167621,"articleLive":2,"columnArticles":1139,"formTitle":"[124]二叉树中的最大路径和","frequency":4.0017718191,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":376515,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47207874492106705,"acs":288721,"articleLive":2,"columnArticles":1904,"formTitle":"[125]验证回文串","frequency":2.8559936729,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":611595,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39712611549371596,"acs":38360,"articleLive":2,"columnArticles":339,"formTitle":"[126]单词接龙 II","frequency":1.565710672,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":96594,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4698067097841174,"acs":127265,"articleLive":2,"columnArticles":676,"formTitle":"[127]单词接龙","frequency":2.4419579224,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":270888,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5434956441227221,"acs":180796,"articleLive":2,"columnArticles":1189,"formTitle":"[128]最长连续序列","frequency":3.9559091186,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":332654,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6840258129108083,"acs":125713,"articleLive":2,"columnArticles":1152,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0971946971,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":183784,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4465580909018715,"acs":134957,"articleLive":2,"columnArticles":1224,"formTitle":"[130]被围绕的区域","frequency":2.2905416474,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":302216,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229031507663677,"acs":139842,"articleLive":2,"columnArticles":918,"formTitle":"[131]分割回文串","frequency":3.1588574211,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":193445,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49245855118661197,"acs":50673,"articleLive":2,"columnArticles":450,"formTitle":"[132]分割回文串 II","frequency":2.2607598156,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":102898,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6771852942761185,"acs":75410,"articleLive":2,"columnArticles":537,"formTitle":"[133]克隆图","frequency":1.4130221531,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":111358,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5724871837419107,"acs":131103,"articleLive":2,"columnArticles":1005,"formTitle":"[134]加油站","frequency":2.9677168824,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":229006,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48621322672928724,"acs":104354,"articleLive":2,"columnArticles":834,"formTitle":"[135]分发糖果","frequency":4.2104442754,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":214626,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192741259027394,"acs":527361,"articleLive":2,"columnArticles":2388,"formTitle":"[136]只出现一次的数字","frequency":3.685462518,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":733185,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7204028306267718,"acs":103939,"articleLive":2,"columnArticles":783,"formTitle":"[137]只出现一次的数字 II","frequency":2.1239904544,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":144279,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6616605222473284,"acs":116838,"articleLive":2,"columnArticles":881,"formTitle":"[138]复制带随机指针的链表","frequency":3.0811459606,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":176583,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5172357412727081,"acs":205625,"articleLive":2,"columnArticles":1287,"formTitle":"[139]单词拆分","frequency":3.6910333768,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":397546,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4949738173029584,"acs":55296,"articleLive":2,"columnArticles":570,"formTitle":"[140]单词拆分 II","frequency":1.3854759961,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":111715,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124288381418363,"acs":557169,"articleLive":2,"columnArticles":2870,"formTitle":"[141]环形链表","frequency":3.4892831225,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1087310,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5530409958998801,"acs":313066,"articleLive":2,"columnArticles":1837,"formTitle":"[142]环形链表 II","frequency":3.0353101735,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":566081,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6228455606551266,"acs":133672,"articleLive":2,"columnArticles":1124,"formTitle":"[143]重排链表","frequency":4.0167242508,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":214615,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7041400071629771,"acs":436464,"articleLive":2,"columnArticles":1952,"formTitle":"[144]二叉树的前序遍历","frequency":2.3079940973,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":619854,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7513720563369638,"acs":318170,"articleLive":2,"columnArticles":1650,"formTitle":"[145]二叉树的后序遍历","frequency":3.0428492819,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":423452,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5252933412497384,"acs":245956,"articleLive":2,"columnArticles":1439,"formTitle":"[146]LRU 缓存机制","frequency":4.4030430547,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":468226,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6823275862068966,"acs":102895,"articleLive":2,"columnArticles":800,"formTitle":"[147]对链表进行插入排序","frequency":2.180689626,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":150800,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671167863276911,"acs":219843,"articleLive":2,"columnArticles":1299,"formTitle":"[148]排序链表","frequency":3.5105207109,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":329542,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34535443226350515,"acs":48734,"articleLive":2,"columnArticles":529,"formTitle":"[149]直线上最多的点数","frequency":3.3070754033,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":141113,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5346382230041786,"acs":138567,"articleLive":2,"columnArticles":1092,"formTitle":"[150]逆波兰表达式求值","frequency":2.3749086861,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":259179,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4859078183680437,"acs":177903,"articleLive":2,"columnArticles":1489,"formTitle":"[151]翻转字符串里的单词","frequency":2.5523640533,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":366125,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42172097966345073,"acs":193249,"articleLive":2,"columnArticles":1300,"formTitle":"[152]乘积最大子数组","frequency":3.7198441274,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":458239,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5671411853966539,"acs":220513,"articleLive":2,"columnArticles":1550,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.0968885246,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":388815,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5315257996200725,"acs":116958,"articleLive":2,"columnArticles":918,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":2.0968885246,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":220042,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5738596444079288,"acs":298943,"articleLive":2,"columnArticles":1654,"formTitle":"[155]最小栈","frequency":2.9854478434,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":520934,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7237382783689812,"acs":6869,"articleLive":2,"columnArticles":125,"formTitle":"[156]上下翻转二叉树","frequency":0.8756739138,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":9491,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5360112097150864,"acs":5738,"articleLive":2,"columnArticles":84,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":10705,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5905241935483871,"acs":2929,"articleLive":2,"columnArticles":68,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.3996908763,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4960,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5484974025120011,"acs":16682,"articleLive":2,"columnArticles":198,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.4709128722,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":30414,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6156815710244459,"acs":352144,"articleLive":2,"columnArticles":2050,"formTitle":"[160]相交链表","frequency":3.0018119096,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":571958,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3362323807891693,"acs":7848,"articleLive":2,"columnArticles":107,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.3438572302,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":23341,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4967532084204064,"acs":168298,"articleLive":2,"columnArticles":1142,"formTitle":"[162]寻找峰值","frequency":3.3702283508,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":338796,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32773938795656465,"acs":9628,"articleLive":2,"columnArticles":148,"formTitle":"[163]缺失的区间","frequency":0.3438572302,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":29377,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6097029822757244,"acs":60474,"articleLive":2,"columnArticles":503,"formTitle":"[164]最大间距","frequency":2.4675675166,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":99186,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5196696344892221,"acs":88718,"articleLive":2,"columnArticles":944,"formTitle":"[165]比较版本号","frequency":3.7094888521,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":170720,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33165536367661796,"acs":42693,"articleLive":2,"columnArticles":386,"formTitle":"[166]分数到小数","frequency":2.6398834313,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":128727,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5867516264281867,"acs":311517,"articleLive":2,"columnArticles":2046,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.1264374969,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":530918,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43293357106571173,"acs":86927,"articleLive":2,"columnArticles":773,"formTitle":"[168]Excel表列名称","frequency":2.7706176193,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":200786,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6648423825052626,"acs":404893,"articleLive":2,"columnArticles":2271,"formTitle":"[169]多数元素","frequency":3.2576325944,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":609006,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.42092525365354183,"acs":9044,"articleLive":2,"columnArticles":91,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.9052181601,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":21486,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7175396255951992,"acs":110006,"articleLive":2,"columnArticles":939,"formTitle":"[171]Excel 表列序号","frequency":2.0968885246,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":153310,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.44158523601088373,"acs":93318,"articleLive":2,"columnArticles":607,"formTitle":"[172]阶乘后的零","frequency":2.5347889085,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":211325,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8047333583114774,"acs":77322,"articleLive":2,"columnArticles":654,"formTitle":"[173]二叉搜索树迭代器","frequency":1.2366872594,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":96084,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48036153874416726,"acs":39222,"articleLive":2,"columnArticles":415,"formTitle":"[174]地下城游戏","frequency":3.1695253269,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":81651,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7387892061887513,"acs":315726,"articleLive":2,"columnArticles":1504,"formTitle":"[175]组合两个表","frequency":4.4439067585,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":427356,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35546235455914776,"acs":260534,"articleLive":2,"columnArticles":1048,"formTitle":"[176]第二高的薪水","frequency":4.1815822432,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":732944,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46296116066152704,"acs":133193,"articleLive":2,"columnArticles":522,"formTitle":"[177]第N高的薪水","frequency":3.649959565,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":287698,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034718206161218,"acs":124177,"articleLive":2,"columnArticles":686,"formTitle":"[178]分数排名","frequency":2.8559936729,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":205771,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097067089428551,"acs":125081,"articleLive":2,"columnArticles":998,"formTitle":"[179]最大数","frequency":3.5547365781,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":305294,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48621509591594103,"acs":90789,"articleLive":2,"columnArticles":531,"formTitle":"[180]连续出现的数字","frequency":3.4539125034,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":186726,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7006317555895563,"acs":170346,"articleLive":2,"columnArticles":696,"formTitle":"[181]超过经理收入的员工","frequency":3.1588574211,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":243132,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7957795168713283,"acs":187609,"articleLive":2,"columnArticles":612,"formTitle":"[182]查找重复的电子邮箱","frequency":3.1912181515,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":235755,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.675986222135569,"acs":156021,"articleLive":2,"columnArticles":571,"formTitle":"[183]从不订购的客户","frequency":2.4356622582,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":230805,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47886772938822314,"acs":106493,"articleLive":2,"columnArticles":701,"formTitle":"[184]部门工资最高的员工","frequency":3.1391647679,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":222385,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4985437713281752,"acs":73777,"articleLive":2,"columnArticles":652,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.4834742186,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":147985,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7582924718777041,"acs":7887,"articleLive":2,"columnArticles":121,"formTitle":"[186]翻转字符串里的单词 II","frequency":1.2675539073,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":10401,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5213613422452599,"acs":76442,"articleLive":2,"columnArticles":556,"formTitle":"[187]重复的DNA序列","frequency":2.9781848938,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":146620,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3941911873585345,"acs":93173,"articleLive":2,"columnArticles":720,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.9374482278,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":236365,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.44870103436606457,"acs":365948,"articleLive":2,"columnArticles":1830,"formTitle":"[189]旋转数组","frequency":3.7234860573,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":815572,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6998619490745475,"acs":136879,"articleLive":2,"columnArticles":860,"formTitle":"[190]颠倒二进制位","frequency":1.7104716115,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":195580,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7495575758956715,"acs":197375,"articleLive":2,"columnArticles":1241,"formTitle":"[191]位1的个数","frequency":1.0723842081,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":263322,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3570145327387636,"acs":22257,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":2.3056048954,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":62342,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32550954363940554,"acs":26655,"articleLive":2,"columnArticles":141,"formTitle":"[193]有效电话号码","frequency":0.8756739138,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":81887,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3457182139583606,"acs":10561,"articleLive":2,"columnArticles":72,"formTitle":"[194]转置文件","frequency":0.3438572302,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30548,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43652769135034225,"acs":36478,"articleLive":2,"columnArticles":147,"formTitle":"[195]第十行","frequency":1.7104716115,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":83564,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6651722570216205,"acs":105342,"articleLive":2,"columnArticles":408,"formTitle":"[196]删除重复的电子邮箱","frequency":2.9496658507,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":158368,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339125316124531,"acs":97958,"articleLive":2,"columnArticles":526,"formTitle":"[197]上升的温度","frequency":2.7706176193,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":183472,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.517460924103352,"acs":408894,"articleLive":2,"columnArticles":2820,"formTitle":"[198]打家劫舍","frequency":3.5465541535,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":790193,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6528238838434114,"acs":148868,"articleLive":2,"columnArticles":1657,"formTitle":"[199]二叉树的右视图","frequency":3.3088711227,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":228037,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5600525140962286,"acs":347246,"articleLive":2,"columnArticles":2205,"formTitle":"[200]岛屿数量","frequency":4.1331780021,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":620024,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5254625351649931,"acs":51179,"articleLive":2,"columnArticles":335,"formTitle":"[201]数字范围按位与","frequency":1.2069231575,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":97398,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6200414554702061,"acs":177986,"articleLive":2,"columnArticles":1447,"formTitle":"[202]快乐数","frequency":2.8266861148,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":287055,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.518396730955644,"acs":248142,"articleLive":2,"columnArticles":1736,"formTitle":"[203]移除链表元素","frequency":2.2972902221,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":478672,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.377442861874793,"acs":173204,"articleLive":2,"columnArticles":750,"formTitle":"[204]计数质数","frequency":2.7073854341,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":458888,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5000616122000654,"acs":117686,"articleLive":2,"columnArticles":904,"formTitle":"[205]同构字符串","frequency":2.6636782153,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":235343,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7235540571408744,"acs":750717,"articleLive":2,"columnArticles":7529,"formTitle":"[206]反转链表","frequency":4.0052092822,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1037541,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5423373446611484,"acs":148992,"articleLive":2,"columnArticles":974,"formTitle":"[207]课程表","frequency":3.2400764378,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":274722,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7171381895786512,"acs":151887,"articleLive":2,"columnArticles":1029,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.6604711827,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":211796,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4742600709093971,"acs":208406,"articleLive":2,"columnArticles":1470,"formTitle":"[209]长度最小的子数组","frequency":2.6284946513,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":439434,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5443177404300464,"acs":93891,"articleLive":2,"columnArticles":706,"formTitle":"[210]课程表 II","frequency":2.3749086861,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":172493,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.51148221181497,"acs":49802,"articleLive":2,"columnArticles":544,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.3996908763,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":97368,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.46219514857754196,"acs":63507,"articleLive":2,"columnArticles":585,"formTitle":"[212]单词搜索 II","frequency":1.9688365977,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":137403,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43363914222574407,"acs":176211,"articleLive":2,"columnArticles":1612,"formTitle":"[213]打家劫舍 II","frequency":3.0533856769,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":406354,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37271068696933546,"acs":31869,"articleLive":2,"columnArticles":321,"formTitle":"[214]最短回文串","frequency":2.6071222572,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":85506,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462537493256106,"acs":462370,"articleLive":2,"columnArticles":2395,"formTitle":"[215]数组中的第K个最大元素","frequency":4.1951958936,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":715462,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7367363934747465,"acs":105273,"articleLive":2,"columnArticles":1076,"formTitle":"[216]组合总和 III","frequency":3.18080449,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":142891,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5564423514558154,"acs":394891,"articleLive":2,"columnArticles":1860,"formTitle":"[217]存在重复元素","frequency":4.1417561736,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":709671,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417358490566038,"acs":32301,"articleLive":2,"columnArticles":285,"formTitle":"[218]天际线问题","frequency":3.3496514931,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":59625,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4238952536824877,"acs":115255,"articleLive":2,"columnArticles":939,"formTitle":"[219]存在重复元素 II","frequency":2.2727791911,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":271895,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2867839711747918,"acs":66221,"articleLive":2,"columnArticles":434,"formTitle":"[220]存在重复元素 III","frequency":1.565710672,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":230909,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47873169801017773,"acs":145533,"articleLive":2,"columnArticles":1036,"formTitle":"[221]最大正方形","frequency":3.2788962821,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":303997,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7828769174882577,"acs":122842,"articleLive":2,"columnArticles":910,"formTitle":"[222]完全二叉树的节点个数","frequency":1.8833144243,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":156911,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5238338929315876,"acs":41968,"articleLive":2,"columnArticles":525,"formTitle":"[223]矩形面积","frequency":3.3417712317,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":80117,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41780409017493575,"acs":73465,"articleLive":2,"columnArticles":673,"formTitle":"[224]基本计算器","frequency":3.2667310856,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":175836,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.674112384547006,"acs":141811,"articleLive":2,"columnArticles":4792,"formTitle":"[225]用队列实现栈","frequency":2.4047973425,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":210367,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.788435660424445,"acs":322251,"articleLive":2,"columnArticles":1940,"formTitle":"[226]翻转二叉树","frequency":3.4172447842,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":408722,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4378226322395378,"acs":89649,"articleLive":2,"columnArticles":716,"formTitle":"[227]基本计算器 II","frequency":3.0075691436,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":204761,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5787259084890393,"acs":59004,"articleLive":2,"columnArticles":671,"formTitle":"[228]汇总区间","frequency":0.2925507746,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":101955,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5336174169055551,"acs":68874,"articleLive":2,"columnArticles":647,"formTitle":"[229]求众数 II","frequency":1.3127695658,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":129070,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7518909639020569,"acs":165113,"articleLive":2,"columnArticles":1139,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0408637038,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":219597,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045045045045045,"acs":176680,"articleLive":2,"columnArticles":1277,"formTitle":"[231]2 的幂","frequency":1.3963883697,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":350205,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6898268220617203,"acs":168097,"articleLive":2,"columnArticles":1320,"formTitle":"[232]用栈实现队列","frequency":2.1886960738,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":243680,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4770521756784192,"acs":35247,"articleLive":2,"columnArticles":426,"formTitle":"[233]数字 1 的个数","frequency":3.1150099765,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":73885,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4987800370819653,"acs":325239,"articleLive":2,"columnArticles":2064,"formTitle":"[234]回文链表","frequency":3.5862055058,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":652069,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.66655942297908,"acs":178174,"articleLive":2,"columnArticles":1033,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.6552825653,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":267304,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6814500723879997,"acs":271119,"articleLive":2,"columnArticles":1457,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.2228997874,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":397856,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8564517191068477,"acs":247130,"articleLive":2,"columnArticles":1299,"formTitle":"[237]删除链表中的节点","frequency":1.339738462,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":288551,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7236388525294511,"acs":144845,"articleLive":2,"columnArticles":915,"formTitle":"[238]除自身以外数组的乘积","frequency":2.2825068942,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":200162,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4967974135301653,"acs":203600,"articleLive":2,"columnArticles":1395,"formTitle":"[239]滑动窗口最大值","frequency":3.1695253269,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":409825,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.49465335820364226,"acs":208440,"articleLive":2,"columnArticles":1065,"formTitle":"[240]搜索二维矩阵 II","frequency":1.8101556691,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":421386,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7363974767625884,"acs":33037,"articleLive":2,"columnArticles":296,"formTitle":"[241]为运算表达式设计优先级","frequency":2.8672177652,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":44863,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6463134634608302,"acs":307112,"articleLive":2,"columnArticles":1776,"formTitle":"[242]有效的字母异位词","frequency":2.3483184463,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":475175,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6563568985176739,"acs":9210,"articleLive":2,"columnArticles":109,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14032,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5550425018364991,"acs":5289,"articleLive":2,"columnArticles":62,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":9529,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5995994659546061,"acs":4491,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.9359331053,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":7490,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4759007585335019,"acs":6023,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":12656,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5257842089929106,"acs":5414,"articleLive":2,"columnArticles":94,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10297,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46799041424169807,"acs":2734,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5842,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.641213389121339,"acs":6130,"articleLive":2,"columnArticles":107,"formTitle":"[249]移位字符串分组","frequency":0.3711664096,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":9560,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6369984937696836,"acs":4652,"articleLive":2,"columnArticles":79,"formTitle":"[250]统计同值子树","frequency":0.3996908763,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7303,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5445896052257881,"acs":3835,"articleLive":2,"columnArticles":72,"formTitle":"[251]展开二维向量","frequency":0.967905138,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7042,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5644452417257153,"acs":12586,"articleLive":2,"columnArticles":164,"formTitle":"[252]会议室","frequency":0.3711664096,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":22298,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.502736396307729,"acs":33713,"articleLive":2,"columnArticles":363,"formTitle":"[253]会议室 II","frequency":2.9496658507,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":67059,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5708254169305468,"acs":5408,"articleLive":2,"columnArticles":78,"formTitle":"[254]因子的组合","frequency":0.3711664096,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":9474,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47606055271959163,"acs":5409,"articleLive":2,"columnArticles":64,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":11362,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6437467018469657,"acs":12199,"articleLive":2,"columnArticles":191,"formTitle":"[256]粉刷房子","frequency":0.8756739138,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":18950,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6845849293462517,"acs":148876,"articleLive":2,"columnArticles":1099,"formTitle":"[257]二叉树的所有路径","frequency":2.8266861148,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":217469,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6914438914918585,"acs":80724,"articleLive":2,"columnArticles":676,"formTitle":"[258]各位相加","frequency":2.1590203057,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":116747,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.564179104477612,"acs":7371,"articleLive":2,"columnArticles":87,"formTitle":"[259]较小的三数之和","frequency":0.3711664096,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":13065,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.742273895342682,"acs":77123,"articleLive":2,"columnArticles":682,"formTitle":"[260]只出现一次的数字 III","frequency":1.6956213237,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":103901,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49542403904820015,"acs":8932,"articleLive":2,"columnArticles":123,"formTitle":"[261]以图判树","frequency":1.2675539073,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":18029,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43323855899430264,"acs":39770,"articleLive":2,"columnArticles":382,"formTitle":"[262]行程和用户","frequency":2.9970961987,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":91797,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5148104488872124,"acs":109181,"articleLive":2,"columnArticles":857,"formTitle":"[263]丑数","frequency":1.939430127,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":212080,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5803217703550938,"acs":103270,"articleLive":2,"columnArticles":635,"formTitle":"[264]丑数 II","frequency":2.4356622582,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":177953,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.59375,"acs":7220,"articleLive":2,"columnArticles":163,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":12160,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.676632801161103,"acs":6993,"articleLive":2,"columnArticles":104,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10335,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44833249115715007,"acs":3549,"articleLive":2,"columnArticles":78,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7916,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6480573198802374,"acs":187227,"articleLive":2,"columnArticles":1471,"formTitle":"[268]丢失的数字","frequency":0.8821422417,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":288905,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.34031730042810376,"acs":6757,"articleLive":2,"columnArticles":110,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":19855,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5559954444384185,"acs":10252,"articleLive":2,"columnArticles":142,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.9359331053,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":18439,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.558316633266533,"acs":2786,"articleLive":2,"columnArticles":47,"formTitle":"[271]字符串的编码与解码","frequency":0.3996908763,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4990,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6451036454610436,"acs":3610,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.3711664096,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5596,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.367154785168642,"acs":28934,"articleLive":2,"columnArticles":353,"formTitle":"[273]整数转换英文表示","frequency":1.4003912571,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":78806,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.43968047735912613,"acs":54822,"articleLive":2,"columnArticles":572,"formTitle":"[274]H 指数","frequency":2.7706176193,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":124686,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4618588769508554,"acs":51670,"articleLive":2,"columnArticles":422,"formTitle":"[275]H 指数 II","frequency":1.8833144243,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":111874,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4951785956811082,"acs":7292,"articleLive":2,"columnArticles":133,"formTitle":"[276]栅栏涂色","frequency":0.3438572302,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":14726,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.571166813251246,"acs":7793,"articleLive":2,"columnArticles":88,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":13644,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45306627994270426,"acs":203381,"articleLive":2,"columnArticles":1167,"formTitle":"[278]第一个错误的版本","frequency":3.6241982229,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":448899,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6334392541261236,"acs":211703,"articleLive":2,"columnArticles":1247,"formTitle":"[279]完全平方数","frequency":3.5089470226,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":334212,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6844088553933113,"acs":5812,"articleLive":2,"columnArticles":74,"formTitle":"[280]摆动排序","frequency":0.9359331053,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8492,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7589585666293394,"acs":2711,"articleLive":2,"columnArticles":69,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3572,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48524420835177806,"acs":19731,"articleLive":2,"columnArticles":166,"formTitle":"[282]给表达式添加运算符","frequency":0.3619327336,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":40662,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6399384896438133,"acs":526846,"articleLive":2,"columnArticles":3528,"formTitle":"[283]移动零","frequency":3.7291411148,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":823276,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7707327442227688,"acs":25381,"articleLive":2,"columnArticles":213,"formTitle":"[284]窥探迭代器","frequency":1.7104716115,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32931,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6355693990731596,"acs":8366,"articleLive":2,"columnArticles":107,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":13163,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5124818948624009,"acs":12030,"articleLive":2,"columnArticles":157,"formTitle":"[286]墙与门","frequency":0.3711664096,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":23474,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6577612385060734,"acs":185415,"articleLive":2,"columnArticles":1268,"formTitle":"[287]寻找重复数","frequency":2.9301910386,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":281888,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4379388313697489,"acs":3680,"articleLive":2,"columnArticles":57,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8403,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7537168893781264,"acs":54092,"articleLive":2,"columnArticles":837,"formTitle":"[289]生命游戏","frequency":1.2996010848,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":71767,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45585257297349285,"acs":85316,"articleLive":2,"columnArticles":1136,"formTitle":"[290]单词规律","frequency":1.9992182418,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":187157,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5274041357157198,"acs":2627,"articleLive":2,"columnArticles":57,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4981,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.70795719785383,"acs":116774,"articleLive":2,"columnArticles":779,"formTitle":"[292]Nim 游戏","frequency":2.2727791911,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":164945,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7125279642058165,"acs":5096,"articleLive":2,"columnArticles":85,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7152,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5811437403400309,"acs":3760,"articleLive":2,"columnArticles":56,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6470,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5222001168427203,"acs":66145,"articleLive":2,"columnArticles":515,"formTitle":"[295]数据流的中位数","frequency":3.1014718636,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":126666,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6203143893591294,"acs":2565,"articleLive":2,"columnArticles":47,"formTitle":"[296]最佳的碰头地点","frequency":1.0012304478,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4135,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5614489928193404,"acs":110012,"articleLive":2,"columnArticles":784,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.8612593373,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":195943,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5799842395587076,"acs":5152,"articleLive":2,"columnArticles":83,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":8883,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5061634528277469,"acs":31289,"articleLive":2,"columnArticles":375,"formTitle":"[299]猜数字游戏","frequency":1.2366872594,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":61816,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5184387728513241,"acs":378030,"articleLive":2,"columnArticles":2083,"formTitle":"[300]最长递增子序列","frequency":3.6066477548,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":729170,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5470989868150022,"acs":52324,"articleLive":2,"columnArticles":378,"formTitle":"[301]删除无效的括号","frequency":1.8611773831,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":95639,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6567491387409959,"acs":2097,"articleLive":2,"columnArticles":40,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3193,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7277985671865859,"acs":131864,"articleLive":2,"columnArticles":811,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.8521106446,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":181182,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5504732259285744,"acs":65432,"articleLive":2,"columnArticles":585,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.441481672,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":118865,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3884008528784648,"acs":4554,"articleLive":2,"columnArticles":69,"formTitle":"[305]岛屿数量 II","frequency":0.4607785683,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":11725,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33757334774552195,"acs":17489,"articleLive":2,"columnArticles":264,"formTitle":"[306]累加数","frequency":1.9156274133,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":51808,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5360786697347284,"acs":24695,"articleLive":2,"columnArticles":241,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.3176777246,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":46066,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.614797261716693,"acs":2335,"articleLive":2,"columnArticles":46,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3798,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6135273330306201,"acs":124308,"articleLive":2,"columnArticles":980,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.2332411412,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":202612,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3806341675298206,"acs":22784,"articleLive":2,"columnArticles":219,"formTitle":"[310]最小高度树","frequency":1.565710672,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":59858,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7612307692307693,"acs":3711,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":1.0012304478,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":4875,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.683739760851144,"acs":58096,"articleLive":2,"columnArticles":390,"formTitle":"[312]戳气球","frequency":2.5523640533,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":84968,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6240512582523691,"acs":41686,"articleLive":2,"columnArticles":358,"formTitle":"[313]超级丑数","frequency":2.5005837207,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":66799,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5446318847056195,"acs":4875,"articleLive":2,"columnArticles":89,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":8951,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4175358566222128,"acs":51440,"articleLive":2,"columnArticles":485,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.806284738,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":123199,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47638239782128217,"acs":69619,"articleLive":2,"columnArticles":551,"formTitle":"[316]去除重复字母","frequency":2.9745737387,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":146141,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48386752136752137,"acs":4529,"articleLive":2,"columnArticles":66,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":9360,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6878828142722883,"acs":21226,"articleLive":2,"columnArticles":190,"formTitle":"[318]最大单词长度乘积","frequency":0.3176777246,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":30857,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5205838323353293,"acs":23647,"articleLive":2,"columnArticles":232,"formTitle":"[319]灯泡开关","frequency":0.3438572302,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":45424,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6784927280740414,"acs":3079,"articleLive":2,"columnArticles":54,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4538,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42387448627193597,"acs":27125,"articleLive":2,"columnArticles":235,"formTitle":"[321]拼接最大数","frequency":1.6351347948,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63993,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44602341260711026,"acs":319859,"articleLive":2,"columnArticles":1879,"formTitle":"[322]零钱兑换","frequency":3.6488531989,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":717135,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.632797783933518,"acs":11422,"articleLive":2,"columnArticles":157,"formTitle":"[323]无向图中连通分量的数目","frequency":1.8101556691,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":18050,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3784581282206293,"acs":26293,"articleLive":2,"columnArticles":177,"formTitle":"[324]摆动排序 II","frequency":1.8833144243,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":69474,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5369079238601151,"acs":9703,"articleLive":2,"columnArticles":115,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.2675539073,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":18072,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044719735778327,"acs":139148,"articleLive":2,"columnArticles":600,"formTitle":"[326]3的幂","frequency":2.4419579224,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":275829,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42013929484074625,"acs":25155,"articleLive":2,"columnArticles":209,"formTitle":"[327]区间和的个数","frequency":1.9491276429,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":59873,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6551294599163626,"acs":132534,"articleLive":2,"columnArticles":1093,"formTitle":"[328]奇偶链表","frequency":3.0075691436,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":202302,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48814558610466724,"acs":58288,"articleLive":2,"columnArticles":514,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.4675675166,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":119407,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5327985292888777,"acs":19128,"articleLive":2,"columnArticles":151,"formTitle":"[330]按要求补齐数组","frequency":1.2996010848,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35901,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4794055870615417,"acs":45649,"articleLive":2,"columnArticles":516,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.3176777246,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":95220,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4475967302452316,"acs":41067,"articleLive":2,"columnArticles":335,"formTitle":"[332]重新安排行程","frequency":1.3329152915,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":91750,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4693683409436834,"acs":4934,"articleLive":2,"columnArticles":82,"formTitle":"[333]最大 BST 子树","frequency":0.3438572302,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":10512,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4118734941803251,"acs":48550,"articleLive":2,"columnArticles":319,"formTitle":"[334]递增的三元子序列","frequency":1.7644804164,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":117876,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.43083432500330554,"acs":16292,"articleLive":2,"columnArticles":145,"formTitle":"[335]路径交叉","frequency":0.6599639311,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":37815,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4008794823209753,"acs":22426,"articleLive":2,"columnArticles":194,"formTitle":"[336]回文对","frequency":1.5997391338,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55942,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6074397974392587,"acs":135306,"articleLive":2,"columnArticles":957,"formTitle":"[337]打家劫舍 III","frequency":3.1161888327,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":222748,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868274009082912,"acs":165458,"articleLive":2,"columnArticles":1421,"formTitle":"[338]比特位计数","frequency":2.6709335616,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":210285,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8119017894298793,"acs":3902,"articleLive":2,"columnArticles":61,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4806,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4941199684293607,"acs":12521,"articleLive":2,"columnArticles":189,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.2366872594,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":25340,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7272005017771274,"acs":52173,"articleLive":2,"columnArticles":494,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.9688365977,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":71745,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5168289983718545,"acs":89199,"articleLive":2,"columnArticles":788,"formTitle":"[342]4的幂","frequency":2.3749086861,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":172589,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6074215153444276,"acs":115452,"articleLive":2,"columnArticles":1083,"formTitle":"[343]整数拆分","frequency":3.1052712603,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":190069,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7708431366709355,"acs":388239,"articleLive":2,"columnArticles":2058,"formTitle":"[344]反转字符串","frequency":3.1695253269,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":503655,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5393197742312184,"acs":110841,"articleLive":2,"columnArticles":1056,"formTitle":"[345]反转字符串中的元音字母","frequency":2.8017533847,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":205520,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7068068622025456,"acs":12772,"articleLive":2,"columnArticles":141,"formTitle":"[346]数据流中的移动平均值","frequency":0.3176777246,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":18070,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6225033034234945,"acs":211526,"articleLive":2,"columnArticles":1562,"formTitle":"[347]前 K 个高频元素","frequency":3.3956718834,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":339799,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6002566196197364,"acs":5146,"articleLive":2,"columnArticles":81,"formTitle":"[348]设计井字棋","frequency":0.3438572302,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":8573,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7379132002813841,"acs":223432,"articleLive":2,"columnArticles":1583,"formTitle":"[349]两个数组的交集","frequency":3.365228132,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":302789,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5509188497494046,"acs":263483,"articleLive":2,"columnArticles":1478,"formTitle":"[350]两个数组的交集 II","frequency":3.1850680706,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":478261,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.591374428229144,"acs":5430,"articleLive":2,"columnArticles":101,"formTitle":"[351]安卓系统手势解锁","frequency":0.6860251698,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9182,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6795011891752909,"acs":21142,"articleLive":2,"columnArticles":348,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.5718110413,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31114,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42862432882799484,"acs":2315,"articleLive":2,"columnArticles":51,"formTitle":"[353]贪吃蛇","frequency":1.0012304478,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5401,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4555751943288291,"acs":71913,"articleLive":2,"columnArticles":554,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.7384811777,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":157851,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4078151858218244,"acs":27521,"articleLive":2,"columnArticles":453,"formTitle":"[355]设计推特","frequency":1.2366872594,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":67484,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3534983853606028,"acs":1642,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4645,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5204708501690443,"acs":25247,"articleLive":2,"columnArticles":397,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.7424845884,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":48508,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35094924447888415,"acs":4529,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12905,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7276281494352737,"acs":5025,"articleLive":2,"columnArticles":60,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6906,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6032430213464697,"acs":2939,"articleLive":2,"columnArticles":64,"formTitle":"[360]有序转化数组","frequency":0.4935683911,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4872,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5667719940129718,"acs":3408,"articleLive":2,"columnArticles":67,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6013,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6913086913086913,"acs":3460,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.3711664096,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5005,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.489246207564332,"acs":33348,"articleLive":2,"columnArticles":218,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":68162,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.72480181200453,"acs":1920,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2649,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36729754689141997,"acs":34602,"articleLive":2,"columnArticles":490,"formTitle":"[365]水壶问题","frequency":2.692207565,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":94207,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7648170417454045,"acs":4452,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.3996908763,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5821,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.447734296516131,"acs":116770,"articleLive":2,"columnArticles":937,"formTitle":"[367]有效的完全平方数","frequency":0.5970090179,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":260802,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4583414067041271,"acs":42579,"articleLive":2,"columnArticles":457,"formTitle":"[368]最大整除子集","frequency":2.2607598156,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":92898,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6199197860962566,"acs":4637,"articleLive":2,"columnArticles":134,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7480,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7268063274903805,"acs":3400,"articleLive":2,"columnArticles":54,"formTitle":"[370]区间加法","frequency":0.9359331053,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":4678,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6130287153425829,"acs":81786,"articleLive":2,"columnArticles":511,"formTitle":"[371]两整数之和","frequency":2.9496658507,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":133413,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5108736991321785,"acs":14776,"articleLive":2,"columnArticles":140,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28923,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4139587344184509,"acs":21287,"articleLive":2,"columnArticles":221,"formTitle":"[373]查找和最小的K对数字","frequency":1.7104716115,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":51423,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5161617258479024,"acs":85560,"articleLive":2,"columnArticles":588,"formTitle":"[374]猜数字大小","frequency":1.7104716115,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":165762,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4717534618174936,"acs":14956,"articleLive":2,"columnArticles":128,"formTitle":"[375]猜数字大小 II","frequency":1.5997391338,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31703,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46529736718382697,"acs":79175,"articleLive":2,"columnArticles":844,"formTitle":"[376]摆动序列","frequency":1.5394072092,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":170160,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5106912134906433,"acs":67352,"articleLive":2,"columnArticles":566,"formTitle":"[377]组合总和 Ⅳ","frequency":1.9992182418,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":131884,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391045639714449,"acs":81737,"articleLive":2,"columnArticles":574,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":1.7104716115,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":127893,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.637110643990063,"acs":3334,"articleLive":2,"columnArticles":72,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5233,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5043354399745543,"acs":36469,"articleLive":2,"columnArticles":229,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.9688365977,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":72311,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44072340337780713,"acs":21372,"articleLive":2,"columnArticles":177,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48493,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.633913812324607,"acs":16490,"articleLive":2,"columnArticles":129,"formTitle":"[382]链表随机节点","frequency":0.2925507746,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":26013,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6060500447535387,"acs":76512,"articleLive":2,"columnArticles":835,"formTitle":"[383]赎金信","frequency":1.2675539073,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":126247,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5803564769930644,"acs":54474,"articleLive":2,"columnArticles":205,"formTitle":"[384]打乱数组","frequency":2.2103888985,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":93863,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41873889875666076,"acs":7544,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18016,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7502426085268811,"acs":23193,"articleLive":2,"columnArticles":249,"formTitle":"[386]字典序排数","frequency":2.6552825653,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30914,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5362997064502601,"acs":232753,"articleLive":2,"columnArticles":1268,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9844974085,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":433998,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5315584307870946,"acs":6409,"articleLive":2,"columnArticles":116,"formTitle":"[388]文件的最长绝对路径","frequency":0.8756739138,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":12057,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6914094354504499,"acs":103439,"articleLive":2,"columnArticles":1020,"formTitle":"[389]找不同","frequency":0.3438572302,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":149606,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46656427977218917,"acs":7291,"articleLive":2,"columnArticles":99,"formTitle":"[390]消除游戏","frequency":1.9156274133,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15627,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.36000299378789014,"acs":4810,"articleLive":2,"columnArticles":68,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13361,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5155236495086808,"acs":151881,"articleLive":2,"columnArticles":1636,"formTitle":"[392]判断子序列","frequency":2.3459379462,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":294615,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3921170395869191,"acs":11391,"articleLive":2,"columnArticles":130,"formTitle":"[393]UTF-8 编码验证","frequency":1.3329152915,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":29050,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.553004424526523,"acs":126111,"articleLive":2,"columnArticles":1339,"formTitle":"[394]字符串解码","frequency":3.8272790474,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":228047,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5200931971923367,"acs":53127,"articleLive":2,"columnArticles":438,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.5523640533,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":102149,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4318491594729668,"acs":9505,"articleLive":2,"columnArticles":155,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":22010,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.376115577303973,"acs":16141,"articleLive":2,"columnArticles":205,"formTitle":"[397]整数替换","frequency":1.4709128722,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":42915,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6597521314933638,"acs":15012,"articleLive":2,"columnArticles":124,"formTitle":"[398]随机数索引","frequency":0.8197934554,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22754,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5915745402802102,"acs":43237,"articleLive":2,"columnArticles":543,"formTitle":"[399]除法求值","frequency":0.9052181601,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":73088,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41837760831308135,"acs":19970,"articleLive":2,"columnArticles":203,"formTitle":"[400]第 N 位数字","frequency":2.1590203057,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":47732,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6146794131821085,"acs":54846,"articleLive":2,"columnArticles":662,"formTitle":"[401]二进制手表","frequency":2.4356622582,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":89227,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3269621222534216,"acs":83256,"articleLive":2,"columnArticles":603,"formTitle":"[402]移掉 K 位数字","frequency":3.0691514142,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":254635,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4552578287793854,"acs":46536,"articleLive":2,"columnArticles":469,"formTitle":"[403]青蛙过河","frequency":2.0968885246,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":102219,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5861335885934352,"acs":105320,"articleLive":2,"columnArticles":1168,"formTitle":"[404]左叶子之和","frequency":2.9496658507,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":179686,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5614948249601228,"acs":46818,"articleLive":2,"columnArticles":473,"formTitle":"[405]数字转换为十六进制数","frequency":2.5523640533,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":83381,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7380133920578652,"acs":123663,"articleLive":2,"columnArticles":818,"formTitle":"[406]根据身高重建队列","frequency":2.8300881729,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":167562,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5788360805420731,"acs":24090,"articleLive":2,"columnArticles":238,"formTitle":"[407]接雨水 II","frequency":2.0968885246,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":41618,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3274514967957159,"acs":3730,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":11391,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5557851005142059,"acs":97926,"articleLive":2,"columnArticles":1370,"formTitle":"[409]最长回文串","frequency":2.8934712924,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":176194,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5660792334416676,"acs":40409,"articleLive":2,"columnArticles":330,"formTitle":"[410]分割数组的最大值","frequency":2.886219629,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":71384,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5035577449370553,"acs":920,"articleLive":2,"columnArticles":23,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1827,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7086471418153069,"acs":103972,"articleLive":2,"columnArticles":598,"formTitle":"[412]Fizz Buzz","frequency":0.9359331053,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":146719,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6883097762073027,"acs":74800,"articleLive":2,"columnArticles":964,"formTitle":"[413]等差数列划分","frequency":2.5984906005,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":108672,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3935598343957416,"acs":89832,"articleLive":2,"columnArticles":1167,"formTitle":"[414]第三大的数","frequency":2.4022701741,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":228255,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5393438574891576,"acs":155077,"articleLive":2,"columnArticles":1127,"formTitle":"[415]字符串相加","frequency":4.1296792931,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":287529,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5084705094581775,"acs":182246,"articleLive":2,"columnArticles":1041,"formTitle":"[416]分割等和子集","frequency":3.5779101451,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":358420,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4836993794222438,"acs":28917,"articleLive":2,"columnArticles":336,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.5854522661,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":59783,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.36356327383823767,"acs":2261,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6219,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7545637743006164,"acs":12731,"articleLive":2,"columnArticles":167,"formTitle":"[419]甲板上的战舰","frequency":0.3176777246,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16872,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20919352443190256,"acs":2817,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":1.8101556691,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13466,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6221127592059627,"acs":33721,"articleLive":2,"columnArticles":312,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.6636782153,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":54204,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4275092936802974,"acs":2070,"articleLive":2,"columnArticles":51,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4842,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5682500326242986,"acs":8709,"articleLive":2,"columnArticles":140,"formTitle":"[423]从英文中重建数字","frequency":0.9052181601,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":15326,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.531776181215425,"acs":52774,"articleLive":2,"columnArticles":460,"formTitle":"[424]替换后的最长重复字符","frequency":2.3396192092,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":99241,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6172549019607844,"acs":1574,"articleLive":2,"columnArticles":34,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2550,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6717157807766455,"acs":7317,"articleLive":2,"columnArticles":118,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.2996010848,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":10893,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6157955529887381,"acs":4265,"articleLive":2,"columnArticles":70,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6926,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6566738044254105,"acs":2760,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4203,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7010670871035555,"acs":61363,"articleLive":2,"columnArticles":496,"formTitle":"[429]N 叉树的层序遍历","frequency":1.7424845884,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":87528,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5876432067820633,"acs":44779,"articleLive":2,"columnArticles":678,"formTitle":"[430]扁平化多级双向链表","frequency":1.9156274133,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":76201,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7346437346437347,"acs":897,"articleLive":2,"columnArticles":30,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1221,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3804681825800324,"acs":6810,"articleLive":2,"columnArticles":90,"formTitle":"[432]全 O(1) 的数据结构","frequency":1.9156274133,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17899,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5319322520640929,"acs":16300,"articleLive":2,"columnArticles":221,"formTitle":"[433]最小基因变化","frequency":0.3438572302,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":30643,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3991169403779941,"acs":64451,"articleLive":2,"columnArticles":883,"formTitle":"[434]字符串中的单词数","frequency":3.0210883437,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":161484,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5070324363346693,"acs":101840,"articleLive":2,"columnArticles":894,"formTitle":"[435]无重叠区间","frequency":2.7998937148,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":200855,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48903860549673833,"acs":9146,"articleLive":2,"columnArticles":152,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18702,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5741873333781392,"acs":128150,"articleLive":2,"columnArticles":1052,"formTitle":"[437]路径总和 III","frequency":2.9496658507,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":223185,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5204704281679688,"acs":100990,"articleLive":2,"columnArticles":884,"formTitle":"[438]找到字符串中所有字母异位词","frequency":1.9688365977,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":194036,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5924361295513981,"acs":2945,"articleLive":2,"columnArticles":69,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4971,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3811614984764295,"acs":17012,"articleLive":2,"columnArticles":126,"formTitle":"[440]字典序的第K小数字","frequency":3.0708259516,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":44632,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45914641969836584,"acs":78728,"articleLive":2,"columnArticles":752,"formTitle":"[441]排列硬币","frequency":1.2203202819,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":171466,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6972050411570478,"acs":44976,"articleLive":2,"columnArticles":456,"formTitle":"[442]数组中重复的数据","frequency":3.0708259516,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":64509,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4772646019538557,"acs":57403,"articleLive":2,"columnArticles":701,"formTitle":"[443]压缩字符串","frequency":2.7706176193,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":120275,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2519803040034254,"acs":3531,"articleLive":2,"columnArticles":55,"formTitle":"[444]序列重建","frequency":0.4295260248,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14013,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5892920458574636,"acs":84762,"articleLive":2,"columnArticles":949,"formTitle":"[445]两数相加 II","frequency":2.4304476664,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":143837,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.550402940760639,"acs":19465,"articleLive":2,"columnArticles":175,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.2607598156,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35365,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6631369953673064,"acs":49098,"articleLive":2,"columnArticles":379,"formTitle":"[447]回旋镖的数量","frequency":2.1917163117,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":74039,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6495654306187505,"acs":143046,"articleLive":2,"columnArticles":1133,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.3749086861,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":220218,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5590945723396055,"acs":15956,"articleLive":2,"columnArticles":140,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.3438572302,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":28539,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48852998894728533,"acs":64974,"articleLive":2,"columnArticles":652,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.1274345769,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":132999,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7118313490044436,"acs":83942,"articleLive":2,"columnArticles":970,"formTitle":"[451]根据字符出现频率排序","frequency":3.2426930074,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":117924,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5084016290411786,"acs":101116,"articleLive":2,"columnArticles":884,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5203869083,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":198890,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6113926128590971,"acs":55866,"articleLive":2,"columnArticles":669,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.3140147099,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":91375,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.604685147787773,"acs":82343,"articleLive":2,"columnArticles":516,"formTitle":"[454]四数相加 II","frequency":2.9393670985,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":136175,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.576304309132979,"acs":158656,"articleLive":2,"columnArticles":1300,"formTitle":"[455]分发饼干","frequency":2.9219632482,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":275299,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3626289094991213,"acs":57984,"articleLive":2,"columnArticles":465,"formTitle":"[456]132 模式","frequency":1.7104716115,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":159899,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43580556550818106,"acs":29192,"articleLive":2,"columnArticles":336,"formTitle":"[457]环形数组是否存在循环","frequency":2.2256006308,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66984,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6149531071960733,"acs":7016,"articleLive":2,"columnArticles":70,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11409,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.510396459935669,"acs":82354,"articleLive":2,"columnArticles":665,"formTitle":"[459]重复的子字符串","frequency":1.9156274133,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":161353,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4369956781333533,"acs":34985,"articleLive":2,"columnArticles":411,"formTitle":"[460]LFU 缓存","frequency":2.4078388924,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":80058,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8125543432530222,"acs":173820,"articleLive":2,"columnArticles":1390,"formTitle":"[461]汉明距离","frequency":2.7112177374,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":213918,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6076796714579056,"acs":14797,"articleLive":2,"columnArticles":142,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.2996010848,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":24350,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7081129530368109,"acs":79793,"articleLive":2,"columnArticles":961,"formTitle":"[463]岛屿的周长","frequency":2.1917163117,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":112684,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35487166785349394,"acs":11462,"articleLive":2,"columnArticles":113,"formTitle":"[464]我能赢吗","frequency":1.0360165639,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":32299,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5313807531380753,"acs":1651,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3107,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37322618705953636,"acs":11704,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.4295260248,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31359,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44185590269262837,"acs":9009,"articleLive":2,"columnArticles":116,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":1.2996010848,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20389,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25197180489612075,"acs":25845,"articleLive":2,"columnArticles":301,"formTitle":"[468]验证IP地址","frequency":2.5854522661,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":102571,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4338444065871664,"acs":1528,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.5643192472,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3522,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5471740542701514,"acs":65697,"articleLive":2,"columnArticles":340,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1588574211,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":120066,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6107066381156316,"acs":1426,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":1.441481672,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2335,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3952239154551293,"acs":6769,"articleLive":2,"columnArticles":83,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":17127,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4211539572223399,"acs":21876,"articleLive":2,"columnArticles":186,"formTitle":"[473]火柴拼正方形","frequency":2.1318815981,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":51943,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6129980224853656,"acs":77806,"articleLive":2,"columnArticles":621,"formTitle":"[474]一和零","frequency":2.9393670985,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":126927,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33637751893882684,"acs":22468,"articleLive":2,"columnArticles":258,"formTitle":"[475]供暖器","frequency":2.9267946423,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":66794,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7134442172735812,"acs":64556,"articleLive":2,"columnArticles":865,"formTitle":"[476]数字的补数","frequency":0.6551050712,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":90485,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6034919222448948,"acs":39335,"articleLive":2,"columnArticles":332,"formTitle":"[477]汉明距离总和","frequency":2.4675675166,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":65179,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4435076923076923,"acs":7207,"articleLive":2,"columnArticles":51,"formTitle":"[478]在圆内随机生成点","frequency":1.3329152915,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":16250,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.42282507015902715,"acs":3164,"articleLive":2,"columnArticles":27,"formTitle":"[479]最大回文数乘积","frequency":0.967905138,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7483,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4477879543994382,"acs":29970,"articleLive":2,"columnArticles":408,"formTitle":"[480]滑动窗口中位数","frequency":2.2256006308,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66929,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5433671097889746,"acs":5845,"articleLive":2,"columnArticles":100,"formTitle":"[481]神奇字符串","frequency":0.3176777246,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10757,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47243736281233295,"acs":41540,"articleLive":2,"columnArticles":442,"formTitle":"[482]密钥格式化","frequency":1.1781910527,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":87927,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5914709750140899,"acs":15742,"articleLive":2,"columnArticles":118,"formTitle":"[483]最小好进制","frequency":1.7756837601,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":26615,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.636986301369863,"acs":1488,"articleLive":2,"columnArticles":35,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2336,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6072050155292941,"acs":126295,"articleLive":2,"columnArticles":1030,"formTitle":"[485]最大连续 1 的个数","frequency":2.4047973425,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":207994,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.586535712065643,"acs":47178,"articleLive":2,"columnArticles":406,"formTitle":"[486]预测赢家","frequency":1.9491276429,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":80435,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5776918117343649,"acs":6272,"articleLive":2,"columnArticles":117,"formTitle":"[487]最大连续1的个数 II","frequency":1.5997391338,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":10857,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3899763389976339,"acs":3626,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.4935683911,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9298,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7230576441102757,"acs":1731,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2394,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4852574750830565,"acs":7011,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.3711664096,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":14448,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5436730491171187,"acs":49633,"articleLive":2,"columnArticles":417,"formTitle":"[491]递增子序列","frequency":2.4078388924,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":91292,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.6057156008014296,"acs":44743,"articleLive":2,"columnArticles":426,"formTitle":"[492]构造矩形","frequency":0.5859417112,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":73868,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34612369729757514,"acs":26935,"articleLive":2,"columnArticles":273,"formTitle":"[493]翻转对","frequency":1.5329530755,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77819,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.492732695024329,"acs":156960,"articleLive":2,"columnArticles":1072,"formTitle":"[494]目标和","frequency":3.3920307161,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":318550,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5451846253508962,"acs":30297,"articleLive":2,"columnArticles":458,"formTitle":"[495]提莫攻击","frequency":1.7104716115,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":55572,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7044937572663398,"acs":139370,"articleLive":2,"columnArticles":1435,"formTitle":"[496]下一个更大元素 I","frequency":1.1074755279,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":197830,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40295988575879527,"acs":3104,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.4607785683,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7703,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4720776787944384,"acs":45361,"articleLive":2,"columnArticles":465,"formTitle":"[498]对角线遍历","frequency":2.7362263345,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":96088,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3735224586288416,"acs":2686,"articleLive":2,"columnArticles":50,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7191,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7440461522851469,"acs":51331,"articleLive":2,"columnArticles":754,"formTitle":"[500]键盘行","frequency":0.9270330822,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":68989,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5145666149746307,"acs":68354,"articleLive":2,"columnArticles":561,"formTitle":"[501]二叉搜索树中的众数","frequency":2.2607598156,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":132838,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44096345961443695,"acs":29530,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":2.1590203057,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66967,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6376933413047468,"acs":107730,"articleLive":2,"columnArticles":1019,"formTitle":"[503]下一个更大元素 II","frequency":2.2905416474,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":168937,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5039714497765566,"acs":31915,"articleLive":2,"columnArticles":337,"formTitle":"[504]七进制数","frequency":0.8756739138,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":63327,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48510389718768254,"acs":5813,"articleLive":2,"columnArticles":70,"formTitle":"[505]迷宫 II","frequency":0.9359331053,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":11983,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5623055673079316,"acs":22594,"articleLive":2,"columnArticles":305,"formTitle":"[506]相对名次","frequency":1.4709128722,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":40181,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4158797065618287,"acs":30783,"articleLive":2,"columnArticles":243,"formTitle":"[507]完美数","frequency":0.9359331053,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":74019,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6772962048057489,"acs":15080,"articleLive":2,"columnArticles":214,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.2366872594,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":22265,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6728193814390377,"acs":260443,"articleLive":2,"columnArticles":1553,"formTitle":"[509]斐波那契数","frequency":2.9558329995,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":387092,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6065870430691278,"acs":3352,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5526,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.731388657667113,"acs":20209,"articleLive":2,"columnArticles":114,"formTitle":"[511]游戏玩法分析 I","frequency":1.7424845884,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":27631,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5381068235826638,"acs":19021,"articleLive":2,"columnArticles":155,"formTitle":"[512]游戏玩法分析 II","frequency":0.3438572302,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":35348,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7312631806629536,"acs":54093,"articleLive":2,"columnArticles":605,"formTitle":"[513]找树左下角的值","frequency":0.2684066756,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":73972,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49900905647123756,"acs":19891,"articleLive":2,"columnArticles":245,"formTitle":"[514]自由之路","frequency":0.3996908763,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39861,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6458928881658954,"acs":40896,"articleLive":2,"columnArticles":442,"formTitle":"[515]在每个树行中找最大值","frequency":1.1504269151,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":63317,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6554804601404439,"acs":89517,"articleLive":2,"columnArticles":643,"formTitle":"[516]最长回文子序列","frequency":3.0239804416,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":136567,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.509230607856506,"acs":19419,"articleLive":2,"columnArticles":168,"formTitle":"[517]超级洗衣机","frequency":2.5854522661,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38134,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6594625620841533,"acs":112594,"articleLive":2,"columnArticles":703,"formTitle":"[518]零钱兑换 II","frequency":3.3939065021,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":170736,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3960101867572156,"acs":2799,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":7068,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5631219245489338,"acs":41198,"articleLive":2,"columnArticles":676,"formTitle":"[520]检测大写字母","frequency":0.9052181601,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":73160,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7129502337091009,"acs":25930,"articleLive":2,"columnArticles":260,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.2925507746,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":36370,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36273898586866166,"acs":6982,"articleLive":2,"columnArticles":110,"formTitle":"[522]最长特殊序列 II","frequency":1.2996010848,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19248,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27526338928229366,"acs":70125,"articleLive":2,"columnArticles":610,"formTitle":"[523]连续的子数组和","frequency":2.8740154258,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":254756,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4959675801468523,"acs":74166,"articleLive":2,"columnArticles":772,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.5203869083,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":149538,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5363651117499768,"acs":46269,"articleLive":2,"columnArticles":524,"formTitle":"[525]连续数组","frequency":3.5139545444,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":86264,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7351929274453445,"acs":33763,"articleLive":2,"columnArticles":389,"formTitle":"[526]优美的排列","frequency":3.1131406074,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45924,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5778735632183908,"acs":2011,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3480,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47807218922641703,"acs":32278,"articleLive":2,"columnArticles":260,"formTitle":"[528]按权重随机选择","frequency":2.4419579224,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":67517,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6446559015763168,"acs":40242,"articleLive":2,"columnArticles":466,"formTitle":"[529]扫雷游戏","frequency":1.9839016612,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":62424,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6215303968852621,"acs":81574,"articleLive":2,"columnArticles":658,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.2925507746,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":131247,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6610540495032834,"acs":3926,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5939,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3765027955618645,"acs":25993,"articleLive":2,"columnArticles":284,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":69038,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5269121813031161,"acs":1674,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3177,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6748722087705139,"acs":15051,"articleLive":2,"columnArticles":145,"formTitle":"[534]游戏玩法分析 III","frequency":1.0012304478,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":22302,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8426560619538486,"acs":16104,"articleLive":2,"columnArticles":106,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.5329530755,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19111,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5394868377207598,"acs":3238,"articleLive":2,"columnArticles":51,"formTitle":"[536]从字符串生成二叉树","frequency":0.9359331053,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6002,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7132217124471191,"acs":11970,"articleLive":2,"columnArticles":178,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16783,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7041874234254405,"acs":113227,"articleLive":2,"columnArticles":882,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.4709128722,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":160791,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5987282051282051,"acs":14594,"articleLive":2,"columnArticles":199,"formTitle":"[539]最小时间差","frequency":1.6496995731,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":24375,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5815048606797729,"acs":40257,"articleLive":2,"columnArticles":422,"formTitle":"[540]有序数组中的单一元素","frequency":1.939430127,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":69229,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6057264692076979,"acs":76138,"articleLive":2,"columnArticles":829,"formTitle":"[541]反转字符串 II","frequency":2.7706176193,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":125697,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4577657016928779,"acs":73118,"articleLive":2,"columnArticles":671,"formTitle":"[542]01 矩阵","frequency":2.6098098529,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":159728,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5539153947415235,"acs":155689,"articleLive":2,"columnArticles":1269,"formTitle":"[543]二叉树的直径","frequency":3.4826171148,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":281070,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7130620985010707,"acs":2331,"articleLive":2,"columnArticles":54,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3269,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4204071913323015,"acs":3531,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8399,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6282580006598483,"acs":15234,"articleLive":2,"columnArticles":122,"formTitle":"[546]移除盒子","frequency":0.967905138,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24248,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6186014650476748,"acs":167967,"articleLive":2,"columnArticles":1177,"formTitle":"[547]省份数量","frequency":1.9322239273,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":271527,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35494292483308204,"acs":1648,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.6026087637,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4643,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4861411866608922,"acs":2245,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4618,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4374547131282524,"acs":13282,"articleLive":2,"columnArticles":188,"formTitle":"[550]游戏玩法分析 IV","frequency":0.8756739138,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":30362,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5675285308399137,"acs":59725,"articleLive":2,"columnArticles":763,"formTitle":"[551]学生出勤记录 I","frequency":2.2727791911,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":105237,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5779186728321495,"acs":24246,"articleLive":2,"columnArticles":288,"formTitle":"[552]学生出勤记录 II","frequency":2.4497098992,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41954,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6063840399002494,"acs":6079,"articleLive":2,"columnArticles":89,"formTitle":"[553]最优除法","frequency":0.3438572302,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10025,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5035059769591747,"acs":46459,"articleLive":2,"columnArticles":489,"formTitle":"[554]砖墙","frequency":2.1917163117,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":92271,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34423723631916847,"acs":1126,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3271,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32791195742064083,"acs":15464,"articleLive":2,"columnArticles":227,"formTitle":"[556]下一个更大元素 III","frequency":1.9156274133,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":47159,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7442731344515546,"acs":171322,"articleLive":2,"columnArticles":1434,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3564961468,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":230187,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5050709939148073,"acs":2988,"articleLive":2,"columnArticles":40,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5916,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7285386839286331,"acs":63251,"articleLive":2,"columnArticles":564,"formTitle":"[559]N 叉树的最大深度","frequency":1.2996010848,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":86819,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4461779968717002,"acs":158030,"articleLive":2,"columnArticles":965,"formTitle":"[560]和为 K 的子数组","frequency":3.960769868,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":354186,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.775174438716536,"acs":91876,"articleLive":2,"columnArticles":771,"formTitle":"[561]数组拆分 I","frequency":0.9052181601,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":118523,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4678383128295255,"acs":3993,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8535,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6067944282759504,"acs":33151,"articleLive":2,"columnArticles":335,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":54633,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.18002138867984316,"acs":4545,"articleLive":2,"columnArticles":82,"formTitle":"[564]寻找最近的回文数","frequency":1.3675928299,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":25247,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6092196819085487,"acs":14709,"articleLive":2,"columnArticles":142,"formTitle":"[565]数组嵌套","frequency":1.2366872594,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":24144,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6847983511586453,"acs":73761,"articleLive":2,"columnArticles":686,"formTitle":"[566]重塑矩阵","frequency":2.180689626,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":107712,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4323273664290627,"acs":126336,"articleLive":2,"columnArticles":1153,"formTitle":"[567]字符串的排列","frequency":2.9781848938,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":292223,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5085738184859891,"acs":1216,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2391,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5661177507297461,"acs":10279,"articleLive":2,"columnArticles":159,"formTitle":"[569]员工薪水中位数","frequency":1.9491276429,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":18157,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6613115874798574,"acs":13543,"articleLive":2,"columnArticles":116,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.8756739138,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":20479,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48457213384530995,"acs":7067,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.3711664096,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":14584,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47251358863662024,"acs":87888,"articleLive":2,"columnArticles":760,"formTitle":"[572]另一棵树的子树","frequency":2.2825068942,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":186001,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6622474747474747,"acs":1049,"articleLive":2,"columnArticles":33,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1584,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6487018095987411,"acs":13192,"articleLive":2,"columnArticles":118,"formTitle":"[574]当选者","frequency":0.3438572302,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":20336,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7136604251965806,"acs":83317,"articleLive":2,"columnArticles":817,"formTitle":"[575]分糖果","frequency":1.7187855935,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":116746,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46792956243329775,"acs":26307,"articleLive":2,"columnArticles":285,"formTitle":"[576]出界的路径数","frequency":2.0631698886,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":56220,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7018669262077508,"acs":15865,"articleLive":2,"columnArticles":88,"formTitle":"[577]员工奖金","frequency":1.2996010848,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":22604,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4907301768397034,"acs":10323,"articleLive":2,"columnArticles":115,"formTitle":"[578]查询回答率最高的问题","frequency":0.3176777246,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":21036,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40916030534351144,"acs":8040,"articleLive":2,"columnArticles":134,"formTitle":"[579]查询员工的累计薪水","frequency":0.9359331053,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":19650,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5225162603644308,"acs":10524,"articleLive":2,"columnArticles":83,"formTitle":"[580]统计各专业学生人数","frequency":0.9052181601,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":20141,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4053155484770058,"acs":101795,"articleLive":2,"columnArticles":883,"formTitle":"[581]最短无序连续子数组","frequency":2.7706176193,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":251150,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4117402932767684,"acs":8929,"articleLive":2,"columnArticles":137,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":21686,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6218545003250399,"acs":52612,"articleLive":2,"columnArticles":503,"formTitle":"[583]两个字符串的删除操作","frequency":3.2246904265,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":84605,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.775,"acs":14415,"articleLive":2,"columnArticles":64,"formTitle":"[584]寻找用户推荐人","frequency":0.3711664096,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":18600,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5886805090421969,"acs":8789,"articleLive":2,"columnArticles":105,"formTitle":"[585]2016年的投资","frequency":0.3176777246,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":14930,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7451622361219703,"acs":15249,"articleLive":2,"columnArticles":90,"formTitle":"[586]订单最多的客户","frequency":1.0012304478,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":20464,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38691523039043263,"acs":2200,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5686,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42352621570225485,"acs":1559,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":1.0723842081,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3681,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7455748389167305,"acs":90603,"articleLive":2,"columnArticles":579,"formTitle":"[589]N 叉树的前序遍历","frequency":1.7424845884,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":121521,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7619279223706374,"acs":64229,"articleLive":2,"columnArticles":479,"formTitle":"[590]N 叉树的后序遍历","frequency":0.3176777246,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":84298,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3410351201478743,"acs":1845,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.5643192472,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5410,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5237073831564687,"acs":4639,"articleLive":2,"columnArticles":113,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8858,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44161163159780886,"acs":8626,"articleLive":2,"columnArticles":138,"formTitle":"[593]有效的正方形","frequency":1.565710672,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19533,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5190169190885523,"acs":30431,"articleLive":2,"columnArticles":283,"formTitle":"[594]最长和谐子序列","frequency":0.8756739138,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":58632,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7969997817201954,"acs":105887,"articleLive":2,"columnArticles":246,"formTitle":"[595]大的国家","frequency":1.6795668033,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":132857,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4236466862974467,"acs":84021,"articleLive":2,"columnArticles":301,"formTitle":"[596]超过5名学生的课","frequency":2.0631698886,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":198328,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4419204322200393,"acs":10797,"articleLive":2,"columnArticles":86,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.3438572302,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":24432,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5218543970418948,"acs":29920,"articleLive":2,"columnArticles":289,"formTitle":"[599]两个列表的最小索引总和","frequency":0.3176777246,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":57334,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4814264119148514,"acs":19427,"articleLive":2,"columnArticles":232,"formTitle":"[600]不含连续1的非负整数","frequency":2.3396192092,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40353,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5028206788125404,"acs":32622,"articleLive":2,"columnArticles":385,"formTitle":"[601]体育馆的人流量","frequency":2.4356622582,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":64878,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.625932766900628,"acs":8472,"articleLive":2,"columnArticles":92,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":1.0012304478,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":13535,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6706758592924362,"acs":13327,"articleLive":2,"columnArticles":116,"formTitle":"[603]连续空余座位","frequency":1.5013798136,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":19871,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3738885595732069,"acs":2523,"articleLive":2,"columnArticles":58,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6748,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3332125557235222,"acs":112195,"articleLive":2,"columnArticles":1292,"formTitle":"[605]种花问题","frequency":2.317831855,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":336707,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5690481270974375,"acs":29335,"articleLive":2,"columnArticles":323,"formTitle":"[606]根据二叉树创建字符串","frequency":0.3711664096,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":51551,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.66237407830512,"acs":12756,"articleLive":2,"columnArticles":89,"formTitle":"[607]销售员","frequency":1.2675539073,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":19258,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6494870742716454,"acs":7914,"articleLive":2,"columnArticles":104,"formTitle":"[608]树节点","frequency":0.9359331053,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":12185,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4843195480553342,"acs":6687,"articleLive":2,"columnArticles":103,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13807,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6632882199429507,"acs":10929,"articleLive":2,"columnArticles":74,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":16477,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5325595991398381,"acs":51760,"articleLive":2,"columnArticles":406,"formTitle":"[611]有效三角形的个数","frequency":3.7783585233,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":97191,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6674180683197503,"acs":7698,"articleLive":2,"columnArticles":68,"formTitle":"[612]平面上的最近距离","frequency":0.9052181601,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":11534,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8154219793564056,"acs":12087,"articleLive":2,"columnArticles":84,"formTitle":"[613]直线上的最近距离","frequency":0.3438572302,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":14823,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3478972344951726,"acs":8504,"articleLive":2,"columnArticles":70,"formTitle":"[614]二级关注者","frequency":0.9359331053,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":24444,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.423038728897716,"acs":5538,"articleLive":2,"columnArticles":93,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13091,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4647868501937725,"acs":3478,"articleLive":2,"columnArticles":58,"formTitle":"[616]给字符串添加加粗标签","frequency":2.0200458196,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":7483,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.787571337983513,"acs":197478,"articleLive":2,"columnArticles":1305,"formTitle":"[617]合并二叉树","frequency":3.0656257318,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":250743,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6202662530696652,"acs":4799,"articleLive":2,"columnArticles":47,"formTitle":"[618]学生地理信息报告","frequency":0.3438572302,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":7737,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4648259020009453,"acs":11801,"articleLive":2,"columnArticles":81,"formTitle":"[619]只出现一次的最大数字","frequency":0.3438572302,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":25388,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7734645643798361,"acs":95560,"articleLive":2,"columnArticles":322,"formTitle":"[620]有趣的电影","frequency":1.8833144243,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":123548,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5715674223149709,"acs":79976,"articleLive":2,"columnArticles":512,"formTitle":"[621]任务调度器","frequency":2.8612593373,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":139924,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4378435285835158,"acs":67790,"articleLive":2,"columnArticles":435,"formTitle":"[622]设计循环队列","frequency":1.6795668033,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":154827,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5457822638788753,"acs":11355,"articleLive":2,"columnArticles":194,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20805,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4219958498396529,"acs":2237,"articleLive":2,"columnArticles":52,"formTitle":"[624]数组列表中的最大距离","frequency":0.8197934554,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5301,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34318488529014846,"acs":2543,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7410,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6837835062134128,"acs":46606,"articleLive":2,"columnArticles":367,"formTitle":"[626]换座位","frequency":1.5013798136,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":68159,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8085208676195935,"acs":87448,"articleLive":2,"columnArticles":351,"formTitle":"[627]变更性别","frequency":0.2451822226,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":108158,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5245408222202257,"acs":81735,"articleLive":2,"columnArticles":781,"formTitle":"[628]三个数的最大乘积","frequency":1.1504269151,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":155822,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4083341353094024,"acs":4243,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.967905138,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10391,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3697512101767421,"acs":6569,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17766,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2895974908520648,"acs":1108,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3826,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5980972052702407,"acs":19111,"articleLive":2,"columnArticles":241,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31953,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39674232575086327,"acs":95822,"articleLive":2,"columnArticles":782,"formTitle":"[633]平方数之和","frequency":1.6208058493,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":241522,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44045728802794537,"acs":1387,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3149,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5534944480731548,"acs":4237,"articleLive":2,"columnArticles":69,"formTitle":"[635]设计日志存储系统","frequency":0.5280307953,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":7655,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5540459431439952,"acs":10154,"articleLive":2,"columnArticles":114,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":18327,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900916630292449,"acs":77469,"articleLive":2,"columnArticles":673,"formTitle":"[637]二叉树的层平均值","frequency":1.2366872594,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":112259,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.6472965669572573,"acs":27547,"articleLive":2,"columnArticles":266,"formTitle":"[638]大礼包","frequency":0.8756739138,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":42557,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3766559521376414,"acs":20272,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":2.1917163117,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53821,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42555984555984555,"acs":11022,"articleLive":2,"columnArticles":215,"formTitle":"[640]求解方程","frequency":0.9359331053,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25900,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5325725841398238,"acs":22122,"articleLive":2,"columnArticles":249,"formTitle":"[641]设计循环双端队列","frequency":1.5013798136,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":41538,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4918410443463237,"acs":2562,"articleLive":2,"columnArticles":58,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5209,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4492781520692974,"acs":65352,"articleLive":2,"columnArticles":590,"formTitle":"[643]子数组最大平均数 I","frequency":1.6795668033,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":145460,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4037202893558388,"acs":1172,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.7677525773,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2903,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43183933050267764,"acs":70075,"articleLive":2,"columnArticles":709,"formTitle":"[645]错误的集合","frequency":1.7424845884,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":162271,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5782290697966672,"acs":23006,"articleLive":2,"columnArticles":211,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":39787,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6574148189312791,"acs":128946,"articleLive":2,"columnArticles":948,"formTitle":"[647]回文子串","frequency":3.0677702748,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":196141,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5863625501181594,"acs":22083,"articleLive":2,"columnArticles":290,"formTitle":"[648]单词替换","frequency":0.3438572302,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":37661,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48153609227038896,"acs":29392,"articleLive":2,"columnArticles":310,"formTitle":"[649]Dota2 参议院","frequency":0.9359331053,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":61038,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5672667385995798,"acs":49945,"articleLive":2,"columnArticles":662,"formTitle":"[650]只有两个键的键盘","frequency":2.2727791911,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":88045,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5841809625018977,"acs":3848,"articleLive":2,"columnArticles":66,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6587,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5708699575548946,"acs":34162,"articleLive":2,"columnArticles":245,"formTitle":"[652]寻找重复的子树","frequency":2.6980168064,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":59842,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5997352710025232,"acs":43497,"articleLive":2,"columnArticles":428,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":72527,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8110173620906317,"acs":63248,"articleLive":2,"columnArticles":642,"formTitle":"[654]最大二叉树","frequency":2.253621517,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":77986,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5989628349178912,"acs":9702,"articleLive":2,"columnArticles":144,"formTitle":"[655]输出二叉树","frequency":1.2675539073,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16198,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30935251798561153,"acs":860,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2780,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832784316686645,"acs":82986,"articleLive":2,"columnArticles":638,"formTitle":"[657]机器人能否返回原点","frequency":0.3176777246,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105947,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45504766560743093,"acs":27924,"articleLive":2,"columnArticles":245,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.5329530755,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":61365,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.541778517146206,"acs":28659,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.3438572302,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52898,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6580166821130676,"acs":710,"articleLive":2,"columnArticles":24,"formTitle":"[660]移除 9","frequency":1.0723842081,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1079,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.56133152443665,"acs":16964,"articleLive":2,"columnArticles":216,"formTitle":"[661]图片平滑器","frequency":0.3438572302,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":30221,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4096037105245208,"acs":30026,"articleLive":2,"columnArticles":285,"formTitle":"[662]二叉树最大宽度","frequency":2.4356622582,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":73305,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46502057613168724,"acs":1808,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3888,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6536222509702458,"acs":22231,"articleLive":2,"columnArticles":191,"formTitle":"[664]奇怪的打印机","frequency":2.7362263345,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34012,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27090461933276305,"acs":76005,"articleLive":2,"columnArticles":954,"formTitle":"[665]非递减数列","frequency":2.1917163117,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":280560,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6195932397593813,"acs":2163,"articleLive":2,"columnArticles":79,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3491,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6229271261220143,"acs":8189,"articleLive":2,"columnArticles":123,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13146,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5104715771477418,"acs":7166,"articleLive":2,"columnArticles":74,"formTitle":"[668]乘法表中第k小的数","frequency":1.2366872594,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14038,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6647011478163494,"acs":37989,"articleLive":2,"columnArticles":317,"formTitle":"[669]修剪二叉搜索树","frequency":0.8472224926,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":57152,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45275879466128516,"acs":19743,"articleLive":2,"columnArticles":294,"formTitle":"[670]最大交换","frequency":2.6552825653,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":43606,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48560450361897955,"acs":54344,"articleLive":2,"columnArticles":683,"formTitle":"[671]二叉树中第二小的节点","frequency":2.5702696346,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":111910,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5469949312092687,"acs":3777,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.3438572302,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6905,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43620652869639426,"acs":49068,"articleLive":2,"columnArticles":420,"formTitle":"[673]最长递增子序列的个数","frequency":3.2618758822,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":112488,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4992445984871059,"acs":95500,"articleLive":2,"columnArticles":788,"formTitle":"[674]最长连续递增序列","frequency":1.8219454779,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":191289,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4000538430475165,"acs":2972,"articleLive":2,"columnArticles":49,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.4607785683,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7429,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5917090340242471,"acs":7565,"articleLive":2,"columnArticles":138,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12785,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6190399743136941,"acs":15424,"articleLive":2,"columnArticles":260,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24916,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3862122856522683,"acs":44482,"articleLive":2,"columnArticles":483,"formTitle":"[678]有效的括号字符串","frequency":3.2246904265,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":115175,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.541399183706955,"acs":26397,"articleLive":2,"columnArticles":265,"formTitle":"[679]24 点游戏","frequency":3.1588574211,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48757,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015462106126274,"acs":89128,"articleLive":2,"columnArticles":844,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.2103888985,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":221962,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5062792877225867,"acs":2701,"articleLive":2,"columnArticles":65,"formTitle":"[681]最近时刻","frequency":0.3996908763,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5335,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6935109481496814,"acs":46907,"articleLive":2,"columnArticles":519,"formTitle":"[682]棒球比赛","frequency":1.1781910527,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":67637,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4356925418569254,"acs":2290,"articleLive":2,"columnArticles":53,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5256,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6659339707426938,"acs":61501,"articleLive":2,"columnArticles":622,"formTitle":"[684]冗余连接","frequency":0.9052181601,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":92353,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4302583493525423,"acs":20368,"articleLive":2,"columnArticles":256,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":47339,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35697108097730534,"acs":17664,"articleLive":2,"columnArticles":200,"formTitle":"[686]重复叠加字符串匹配","frequency":0.2925507746,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":49483,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4421168313242092,"acs":39023,"articleLive":2,"columnArticles":274,"formTitle":"[687]最长同值路径","frequency":2.180689626,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":88264,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5117639736088634,"acs":8222,"articleLive":2,"columnArticles":108,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.2675539073,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16066,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48905214635551714,"acs":3395,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.8833144243,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6942,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6477844598372722,"acs":56766,"articleLive":2,"columnArticles":578,"formTitle":"[690]员工的重要性","frequency":1.7756837601,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":87631,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48850348180265407,"acs":3718,"articleLive":2,"columnArticles":51,"formTitle":"[691]贴纸拼词","frequency":0.4607785683,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7611,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5765886731150177,"acs":69566,"articleLive":2,"columnArticles":755,"formTitle":"[692]前K个高频单词","frequency":2.9174223268,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":120651,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6088278321294688,"acs":26635,"articleLive":2,"columnArticles":294,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":43748,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5346658338538414,"acs":4280,"articleLive":2,"columnArticles":85,"formTitle":"[694]不同岛屿的数量","frequency":0.3711664096,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8005,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.66652123327516,"acs":137490,"articleLive":2,"columnArticles":1368,"formTitle":"[695]岛屿的最大面积","frequency":3.0640376737,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":206280,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6321824042246987,"acs":53152,"articleLive":2,"columnArticles":480,"formTitle":"[696]计数二进制子串","frequency":0.9052181601,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":84077,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6045647747972998,"acs":67704,"articleLive":2,"columnArticles":862,"formTitle":"[697]数组的度","frequency":0.8472224926,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":111988,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44714408725602756,"acs":31157,"articleLive":2,"columnArticles":225,"formTitle":"[698]划分为k个相等的子集","frequency":2.9613074258,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":69680,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4775716694772344,"acs":2832,"articleLive":2,"columnArticles":42,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5930,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7614120777640643,"acs":86986,"articleLive":2,"columnArticles":558,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.7677525773,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":114243,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7226404377890571,"acs":80156,"articleLive":2,"columnArticles":598,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.4130221531,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":110921,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7411609932576879,"acs":4507,"articleLive":2,"columnArticles":79,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6081,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.512953669720953,"acs":61636,"articleLive":2,"columnArticles":565,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.7104716115,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":120159,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5526750653607121,"acs":321742,"articleLive":2,"columnArticles":1581,"formTitle":"[704]二分查找","frequency":4.584111277,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":582154,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6442595519196802,"acs":69303,"articleLive":2,"columnArticles":445,"formTitle":"[705]设计哈希集合","frequency":2.5854522661,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":107570,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6431713381074821,"acs":60534,"articleLive":2,"columnArticles":403,"formTitle":"[706]设计哈希映射","frequency":1.1781910527,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":94118,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.32350039416726856,"acs":68530,"articleLive":2,"columnArticles":469,"formTitle":"[707]设计链表","frequency":2.8383024461,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":211839,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.34102818297691545,"acs":2408,"articleLive":2,"columnArticles":54,"formTitle":"[708]循环有序列表的插入","frequency":0.3438572302,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7061,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7578662837352705,"acs":71776,"articleLive":2,"columnArticles":523,"formTitle":"[709]转换成小写字母","frequency":0.8472224926,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":94708,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3549078161516489,"acs":5467,"articleLive":2,"columnArticles":66,"formTitle":"[710]黑名单中的随机数","frequency":0.967905138,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":15404,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5621165644171779,"acs":733,"articleLive":2,"columnArticles":26,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1304,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6742567451452139,"acs":15694,"articleLive":2,"columnArticles":177,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.3438572302,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":23276,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41880858290603873,"acs":25647,"articleLive":2,"columnArticles":235,"formTitle":"[713]乘积小于K的子数组","frequency":1.9992182418,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":61238,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7234397481076797,"acs":104082,"articleLive":2,"columnArticles":699,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.2410640594,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":143871,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40825756446564315,"acs":2739,"articleLive":2,"columnArticles":47,"formTitle":"[715]Range 模块","frequency":0.4295260248,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6709,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46148753034650186,"acs":4182,"articleLive":2,"columnArticles":77,"formTitle":"[716]最大栈","frequency":0.3438572302,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9062,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5112234516088007,"acs":32158,"articleLive":2,"columnArticles":394,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62904,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645420943500715,"acs":87670,"articleLive":2,"columnArticles":601,"formTitle":"[718]最长重复子数组","frequency":2.8236523159,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":155294,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.37343117205982596,"acs":9313,"articleLive":2,"columnArticles":88,"formTitle":"[719]找出第 k 小的距离对","frequency":2.0968885246,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24939,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4839806371721265,"acs":21496,"articleLive":2,"columnArticles":289,"formTitle":"[720]词典中最长的单词","frequency":0.9359331053,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":44415,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4698922155688623,"acs":29427,"articleLive":2,"columnArticles":341,"formTitle":"[721]账户合并","frequency":1.0012304478,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":62625,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32299660334633284,"acs":5135,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.9839016612,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15898,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7216386554621849,"acs":1374,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.6860251698,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1904,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4650564874481447,"acs":141812,"articleLive":2,"columnArticles":887,"formTitle":"[724]寻找数组的中心下标","frequency":1.5928273009,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":304935,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6088838465427729,"acs":49375,"articleLive":2,"columnArticles":626,"formTitle":"[725]分隔链表","frequency":2.3749086861,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":81091,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.552364483873393,"acs":22041,"articleLive":2,"columnArticles":400,"formTitle":"[726]原子的数量","frequency":2.8383024461,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39903,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40926901770031077,"acs":3029,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":1.6351347948,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":7401,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7596597812879708,"acs":34386,"articleLive":2,"columnArticles":318,"formTitle":"[728]自除数","frequency":0.3176777246,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":45265,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5157969893496758,"acs":8669,"articleLive":2,"columnArticles":101,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16807,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4929317762753534,"acs":4010,"articleLive":2,"columnArticles":50,"formTitle":"[730]统计不同回文子序列","frequency":1.6351347948,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8135,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.507190332326284,"acs":4197,"articleLive":2,"columnArticles":44,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8275,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6101076762764849,"acs":3513,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.9052181601,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5758,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5806758218347481,"acs":70868,"articleLive":2,"columnArticles":610,"formTitle":"[733]图像渲染","frequency":2.6709335616,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":122044,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48027946810908273,"acs":2131,"articleLive":2,"columnArticles":39,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4437,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4087420631268979,"acs":22209,"articleLive":2,"columnArticles":281,"formTitle":"[735]行星碰撞","frequency":2.4675675166,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":54335,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4667057788207686,"acs":1591,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3409,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4624007473143391,"acs":3960,"articleLive":2,"columnArticles":67,"formTitle":"[737]句子相似性 II","frequency":0.5280307953,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8564,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5013490485657484,"acs":42366,"articleLive":2,"columnArticles":602,"formTitle":"[738]单调递增的数字","frequency":1.0012304478,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":84504,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6809565588102637,"acs":220427,"articleLive":2,"columnArticles":1571,"formTitle":"[739]每日温度","frequency":3.6432443447,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":323702,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.628125790793439,"acs":54608,"articleLive":2,"columnArticles":619,"formTitle":"[740]删除并获得点数","frequency":2.5674929349,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":86938,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3692502716407099,"acs":4078,"articleLive":2,"columnArticles":47,"formTitle":"[741]摘樱桃","frequency":1.441481672,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11044,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4955233096634764,"acs":1605,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3239,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5225303673993544,"acs":59407,"articleLive":2,"columnArticles":537,"formTitle":"[743]网络延迟时间","frequency":2.6305288261,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":113691,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45905469879256194,"acs":42239,"articleLive":2,"columnArticles":375,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.8197934554,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":92013,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39731260703464627,"acs":3016,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7591,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5919030781686301,"acs":143295,"articleLive":2,"columnArticles":1363,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.426057651,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":242092,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41791112482081616,"acs":46063,"articleLive":2,"columnArticles":417,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.3176777246,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":110222,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6001594298039952,"acs":12799,"articleLive":2,"columnArticles":183,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":21326,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5052705551651441,"acs":1438,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2846,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7201268946069792,"acs":2043,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.5643192472,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2837,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5007012622720898,"acs":1428,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2852,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5302098274357875,"acs":71713,"articleLive":2,"columnArticles":602,"formTitle":"[752]打开转盘锁","frequency":2.030639139,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":135254,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5941977077363897,"acs":3318,"articleLive":2,"columnArticles":43,"formTitle":"[753]破解保险箱","frequency":0.5280307953,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5584,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43140974967061924,"acs":8186,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18975,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4979652238253792,"acs":1346,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2703,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5624775368395831,"acs":4695,"articleLive":2,"columnArticles":69,"formTitle":"[756]金字塔转换矩阵","frequency":0.4935683911,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8347,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.42019489247311825,"acs":2501,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.4935683911,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5952,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4633603768646951,"acs":3541,"articleLive":2,"columnArticles":69,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7642,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6647535449020932,"acs":1969,"articleLive":2,"columnArticles":47,"formTitle":"[759]员工空闲时间","frequency":0.4935683911,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2962,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8386161176714315,"acs":4048,"articleLive":2,"columnArticles":94,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4827,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5932062966031483,"acs":2148,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3621,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7003774166217361,"acs":18186,"articleLive":2,"columnArticles":149,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25966,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7629580183658374,"acs":84580,"articleLive":2,"columnArticles":1017,"formTitle":"[763]划分字母区间","frequency":2.7404585181,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":110858,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4947747329307942,"acs":4261,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.3996908763,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8612,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6649527546625172,"acs":29486,"articleLive":2,"columnArticles":447,"formTitle":"[765]情侣牵手","frequency":1.8833144243,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":44343,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7078219687324948,"acs":55598,"articleLive":2,"columnArticles":642,"formTitle":"[766]托普利茨矩阵","frequency":0.3711664096,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":78548,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47804103709800694,"acs":40655,"articleLive":2,"columnArticles":502,"formTitle":"[767]重构字符串","frequency":2.3396192092,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":85045,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5082968636032094,"acs":5575,"articleLive":2,"columnArticles":83,"formTitle":"[768]最多能完成排序的块 II","frequency":0.4295260248,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10968,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5872617178739628,"acs":13093,"articleLive":2,"columnArticles":157,"formTitle":"[769]最多能完成排序的块","frequency":0.3996908763,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":22295,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5556552962298025,"acs":1238,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2228,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8510676980034378,"acs":154479,"articleLive":2,"columnArticles":1142,"formTitle":"[771]宝石与石头","frequency":1.7424845884,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":181512,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49640621377231625,"acs":6423,"articleLive":2,"columnArticles":130,"formTitle":"[772]基本计算器 III","frequency":1.1104695421,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":12939,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7114981744179086,"acs":23774,"articleLive":2,"columnArticles":337,"formTitle":"[773]滑动谜题","frequency":2.030639139,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":33414,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5882655687081833,"acs":1143,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":1.0012304478,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1943,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45894960588079003,"acs":5182,"articleLive":2,"columnArticles":83,"formTitle":"[775]全局倒置与局部倒置","frequency":0.3996908763,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11291,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5648926237161531,"acs":1815,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3213,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.324278147958312,"acs":5694,"articleLive":2,"columnArticles":62,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":1.0012304478,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17559,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5938663093642995,"acs":23934,"articleLive":2,"columnArticles":351,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":40302,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4364357518976954,"acs":19146,"articleLive":2,"columnArticles":238,"formTitle":"[779]第K个语法符号","frequency":1.5013798136,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43869,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28583610471561355,"acs":3352,"articleLive":2,"columnArticles":52,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11727,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6157489638839551,"acs":43680,"articleLive":2,"columnArticles":667,"formTitle":"[781]森林中的兔子","frequency":2.8672177652,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70938,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42789400278940026,"acs":1534,"articleLive":2,"columnArticles":32,"formTitle":"[782]变为棋盘","frequency":0.6431001251,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3585,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5961344893212096,"acs":70478,"articleLive":2,"columnArticles":683,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.9052181601,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":118225,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6886058560912607,"acs":46118,"articleLive":2,"columnArticles":522,"formTitle":"[784]字母大小写全排列","frequency":1.8833144243,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":66973,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.513268544473395,"acs":41565,"articleLive":2,"columnArticles":414,"formTitle":"[785]判断二分图","frequency":2.2103888985,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":80981,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4775135135135135,"acs":4417,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.3711664096,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9250,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39059904672492235,"acs":43269,"articleLive":2,"columnArticles":411,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.7336311549,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":110776,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6084327504494198,"acs":18615,"articleLive":2,"columnArticles":192,"formTitle":"[788]旋转数字","frequency":0.9359331053,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30595,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6920797945881888,"acs":21024,"articleLive":2,"columnArticles":298,"formTitle":"[789]逃脱阻碍者","frequency":2.1917163117,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30378,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4490646833446022,"acs":3985,"articleLive":2,"columnArticles":69,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.3711664096,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8874,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6954097971770846,"acs":11726,"articleLive":2,"columnArticles":209,"formTitle":"[791]自定义字符串排序","frequency":1.5013798136,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16862,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4648731668648434,"acs":9383,"articleLive":2,"columnArticles":101,"formTitle":"[792]匹配子序列的单词数","frequency":0.3711664096,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":20184,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3916389978871114,"acs":5190,"articleLive":2,"columnArticles":70,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":13252,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3416701021483212,"acs":7459,"articleLive":2,"columnArticles":106,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21831,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5324909747292419,"acs":8260,"articleLive":2,"columnArticles":90,"formTitle":"[795]区间子数组个数","frequency":1.5329530755,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15512,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5337631047730677,"acs":24591,"articleLive":2,"columnArticles":300,"formTitle":"[796]旋转字符串","frequency":2.2410640594,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":46071,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7912780175414172,"acs":45470,"articleLive":2,"columnArticles":563,"formTitle":"[797]所有可能的路径","frequency":2.2410640594,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":57464,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46601941747572817,"acs":1440,"articleLive":2,"columnArticles":36,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3090,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40982992432756427,"acs":5470,"articleLive":2,"columnArticles":71,"formTitle":"[799]香槟塔","frequency":2.2410640594,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13347,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7103250478011472,"acs":1486,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2092,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4194900849858357,"acs":7404,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.565710672,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17650,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5764746665693591,"acs":31596,"articleLive":2,"columnArticles":335,"formTitle":"[802]找到最终的安全状态","frequency":2.3749086861,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54809,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4806032807276685,"acs":12364,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.4295260248,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25726,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7722274463144563,"acs":40240,"articleLive":2,"columnArticles":407,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.2366872594,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":52109,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29188439799509436,"acs":2737,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9377,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6562722821695108,"acs":13806,"articleLive":2,"columnArticles":156,"formTitle":"[806]写字符串需要的行数","frequency":0.3438572302,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21037,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8463926300505683,"acs":16905,"articleLive":2,"columnArticles":227,"formTitle":"[807]保持城市天际线","frequency":0.9052181601,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19973,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4816568047337278,"acs":4477,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.3996908763,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9295,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.42003853564547206,"acs":5014,"articleLive":2,"columnArticles":92,"formTitle":"[809]情感丰富的文字","frequency":0.3996908763,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11937,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7324636535336232,"acs":16676,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":2.2607598156,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22767,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7053345749634162,"acs":15906,"articleLive":2,"columnArticles":201,"formTitle":"[811]子域名访问计数","frequency":0.8472224926,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22551,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.630347328460536,"acs":11125,"articleLive":2,"columnArticles":102,"formTitle":"[812]最大三角形面积","frequency":0.3711664096,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17649,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.551213144963145,"acs":7179,"articleLive":2,"columnArticles":84,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13024,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998150689017479,"acs":23462,"articleLive":2,"columnArticles":368,"formTitle":"[814]二叉树剪枝","frequency":0.8472224926,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":33526,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4334576417676339,"acs":27082,"articleLive":2,"columnArticles":321,"formTitle":"[815]公交路线","frequency":3.4886623515,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":62479,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.512229406803486,"acs":3644,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.4295260248,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7114,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5913343392972623,"acs":13716,"articleLive":2,"columnArticles":169,"formTitle":"[817]链表组件","frequency":0.3438572302,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23195,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4335165477721904,"acs":3707,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8551,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42172583881918263,"acs":22486,"articleLive":2,"columnArticles":255,"formTitle":"[819]最常见的单词","frequency":0.3711664096,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":53319,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5083952079442445,"acs":55804,"articleLive":2,"columnArticles":613,"formTitle":"[820]单词的压缩编码","frequency":0.9052181601,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":109765,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6925904900927202,"acs":25621,"articleLive":2,"columnArticles":343,"formTitle":"[821]字符的最短距离","frequency":1.5013798136,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36993,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5029827850690302,"acs":2951,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5867,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42915782024062277,"acs":3032,"articleLive":2,"columnArticles":55,"formTitle":"[823]带因子的二叉树","frequency":1.0012304478,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7065,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.615497652413892,"acs":17173,"articleLive":2,"columnArticles":242,"formTitle":"[824]山羊拉丁文","frequency":0.3711664096,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27901,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3932358842075093,"acs":6860,"articleLive":2,"columnArticles":95,"formTitle":"[825]适龄的朋友","frequency":0.9052181601,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17445,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37587126350750805,"acs":8035,"articleLive":2,"columnArticles":119,"formTitle":"[826]安排工作以达到最大收益","frequency":0.967905138,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":21377,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3873844524982693,"acs":9513,"articleLive":2,"columnArticles":186,"formTitle":"[827]最大人工岛","frequency":0.9052181601,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":24557,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4938604372566637,"acs":3298,"articleLive":2,"columnArticles":54,"formTitle":"[828]统计子串中的唯一字符","frequency":0.4295260248,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6678,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3660535048547667,"acs":8935,"articleLive":2,"columnArticles":103,"formTitle":"[829]连续整数求和","frequency":0.9052181601,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":24409,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5430566088700043,"acs":52273,"articleLive":2,"columnArticles":585,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":96257,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4066691406457085,"acs":7671,"articleLive":2,"columnArticles":74,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18863,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958484834537672,"acs":86457,"articleLive":2,"columnArticles":926,"formTitle":"[832]翻转图像","frequency":1.7104716115,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":108635,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4328845369237046,"acs":5305,"articleLive":2,"columnArticles":81,"formTitle":"[833]字符串中的查找与替换","frequency":0.3438572302,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12255,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5275704404236196,"acs":13500,"articleLive":2,"columnArticles":133,"formTitle":"[834]树中距离之和","frequency":0.967905138,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25589,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5742366662298519,"acs":4382,"articleLive":2,"columnArticles":50,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7631,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47971204188481675,"acs":38116,"articleLive":2,"columnArticles":662,"formTitle":"[836]矩形重叠","frequency":1.2996010848,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":79456,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3967030961698331,"acs":19565,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":1.0360165639,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49319,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.500775507451615,"acs":7426,"articleLive":2,"columnArticles":129,"formTitle":"[838]推多米诺","frequency":2.3056048954,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14829,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5738817297104253,"acs":19283,"articleLive":2,"columnArticles":273,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33601,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3604123059910746,"acs":9126,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25321,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6581464437583736,"acs":56492,"articleLive":2,"columnArticles":557,"formTitle":"[841]钥匙和房间","frequency":1.5329530755,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":85835,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4877112790162201,"acs":28595,"articleLive":2,"columnArticles":322,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.2607598156,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58631,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.38270298862734725,"acs":2894,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7562,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5104606145509238,"acs":94010,"articleLive":2,"columnArticles":1024,"formTitle":"[844]比较含退格的字符串","frequency":1.1235724549,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":184167,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42132791896097016,"acs":38182,"articleLive":2,"columnArticles":562,"formTitle":"[845]数组中的最长山脉","frequency":1.7424845884,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":90623,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5120361370004003,"acs":8955,"articleLive":2,"columnArticles":126,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17489,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6794308357348703,"acs":18861,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":2.8818432544,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27760,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4499227351748117,"acs":9317,"articleLive":2,"columnArticles":100,"formTitle":"[848]字母移位","frequency":0.9052181601,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20708,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.426813880126183,"acs":16236,"articleLive":2,"columnArticles":191,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38040,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4491525423728814,"acs":2491,"articleLive":2,"columnArticles":43,"formTitle":"[850]矩形面积 II","frequency":2.1983954709,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5546,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4865332612222823,"acs":4498,"articleLive":2,"columnArticles":75,"formTitle":"[851]喧闹和富有","frequency":0.3996908763,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9245,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.715494582457875,"acs":86836,"articleLive":2,"columnArticles":753,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.7422066175,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":121365,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3863145170152753,"acs":10546,"articleLive":2,"columnArticles":128,"formTitle":"[853]车队","frequency":1.7424845884,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":27299,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3605436640351591,"acs":4430,"articleLive":2,"columnArticles":70,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12287,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40872284133728853,"acs":5098,"articleLive":2,"columnArticles":59,"formTitle":"[855]考场就座","frequency":0.3438572302,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":12473,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6275361771262327,"acs":16609,"articleLive":2,"columnArticles":221,"formTitle":"[856]括号的分数","frequency":2.6197295851,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26467,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4691358024691358,"acs":3116,"articleLive":2,"columnArticles":49,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4607785683,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6642,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5553047404063205,"acs":2952,"articleLive":2,"columnArticles":50,"formTitle":"[858]镜面反射","frequency":1.441481672,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5316,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3031279337714432,"acs":28414,"articleLive":2,"columnArticles":371,"formTitle":"[859]亲密字符串","frequency":0.4295260248,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":93736,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5871399457815645,"acs":92481,"articleLive":2,"columnArticles":791,"formTitle":"[860]柠檬水找零","frequency":1.5013798136,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":157511,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8088501902305748,"acs":31677,"articleLive":2,"columnArticles":443,"formTitle":"[861]翻转矩阵后的得分","frequency":0.3711664096,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39163,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1946382751454214,"acs":16764,"articleLive":2,"columnArticles":132,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3749086861,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":86129,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6039565814600154,"acs":36055,"articleLive":2,"columnArticles":565,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.5702696346,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":59698,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4585172109443954,"acs":3117,"articleLive":2,"columnArticles":45,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.3996908763,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6798,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6605225988700565,"acs":9353,"articleLive":2,"columnArticles":134,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14160,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2243623416797992,"acs":7688,"articleLive":2,"columnArticles":89,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":34266,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6699142356180033,"acs":84438,"articleLive":2,"columnArticles":759,"formTitle":"[867]转置矩阵","frequency":0.9359331053,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":126043,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6242826600652639,"acs":16644,"articleLive":2,"columnArticles":241,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26661,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6429723754705332,"acs":32283,"articleLive":2,"columnArticles":457,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.5870406124,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":50209,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.43156658839315665,"acs":15438,"articleLive":2,"columnArticles":198,"formTitle":"[870]优势洗牌","frequency":0.967905138,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":35772,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34370883882149045,"acs":9916,"articleLive":2,"columnArticles":133,"formTitle":"[871]最低加油次数","frequency":1.9491276429,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":28850,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521901430232186,"acs":61150,"articleLive":2,"columnArticles":731,"formTitle":"[872]叶子相似的树","frequency":0.8756739138,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93761,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5140902427105392,"acs":15780,"articleLive":2,"columnArticles":116,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.7756837601,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":30695,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.417526796347757,"acs":21035,"articleLive":2,"columnArticles":234,"formTitle":"[874]模拟行走机器人","frequency":2.0968885246,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":50380,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4804034582132565,"acs":46676,"articleLive":2,"columnArticles":376,"formTitle":"[875]爱吃香蕉的珂珂","frequency":1.9156274133,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":97160,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.706070996545032,"acs":162265,"articleLive":2,"columnArticles":1734,"formTitle":"[876]链表的中间结点","frequency":2.5394439769,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":229814,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7571635120925342,"acs":69126,"articleLive":2,"columnArticles":486,"formTitle":"[877]石子游戏","frequency":2.9496658507,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":91296,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2828843606081635,"acs":4484,"articleLive":2,"columnArticles":64,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15851,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5538096574241768,"acs":21711,"articleLive":2,"columnArticles":184,"formTitle":"[879]盈利计划","frequency":3.1695253269,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":39203,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25298200407298116,"acs":6087,"articleLive":2,"columnArticles":79,"formTitle":"[880]索引处的解码字符串","frequency":0.4295260248,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24061,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5379953536917949,"acs":47937,"articleLive":2,"columnArticles":588,"formTitle":"[881]救生艇","frequency":3.3531900672,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":89103,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48524844720496896,"acs":1875,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3864,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6904940119760479,"acs":11070,"articleLive":2,"columnArticles":115,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16032,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6624754681834814,"acs":19916,"articleLive":2,"columnArticles":258,"formTitle":"[884]两句话中的不常见单词","frequency":0.9052181601,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":30063,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6936441291443464,"acs":4791,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":1.2996010848,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6907,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4311848341232227,"acs":9098,"articleLive":2,"columnArticles":122,"formTitle":"[886]可能的二分法","frequency":0.8756739138,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":21100,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29117152435153526,"acs":52288,"articleLive":2,"columnArticles":346,"formTitle":"[887]鸡蛋掉落","frequency":3.0131792565,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":179578,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6406665505428787,"acs":55171,"articleLive":2,"columnArticles":463,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":86115,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6770607950447584,"acs":15959,"articleLive":2,"columnArticles":154,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.8521106446,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23571,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7276195114032952,"acs":8965,"articleLive":2,"columnArticles":127,"formTitle":"[890]查找和替换模式","frequency":0.3996908763,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12321,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3307059629883482,"acs":2895,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8754,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6381771804926334,"acs":33526,"articleLive":2,"columnArticles":686,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52534,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7250751252086811,"acs":10858,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.4607785683,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14975,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7751226551226551,"acs":13429,"articleLive":2,"columnArticles":124,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17325,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5500366300366301,"acs":7508,"articleLive":2,"columnArticles":85,"formTitle":"[895]最大频率栈","frequency":1.7756837601,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13650,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5853816801286149,"acs":60443,"articleLive":2,"columnArticles":723,"formTitle":"[896]单调数列","frequency":0.3176777246,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":103254,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7438738823974644,"acs":62899,"articleLive":2,"columnArticles":724,"formTitle":"[897]递增顺序搜索树","frequency":0.2684066756,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":84556,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3396797922977066,"acs":5495,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.4607785683,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16177,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5381727158948686,"acs":4300,"articleLive":2,"columnArticles":50,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7990,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4945132245357344,"acs":3515,"articleLive":2,"columnArticles":52,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7108,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5471535684532074,"acs":19703,"articleLive":2,"columnArticles":242,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":36010,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.33126092869632795,"acs":3410,"articleLive":2,"columnArticles":81,"formTitle":"[902]最大为 N 的数字组合","frequency":1.1504269151,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10294,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.532353468363506,"acs":2970,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.6860251698,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5579,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4525232670089859,"acs":22561,"articleLive":2,"columnArticles":308,"formTitle":"[904]水果成篮","frequency":2.030639139,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":49856,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.6998732542850713,"acs":59084,"articleLive":2,"columnArticles":615,"formTitle":"[905]按奇偶排序数组","frequency":1.2675539073,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":84421,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2793275217932752,"acs":2243,"articleLive":2,"columnArticles":41,"formTitle":"[906]超级回文数","frequency":0.4295260248,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8030,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3200475264635991,"acs":11852,"articleLive":2,"columnArticles":134,"formTitle":"[907]子数组的最小值之和","frequency":1.9839016612,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":37032,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6984845502853769,"acs":21294,"articleLive":2,"columnArticles":196,"formTitle":"[908]最小差值 I","frequency":0.3176777246,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":30486,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4595848801889976,"acs":16341,"articleLive":2,"columnArticles":197,"formTitle":"[909]蛇梯棋","frequency":2.0968885246,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35556,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3200189304306673,"acs":6762,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.3438572302,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21130,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4268182638512904,"acs":4730,"articleLive":2,"columnArticles":70,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":11082,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5587133678833335,"acs":241058,"articleLive":2,"columnArticles":1096,"formTitle":"[912]排序数组","frequency":3.8956590064,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":431452,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.3996717275338531,"acs":1948,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4874,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889251480290318,"acs":49460,"articleLive":2,"columnArticles":624,"formTitle":"[914]卡牌分组","frequency":1.2366872594,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":127171,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4700626426455592,"acs":9680,"articleLive":2,"columnArticles":118,"formTitle":"[915]分割数组","frequency":0.9359331053,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20593,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4439249169885478,"acs":6551,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14757,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5686824566027789,"acs":30205,"articleLive":2,"columnArticles":442,"formTitle":"[917]仅仅反转字母","frequency":1.565710672,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":53114,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35807219234810556,"acs":23173,"articleLive":2,"columnArticles":240,"formTitle":"[918]环形子数组的最大和","frequency":1.9992182418,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":64716,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6395335673044266,"acs":5649,"articleLive":2,"columnArticles":105,"formTitle":"[919]完全二叉树插入器","frequency":0.3438572302,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8833,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4829416224412434,"acs":1911,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3957,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7400082124281413,"acs":21626,"articleLive":2,"columnArticles":323,"formTitle":"[921]使括号有效的最少添加","frequency":0.2925507746,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":29224,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.714089082200077,"acs":90790,"articleLive":2,"columnArticles":837,"formTitle":"[922]按奇偶排序数组 II","frequency":1.565710672,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":127141,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.34095940959409593,"acs":6468,"articleLive":2,"columnArticles":87,"formTitle":"[923]三数之和的多种可能","frequency":0.3711664096,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18970,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3597381705219948,"acs":6485,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":18027,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38771255753794653,"acs":50959,"articleLive":2,"columnArticles":687,"formTitle":"[925]长按键入","frequency":0.8472224926,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":131435,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5267419402763334,"acs":7091,"articleLive":2,"columnArticles":129,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.2684066756,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13462,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33705593530374506,"acs":3501,"articleLive":2,"columnArticles":71,"formTitle":"[927]三等分","frequency":1.0723842081,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10387,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4212663836071626,"acs":2282,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5417,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6444959786845611,"acs":26124,"articleLive":2,"columnArticles":234,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40534,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449686635065059,"acs":34260,"articleLive":2,"columnArticles":346,"formTitle":"[930]和相同的二元子数组","frequency":2.7362263345,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62866,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6676402903168702,"acs":22629,"articleLive":2,"columnArticles":289,"formTitle":"[931]下降路径最小和","frequency":0.8756739138,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":33894,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6335618910140743,"acs":8778,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.3711664096,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13855,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.72518326948879,"acs":37294,"articleLive":2,"columnArticles":325,"formTitle":"[933]最近的请求次数","frequency":2.3056048954,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":51427,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4720868878661249,"acs":24515,"articleLive":2,"columnArticles":279,"formTitle":"[934]最短的桥","frequency":0.9052181601,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":51929,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4761832177425501,"acs":6248,"articleLive":2,"columnArticles":81,"formTitle":"[935]骑士拨号器","frequency":0.9052181601,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13121,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.380849532037437,"acs":1587,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4167,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5877989634349294,"acs":12362,"articleLive":2,"columnArticles":131,"formTitle":"[937]重新排列日志文件","frequency":1.565710672,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":21031,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.818893832591778,"acs":98282,"articleLive":2,"columnArticles":811,"formTitle":"[938]二叉搜索树的范围和","frequency":0.2925507746,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":120018,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45538412597423256,"acs":5726,"articleLive":2,"columnArticles":64,"formTitle":"[939]最小面积矩形","frequency":0.3438572302,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12574,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.42054455445544553,"acs":5097,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12120,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3926084124558459,"acs":62687,"articleLive":2,"columnArticles":624,"formTitle":"[941]有效的山脉数组","frequency":0.8756739138,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":159668,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7303947994292056,"acs":23033,"articleLive":2,"columnArticles":218,"formTitle":"[942]增减字符串匹配","frequency":0.3176777246,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31535,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4650485436893204,"acs":1916,"articleLive":2,"columnArticles":43,"formTitle":"[943]最短超级串","frequency":0.5280307953,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4120,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6885774486017111,"acs":21569,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":31324,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.484913618298321,"acs":35871,"articleLive":2,"columnArticles":542,"formTitle":"[945]使数组唯一的最小增量","frequency":0.3711664096,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73974,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6252375947583801,"acs":27960,"articleLive":2,"columnArticles":308,"formTitle":"[946]验证栈序列","frequency":2.1917163117,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":44719,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6121157113267705,"acs":26302,"articleLive":2,"columnArticles":341,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42969,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39202714164546226,"acs":6933,"articleLive":2,"columnArticles":102,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17685,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3716663761547847,"acs":8529,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.7756837601,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22948,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7753583882216195,"acs":10006,"articleLive":2,"columnArticles":154,"formTitle":"[950]按递增顺序显示卡牌","frequency":1.2675539073,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12905,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6646898075469504,"acs":11432,"articleLive":2,"columnArticles":174,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":17199,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3547664388932452,"acs":3167,"articleLive":2,"columnArticles":61,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8927,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5517241379310345,"acs":14560,"articleLive":2,"columnArticles":174,"formTitle":"[953]验证外星语词典","frequency":0.3438572302,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":26390,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3021555685520929,"acs":7233,"articleLive":2,"columnArticles":107,"formTitle":"[954]二倍数对数组","frequency":1.7756837601,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23938,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32959551461754105,"acs":3292,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.4295260248,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9988,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43836491377474984,"acs":4118,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9394,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.360740314057452,"acs":14404,"articleLive":2,"columnArticles":141,"formTitle":"[957]N 天后的牢房","frequency":2.1917163117,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39929,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5365078045434706,"acs":25813,"articleLive":2,"columnArticles":245,"formTitle":"[958]二叉树的完全性检验","frequency":1.5329530755,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":48113,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7429161969184517,"acs":19769,"articleLive":2,"columnArticles":306,"formTitle":"[959]由斜杠划分区域","frequency":1.0360165639,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26610,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.555979297194225,"acs":2041,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3671,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6771519274376417,"acs":37328,"articleLive":2,"columnArticles":314,"formTitle":"[961]重复 N 次的元素","frequency":0.3438572302,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":55125,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44461878382272885,"acs":13885,"articleLive":2,"columnArticles":139,"formTitle":"[962]最大宽度坡","frequency":0.9052181601,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":31229,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5061487409720866,"acs":2593,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.4295260248,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5123,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4343493552168816,"acs":1482,"articleLive":2,"columnArticles":28,"formTitle":"[964]表示数字的最少运算符","frequency":1.0012304478,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3412,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6842232911597074,"acs":33854,"articleLive":2,"columnArticles":406,"formTitle":"[965]单值二叉树","frequency":0.8756739138,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":49478,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40504854368932036,"acs":3129,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7725,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.46582893722956553,"acs":7859,"articleLive":2,"columnArticles":157,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16871,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49958337370409844,"acs":25781,"articleLive":2,"columnArticles":340,"formTitle":"[968]监控二叉树","frequency":1.2675539073,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":51605,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6502414262721308,"acs":15756,"articleLive":2,"columnArticles":200,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":24231,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41327188940092163,"acs":11210,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27125,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44166138237159164,"acs":6965,"articleLive":2,"columnArticles":111,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15770,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4101281650515786,"acs":1312,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.7268888735,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3199,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6416306212245507,"acs":68829,"articleLive":2,"columnArticles":641,"formTitle":"[973]最接近原点的 K 个点","frequency":1.3329152915,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":107272,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46642527978933507,"acs":38259,"articleLive":2,"columnArticles":391,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.3056048954,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":82026,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4476056338028169,"acs":3178,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.4607785683,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7100,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597345620494279,"acs":54190,"articleLive":2,"columnArticles":506,"formTitle":"[976]三角形的最大周长","frequency":0.9052181601,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90718,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7071355178387946,"acs":188569,"articleLive":2,"columnArticles":1443,"formTitle":"[977]有序数组的平方","frequency":2.7931614054,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":266666,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47327606776425674,"acs":43637,"articleLive":2,"columnArticles":603,"formTitle":"[978]最长湍流子数组","frequency":0.3176777246,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":92202,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7137319587628866,"acs":8654,"articleLive":2,"columnArticles":136,"formTitle":"[979]在二叉树中分配硬币","frequency":1.5329530755,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12125,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7349277030069545,"acs":14689,"articleLive":2,"columnArticles":219,"formTitle":"[980]不同路径 III","frequency":2.1917163117,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19987,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5320061104814469,"acs":21592,"articleLive":2,"columnArticles":316,"formTitle":"[981]基于时间的键值存储","frequency":2.4078388924,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40586,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5456070455022017,"acs":2602,"articleLive":2,"columnArticles":30,"formTitle":"[982]按位与为零的三元组","frequency":0.6026087637,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4769,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336147767451745,"acs":32794,"articleLive":2,"columnArticles":458,"formTitle":"[983]最低票价","frequency":1.7424845884,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51757,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4183969534862635,"acs":9229,"articleLive":2,"columnArticles":148,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.3438572302,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22058,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6010468904425491,"acs":16420,"articleLive":2,"columnArticles":188,"formTitle":"[985]查询后的偶数和","frequency":0.3438572302,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27319,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6804044699367089,"acs":27521,"articleLive":2,"columnArticles":267,"formTitle":"[986]区间列表的交集","frequency":1.737068924,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":40448,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5331703673524818,"acs":23556,"articleLive":2,"columnArticles":419,"formTitle":"[987]二叉树的垂序遍历","frequency":2.5702696346,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":44181,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49896017469065196,"acs":9597,"articleLive":2,"columnArticles":114,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.3176777246,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":19234,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4709827345503384,"acs":53303,"articleLive":2,"columnArticles":600,"formTitle":"[989]数组形式的整数加法","frequency":0.9359331053,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":113174,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5040932036535358,"acs":34052,"articleLive":2,"columnArticles":511,"formTitle":"[990]等式方程的可满足性","frequency":0.4295260248,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":67551,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5202180028129395,"acs":8877,"articleLive":2,"columnArticles":111,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17064,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4533234887639386,"acs":23945,"articleLive":2,"columnArticles":276,"formTitle":"[992]K 个不同整数的子数组","frequency":1.2996010848,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52821,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5568519395531063,"acs":51736,"articleLive":2,"columnArticles":817,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.6636782153,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":92908,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5098060011489681,"acs":57682,"articleLive":2,"columnArticles":1449,"formTitle":"[994]腐烂的橘子","frequency":2.030639139,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":113145,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5401742255946884,"acs":21641,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.3711664096,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40063,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49513041531400426,"acs":4423,"articleLive":2,"columnArticles":92,"formTitle":"[996]正方形数组的数目","frequency":0.4607785683,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8933,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.509650213548143,"acs":37708,"articleLive":2,"columnArticles":407,"formTitle":"[997]找到小镇的法官","frequency":0.8756739138,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":73988,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6154211150652432,"acs":7782,"articleLive":2,"columnArticles":117,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12645,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6909717529395865,"acs":30675,"articleLive":2,"columnArticles":573,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.3711664096,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44394,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.408893346706787,"acs":3669,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":1.403741344,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8973,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29340989882417284,"acs":2146,"articleLive":2,"columnArticles":56,"formTitle":"[1001]网格照明","frequency":0.7268888735,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7314,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7333350198588379,"acs":57976,"articleLive":2,"columnArticles":609,"formTitle":"[1002]查找共用字符","frequency":2.1917163117,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":79058,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5778327191304753,"acs":12387,"articleLive":2,"columnArticles":188,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21437,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5965763440860216,"acs":69352,"articleLive":2,"columnArticles":731,"formTitle":"[1004]最大连续1的个数 III","frequency":2.5005837207,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":116250,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5285774848730104,"acs":27430,"articleLive":2,"columnArticles":439,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.2069231575,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":51894,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6273036195203113,"acs":44489,"articleLive":2,"columnArticles":608,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70921,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4657484857225267,"acs":6459,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13868,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7222064949245763,"acs":17858,"articleLive":2,"columnArticles":230,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.9156274133,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24727,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5886771062141288,"acs":16616,"articleLive":2,"columnArticles":231,"formTitle":"[1009]十进制整数的反码","frequency":0.6225655226,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":28226,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45381973003048043,"acs":18760,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.3711664096,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":41338,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6260310800627304,"acs":61475,"articleLive":2,"columnArticles":593,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.7104716115,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":98198,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3365198711063373,"acs":3133,"articleLive":2,"columnArticles":67,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.0723842081,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9310,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39601594952093166,"acs":47573,"articleLive":2,"columnArticles":930,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.5329530755,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":120129,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.553035310967884,"acs":40157,"articleLive":2,"columnArticles":471,"formTitle":"[1014]最佳观光组合","frequency":0.7933228787,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":72612,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35588256304021715,"acs":4982,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.4295260248,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13999,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5827930996593781,"acs":5304,"articleLive":2,"columnArticles":82,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.3176777246,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9101,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.56015503875969,"acs":3613,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6450,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5161064589116185,"acs":44252,"articleLive":2,"columnArticles":378,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85742,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.600069593458215,"acs":20694,"articleLive":2,"columnArticles":270,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.4295260248,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":34486,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5416941331575478,"acs":9861,"articleLive":2,"columnArticles":146,"formTitle":"[1020]飞地的数量","frequency":1.0360165639,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":18204,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7826628288372716,"acs":58461,"articleLive":2,"columnArticles":665,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":74695,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7051755363611034,"acs":20247,"articleLive":2,"columnArticles":272,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.3176777246,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28712,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5644385856079405,"acs":7279,"articleLive":2,"columnArticles":165,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12896,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5563656666174032,"acs":33881,"articleLive":2,"columnArticles":389,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60897,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7097074629089791,"acs":76202,"articleLive":2,"columnArticles":653,"formTitle":"[1025]除数博弈","frequency":0.9052181601,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":107371,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6721452145214522,"acs":10183,"articleLive":2,"columnArticles":174,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15150,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4340407955773019,"acs":13661,"articleLive":2,"columnArticles":121,"formTitle":"[1027]最长等差数列","frequency":0.967905138,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":31474,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319760393639022,"acs":20529,"articleLive":2,"columnArticles":429,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.565710672,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28046,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6572436807180392,"acs":17135,"articleLive":2,"columnArticles":186,"formTitle":"[1029]两地调度","frequency":0.3176777246,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26071,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7101199191243115,"acs":40741,"articleLive":2,"columnArticles":445,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.3711664096,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57372,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.568908614999431,"acs":4999,"articleLive":2,"columnArticles":76,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8787,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.40006075334143376,"acs":2634,"articleLive":2,"columnArticles":44,"formTitle":"[1032]字符流","frequency":0.3711664096,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6584,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39126141693409033,"acs":11095,"articleLive":2,"columnArticles":169,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28357,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4359670473694065,"acs":4657,"articleLive":2,"columnArticles":99,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10682,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6354351842169472,"acs":36460,"articleLive":2,"columnArticles":393,"formTitle":"[1035]不相交的线","frequency":2.7362263345,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":57378,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29998193967852627,"acs":3322,"articleLive":2,"columnArticles":56,"formTitle":"[1036]逃离大迷宫","frequency":0.4295260248,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11074,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43962255752882007,"acs":9877,"articleLive":2,"columnArticles":116,"formTitle":"[1037]有效的回旋镖","frequency":0.9359331053,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22467,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7937723016865412,"acs":26027,"articleLive":2,"columnArticles":334,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.2684066756,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32789,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.556090515166105,"acs":4620,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8308,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5215283165244375,"acs":2689,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5156,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48416751787538304,"acs":7110,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":1.2996010848,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14685,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5316662136450122,"acs":11736,"articleLive":2,"columnArticles":156,"formTitle":"[1042]不邻接植花","frequency":0.9359331053,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22074,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6898030634573304,"acs":7881,"articleLive":2,"columnArticles":103,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.2996010848,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11425,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20876441286097466,"acs":5993,"articleLive":2,"columnArticles":74,"formTitle":"[1044]最长重复子串","frequency":2.901695023,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":28707,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6427637314734089,"acs":8847,"articleLive":2,"columnArticles":108,"formTitle":"[1045]买下所有产品的客户","frequency":0.3711664096,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":13764,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595751002822761,"acs":66594,"articleLive":2,"columnArticles":929,"formTitle":"[1046]最后一块石头的重量","frequency":1.2675539073,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":100965,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7244339017992243,"acs":109638,"articleLive":2,"columnArticles":1003,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.7706176193,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":151343,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4578619153674833,"acs":10279,"articleLive":2,"columnArticles":143,"formTitle":"[1048]最长字符串链","frequency":2.5005837207,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":22450,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6464097210138623,"acs":44579,"articleLive":2,"columnArticles":418,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.806284738,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":68964,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7587291399229782,"acs":11821,"articleLive":2,"columnArticles":56,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.2675539073,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":15580,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7537732915540459,"acs":31513,"articleLive":2,"columnArticles":376,"formTitle":"[1051]高度检查器","frequency":0.9052181601,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41807,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5815899581589958,"acs":48789,"articleLive":2,"columnArticles":756,"formTitle":"[1052]爱生气的书店老板","frequency":0.2451822226,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":83889,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4584348355663825,"acs":6022,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13136,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.377471734983483,"acs":8113,"articleLive":2,"columnArticles":110,"formTitle":"[1054]距离相等的条形码","frequency":0.3176777246,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21493,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5892470531633389,"acs":4899,"articleLive":2,"columnArticles":89,"formTitle":"[1055]形成字符串的最短路径","frequency":0.8756739138,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":8314,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4118562874251497,"acs":3439,"articleLive":2,"columnArticles":68,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8350,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.467610726122326,"acs":3104,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6638,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3434266969467575,"acs":1361,"articleLive":2,"columnArticles":33,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3963,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36296875,"acs":2323,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6400,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5280594996619338,"acs":4686,"articleLive":2,"columnArticles":70,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":8874,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.606928999144568,"acs":2838,"articleLive":2,"columnArticles":62,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4676,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5436447166921899,"acs":3550,"articleLive":2,"columnArticles":50,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6530,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7092544023979018,"acs":1893,"articleLive":2,"columnArticles":41,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2669,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6492209348781462,"acs":4875,"articleLive":2,"columnArticles":69,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7509,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.541684759009987,"acs":2495,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4606,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47621215570225356,"acs":2092,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4393,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4218436873747495,"acs":842,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1996,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8644683972192104,"acs":13554,"articleLive":2,"columnArticles":66,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":15679,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8190822288727376,"acs":11495,"articleLive":2,"columnArticles":57,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14034,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48072830456372667,"acs":8132,"articleLive":2,"columnArticles":72,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":16916,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866821291114136,"acs":34907,"articleLive":2,"columnArticles":674,"formTitle":"[1071]字符串的最大公因子","frequency":0.9052181601,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59499,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5816589386913962,"acs":3387,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5823,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3343767011431682,"acs":2457,"articleLive":2,"columnArticles":55,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7348,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6687735679655235,"acs":18622,"articleLive":2,"columnArticles":189,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.3749086861,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27845,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6940261923103859,"acs":9910,"articleLive":2,"columnArticles":74,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":14279,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49611568700861103,"acs":10601,"articleLive":2,"columnArticles":90,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":21368,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7218052080437402,"acs":7789,"articleLive":2,"columnArticles":88,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":10791,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6211964396605257,"acs":12004,"articleLive":2,"columnArticles":191,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19324,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7349657447348389,"acs":11586,"articleLive":2,"columnArticles":192,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15764,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4924680031713671,"acs":4348,"articleLive":2,"columnArticles":98,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8829,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5715146948003015,"acs":15168,"articleLive":2,"columnArticles":156,"formTitle":"[1081]不同字符的最小子序列","frequency":1.7424845884,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26540,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7610664953421137,"acs":11846,"articleLive":2,"columnArticles":96,"formTitle":"[1082]销售分析 I ","frequency":0.9052181601,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":15565,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5283891163014688,"acs":10972,"articleLive":2,"columnArticles":101,"formTitle":"[1083]销售分析 II","frequency":1.2675539073,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":20765,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5368995302318533,"acs":10629,"articleLive":2,"columnArticles":101,"formTitle":"[1084]销售分析III","frequency":0.3438572302,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":19797,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7729377104377104,"acs":3673,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4752,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6888241525423728,"acs":5202,"articleLive":2,"columnArticles":82,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7552,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5347901092581944,"acs":1860,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3478,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45450716090985677,"acs":1079,"articleLive":2,"columnArticles":35,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2374,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5853875062882845,"acs":19782,"articleLive":2,"columnArticles":295,"formTitle":"[1089]复写零","frequency":0.4295260248,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33793,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5457650273224044,"acs":3995,"articleLive":2,"columnArticles":83,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7320,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37930192510345184,"acs":29515,"articleLive":2,"columnArticles":299,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.4047973425,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":77814,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4890299184043518,"acs":2697,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":1.1104695421,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5515,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.37607264019157854,"acs":3769,"articleLive":2,"columnArticles":61,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10022,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6051779935275081,"acs":28050,"articleLive":2,"columnArticles":393,"formTitle":"[1094]拼车","frequency":1.8833144243,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":46350,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3728643402926249,"acs":20056,"articleLive":2,"columnArticles":389,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53789,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5468549422336328,"acs":1704,"articleLive":2,"columnArticles":48,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3116,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5227438579421065,"acs":6447,"articleLive":2,"columnArticles":116,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9156274133,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":12333,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4747550396305311,"acs":7607,"articleLive":2,"columnArticles":105,"formTitle":"[1098]小众书籍","frequency":0.3176777246,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":16023,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5815305885089556,"acs":5000,"articleLive":2,"columnArticles":94,"formTitle":"[1099]小于 K 的两数之和","frequency":0.3996908763,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":8598,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7012365376944555,"acs":5274,"articleLive":2,"columnArticles":104,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":1.0012304478,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":7521,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6687619568188029,"acs":2447,"articleLive":2,"columnArticles":57,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3659,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3695622620989668,"acs":5437,"articleLive":2,"columnArticles":69,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":14712,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6369174103980734,"acs":35968,"articleLive":2,"columnArticles":1108,"formTitle":"[1103]分糖果 II","frequency":0.8756739138,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56472,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.760827083553396,"acs":28811,"articleLive":2,"columnArticles":676,"formTitle":"[1104]二叉树寻路","frequency":2.2410640594,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37868,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5591156680551106,"acs":5235,"articleLive":2,"columnArticles":69,"formTitle":"[1105]填充书架","frequency":0.9052181601,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9363,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.578392094017094,"acs":4331,"articleLive":2,"columnArticles":128,"formTitle":"[1106]解析布尔表达式","frequency":0.4295260248,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7488,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41164575031225836,"acs":6921,"articleLive":2,"columnArticles":95,"formTitle":"[1107]每日新用户统计","frequency":0.3996908763,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":16813,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395835915231131,"acs":67746,"articleLive":2,"columnArticles":694,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80690,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5781606528212863,"acs":59798,"articleLive":2,"columnArticles":597,"formTitle":"[1109]航班预订统计","frequency":2.3123100298,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":103428,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.629945945945946,"acs":11654,"articleLive":2,"columnArticles":212,"formTitle":"[1110]删点成林","frequency":0.9359331053,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":18500,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713968606310448,"acs":24326,"articleLive":2,"columnArticles":403,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.2996010848,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31535,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6470830926644112,"acs":7842,"articleLive":2,"columnArticles":92,"formTitle":"[1112]每位学生的最高成绩","frequency":0.3996908763,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12119,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5401907356948229,"acs":7137,"articleLive":2,"columnArticles":51,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":13212,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6537819294039845,"acs":79088,"articleLive":2,"columnArticles":586,"formTitle":"[1114]按序打印","frequency":3.2181635846,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":120970,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.561562631183931,"acs":44145,"articleLive":2,"columnArticles":482,"formTitle":"[1115]交替打印FooBar","frequency":1.441481672,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":78611,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5201851893270113,"acs":23258,"articleLive":2,"columnArticles":373,"formTitle":"[1116]打印零与奇偶数","frequency":2.5854522661,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":44711,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5221152997263176,"acs":17742,"articleLive":2,"columnArticles":253,"formTitle":"[1117]H2O 生成","frequency":2.1274345769,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33981,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6429139072847682,"acs":2427,"articleLive":2,"columnArticles":39,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3775,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662407254740313,"acs":8406,"articleLive":2,"columnArticles":148,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9704,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.61051915665382,"acs":2693,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.5643192472,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4411,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5763673890608875,"acs":1117,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1938,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069562514070088,"acs":65947,"articleLive":2,"columnArticles":880,"formTitle":"[1122]数组的相对排序","frequency":2.1917163117,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":93283,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7026044309149332,"acs":8309,"articleLive":2,"columnArticles":108,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.3711664096,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11826,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31932302447339583,"acs":13113,"articleLive":2,"columnArticles":137,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3996908763,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":41065,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4930500079884966,"acs":3086,"articleLive":2,"columnArticles":51,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6259,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6934122547407651,"acs":6326,"articleLive":2,"columnArticles":95,"formTitle":"[1126]查询活跃业务","frequency":0.9359331053,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9123,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4201357236908741,"acs":4148,"articleLive":2,"columnArticles":75,"formTitle":"[1127]用户购买平台","frequency":0.8756739138,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":9873,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5450098986840572,"acs":37440,"articleLive":2,"columnArticles":484,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.9052181601,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68696,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3806163681321995,"acs":6311,"articleLive":2,"columnArticles":116,"formTitle":"[1129]颜色交替的最短路径","frequency":1.0012304478,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16581,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6298491939677587,"acs":6056,"articleLive":2,"columnArticles":109,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.3438572302,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9615,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45582884587396305,"acs":3132,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6871,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39060618225612204,"acs":4865,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.3438572302,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":12455,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6491379310344828,"acs":3012,"articleLive":2,"columnArticles":64,"formTitle":"[1133]最大唯一数","frequency":0.5280307953,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4640,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.777401403338979,"acs":3213,"articleLive":2,"columnArticles":54,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4133,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5365113226124056,"acs":6539,"articleLive":2,"columnArticles":74,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4607785683,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":12188,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5693473193473193,"acs":2931,"articleLive":2,"columnArticles":50,"formTitle":"[1136]平行课程","frequency":0.4607785683,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5148,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6088740148979812,"acs":84600,"articleLive":2,"columnArticles":899,"formTitle":"[1137]第 N 个泰波那契数","frequency":1.8598115798,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":138945,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43363263033340294,"acs":6230,"articleLive":2,"columnArticles":141,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14367,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4802305186670007,"acs":9583,"articleLive":2,"columnArticles":156,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.9052181601,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19955,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6525223950966526,"acs":6920,"articleLive":2,"columnArticles":98,"formTitle":"[1140]石子游戏 II","frequency":1.0360165639,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10605,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5097104256692991,"acs":10262,"articleLive":2,"columnArticles":68,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.3438572302,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":20133,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37121054817275745,"acs":7151,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":19264,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.637644391267098,"acs":172669,"articleLive":2,"columnArticles":1147,"formTitle":"[1143]最长公共子序列","frequency":2.9717743415,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":270792,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44260692118017175,"acs":10411,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.8756739138,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23522,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4689534476723836,"acs":6699,"articleLive":2,"columnArticles":108,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14285,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28843085106382976,"acs":4338,"articleLive":2,"columnArticles":65,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15040,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5621506521160501,"acs":4224,"articleLive":2,"columnArticles":85,"formTitle":"[1147]段式回文","frequency":2.0968885246,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7514,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.714133238459486,"acs":8029,"articleLive":2,"columnArticles":37,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11243,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44336311423101465,"acs":5558,"articleLive":2,"columnArticles":48,"formTitle":"[1149]文章浏览 II","frequency":0.3711664096,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":12536,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6047896761384787,"acs":4874,"articleLive":2,"columnArticles":86,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.8756739138,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8059,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48795113825652414,"acs":4394,"articleLive":2,"columnArticles":64,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.967905138,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9005,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3918845315904139,"acs":1439,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.4935683911,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3672,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3703544575725027,"acs":1724,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4655,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5706184586108468,"acs":14993,"articleLive":2,"columnArticles":230,"formTitle":"[1154]一年中的第几天","frequency":1.6208058493,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":26275,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4781678082191781,"acs":10053,"articleLive":2,"columnArticles":129,"formTitle":"[1155]掷骰子的N种方法","frequency":1.2675539073,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":21024,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4300675675675676,"acs":5092,"articleLive":2,"columnArticles":91,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.3711664096,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11840,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3208777559258876,"acs":3100,"articleLive":2,"columnArticles":47,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9661,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5522796055843014,"acs":5657,"articleLive":2,"columnArticles":62,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":10243,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48896646303453434,"acs":3922,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.9359331053,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8021,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871546092149975,"acs":60058,"articleLive":2,"columnArticles":913,"formTitle":"[1160]拼写单词","frequency":0.8756739138,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":87401,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6333058920381042,"acs":10770,"articleLive":2,"columnArticles":181,"formTitle":"[1161]最大层内元素和","frequency":0.8756739138,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17006,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.47017560834018673,"acs":38876,"articleLive":2,"columnArticles":498,"formTitle":"[1162]地图分析","frequency":0.9052181601,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":82684,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2674279113164793,"acs":6019,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22507,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6083850931677018,"acs":5877,"articleLive":2,"columnArticles":87,"formTitle":"[1164]指定日期的产品价格","frequency":0.967905138,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":9660,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837640388180133,"acs":7682,"articleLive":2,"columnArticles":114,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9171,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48204060385216035,"acs":2778,"articleLive":2,"columnArticles":50,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5763,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.43834367019336007,"acs":2403,"articleLive":2,"columnArticles":36,"formTitle":"[1167]连接棒材的最低费用","frequency":0.5280307953,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5482,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5687103594080338,"acs":1614,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.7677525773,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2838,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3220857452115394,"acs":6844,"articleLive":2,"columnArticles":82,"formTitle":"[1169]查询无效交易","frequency":0.4295260248,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21249,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171428571428571,"acs":13824,"articleLive":2,"columnArticles":218,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.9052181601,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22400,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4749704375246354,"acs":13255,"articleLive":2,"columnArticles":159,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":1.4709128722,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27907,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2672985781990521,"acs":2538,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9495,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7574302283436027,"acs":8359,"articleLive":2,"columnArticles":79,"formTitle":"[1173]即时食物配送 I","frequency":0.3711664096,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11036,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6193174818282616,"acs":5027,"articleLive":2,"columnArticles":64,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8117,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.49225802200698426,"acs":7471,"articleLive":2,"columnArticles":119,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":15177,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.45188844293506225,"acs":4391,"articleLive":2,"columnArticles":64,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9717,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26683494481047315,"acs":6237,"articleLive":2,"columnArticles":96,"formTitle":"[1177]构建回文串检测","frequency":0.9052181601,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23374,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46193673049768375,"acs":18647,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40367,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6369223304896292,"acs":31506,"articleLive":2,"columnArticles":189,"formTitle":"[1179]重新格式化部门表","frequency":2.4078388924,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":49466,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7767156862745098,"acs":3169,"articleLive":2,"columnArticles":71,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4080,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37413280475718536,"acs":1510,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4036,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.4053654024051804,"acs":2191,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":5405,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6001829826166514,"acs":656,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1093,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5844707700231779,"acs":13617,"articleLive":2,"columnArticles":269,"formTitle":"[1184]公交站间的距离","frequency":0.8756739138,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":23298,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6025041562759768,"acs":11597,"articleLive":2,"columnArticles":212,"formTitle":"[1185]一周中的第几天","frequency":0.3711664096,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":19248,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39494446174608117,"acs":7609,"articleLive":2,"columnArticles":111,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.3996908763,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19266,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4421274601686973,"acs":1887,"articleLive":2,"columnArticles":33,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4268,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6986970684039088,"acs":3432,"articleLive":2,"columnArticles":67,"formTitle":"[1188]设计有限阻塞队列","frequency":0.967905138,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4912,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6458573246863446,"acs":21312,"articleLive":2,"columnArticles":334,"formTitle":"[1189]“气球” 的最大数量","frequency":0.9052181601,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32998,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6507123965531951,"acs":45762,"articleLive":2,"columnArticles":620,"formTitle":"[1190]反转每对括号间的子串","frequency":3.6402659803,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":70326,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.266827661909989,"acs":6077,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22775,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4997165211475224,"acs":4407,"articleLive":2,"columnArticles":53,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8819,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6058478306434709,"acs":5781,"articleLive":2,"columnArticles":74,"formTitle":"[1193]每月交易 I","frequency":0.3996908763,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":9542,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5076410113920533,"acs":3654,"articleLive":2,"columnArticles":65,"formTitle":"[1194]锦标赛优胜者","frequency":0.3996908763,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7198,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6369669521546119,"acs":14205,"articleLive":2,"columnArticles":269,"formTitle":"[1195]交替打印字符串","frequency":1.565710672,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":22301,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6939782823297137,"acs":3515,"articleLive":2,"columnArticles":60,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.4935683911,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5065,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.370977398593025,"acs":4957,"articleLive":2,"columnArticles":62,"formTitle":"[1197]进击的骑士","frequency":0.5643192472,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13362,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7443836133660563,"acs":3943,"articleLive":2,"columnArticles":59,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5297,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43990665110851807,"acs":754,"articleLive":2,"columnArticles":19,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1714,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6833513876956409,"acs":18294,"articleLive":2,"columnArticles":257,"formTitle":"[1200]最小绝对差","frequency":0.9052181601,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26771,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24771932644777558,"acs":6164,"articleLive":2,"columnArticles":88,"formTitle":"[1201]丑数 III","frequency":1.5329530755,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24883,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5026093416287492,"acs":27063,"articleLive":2,"columnArticles":298,"formTitle":"[1202]交换字符串中的元素","frequency":0.3711664096,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53845,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6212167532864568,"acs":12192,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.5643192472,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19626,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7278225806451613,"acs":5776,"articleLive":2,"columnArticles":84,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7936,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4692386131883073,"acs":5522,"articleLive":2,"columnArticles":84,"formTitle":"[1205]每月交易II","frequency":0.4295260248,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":11768,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6067168598257339,"acs":7172,"articleLive":2,"columnArticles":92,"formTitle":"[1206]设计跳表","frequency":0.3711664096,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11821,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304852958973739,"acs":60360,"articleLive":2,"columnArticles":838,"formTitle":"[1207]独一无二的出现次数","frequency":0.8756739138,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82630,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4972842300174879,"acs":48341,"articleLive":2,"columnArticles":617,"formTitle":"[1208]尽可能使字符串相等","frequency":0.4295260248,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":97210,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5279385057228534,"acs":12500,"articleLive":2,"columnArticles":160,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.3438572302,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23677,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45052737317930686,"acs":2691,"articleLive":2,"columnArticles":56,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.9359331053,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5973,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6566933195769925,"acs":7638,"articleLive":2,"columnArticles":64,"formTitle":"[1211]查询结果的质量和占比","frequency":0.3711664096,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":11631,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5119531792480905,"acs":5161,"articleLive":2,"columnArticles":100,"formTitle":"[1212]查询球队积分","frequency":0.3996908763,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10081,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7744544287548139,"acs":6033,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.9359331053,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7790,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6363302077587792,"acs":3461,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4935683911,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5439,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4118136439267887,"acs":1980,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4808,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5367857142857143,"acs":1503,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2800,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6942523700760301,"acs":22189,"articleLive":2,"columnArticles":361,"formTitle":"[1217]玩筹码","frequency":1.2069231575,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31961,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5135099200780016,"acs":34760,"articleLive":2,"columnArticles":344,"formTitle":"[1218]最长定差子序列","frequency":1.2651386806,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":67691,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6305504399427051,"acs":12326,"articleLive":2,"columnArticles":175,"formTitle":"[1219]黄金矿工","frequency":1.2675539073,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19548,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.527530847817434,"acs":3976,"articleLive":2,"columnArticles":78,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7537,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843963963963964,"acs":77286,"articleLive":2,"columnArticles":1118,"formTitle":"[1221]分割平衡字符串","frequency":2.4078388924,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":91575,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6731718259309107,"acs":6002,"articleLive":2,"columnArticles":133,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.3176777246,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8916,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47602549889135254,"acs":3435,"articleLive":2,"columnArticles":59,"formTitle":"[1223]掷骰子模拟","frequency":0.6860251698,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7216,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32841455044612217,"acs":4785,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.1104695421,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14570,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5369127516778524,"acs":3440,"articleLive":2,"columnArticles":81,"formTitle":"[1225]报告系统状态的连续日期","frequency":1.0012304478,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6407,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5967385431504494,"acs":12149,"articleLive":2,"columnArticles":138,"formTitle":"[1226]哲学家进餐","frequency":2.3396192092,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":20359,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6634951456310679,"acs":10251,"articleLive":2,"columnArticles":160,"formTitle":"[1227]飞机座位分配概率","frequency":0.3711664096,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15450,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5404798895218367,"acs":3131,"articleLive":2,"columnArticles":54,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5793,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4236453201970443,"acs":2580,"articleLive":2,"columnArticles":48,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":6090,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49709302325581395,"acs":3249,"articleLive":2,"columnArticles":66,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":6536,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5664323374340949,"acs":3223,"articleLive":2,"columnArticles":43,"formTitle":"[1231]分享巧克力","frequency":1.0360165639,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":5690,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4694341807753819,"acs":34049,"articleLive":2,"columnArticles":424,"formTitle":"[1232]缀点成线","frequency":0.3438572302,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72532,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4838237017934591,"acs":8255,"articleLive":2,"columnArticles":119,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17062,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34554167379770667,"acs":6057,"articleLive":2,"columnArticles":93,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.3675928299,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17529,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.464866760168303,"acs":6629,"articleLive":2,"columnArticles":116,"formTitle":"[1235]规划兼职工作","frequency":1.7424845884,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":14260,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5645236977944627,"acs":1203,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2131,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7107237116266149,"acs":10233,"articleLive":2,"columnArticles":135,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14398,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6600331674958541,"acs":3184,"articleLive":2,"columnArticles":74,"formTitle":"[1238]循环码排列","frequency":0.4607785683,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4824,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4912430645070896,"acs":35061,"articleLive":2,"columnArticles":386,"formTitle":"[1239]串联字符串的最大长度","frequency":1.6795668033,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":71372,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49522353840275124,"acs":2592,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":1.2366872594,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5234,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5945135797983468,"acs":6545,"articleLive":2,"columnArticles":67,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11009,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.46693026599568654,"acs":1299,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":1.0723842081,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2782,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393466200945141,"acs":2625,"articleLive":2,"columnArticles":58,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4867,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6215624239474324,"acs":2554,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4109,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5108603667136813,"acs":3622,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.4935683911,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7090,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4816140579238529,"acs":2960,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.8756739138,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6146,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6188902657304144,"acs":8990,"articleLive":2,"columnArticles":158,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.3711664096,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14526,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5600877331397734,"acs":35495,"articleLive":2,"columnArticles":488,"formTitle":"[1248]统计「优美子数组」","frequency":0.8756739138,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":63374,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.575496704846672,"acs":23665,"articleLive":2,"columnArticles":331,"formTitle":"[1249]移除无效的括号","frequency":1.5013798136,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":41121,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5617271437259275,"acs":2771,"articleLive":2,"columnArticles":40,"formTitle":"[1250]检查「好数组」","frequency":0.4607785683,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4933,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7724202626641651,"acs":8234,"articleLive":2,"columnArticles":99,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":10660,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7489536315141567,"acs":18252,"articleLive":2,"columnArticles":320,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24370,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39455882352941174,"acs":5366,"articleLive":2,"columnArticles":83,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13600,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6014904883310453,"acs":15335,"articleLive":2,"columnArticles":243,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.3438572302,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":25495,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6826815642458101,"acs":3055,"articleLive":2,"columnArticles":68,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4475,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6683915480810694,"acs":1550,"articleLive":2,"columnArticles":38,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2319,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5648063433973772,"acs":1852,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3279,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5550133096716947,"acs":1251,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2254,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4808664259927798,"acs":1998,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4155,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6036703307071756,"acs":12796,"articleLive":2,"columnArticles":260,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":21197,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7274051151360699,"acs":7992,"articleLive":2,"columnArticles":105,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10987,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5253624611999529,"acs":13371,"articleLive":2,"columnArticles":201,"formTitle":"[1262]可被三整除的最大和","frequency":1.2996010848,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":25451,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.42439840432376785,"acs":3298,"articleLive":2,"columnArticles":61,"formTitle":"[1263]推箱子","frequency":1.0012304478,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7771,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5672183178417592,"acs":5004,"articleLive":2,"columnArticles":88,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":8822,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.922399739158787,"acs":2829,"articleLive":2,"columnArticles":71,"formTitle":"[1265]逆序打印不可变链表","frequency":1.0360165639,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3067,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8240591213904476,"acs":30107,"articleLive":2,"columnArticles":458,"formTitle":"[1266]访问所有点的最小时间","frequency":0.3438572302,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36535,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6073721004130919,"acs":9557,"articleLive":2,"columnArticles":149,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15735,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5838657586182686,"acs":8316,"articleLive":2,"columnArticles":146,"formTitle":"[1268]搜索推荐系统","frequency":0.4607785683,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":14243,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49122863906092934,"acs":30298,"articleLive":2,"columnArticles":322,"formTitle":"[1269]停在原地的方案数","frequency":2.4497098992,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61678,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8026263952724885,"acs":6112,"articleLive":2,"columnArticles":86,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":7615,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5075571895424836,"acs":2485,"articleLive":2,"columnArticles":42,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4896,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.519298245614035,"acs":1628,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3135,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5447126827609656,"acs":1602,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2941,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6037394451145959,"acs":1001,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1658,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5438941299790356,"acs":8302,"articleLive":2,"columnArticles":172,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.3438572302,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15264,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5026487059179658,"acs":6642,"articleLive":2,"columnArticles":99,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13214,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7258698716521997,"acs":19568,"articleLive":2,"columnArticles":243,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.565710672,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26958,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5985755908060861,"acs":3698,"articleLive":2,"columnArticles":60,"formTitle":"[1278]分割回文串 III","frequency":1.4809500939,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6178,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6219746446407991,"acs":1619,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2603,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5073941866394697,"acs":6965,"articleLive":2,"columnArticles":72,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":13727,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8309943537699025,"acs":45772,"articleLive":2,"columnArticles":625,"formTitle":"[1281]整数的各位积和之差","frequency":0.3438572302,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55081,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8106774338268282,"acs":12649,"articleLive":2,"columnArticles":233,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15603,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4178268153197389,"acs":7233,"articleLive":2,"columnArticles":101,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":1.0012304478,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17311,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.664253619570644,"acs":2661,"articleLive":2,"columnArticles":61,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.1924322504,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4006,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8132832080200502,"acs":4543,"articleLive":2,"columnArticles":63,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5586,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6476304579339723,"acs":4865,"articleLive":2,"columnArticles":99,"formTitle":"[1286]字母组合迭代器","frequency":0.4607785683,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7512,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6024825800555915,"acs":15823,"articleLive":2,"columnArticles":221,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.9052181601,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":26263,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5635574488606679,"acs":14023,"articleLive":2,"columnArticles":172,"formTitle":"[1288]删除被覆盖区间","frequency":1.2675539073,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24883,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6246835443037975,"acs":6909,"articleLive":2,"columnArticles":106,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":11060,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8085593232849614,"acs":54771,"articleLive":2,"columnArticles":714,"formTitle":"[1290]二进制链表转整数","frequency":0.2925507746,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":67739,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5180017351069983,"acs":7165,"articleLive":2,"columnArticles":161,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13832,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4721925948499162,"acs":6198,"articleLive":2,"columnArticles":97,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.3996908763,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13126,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3623192223597903,"acs":13754,"articleLive":2,"columnArticles":130,"formTitle":"[1293]网格中的最短路径","frequency":2.7362263345,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37961,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.655404790091977,"acs":7197,"articleLive":2,"columnArticles":80,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":10981,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8077741570792046,"acs":48586,"articleLive":2,"columnArticles":644,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.9052181601,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":60148,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4547084683017122,"acs":7861,"articleLive":2,"columnArticles":128,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17288,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4594107452339688,"acs":6627,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.9052181601,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14425,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5974199288256228,"acs":2686,"articleLive":2,"columnArticles":93,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4496,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7871851208420623,"acs":30812,"articleLive":2,"columnArticles":442,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":39142,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46568664933476067,"acs":24361,"articleLive":2,"columnArticles":370,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.3711664096,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":52312,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36064,"acs":3381,"articleLive":2,"columnArticles":84,"formTitle":"[1301]最大得分的路径数目","frequency":0.3996908763,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":9375,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8198602189633579,"acs":20294,"articleLive":2,"columnArticles":304,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.9359331053,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24753,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8233058898036733,"acs":9100,"articleLive":2,"columnArticles":88,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11053,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7227129759753731,"acs":21599,"articleLive":2,"columnArticles":391,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29886,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7478201234446948,"acs":15266,"articleLive":2,"columnArticles":231,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.3176777246,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20414,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5754819701530776,"acs":17970,"articleLive":2,"columnArticles":277,"formTitle":"[1306]跳跃游戏 III","frequency":0.9052181601,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":31226,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33043323863636365,"acs":1861,"articleLive":2,"columnArticles":56,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5632,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7526807808633489,"acs":5475,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7274,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557491915199425,"acs":16826,"articleLive":2,"columnArticles":292,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22264,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.713262198042183,"acs":37233,"articleLive":2,"columnArticles":501,"formTitle":"[1310]子数组异或查询","frequency":2.6636782153,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52201,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.382453551546046,"acs":5702,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14909,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6661208151382824,"acs":10983,"articleLive":2,"columnArticles":155,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.3711664096,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16488,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8322142907625981,"acs":35325,"articleLive":2,"columnArticles":549,"formTitle":"[1313]解压缩编码列表","frequency":0.3438572302,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42447,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7425264037233725,"acs":12444,"articleLive":2,"columnArticles":205,"formTitle":"[1314]矩阵区域和","frequency":1.7756837601,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16759,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8098604651162791,"acs":13059,"articleLive":2,"columnArticles":268,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16125,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4417989417989418,"acs":2839,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.5643192472,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6426,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6153389880775847,"acs":10374,"articleLive":2,"columnArticles":195,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16859,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6551653527183373,"acs":6399,"articleLive":2,"columnArticles":115,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.565710672,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9767,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6170988335435057,"acs":31319,"articleLive":2,"columnArticles":517,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50752,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5891203703703703,"acs":2545,"articleLive":2,"columnArticles":59,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4320,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6179181349959338,"acs":4559,"articleLive":2,"columnArticles":81,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.3996908763,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7378,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5947790294627383,"acs":5491,"articleLive":2,"columnArticles":65,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9232,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.754225522153809,"acs":24989,"articleLive":2,"columnArticles":491,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.3438572302,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":33132,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5873667742250904,"acs":6007,"articleLive":2,"columnArticles":119,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10227,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7285406980778572,"acs":10499,"articleLive":2,"columnArticles":188,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.3711664096,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14411,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4732243973467076,"acs":5850,"articleLive":2,"columnArticles":93,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12362,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6891216956998416,"acs":5657,"articleLive":2,"columnArticles":55,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8209,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4639293060105127,"acs":6090,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.3438572302,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13127,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7713450925224543,"acs":7128,"articleLive":2,"columnArticles":161,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.9052181601,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9241,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37854186564788284,"acs":1189,"articleLive":2,"columnArticles":30,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.8756739138,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3141,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5339209753102662,"acs":12175,"articleLive":2,"columnArticles":206,"formTitle":"[1331]数组序号转换","frequency":1.2675539073,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22803,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6878926327812679,"acs":9636,"articleLive":2,"columnArticles":137,"formTitle":"[1332]删除回文子序列","frequency":0.9052181601,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14008,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5459791863765374,"acs":5771,"articleLive":2,"columnArticles":120,"formTitle":"[1333]餐厅过滤器","frequency":0.967905138,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10570,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4926545086119554,"acs":5835,"articleLive":2,"columnArticles":94,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.967905138,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11844,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5877250409165303,"acs":3591,"articleLive":2,"columnArticles":59,"formTitle":"[1335]工作计划的最低难度","frequency":0.5643192472,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6110,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4209799861973775,"acs":1830,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4347,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7056203186463815,"acs":39284,"articleLive":2,"columnArticles":629,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":2.030639139,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55673,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.639375,"acs":9207,"articleLive":2,"columnArticles":136,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14400,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39931339352896916,"acs":8491,"articleLive":2,"columnArticles":136,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":21264,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5732991014120667,"acs":4466,"articleLive":2,"columnArticles":98,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7790,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.47662408263114975,"acs":3507,"articleLive":2,"columnArticles":51,"formTitle":"[1341]电影评分","frequency":0.4607785683,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":7358,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.820374920198874,"acs":42406,"articleLive":2,"columnArticles":643,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51691,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5457841483979764,"acs":12946,"articleLive":2,"columnArticles":218,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23720,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5955602134146342,"acs":6251,"articleLive":2,"columnArticles":122,"formTitle":"[1344]时钟指针的夹角","frequency":0.9052181601,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10496,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3657093553556021,"acs":5934,"articleLive":2,"columnArticles":110,"formTitle":"[1345]跳跃游戏 IV","frequency":0.9359331053,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":16226,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43450427672279307,"acs":16154,"articleLive":2,"columnArticles":271,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":37178,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7413041461830999,"acs":7992,"articleLive":2,"columnArticles":121,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10781,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30582657062095375,"acs":3354,"articleLive":2,"columnArticles":52,"formTitle":"[1348]推文计数","frequency":1.403741344,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10967,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5095110831630247,"acs":3241,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.4607785683,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6361,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8478753820368727,"acs":8600,"articleLive":2,"columnArticles":88,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10143,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546281219469425,"acs":30124,"articleLive":2,"columnArticles":549,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.3438572302,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39919,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44636429085673146,"acs":6820,"articleLive":2,"columnArticles":74,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15279,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28600469494929937,"acs":11818,"articleLive":2,"columnArticles":159,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.2996010848,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":41321,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816389048439594,"acs":2942,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.6431001251,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10446,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6647273936170213,"acs":3999,"articleLive":2,"columnArticles":61,"formTitle":"[1355]活动参与者","frequency":0.3438572302,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6016,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7313217708085847,"acs":46172,"articleLive":2,"columnArticles":511,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.9052181601,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":63135,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5314950670376929,"acs":4202,"articleLive":2,"columnArticles":43,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7906,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4951656887860507,"acs":5992,"articleLive":2,"columnArticles":115,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.3996908763,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12101,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5505166475315729,"acs":2877,"articleLive":2,"columnArticles":68,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5226,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.505341331048272,"acs":8846,"articleLive":2,"columnArticles":143,"formTitle":"[1360]日期之间隔几天","frequency":1.5329530755,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17505,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.39985406785844585,"acs":7672,"articleLive":2,"columnArticles":207,"formTitle":"[1361]验证二叉树","frequency":1.0360165639,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":19187,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5262858227367622,"acs":5546,"articleLive":2,"columnArticles":71,"formTitle":"[1362]最接近的因数","frequency":0.3711664096,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10538,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3655103781632073,"acs":5142,"articleLive":2,"columnArticles":100,"formTitle":"[1363]形成三的最大倍数","frequency":1.2069231575,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14068,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.684918529746116,"acs":3615,"articleLive":2,"columnArticles":69,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.3996908763,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5278,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8246997824441016,"acs":86050,"articleLive":2,"columnArticles":1097,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.3438572302,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":104341,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5390182035213369,"acs":7225,"articleLive":2,"columnArticles":141,"formTitle":"[1366]通过投票对团队排名","frequency":0.3996908763,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13404,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4178219430304343,"acs":15431,"articleLive":2,"columnArticles":225,"formTitle":"[1367]二叉树中的列表","frequency":0.3176777246,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36932,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5285959393766085,"acs":3697,"articleLive":2,"columnArticles":92,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6994,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6059893048128342,"acs":2833,"articleLive":2,"columnArticles":43,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3996908763,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4675,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7902017856558852,"acs":48324,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.3438572302,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61154,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5806740232627497,"acs":21417,"articleLive":2,"columnArticles":274,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.5329530755,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36883,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5145217981130912,"acs":8344,"articleLive":2,"columnArticles":167,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16217,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.40581126253535615,"acs":7891,"articleLive":2,"columnArticles":171,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.2366872594,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":19445,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7401327128576353,"acs":17177,"articleLive":2,"columnArticles":229,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23208,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5763556488099141,"acs":8790,"articleLive":2,"columnArticles":175,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15251,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5048984154119271,"acs":7679,"articleLive":2,"columnArticles":156,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15209,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3264591735788753,"acs":4290,"articleLive":2,"columnArticles":132,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13141,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8627221702525725,"acs":7378,"articleLive":2,"columnArticles":63,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8552,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8379042485732403,"acs":10571,"articleLive":2,"columnArticles":165,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12616,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7286848463928202,"acs":16888,"articleLive":2,"columnArticles":254,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":23176,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7326336225201723,"acs":12076,"articleLive":2,"columnArticles":164,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.3438572302,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16483,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.695871037334452,"acs":11612,"articleLive":2,"columnArticles":180,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16687,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32503322375323496,"acs":4647,"articleLive":2,"columnArticles":88,"formTitle":"[1383]最大的团队表现值","frequency":0.4935683911,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14297,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5444295302013423,"acs":2028,"articleLive":2,"columnArticles":47,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3725,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7005425499849292,"acs":13945,"articleLive":2,"columnArticles":208,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19906,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3131541447594713,"acs":6373,"articleLive":2,"columnArticles":132,"formTitle":"[1386]安排电影院座位","frequency":0.9052181601,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20351,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6943188929837981,"acs":9985,"articleLive":2,"columnArticles":179,"formTitle":"[1387]将整数按权重排序","frequency":0.3438572302,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14381,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5432067617005172,"acs":4306,"articleLive":2,"columnArticles":54,"formTitle":"[1388]3n 块披萨","frequency":0.3438572302,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7927,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8314807231030247,"acs":28425,"articleLive":2,"columnArticles":488,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.3176777246,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":34186,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3615840315952394,"acs":6775,"articleLive":2,"columnArticles":120,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":18737,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.40042611114399007,"acs":6766,"articleLive":2,"columnArticles":206,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.4607785683,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16897,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40698655287054036,"acs":8202,"articleLive":2,"columnArticles":148,"formTitle":"[1392]最长快乐前缀","frequency":0.9359331053,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":20153,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.856996935648621,"acs":4195,"articleLive":2,"columnArticles":65,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4895,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6653960509262788,"acs":17456,"articleLive":2,"columnArticles":281,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":26234,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7465746315133901,"acs":14385,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.3438572302,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19268,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4119437763078773,"acs":10961,"articleLive":2,"columnArticles":151,"formTitle":"[1396]设计地铁系统","frequency":0.9052181601,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":26608,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3770255671588045,"acs":1047,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2777,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7599259757738897,"acs":4517,"articleLive":2,"columnArticles":71,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5944,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6715978405665007,"acs":9579,"articleLive":2,"columnArticles":155,"formTitle":"[1399]统计最大组的数目","frequency":0.3711664096,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14263,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6053311292488893,"acs":5859,"articleLive":2,"columnArticles":99,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.3438572302,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9679,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4179495235103152,"acs":3991,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9549,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7534172938104746,"acs":9811,"articleLive":2,"columnArticles":179,"formTitle":"[1402]做菜顺序","frequency":0.4295260248,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13022,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6910867690735477,"acs":21640,"articleLive":2,"columnArticles":366,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.9052181601,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31313,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4945321992709599,"acs":7326,"articleLive":2,"columnArticles":155,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14814,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5093195006154387,"acs":5793,"articleLive":2,"columnArticles":142,"formTitle":"[1405]最长快乐字符串","frequency":1.3675928299,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11374,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5683428571428571,"acs":4973,"articleLive":2,"columnArticles":82,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8750,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6683322229624694,"acs":6019,"articleLive":2,"columnArticles":70,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9006,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6147496617050068,"acs":13629,"articleLive":2,"columnArticles":205,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22170,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8063120637105496,"acs":8201,"articleLive":2,"columnArticles":132,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10171,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4756305708325431,"acs":7524,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.3711664096,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15819,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506676036542516,"acs":7836,"articleLive":2,"columnArticles":143,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.441481672,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14230,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5523664702528036,"acs":2906,"articleLive":2,"columnArticles":69,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5261,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6935734244023595,"acs":11170,"articleLive":2,"columnArticles":230,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.3176777246,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":16105,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6039420756234916,"acs":7507,"articleLive":2,"columnArticles":151,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.3675928299,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12430,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6851398244539701,"acs":6713,"articleLive":2,"columnArticles":182,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.3438572302,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9798,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40921447989698095,"acs":2860,"articleLive":2,"columnArticles":53,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6989,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5198501872659176,"acs":13186,"articleLive":2,"columnArticles":185,"formTitle":"[1417]重新格式化字符串","frequency":0.3176777246,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":25365,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7320783259097403,"acs":26133,"articleLive":2,"columnArticles":417,"formTitle":"[1418]点菜展示表","frequency":2.4419579224,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35697,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41967934611757307,"acs":8010,"articleLive":2,"columnArticles":157,"formTitle":"[1419]数青蛙","frequency":1.3329152915,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19086,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5992744860943168,"acs":2478,"articleLive":2,"columnArticles":45,"formTitle":"[1420]生成数组","frequency":0.7677525773,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4135,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7501892505677517,"acs":2973,"articleLive":2,"columnArticles":37,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":3963,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5407093913744457,"acs":10732,"articleLive":2,"columnArticles":196,"formTitle":"[1422]分割字符串的最大得分","frequency":0.9052181601,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19848,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5533785363572598,"acs":35502,"articleLive":2,"columnArticles":520,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":64155,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.399988417882789,"acs":6907,"articleLive":2,"columnArticles":150,"formTitle":"[1424]对角线遍历 II","frequency":1.2675539073,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17268,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.44150080688542226,"acs":3283,"articleLive":2,"columnArticles":70,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7436,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7094843462246777,"acs":1541,"articleLive":2,"columnArticles":49,"formTitle":"[1426]数元素","frequency":1.0723842081,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2172,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6595159515951595,"acs":1199,"articleLive":2,"columnArticles":47,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1818,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5881656804733728,"acs":994,"articleLive":2,"columnArticles":21,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1690,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5034232782923882,"acs":1250,"articleLive":2,"columnArticles":42,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2483,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5795275590551181,"acs":736,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1270,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8461307802694424,"acs":79010,"articleLive":2,"columnArticles":1039,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":93378,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39597834493426143,"acs":4608,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11637,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6410041841004184,"acs":6128,"articleLive":2,"columnArticles":104,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9560,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.46641386782231853,"acs":2583,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5538,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6210510991410686,"acs":4266,"articleLive":2,"columnArticles":48,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6869,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8217607455375979,"acs":44795,"articleLive":2,"columnArticles":653,"formTitle":"[1436]旅行终点站","frequency":0.8197934554,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":54511,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5854468270382062,"acs":10757,"articleLive":2,"columnArticles":180,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":18374,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48283472290338403,"acs":33473,"articleLive":2,"columnArticles":472,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.8756739138,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":69326,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5637088439391702,"acs":3818,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6773,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.7003050330452466,"acs":2755,"articleLive":2,"columnArticles":38,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3934,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.648654398468248,"acs":18294,"articleLive":2,"columnArticles":379,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":28203,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916193246375495,"acs":34836,"articleLive":2,"columnArticles":375,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.5854522661,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44006,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.411012994471965,"acs":5725,"articleLive":2,"columnArticles":141,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13929,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5251826980051353,"acs":2659,"articleLive":2,"columnArticles":61,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5063,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8571428571428571,"acs":4128,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4816,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5756067749257902,"acs":13186,"articleLive":2,"columnArticles":221,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22908,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6165675620258355,"acs":6014,"articleLive":2,"columnArticles":75,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9754,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7132009752699408,"acs":10238,"articleLive":2,"columnArticles":165,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.3176777246,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":14355,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6281173131504257,"acs":16598,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.6351347948,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26425,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8029688273132113,"acs":24342,"articleLive":2,"columnArticles":346,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.2684066756,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30315,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5256390632175111,"acs":10302,"articleLive":2,"columnArticles":157,"formTitle":"[1451]重新排列句子中的单词","frequency":0.3176777246,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19599,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.499003984063745,"acs":6012,"articleLive":2,"columnArticles":91,"formTitle":"[1452]收藏清单","frequency":0.4295260248,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12048,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3657725559742851,"acs":1650,"articleLive":2,"columnArticles":32,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":1.0723842081,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4511,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3969529934160159,"acs":5185,"articleLive":2,"columnArticles":83,"formTitle":"[1454]活跃用户","frequency":0.3996908763,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":13062,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6319437260784111,"acs":12218,"articleLive":2,"columnArticles":210,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19334,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5258351893095768,"acs":14166,"articleLive":2,"columnArticles":218,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":26940,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6295749475483721,"acs":8102,"articleLive":2,"columnArticles":141,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12869,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4427152576835849,"acs":5661,"articleLive":2,"columnArticles":91,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12787,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5986791973583947,"acs":2357,"articleLive":2,"columnArticles":50,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3937,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7439576679220098,"acs":15606,"articleLive":2,"columnArticles":316,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20977,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5030065141139135,"acs":6023,"articleLive":2,"columnArticles":87,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11974,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4293568258594423,"acs":6482,"articleLive":2,"columnArticles":127,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":15097,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5938314509122502,"acs":2734,"articleLive":2,"columnArticles":66,"formTitle":"[1463]摘樱桃 II","frequency":0.4935683911,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4604,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.76726306566042,"acs":27145,"articleLive":2,"columnArticles":384,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.2675539073,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":35379,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3113451412158928,"acs":6504,"articleLive":2,"columnArticles":83,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.3711664096,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20890,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4825247782994262,"acs":6475,"articleLive":2,"columnArticles":125,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13419,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178623718887262,"acs":1688,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2732,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.699246403288422,"acs":3062,"articleLive":2,"columnArticles":52,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4379,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7997237569060773,"acs":2316,"articleLive":2,"columnArticles":87,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2896,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8430045835801815,"acs":54072,"articleLive":2,"columnArticles":735,"formTitle":"[1470]重新排列数组","frequency":1.2675539073,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":64142,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5455599855019935,"acs":7526,"articleLive":2,"columnArticles":108,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13795,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6202494711503392,"acs":8503,"articleLive":2,"columnArticles":138,"formTitle":"[1472]设计浏览器历史记录","frequency":0.8472224926,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13709,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6740099545552911,"acs":15573,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23105,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7191091954022989,"acs":2002,"articleLive":2,"columnArticles":63,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2784,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7216972392069668,"acs":15580,"articleLive":2,"columnArticles":239,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":21588,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8658594331326523,"acs":12800,"articleLive":2,"columnArticles":120,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14783,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2914710933028048,"acs":5092,"articleLive":2,"columnArticles":98,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.9359331053,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17470,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5822119428090833,"acs":2769,"articleLive":2,"columnArticles":58,"formTitle":"[1478]安排邮筒","frequency":0.4935683911,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4756,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5666666666666667,"acs":2023,"articleLive":2,"columnArticles":40,"formTitle":"[1479]周内每天的销售情况","frequency":1.0012304478,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3570,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692810895588413,"acs":129695,"articleLive":2,"columnArticles":1300,"formTitle":"[1480]一维数组的动态和","frequency":1.7756837601,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":149198,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5147036871174803,"acs":10344,"articleLive":2,"columnArticles":150,"formTitle":"[1481]不同整数的最少数目","frequency":1.5329530755,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20097,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5867663551401869,"acs":31392,"articleLive":2,"columnArticles":409,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.9359331053,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53500,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.299947192395705,"acs":3408,"articleLive":2,"columnArticles":71,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11362,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8094768015794669,"acs":820,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1013,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6585365853658537,"acs":3915,"articleLive":2,"columnArticles":47,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5945,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.858255227108868,"acs":71424,"articleLive":2,"columnArticles":691,"formTitle":"[1486]数组异或操作","frequency":0.8756739138,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":83220,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3125845199268157,"acs":7859,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":0.3711664096,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25142,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23840510366826156,"acs":7474,"articleLive":2,"columnArticles":114,"formTitle":"[1488]避免洪水泛滥","frequency":3.1438960409,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":31350,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6908798857754774,"acs":11613,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.8756739138,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16809,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8545454545454545,"acs":1222,"articleLive":2,"columnArticles":31,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1430,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6708188008636439,"acs":20195,"articleLive":2,"columnArticles":301,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":30105,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6577851790174855,"acs":7110,"articleLive":2,"columnArticles":84,"formTitle":"[1492]n 的第 k 个因子","frequency":0.9052181601,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10809,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5684017232855427,"acs":8048,"articleLive":2,"columnArticles":154,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.2675539073,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":14159,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.37168141592920356,"acs":2310,"articleLive":2,"columnArticles":37,"formTitle":"[1494]并行课程 II","frequency":1.6595441102,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6215,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5422422954303932,"acs":4082,"articleLive":2,"columnArticles":40,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":7528,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5360937203566686,"acs":11303,"articleLive":2,"columnArticles":170,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21084,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3920725009154156,"acs":8566,"articleLive":2,"columnArticles":116,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.967905138,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21848,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33444647470228717,"acs":5308,"articleLive":2,"columnArticles":68,"formTitle":"[1498]满足条件的子序列数目","frequency":0.4295260248,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15871,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3749833666001331,"acs":2818,"articleLive":2,"columnArticles":60,"formTitle":"[1499]满足不等式的最大值","frequency":0.5643192472,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7515,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.3029304029304029,"acs":827,"articleLive":2,"columnArticles":28,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":2730,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5926757401431177,"acs":4224,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.3176777246,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7127,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7163529509605522,"acs":25841,"articleLive":2,"columnArticles":310,"formTitle":"[1502]判断能否形成等差数列","frequency":1.565710672,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":36073,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5140075973409307,"acs":8660,"articleLive":2,"columnArticles":88,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16848,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5970652856246077,"acs":7609,"articleLive":2,"columnArticles":136,"formTitle":"[1504]统计全 1 子矩形","frequency":0.3438572302,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12744,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3620652173913044,"acs":3331,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9200,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8333333333333334,"acs":605,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":726,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5889171447158318,"acs":9958,"articleLive":2,"columnArticles":132,"formTitle":"[1507]转变日期格式","frequency":0.3438572302,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16909,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5529842744817727,"acs":6189,"articleLive":2,"columnArticles":54,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11192,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5486707566462168,"acs":5366,"articleLive":2,"columnArticles":79,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.3438572302,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9780,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.578005115089514,"acs":5198,"articleLive":2,"columnArticles":63,"formTitle":"[1510]石子游戏 IV","frequency":1.565710672,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8993,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6793725490196079,"acs":4331,"articleLive":2,"columnArticles":64,"formTitle":"[1511]消费者下单频率","frequency":0.3996908763,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6375,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8483016284972763,"acs":59488,"articleLive":2,"columnArticles":756,"formTitle":"[1512]好数对的数目","frequency":0.3176777246,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":70126,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3808795020916233,"acs":11199,"articleLive":2,"columnArticles":154,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29403,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32764179104477614,"acs":8232,"articleLive":2,"columnArticles":142,"formTitle":"[1514]概率最大的路径","frequency":0.3996908763,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":25125,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34336569579288023,"acs":3183,"articleLive":2,"columnArticles":60,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9270,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5855421686746988,"acs":243,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":415,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7286805698946933,"acs":3529,"articleLive":2,"columnArticles":37,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4843,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6737842310361394,"acs":25244,"articleLive":2,"columnArticles":402,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37466,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2983762928031724,"acs":5568,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.4295260248,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18661,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33434051497635314,"acs":2545,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7612,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39503252513305737,"acs":2672,"articleLive":2,"columnArticles":53,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6764,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7163120567375887,"acs":808,"articleLive":2,"columnArticles":29,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1128,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5775154581225408,"acs":10274,"articleLive":2,"columnArticles":174,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17790,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4320019603038471,"acs":5289,"articleLive":2,"columnArticles":104,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.9359331053,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12243,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6608034228666508,"acs":5560,"articleLive":2,"columnArticles":112,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8414,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.619482496194825,"acs":3256,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5256,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49791806581598386,"acs":3707,"articleLive":2,"columnArticles":39,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":7445,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851248194759645,"acs":30444,"articleLive":2,"columnArticles":362,"formTitle":"[1528]重新排列字符串","frequency":0.8756739138,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38776,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6917661463116008,"acs":9040,"articleLive":2,"columnArticles":135,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13068,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5681084570690769,"acs":8800,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":1.0012304478,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15490,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3443179887888568,"acs":2027,"articleLive":2,"columnArticles":35,"formTitle":"[1531]压缩字符串 II","frequency":1.9839016612,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5887,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6199780461031833,"acs":2824,"articleLive":2,"columnArticles":50,"formTitle":"[1532]最近的三笔订单","frequency":0.9359331053,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":4555,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6051587301587301,"acs":305,"articleLive":2,"columnArticles":19,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":504,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.788511041864246,"acs":17460,"articleLive":2,"columnArticles":165,"formTitle":"[1534]统计好三元组","frequency":0.3438572302,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":22143,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45326660354389287,"acs":13404,"articleLive":2,"columnArticles":184,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3711664096,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29572,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44135146621334465,"acs":4154,"articleLive":2,"columnArticles":81,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.6431001251,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9412,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3674991891015245,"acs":4532,"articleLive":2,"columnArticles":91,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12332,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6055045871559633,"acs":132,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":218,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5395882315562052,"acs":16983,"articleLive":2,"columnArticles":251,"formTitle":"[1539]第 k 个缺失的正整数","frequency":1.2366872594,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":31474,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31787096774193546,"acs":4927,"articleLive":2,"columnArticles":88,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15500,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4610375028070963,"acs":6159,"articleLive":2,"columnArticles":94,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":13359,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38558231107072544,"acs":2546,"articleLive":2,"columnArticles":48,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6603,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5540201005025126,"acs":3087,"articleLive":2,"columnArticles":45,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5572,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.548470836375436,"acs":20283,"articleLive":2,"columnArticles":325,"formTitle":"[1544]整理字符串","frequency":1.5013798136,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36981,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5543700672318036,"acs":7586,"articleLive":2,"columnArticles":102,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":1.0012304478,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13684,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4153870508152604,"acs":5248,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12634,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5361161999476577,"acs":4097,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":1.1924322504,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7642,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7077798861480076,"acs":373,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":527,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6655307994757536,"acs":2539,"articleLive":2,"columnArticles":49,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3815,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6577556352147761,"acs":21652,"articleLive":2,"columnArticles":294,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.3438572302,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32918,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8169601149838304,"acs":11368,"articleLive":2,"columnArticles":157,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.3711664096,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13915,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5108036600154338,"acs":9267,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.3438572302,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18142,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2955444239388347,"acs":7847,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":1.0360165639,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26551,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7130214917825537,"acs":564,"articleLive":2,"columnArticles":19,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":791,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4372178329571106,"acs":3099,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7088,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5784247815069555,"acs":11185,"articleLive":2,"columnArticles":171,"formTitle":"[1556]千位分隔数","frequency":2.5347889085,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":19337,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7694680751612601,"acs":8231,"articleLive":2,"columnArticles":116,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.3711664096,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10697,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6229508196721312,"acs":4560,"articleLive":2,"columnArticles":73,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.3996908763,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7320,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37041871673862836,"acs":3689,"articleLive":2,"columnArticles":69,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9959,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.572659616137877,"acs":8772,"articleLive":2,"columnArticles":92,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15318,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7786558683299588,"acs":11922,"articleLive":2,"columnArticles":173,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.2996010848,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15311,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3099080842440472,"acs":4282,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13817,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.38045013654769755,"acs":4040,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10619,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5478119935170178,"acs":676,"articleLive":2,"columnArticles":25,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1234,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7275042444821732,"acs":3428,"articleLive":2,"columnArticles":44,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.3711664096,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4712,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4459519326614243,"acs":8053,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.3711664096,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18058,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.40193304384367556,"acs":14347,"articleLive":2,"columnArticles":231,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.565710672,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":35695,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4573467966573816,"acs":2627,"articleLive":2,"columnArticles":48,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5744,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47458775694601313,"acs":2101,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4427,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8925659472422063,"acs":1861,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.3176777246,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2085,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7581615120274914,"acs":3530,"articleLive":2,"columnArticles":44,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4656,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8053746941483847,"acs":19420,"articleLive":2,"columnArticles":328,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.9052181601,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":24113,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.296235998958062,"acs":4549,"articleLive":2,"columnArticles":66,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15356,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32888471598149016,"acs":4904,"articleLive":2,"columnArticles":86,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.3438572302,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14911,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5966894377299001,"acs":4542,"articleLive":2,"columnArticles":70,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7612,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47664210691330927,"acs":18243,"articleLive":2,"columnArticles":259,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":38274,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32635032811711256,"acs":5172,"articleLive":2,"columnArticles":80,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4607785683,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15848,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5827375946173254,"acs":11086,"articleLive":2,"columnArticles":209,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19024,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.619581007722303,"acs":16207,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26158,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6347826086956522,"acs":292,"articleLive":2,"columnArticles":20,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":460,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8038478549314463,"acs":3635,"articleLive":2,"columnArticles":50,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4522,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6692886456908345,"acs":9785,"articleLive":2,"columnArticles":112,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.3438572302,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14620,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853036896186053,"acs":18741,"articleLive":2,"columnArticles":244,"formTitle":"[1583]统计不开心的朋友","frequency":2.6853871867,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27347,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6636481241914618,"acs":26676,"articleLive":2,"columnArticles":335,"formTitle":"[1584]连接所有点的最小费用","frequency":1.6351347948,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":40196,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4302910528206971,"acs":2395,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5566,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6196319018404908,"acs":404,"articleLive":2,"columnArticles":22,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":652,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8270728355474118,"acs":3611,"articleLive":2,"columnArticles":43,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4366,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8391047935883865,"acs":44392,"articleLive":2,"columnArticles":706,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.2256006308,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52904,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2936561309123515,"acs":3930,"articleLive":2,"columnArticles":57,"formTitle":"[1589]所有排列中的最大和","frequency":0.3438572302,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13383,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2712704800229951,"acs":3775,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.9359331053,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13916,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5739348370927319,"acs":1145,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1995,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4449698812137589,"acs":7904,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17763,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5349937252630563,"acs":5542,"articleLive":2,"columnArticles":93,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.4295260248,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10359,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3141886903883065,"acs":4256,"articleLive":2,"columnArticles":101,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13546,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4669431568675287,"acs":1914,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4099,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7503710299792223,"acs":2528,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3369,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6651685393258427,"acs":296,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":445,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6720337472520943,"acs":11311,"articleLive":2,"columnArticles":151,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16831,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4198621283929341,"acs":3898,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9284,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.677437348101518,"acs":17003,"articleLive":2,"columnArticles":208,"formTitle":"[1600]皇位继承顺序","frequency":0.9052181601,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25099,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.49153297682709446,"acs":2206,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4488,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7804370447450573,"acs":750,"articleLive":2,"columnArticles":31,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":961,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8443055026795911,"acs":57661,"articleLive":2,"columnArticles":461,"formTitle":"[1603]设计停车系统","frequency":1.565710672,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":68294,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41494130202774815,"acs":3888,"articleLive":2,"columnArticles":65,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.4607785683,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9370,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7378010471204188,"acs":3523,"articleLive":2,"columnArticles":71,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4775,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3399258343634116,"acs":1650,"articleLive":2,"columnArticles":35,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4854,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5441095890410959,"acs":2979,"articleLive":2,"columnArticles":41,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5475,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6398730158730159,"acs":10078,"articleLive":2,"columnArticles":167,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15750,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5119122039313746,"acs":7370,"articleLive":2,"columnArticles":133,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14397,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2722108611679164,"acs":2396,"articleLive":2,"columnArticles":41,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8802,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6093794681155276,"acs":2131,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3497,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7338582677165354,"acs":466,"articleLive":2,"columnArticles":22,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":635,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7269372693726938,"acs":1773,"articleLive":2,"columnArticles":37,"formTitle":"[1613]找到遗失的ID","frequency":0.4607785683,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2439,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8227775930061292,"acs":17317,"articleLive":2,"columnArticles":292,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.2684066756,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":21047,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49872472217161595,"acs":5475,"articleLive":2,"columnArticles":67,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10978,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2756233436097139,"acs":5096,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.0012304478,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18489,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6221214235868807,"acs":1783,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2866,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5974955277280859,"acs":334,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":559,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6728090283900546,"acs":7631,"articleLive":2,"columnArticles":132,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11342,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3731474688187821,"acs":2543,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6815,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4419621175327829,"acs":1820,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4118,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.15378351654743208,"acs":2644,"articleLive":2,"columnArticles":58,"formTitle":"[1622]奇妙序列","frequency":1.3329152915,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":17193,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.783957456237536,"acs":3538,"articleLive":2,"columnArticles":47,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4513,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6217909221606079,"acs":12110,"articleLive":2,"columnArticles":209,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.9052181601,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":19476,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5440934818331203,"acs":2980,"articleLive":2,"columnArticles":68,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5477,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3874878758486906,"acs":3995,"articleLive":2,"columnArticles":86,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10310,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3825296564473887,"acs":2483,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6491,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8369351669941061,"acs":426,"articleLive":2,"columnArticles":19,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":509,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5242078270956713,"acs":8586,"articleLive":2,"columnArticles":100,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":16379,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.766487145615283,"acs":7543,"articleLive":2,"columnArticles":118,"formTitle":"[1630]等差子数组","frequency":1.3329152915,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9841,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4942084210127206,"acs":26069,"articleLive":2,"columnArticles":305,"formTitle":"[1631]最小体力消耗路径","frequency":1.2675539073,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":52749,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3195610071013557,"acs":1485,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4647,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6560613098002787,"acs":2825,"articleLive":2,"columnArticles":28,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4306,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5304054054054054,"acs":471,"articleLive":2,"columnArticles":26,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":888,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5439144003566652,"acs":1220,"articleLive":2,"columnArticles":34,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.5280307953,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2243,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.705766759882095,"acs":9338,"articleLive":2,"columnArticles":183,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.8756739138,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":13231,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8070998973155347,"acs":5502,"articleLive":2,"columnArticles":72,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6817,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7120291616038882,"acs":2930,"articleLive":2,"columnArticles":49,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.4607785683,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4115,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40271772699197034,"acs":1304,"articleLive":2,"columnArticles":29,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3238,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6571632580200949,"acs":12885,"articleLive":2,"columnArticles":221,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19607,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7715598640312225,"acs":12257,"articleLive":2,"columnArticles":281,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.3329152915,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15886,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45150138954788854,"acs":6661,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14753,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4510075069142631,"acs":2283,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5062,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5501355013550135,"acs":1218,"articleLive":2,"columnArticles":26,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2214,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41310679611650486,"acs":851,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.6026087637,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2060,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5355542479518399,"acs":35496,"articleLive":2,"columnArticles":361,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.4078388924,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":66279,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5157288739634021,"acs":7525,"articleLive":2,"columnArticles":112,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.9359331053,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14591,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27749882316020713,"acs":3537,"articleLive":2,"columnArticles":92,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.2996010848,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12746,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4741775408932182,"acs":2580,"articleLive":2,"columnArticles":66,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5441,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7931404072883173,"acs":1480,"articleLive":2,"columnArticles":31,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.4295260248,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1866,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6717428087986463,"acs":794,"articleLive":2,"columnArticles":24,"formTitle":"[1651]Hopper Company Queries III","frequency":0.6860251698,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1182,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6527553401543709,"acs":7273,"articleLive":2,"columnArticles":180,"formTitle":"[1652]拆炸弹","frequency":0.8756739138,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11142,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5088395586866942,"acs":3828,"articleLive":2,"columnArticles":88,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7523,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2758877946881528,"acs":3698,"articleLive":2,"columnArticles":50,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.2366872594,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":13404,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3842007434944238,"acs":2067,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.6026087637,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5380,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7820662768031189,"acs":8024,"articleLive":2,"columnArticles":97,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10260,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46550283995990643,"acs":5573,"articleLive":2,"columnArticles":77,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.9359331053,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11972,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3010851091645967,"acs":9212,"articleLive":2,"columnArticles":154,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.8756739138,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":30596,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.41379310344827586,"acs":1356,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.3329152915,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3277,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7421602787456446,"acs":426,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":574,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7270788912579957,"acs":2728,"articleLive":2,"columnArticles":56,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.967905138,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":3752,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8129683437834532,"acs":21264,"articleLive":2,"columnArticles":293,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":26156,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5721619243179819,"acs":7802,"articleLive":2,"columnArticles":135,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13636,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.546637528558657,"acs":5503,"articleLive":2,"columnArticles":109,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10067,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6599648152802211,"acs":5252,"articleLive":2,"columnArticles":83,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3996908763,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7958,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6925133689839572,"acs":259,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":374,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6028481012658228,"acs":2286,"articleLive":2,"columnArticles":34,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3792,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44276094276094274,"acs":7101,"articleLive":2,"columnArticles":133,"formTitle":"[1668]最大重复子字符串","frequency":0.3438572302,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16038,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7572109925051101,"acs":13336,"articleLive":2,"columnArticles":245,"formTitle":"[1669]合并两个链表","frequency":0.2925507746,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17612,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5256968128895684,"acs":4470,"articleLive":2,"columnArticles":79,"formTitle":"[1670]设计前中后队列","frequency":0.3996908763,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8503,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4689329131022062,"acs":2083,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6860251698,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4442,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8500455393156091,"acs":39199,"articleLive":2,"columnArticles":453,"formTitle":"[1672]最富有客户的资产总量","frequency":0.2925507746,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":46114,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35716918540361225,"acs":7752,"articleLive":2,"columnArticles":171,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.3176777246,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21704,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36506800286327845,"acs":2550,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.6026087637,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6985,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4363015924601885,"acs":2685,"articleLive":2,"columnArticles":44,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6154,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7692307692307693,"acs":880,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.6026087637,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1144,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38586559532505477,"acs":2113,"articleLive":2,"columnArticles":35,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":5476,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8288680039276196,"acs":17727,"articleLive":2,"columnArticles":293,"formTitle":"[1678]设计 Goal 解析器","frequency":0.3438572302,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21387,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49740387314061185,"acs":7089,"articleLive":2,"columnArticles":114,"formTitle":"[1679]K 和数对的最大数目","frequency":0.3176777246,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14252,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46717983420740994,"acs":5523,"articleLive":2,"columnArticles":73,"formTitle":"[1680]连接连续二进制数字","frequency":0.3438572302,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11822,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38460307298335467,"acs":2403,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6248,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5233082706766917,"acs":348,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":665,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8975440337385264,"acs":3618,"articleLive":2,"columnArticles":39,"formTitle":"[1683]无效的推文","frequency":0.3996908763,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4031,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8275275322588269,"acs":17508,"articleLive":2,"columnArticles":363,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":21157,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6031097848280195,"acs":3840,"articleLive":2,"columnArticles":88,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6367,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4722411444141689,"acs":2773,"articleLive":2,"columnArticles":50,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5872,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.402317880794702,"acs":972,"articleLive":2,"columnArticles":22,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2416,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8057115545465408,"acs":20229,"articleLive":2,"columnArticles":273,"formTitle":"[1688]比赛中的配对次数","frequency":0.8756739138,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":25107,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8665862623478061,"acs":15089,"articleLive":2,"columnArticles":200,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.3438572302,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17412,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5183507549361208,"acs":4463,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.4607785683,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8610,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.488620621413022,"acs":2469,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5053,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.660958904109589,"acs":193,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":292,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8037162162162163,"acs":2379,"articleLive":2,"columnArticles":35,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2960,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6353157768350276,"acs":7937,"articleLive":2,"columnArticles":139,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12493,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4677511415525114,"acs":6556,"articleLive":2,"columnArticles":136,"formTitle":"[1695]删除子数组的最大得分","frequency":0.3438572302,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":14016,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3980265186555658,"acs":6454,"articleLive":2,"columnArticles":116,"formTitle":"[1696]跳跃游戏 VI","frequency":0.9359331053,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":16215,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5282613880276652,"acs":2215,"articleLive":2,"columnArticles":43,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4193,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5198744769874477,"acs":497,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":956,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8013611229264143,"acs":1884,"articleLive":2,"columnArticles":42,"formTitle":"[1699]两人之间的通话次数","frequency":0.3711664096,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2351,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7068722539998342,"acs":8527,"articleLive":2,"columnArticles":186,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2925507746,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":12063,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6118631178707225,"acs":4023,"articleLive":2,"columnArticles":82,"formTitle":"[1701]平均等待时间","frequency":0.3438572302,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6575,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47889328063241104,"acs":3029,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.4607785683,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6325,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3878942881500426,"acs":1365,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.4295260248,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3519,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7807891087860834,"acs":12388,"articleLive":2,"columnArticles":192,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15866,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3477717617659309,"acs":5845,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.4295260248,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16807,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5886647199362888,"acs":4435,"articleLive":2,"columnArticles":112,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7534,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5029276895943563,"acs":14258,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":2.0968885246,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28350,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7017167381974249,"acs":981,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1398,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7053072625698324,"acs":1515,"articleLive":2,"columnArticles":38,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2148,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.694269340974212,"acs":12115,"articleLive":2,"columnArticles":192,"formTitle":"[1710]卡车上的最大单元数","frequency":1.2675539073,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":17450,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35894061718296166,"acs":30277,"articleLive":2,"columnArticles":362,"formTitle":"[1711]大餐计数","frequency":2.4773523305,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":84351,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26250297218039154,"acs":6624,"articleLive":2,"columnArticles":106,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.5280307953,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":25234,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49521078832944737,"acs":15717,"articleLive":2,"columnArticles":170,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.4115696832,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31738,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6323907455012854,"acs":246,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7306763285024155,"acs":1815,"articleLive":2,"columnArticles":37,"formTitle":"[1715]苹果和橘子的个数","frequency":0.9359331053,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2484,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6710732165206508,"acs":8579,"articleLive":2,"columnArticles":195,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12784,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4353689077249085,"acs":2260,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.4935683911,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5191,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4924224200144335,"acs":2047,"articleLive":2,"columnArticles":50,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4157,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.37283236994219654,"acs":645,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1730,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8689661566991191,"acs":46859,"articleLive":2,"columnArticles":493,"formTitle":"[1720]解码异或后的数组","frequency":0.8756739138,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53925,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6452791414545039,"acs":11304,"articleLive":2,"columnArticles":173,"formTitle":"[1721]交换链表中的节点","frequency":0.3438572302,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":17518,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5165320409262251,"acs":4796,"articleLive":2,"columnArticles":114,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9285,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5060604103425262,"acs":23506,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.5329530755,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":46449,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5660964230171073,"acs":364,"articleLive":2,"columnArticles":12,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":643,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.788638322321172,"acs":10981,"articleLive":2,"columnArticles":150,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13924,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4826847248414195,"acs":5631,"articleLive":2,"columnArticles":109,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11666,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5769867549668874,"acs":3485,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.4607785683,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6040,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.36162827390343955,"acs":1146,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3169,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6203325156718452,"acs":2276,"articleLive":2,"columnArticles":23,"formTitle":"[1729]求关注者的数量","frequency":0.3711664096,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":3669,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5296803652968036,"acs":696,"articleLive":2,"columnArticles":24,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1314,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4648869648869649,"acs":1933,"articleLive":2,"columnArticles":29,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4158,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7912250273013426,"acs":12317,"articleLive":2,"columnArticles":214,"formTitle":"[1732]找到最高海拔","frequency":1.1781910527,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15567,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.46316233903314336,"acs":2194,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4737,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231082369309252,"acs":28066,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":2.8433240495,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38813,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48935185185185187,"acs":1057,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2160,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4488841061151921,"acs":28782,"articleLive":2,"columnArticles":355,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8833144243,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":64119,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31717544448171753,"acs":3782,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11924,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6537476562857274,"acs":28591,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.3297746721,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43734,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4715419110037944,"acs":2734,"articleLive":2,"columnArticles":58,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5798,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7059483726150393,"acs":629,"articleLive":2,"columnArticles":21,"formTitle":"[1740]找到二叉树中的距离","frequency":0.6026087637,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":891,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8412942989214176,"acs":2184,"articleLive":2,"columnArticles":32,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2596,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.70989816700611,"acs":8714,"articleLive":2,"columnArticles":132,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12275,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6966017917825147,"acs":22549,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.2256006308,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32370,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36284757718258026,"acs":28395,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.8433240495,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78256,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48519713764557315,"acs":3458,"articleLive":2,"columnArticles":72,"formTitle":"[1745]回文串分割 IV","frequency":0.4935683911,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7127,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5864570737605804,"acs":970,"articleLive":2,"columnArticles":41,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.1104695421,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":1654,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6988071570576541,"acs":1406,"articleLive":2,"columnArticles":35,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2012,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7459088620342397,"acs":11851,"articleLive":2,"columnArticles":237,"formTitle":"[1748]唯一元素的和","frequency":0.3176777246,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15888,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5308659217877095,"acs":3801,"articleLive":2,"columnArticles":89,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7160,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4567733151803948,"acs":3355,"articleLive":2,"columnArticles":81,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7345,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.47197825177749897,"acs":2257,"articleLive":2,"columnArticles":34,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.4935683911,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4782,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6762524489224742,"acs":9665,"articleLive":2,"columnArticles":113,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.3711664096,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14292,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6295505389465121,"acs":6191,"articleLive":2,"columnArticles":131,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9834,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4223645320197044,"acs":4287,"articleLive":2,"columnArticles":92,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.4607785683,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10150,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4163128779107166,"acs":3236,"articleLive":2,"columnArticles":55,"formTitle":"[1755]最接近目标值的子序列和","frequency":1.0012304478,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7773,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8011472275334608,"acs":419,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":523,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9201498991063707,"acs":3192,"articleLive":2,"columnArticles":33,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3469,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6410123071589531,"acs":7396,"articleLive":2,"columnArticles":115,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11538,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4314534617148097,"acs":4705,"articleLive":2,"columnArticles":99,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10905,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.542257085020243,"acs":4286,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7904,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4353841145833333,"acs":2675,"articleLive":2,"columnArticles":42,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.6026087637,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6144,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7060221870047544,"acs":891,"articleLive":2,"columnArticles":22,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1262,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6067872668629926,"acs":4327,"articleLive":2,"columnArticles":85,"formTitle":"[1763]最长的美好子字符串","frequency":0.3711664096,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":7131,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47568752491032285,"acs":2387,"articleLive":2,"columnArticles":60,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.4935683911,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5018,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.55096011816839,"acs":3730,"articleLive":2,"columnArticles":86,"formTitle":"[1765]地图中的最高点","frequency":1.0012304478,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6770,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37965390665967486,"acs":1448,"articleLive":2,"columnArticles":28,"formTitle":"[1766]互质树","frequency":1.5013798136,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3814,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7957371225577264,"acs":896,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1126,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.762106615285806,"acs":11866,"articleLive":2,"columnArticles":209,"formTitle":"[1768]交替合并字符串","frequency":0.3438572302,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15570,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.855914689592461,"acs":10354,"articleLive":2,"columnArticles":177,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12097,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3712053967690396,"acs":4182,"articleLive":2,"columnArticles":104,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11266,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3661185231151102,"acs":2360,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6446,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5147679324894515,"acs":366,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":711,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427873489328876,"acs":16388,"articleLive":2,"columnArticles":204,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.9052181601,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19445,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5490530473027556,"acs":6117,"articleLive":2,"columnArticles":92,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11141,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4745595798227377,"acs":4337,"articleLive":2,"columnArticles":93,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9139,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.46013039117352056,"acs":1835,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.0723842081,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3988,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7842646649986099,"acs":5642,"articleLive":2,"columnArticles":63,"formTitle":"[1777]每家商店的产品价格","frequency":1.3329152915,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7194,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5081521739130435,"acs":187,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":368,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.647778276481149,"acs":5773,"articleLive":2,"columnArticles":72,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.3438572302,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8912,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6643819428031198,"acs":5622,"articleLive":2,"columnArticles":115,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8462,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5212128774644372,"acs":4177,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8014,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.293480875631465,"acs":1220,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4157,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7936998147004324,"acs":1285,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1619,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42141486024626623,"acs":9001,"articleLive":2,"columnArticles":107,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21359,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35150233214014537,"acs":6481,"articleLive":2,"columnArticles":64,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18438,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34372234785173533,"acs":3496,"articleLive":2,"columnArticles":92,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10171,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6529889951888515,"acs":11808,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.886219629,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18083,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7134502923976608,"acs":244,"articleLive":2,"columnArticles":17,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":342,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7119932432432432,"acs":1686,"articleLive":2,"columnArticles":31,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2368,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6410873225884051,"acs":13325,"articleLive":2,"columnArticles":149,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20785,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8084824902723735,"acs":10389,"articleLive":2,"columnArticles":143,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12850,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5133369205934353,"acs":6678,"articleLive":2,"columnArticles":106,"formTitle":"[1792]最大平均通过率","frequency":1.8833144243,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13009,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4157878249973896,"acs":3982,"articleLive":2,"columnArticles":96,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9577,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5765472312703583,"acs":177,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":307,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7858823529411765,"acs":2004,"articleLive":2,"columnArticles":31,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.9359331053,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2550,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.49000350754121363,"acs":6985,"articleLive":2,"columnArticles":124,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":14255,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.571445624925391,"acs":4787,"articleLive":2,"columnArticles":76,"formTitle":"[1797]设计一个验证系统","frequency":0.9359331053,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":8377,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.523936170212766,"acs":3152,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6016,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5184142114384749,"acs":2393,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.2366872594,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4616,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6819353963083605,"acs":10049,"articleLive":2,"columnArticles":160,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14736,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3808711270767849,"acs":4241,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.3176777246,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11135,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26287229450576555,"acs":4263,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16217,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40883136657784547,"acs":2148,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5254,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5777777777777777,"acs":520,"articleLive":2,"columnArticles":31,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.4935683911,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":900,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4850598865307838,"acs":11542,"articleLive":2,"columnArticles":154,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23795,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.66298833079655,"acs":5227,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7884,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5849302698906391,"acs":5830,"articleLive":2,"columnArticles":90,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9967,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26774020397208803,"acs":2494,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9315,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6278515491998639,"acs":1844,"articleLive":2,"columnArticles":32,"formTitle":"[1809]没有广告的剧集","frequency":0.9359331053,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2937,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6158730158730159,"acs":194,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":315,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.676510989010989,"acs":985,"articleLive":2,"columnArticles":30,"formTitle":"[1811]寻找面试候选人","frequency":0.4935683911,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1456,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7934410646387833,"acs":8347,"articleLive":2,"columnArticles":202,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10520,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5097542674920278,"acs":5435,"articleLive":2,"columnArticles":75,"formTitle":"[1813]句子相似性 III","frequency":1.0360165639,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10662,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34795792665592723,"acs":3672,"articleLive":2,"columnArticles":82,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10553,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2967610649482788,"acs":1750,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5897,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7507139374521139,"acs":10778,"articleLive":2,"columnArticles":165,"formTitle":"[1816]截断句子","frequency":0.3176777246,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":14357,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.7000229515721828,"acs":6100,"articleLive":2,"columnArticles":103,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8714,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3731538982464735,"acs":25898,"articleLive":2,"columnArticles":339,"formTitle":"[1818]绝对差值和","frequency":2.4497098992,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69403,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3760513840036703,"acs":2459,"articleLive":2,"columnArticles":34,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.7268888735,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6539,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5108225108225108,"acs":118,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":231,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.8998266897746967,"acs":2596,"articleLive":2,"columnArticles":24,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2885,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8064975100782547,"acs":20406,"articleLive":2,"columnArticles":205,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":25302,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7183650615901456,"acs":8981,"articleLive":2,"columnArticles":112,"formTitle":"[1823]找出游戏的获胜者","frequency":0.967905138,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":12502,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6539939839572193,"acs":7827,"articleLive":2,"columnArticles":156,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11968,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2853035143769968,"acs":2679,"articleLive":2,"columnArticles":51,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9390,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4325925925925926,"acs":292,"articleLive":2,"columnArticles":23,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":675,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7941058701049091,"acs":9916,"articleLive":2,"columnArticles":145,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12487,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8659181690596999,"acs":8021,"articleLive":2,"columnArticles":103,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9263,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6847789402632467,"acs":4058,"articleLive":2,"columnArticles":85,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5926,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48747913188647746,"acs":876,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1797,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7377675840978594,"acs":965,"articleLive":2,"columnArticles":26,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1308,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8251278392198834,"acs":13877,"articleLive":2,"columnArticles":219,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.3996908763,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16818,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6843648614923883,"acs":43876,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":1.5329530755,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":64112,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3539526574363555,"acs":6340,"articleLive":2,"columnArticles":135,"formTitle":"[1834]单线程 CPU","frequency":0.3996908763,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17912,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.51171875,"acs":3668,"articleLive":2,"columnArticles":61,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.5280307953,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7168,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7247023809523809,"acs":487,"articleLive":2,"columnArticles":29,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.6431001251,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":672,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7957265802750024,"acs":8044,"articleLive":2,"columnArticles":95,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4295260248,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10109,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4292541339275243,"acs":29282,"articleLive":2,"columnArticles":313,"formTitle":"[1838]最高频元素的频数","frequency":3.0708259516,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":68216,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5705721137375813,"acs":6662,"articleLive":2,"columnArticles":129,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11676,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.388607101053453,"acs":1992,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5126,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5226586102719033,"acs":1038,"articleLive":2,"columnArticles":33,"formTitle":"[1841]联赛信息统计","frequency":0.9359331053,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1986,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6612903225806451,"acs":123,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":186,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5142002989536621,"acs":688,"articleLive":2,"columnArticles":25,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1338,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7979148181011535,"acs":7194,"articleLive":2,"columnArticles":120,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9016,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.521459066736574,"acs":6962,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.3438572302,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":13351,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6334986402175652,"acs":27720,"articleLive":2,"columnArticles":377,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.0968885246,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43757,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.361236802413273,"acs":2395,"articleLive":2,"columnArticles":44,"formTitle":"[1847]最近的房间","frequency":1.0723842081,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6630,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6828603085314924,"acs":8012,"articleLive":2,"columnArticles":105,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11733,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.327990775439608,"acs":5689,"articleLive":2,"columnArticles":110,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.4607785683,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17345,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6119628047248052,"acs":2435,"articleLive":2,"columnArticles":50,"formTitle":"[1850]邻位交换的最小次数","frequency":0.5643192472,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3979,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40126632370399684,"acs":2028,"articleLive":2,"columnArticles":49,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.6860251698,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5054,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6945337620578779,"acs":216,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":311,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6435754189944134,"acs":1152,"articleLive":2,"columnArticles":20,"formTitle":"[1853]转换日期格式","frequency":0.3996908763,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1790,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7827900912646676,"acs":12008,"articleLive":2,"columnArticles":126,"formTitle":"[1854]人口最多的年份","frequency":1.2675539073,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":15340,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6760536520246647,"acs":10635,"articleLive":2,"columnArticles":104,"formTitle":"[1855]下标对中的最大距离","frequency":1.2366872594,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15731,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3561165048543689,"acs":4585,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.3711664096,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12875,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.45650869826034796,"acs":2283,"articleLive":2,"columnArticles":33,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5001,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6337522441651705,"acs":353,"articleLive":2,"columnArticles":20,"formTitle":"[1858]包含所有前缀的最长单词","frequency":1.1504269151,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":557,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7670109679480354,"acs":7203,"articleLive":2,"columnArticles":149,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9391,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7698721511951084,"acs":4155,"articleLive":2,"columnArticles":73,"formTitle":"[1860]增长的内存泄露","frequency":0.3438572302,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5397,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6195456184637577,"acs":3436,"articleLive":2,"columnArticles":70,"formTitle":"[1861]旋转盒子","frequency":0.3711664096,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5546,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3122859882207917,"acs":2280,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7301,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8984417714598141,"acs":13146,"articleLive":2,"columnArticles":154,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":2.1917163117,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14632,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3895020422351612,"acs":4482,"articleLive":2,"columnArticles":108,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.967905138,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11507,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.512720343020486,"acs":5381,"articleLive":2,"columnArticles":63,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.3996908763,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10495,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6018858040859089,"acs":2298,"articleLive":2,"columnArticles":50,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.1924322504,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3818,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7370517928286853,"acs":555,"articleLive":2,"columnArticles":16,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":753,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5447316103379721,"acs":274,"articleLive":2,"columnArticles":16,"formTitle":"[1868]两个行程编码数组的积","frequency":0.4935683911,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":503,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7822463768115943,"acs":12954,"articleLive":2,"columnArticles":145,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.5329530755,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16560,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4528537455410226,"acs":7617,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.9052181601,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16820,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27556458897922315,"acs":6101,"articleLive":2,"columnArticles":130,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":22140,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6233576642335766,"acs":2135,"articleLive":2,"columnArticles":31,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3425,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8157708628005658,"acs":2307,"articleLive":2,"columnArticles":35,"formTitle":"[1873]计算特殊奖金","frequency":1.7756837601,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":2828,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8801955990220048,"acs":360,"articleLive":2,"columnArticles":20,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":409,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7375776397515528,"acs":475,"articleLive":2,"columnArticles":20,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":644,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7292993630573248,"acs":6412,"articleLive":2,"columnArticles":102,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8792,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8199623942337825,"acs":31398,"articleLive":2,"columnArticles":403,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.7362263345,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":38292,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4304219823356232,"acs":2193,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5095,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4140997830802603,"acs":1909,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.6026087637,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4610,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.769992993694325,"acs":7693,"articleLive":2,"columnArticles":106,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.3438572302,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9991,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3543452004371082,"acs":6161,"articleLive":2,"columnArticles":64,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17387,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27940520446096656,"acs":3758,"articleLive":2,"columnArticles":112,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13450,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37669027688345136,"acs":1755,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4659,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.690358670615334,"acs":2098,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.2256006308,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3039,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5134168157423972,"acs":287,"articleLive":2,"columnArticles":13,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":559,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5709263854425145,"acs":5522,"articleLive":2,"columnArticles":81,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.9052181601,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9672,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6476307692307692,"acs":5262,"articleLive":2,"columnArticles":67,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.3711664096,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8125,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31987367471238437,"acs":2836,"articleLive":2,"columnArticles":65,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.5280307953,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8866,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27024658905995746,"acs":2159,"articleLive":2,"columnArticles":42,"formTitle":"[1889]装包裹的最小浪费空间","frequency":1.1504269151,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7989,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7190412782956058,"acs":1080,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1502,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.3813300793166565,"acs":625,"articleLive":2,"columnArticles":15,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":1639,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3476959904248953,"acs":581,"articleLive":2,"columnArticles":15,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3996908763,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":1671,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5906432748538012,"acs":31714,"articleLive":2,"columnArticles":418,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.3056048954,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53694,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4574952121884873,"acs":37505,"articleLive":2,"columnArticles":517,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":1.9156274133,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81979,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5353713996968166,"acs":2119,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3958,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5067369654364382,"acs":865,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1707,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.532961169033741,"acs":6492,"articleLive":2,"columnArticles":82,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.9052181601,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12181,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31051123510782686,"acs":4118,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.5643192472,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13262,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6320691949434465,"acs":3800,"articleLive":2,"columnArticles":44,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6012,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4399865138233311,"acs":1305,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":2.0968885246,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2966,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6333541536539663,"acs":1014,"articleLive":2,"columnArticles":37,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1601,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.455,"acs":91,"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":200,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6426843039199871,"acs":7968,"articleLive":2,"columnArticles":106,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":12398,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2857802045681766,"acs":3716,"articleLive":2,"columnArticles":72,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13003,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5819753907549052,"acs":5250,"articleLive":2,"columnArticles":117,"formTitle":"[1905]统计子岛屿","frequency":0.3176777246,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":9021,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4251039068994181,"acs":2557,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.0012304478,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6015,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5714285714285714,"acs":556,"articleLive":2,"columnArticles":20,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":973,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6606498194945848,"acs":183,"articleLive":2,"columnArticles":8,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":277,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3240216102253261,"acs":4918,"articleLive":2,"columnArticles":76,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.3176777246,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":15178,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6763668430335097,"acs":3835,"articleLive":2,"columnArticles":61,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.3438572302,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5670,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5636592266582836,"acs":3586,"articleLive":2,"columnArticles":72,"formTitle":"[1911]最大子序列交替和","frequency":0.9359331053,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6362,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2597072879330944,"acs":1739,"articleLive":2,"columnArticles":39,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6696,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8338150289017341,"acs":8655,"articleLive":2,"columnArticles":96,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.967905138,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":10380,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.443322563274098,"acs":3293,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":1.1924322504,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7428,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3929098966026588,"acs":2926,"articleLive":2,"columnArticles":58,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7447,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5548446069469836,"acs":1214,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.441481672,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2188,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.28689883913764513,"acs":346,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1206,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5182072829131653,"acs":185,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":357,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3937341236240474,"acs":465,"articleLive":2,"columnArticles":14,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1181,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9048231998182782,"acs":11950,"articleLive":2,"columnArticles":111,"formTitle":"[1920]基于排列构建数组","frequency":1.5013798136,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":13207,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3457570919808424,"acs":5631,"articleLive":2,"columnArticles":92,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.9052181601,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16286,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3616727941176471,"acs":4722,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.3438572302,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13056,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23716343143393864,"acs":1515,"articleLive":2,"columnArticles":31,"formTitle":"[1923]最长公共子路径","frequency":1.8219454779,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6388,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6935199021872028,"acs":5105,"articleLive":2,"columnArticles":66,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.5329530755,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7361,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3448402497245685,"acs":3756,"articleLive":2,"columnArticles":64,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10892,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4154256501444766,"acs":1869,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.3996908763,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4499,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.4041694687289845,"acs":2404,"articleLive":2,"columnArticles":40,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":2.0576678114,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5948,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9046005473739085,"acs":13882,"articleLive":2,"columnArticles":119,"formTitle":"[1929]数组串联","frequency":1.2366872594,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":15346,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4822707125809751,"acs":5658,"articleLive":2,"columnArticles":101,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":1.0012304478,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11732,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5618459887308828,"acs":2094,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.6431001251,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3727,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3333333333333333,"acs":1149,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.7644804164,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3447,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5428893905191874,"acs":481,"articleLive":2,"columnArticles":25,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.6431001251,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":886,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7467248908296943,"acs":342,"articleLive":2,"columnArticles":14,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":458,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7362464633762967,"acs":7026,"articleLive":2,"columnArticles":99,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9543,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45167373880245165,"acs":5748,"articleLive":2,"columnArticles":66,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12726,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24535287894816382,"acs":3247,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.9359331053,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13234,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3480861244019139,"acs":1164,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":1.3854759961,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3344,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6325301204819277,"acs":525,"articleLive":2,"columnArticles":16,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":830,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7892644135188867,"acs":397,"articleLive":2,"columnArticles":26,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":503,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7681329998528763,"acs":5221,"articleLive":2,"columnArticles":92,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.2684066756,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6797,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.397566459463034,"acs":3006,"articleLive":2,"columnArticles":69,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7561,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4124234100993028,"acs":1952,"articleLive":2,"columnArticles":54,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4733,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5781808189062929,"acs":2104,"articleLive":2,"columnArticles":56,"formTitle":"[1944]队列中可以看到的人数","frequency":0.9052181601,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3639,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6623161585662803,"acs":6800,"articleLive":2,"columnArticles":79,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.3176777246,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":10267,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30552126585119516,"acs":5445,"articleLive":2,"columnArticles":83,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.9052181601,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17822,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5447682119205298,"acs":4113,"articleLive":2,"columnArticles":91,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7550,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5171339563862928,"acs":996,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.7268888735,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1926,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5242214532871973,"acs":303,"articleLive":2,"columnArticles":14,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":578,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5572519083969466,"acs":146,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":262,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6898395721925134,"acs":387,"articleLive":2,"columnArticles":14,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":561,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5448965674016822,"acs":7191,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.2925507746,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":13197,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3288352808141726,"acs":4362,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13265,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4806930132487827,"acs":4245,"articleLive":2,"columnArticles":70,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.3711664096,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8831,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49689674628549935,"acs":2642,"articleLive":2,"columnArticles":42,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.5280307953,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5317,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.42592592592592593,"acs":161,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.565710672,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":378,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6042807366849179,"acs":4856,"articleLive":2,"columnArticles":59,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8036,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4249457338453832,"acs":2545,"articleLive":2,"columnArticles":45,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5989,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4169184290030212,"acs":1518,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3641,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2807323452484743,"acs":644,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.2834247372,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2294,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5357037037037037,"acs":7232,"articleLive":2,"columnArticles":67,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.3438572302,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13500,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.43453009503695883,"acs":5761,"articleLive":2,"columnArticles":76,"formTitle":"[1962]移除石子使总数最小","frequency":1.2366872594,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13258,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6166531494998648,"acs":4562,"articleLive":2,"columnArticles":56,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.4295260248,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7398,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3869916737058043,"acs":3207,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8287,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7541528239202658,"acs":454,"articleLive":2,"columnArticles":15,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":602,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7536231884057971,"acs":52,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":69,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7801427016567904,"acs":6451,"articleLive":2,"columnArticles":61,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8269,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35930408472012104,"acs":4750,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13220,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.280140831668094,"acs":2944,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":2.1462568906,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10509,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47952970816712154,"acs":2284,"articleLive":2,"columnArticles":51,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.0360165639,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4763,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.556403731976251,"acs":656,"articleLive":2,"columnArticles":21,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":1179,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.46466809421841543,"acs":217,"articleLive":2,"columnArticles":9,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.5280307953,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":467,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.583941605839416,"acs":80,"articleLive":2,"columnArticles":10,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":137,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7362059905412507,"acs":4203,"articleLive":2,"columnArticles":58,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.8756739138,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5709,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3834737768834109,"acs":3049,"articleLive":2,"columnArticles":47,"formTitle":"[1975]最大方阵和","frequency":1.2675539073,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7951,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2927846517447518,"acs":2106,"articleLive":2,"columnArticles":46,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":7193,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24992040751353073,"acs":785,"articleLive":2,"columnArticles":15,"formTitle":"[1977]划分数字的方案数","frequency":1.1924322504,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3141,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5471406491499228,"acs":354,"articleLive":2,"columnArticles":13,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.3711664096,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":647,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8017216081385112,"acs":8196,"articleLive":2,"columnArticles":103,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":10223,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.58408203125,"acs":5981,"articleLive":2,"columnArticles":101,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.9359331053,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10240,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30016281341582546,"acs":4609,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.5997391338,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15355,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.464228079612695,"acs":863,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.7677525773,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1859,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6739130434782609,"acs":62,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":92,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5806265615990774,"acs":6042,"articleLive":2,"columnArticles":66,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10406,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4119886481622482,"acs":5952,"articleLive":2,"columnArticles":84,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":14447,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2786922209695603,"acs":3708,"articleLive":2,"columnArticles":77,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.3711664096,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13305,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4650793650793651,"acs":1465,"articleLive":2,"columnArticles":26,"formTitle":"[1987]不同的好子序列数目","frequency":0.3996908763,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3150,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6556122448979592,"acs":257,"articleLive":2,"columnArticles":7,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.0723842081,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":392,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.49504950495049505,"acs":50,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":101,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6030701754385965,"acs":275,"articleLive":2,"columnArticles":9,"formTitle":"[1990]Count the Number of Experiments","frequency":0.3711664096,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":456,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6600828729281768,"acs":4779,"articleLive":2,"columnArticles":64,"formTitle":"[1991]找到数组的中间位置","frequency":0.2925507746,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":7240,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5950540958268934,"acs":3080,"articleLive":2,"columnArticles":59,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5176,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3855173832544744,"acs":1874,"articleLive":2,"columnArticles":43,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4861,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37061915887850466,"acs":1269,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3424,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5561436672967864,"acs":5884,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10580,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.25149342891278376,"acs":5052,"articleLive":2,"columnArticles":98,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":20088,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34191927124234334,"acs":2177,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.9359331053,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6367,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42243975903614456,"acs":1683,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.4295260248,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3984,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.616822429906542,"acs":66,"articleLive":2,"columnArticles":6,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":107,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.774888558692422,"acs":7301,"articleLive":2,"columnArticles":96,"formTitle":"[2000]反转单词前缀","frequency":0.3438572302,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":9422,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3603305785123967,"acs":5886,"articleLive":2,"columnArticles":128,"formTitle":"[2001]可互换矩形的组数","frequency":0.3176777246,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16335,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5748549929456027,"acs":3667,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6379,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.39258959303502733,"acs":1939,"articleLive":2,"columnArticles":41,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4939,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.40988372093023256,"acs":141,"articleLive":2,"columnArticles":5,"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":344,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6739130434782609,"acs":31,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":46,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8738738738738738,"acs":4559,"articleLive":2,"columnArticles":60,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":5217,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.30231372948731017,"acs":2966,"articleLive":2,"columnArticles":55,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.3176777246,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9811,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4199484725800515,"acs":2282,"articleLive":2,"columnArticles":41,"formTitle":"[2008]出租车的最大盈利","frequency":0.8756739138,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5434,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.41969378564995496,"acs":1398,"articleLive":2,"columnArticles":40,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3331,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6612903225806451,"acs":123,"articleLive":2,"columnArticles":5,"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":186,"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.897460355311792,"acs":7527,"articleLive":2,"columnArticles":70,"formTitle":"[2011]执行操作后的变量值","frequency":0.3176777246,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":8387,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.36008040874445096,"acs":4299,"articleLive":2,"columnArticles":78,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11939,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.3336440974245426,"acs":2863,"articleLive":2,"columnArticles":51,"formTitle":"[2013]检测正方形","frequency":0.4295260248,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8581,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5258215962441315,"acs":1456,"articleLive":2,"columnArticles":25,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2769,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7746478873239436,"acs":55,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":71,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5523737754333082,"acs":5864,"articleLive":2,"columnArticles":78,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.3176777246,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":10616,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3508688633558067,"acs":3695,"articleLive":2,"columnArticles":96,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10531,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4096898439083722,"acs":2021,"articleLive":2,"columnArticles":51,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.3711664096,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4933,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3520813473149031,"acs":1108,"articleLive":2,"columnArticles":34,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.4607785683,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3147,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7966804979253111,"acs":192,"articleLive":2,"columnArticles":8,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":241,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7127659574468085,"acs":67,"articleLive":2,"columnArticles":6,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":94,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6542553191489362,"acs":3321,"articleLive":2,"columnArticles":40,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":5076,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7482161060142711,"acs":2936,"articleLive":2,"columnArticles":46,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3924,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.48675429726996966,"acs":2407,"articleLive":2,"columnArticles":63,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4945,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2615417196103346,"acs":1235,"articleLive":2,"columnArticles":41,"formTitle":"[2025]分割数组的最多方案数","frequency":0.4295260248,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4722,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8931750741839762,"acs":301,"articleLive":2,"columnArticles":12,"formTitle":"[2026]Low-Quality Problems","frequency":0.3438572302,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":337,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5545311173116584,"acs":4571,"articleLive":2,"columnArticles":48,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":8243,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4257738471257107,"acs":4044,"articleLive":2,"columnArticles":58,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9498,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22858359050760882,"acs":2148,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.3438572302,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9397,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.34339948231233824,"acs":1194,"articleLive":2,"columnArticles":39,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.4607785683,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3477,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6031746031746031,"acs":38,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.0,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":63,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6627412495911024,"acs":6078,"articleLive":2,"columnArticles":96,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":9171,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3927194055121814,"acs":4175,"articleLive":2,"columnArticles":84,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.4607785683,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":10631,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.3035296411856474,"acs":3113,"articleLive":2,"columnArticles":65,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":10256,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.31671041119860016,"acs":1810,"articleLive":2,"columnArticles":42,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.1634548151,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5715,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.5145631067961165,"acs":53,"articleLive":2,"columnArticles":6,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":103,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.830005120327701,"acs":3242,"articleLive":2,"columnArticles":48,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":3906,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5005289139633287,"acs":2839,"articleLive":2,"columnArticles":60,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":5672,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.35212401852224684,"acs":1749,"articleLive":2,"columnArticles":43,"formTitle":"[2039]网络空闲的时刻","frequency":0.2451822226,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":4967,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.31676829268292683,"acs":1039,"articleLive":2,"columnArticles":20,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3280,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6512820512820513,"acs":127,"articleLive":2,"columnArticles":8,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":195,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6756504612833005,"acs":6518,"articleLive":2,"columnArticles":100,"formTitle":"[2042]检查句子中的数字是否递增","frequency":0.6714306317,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":9647,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5951693054431989,"acs":5150,"articleLive":2,"columnArticles":61,"formTitle":"[2043]简易银行系统","frequency":0.0817274075,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":8653,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.745442813356993,"acs":4621,"articleLive":2,"columnArticles":94,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6199,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.3271386883735217,"acs":2130,"articleLive":2,"columnArticles":59,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.2925507746,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":6511,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6486486486486487,"acs":96,"articleLive":2,"columnArticles":13,"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":148,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.27823013318184686,"acs":4408,"articleLive":2,"columnArticles":96,"formTitle":"[2047]句子中的有效单词数","frequency":0.1225911113,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":15843,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.406994369857081,"acs":3759,"articleLive":2,"columnArticles":85,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9236,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.3871802679658953,"acs":2543,"articleLive":2,"columnArticles":89,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":6568,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.5581251927227875,"acs":1810,"articleLive":2,"columnArticles":61,"formTitle":"[2050]并行课程 III","frequency":0.0,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3243,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.7419354838709677,"acs":92,"articleLive":2,"columnArticles":5,"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":124,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5238095238095238,"acs":22,"articleLive":2,"columnArticles":5,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":42,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7590123456790123,"acs":3074,"articleLive":2,"columnArticles":49,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":4050,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.3100991325898389,"acs":2002,"articleLive":2,"columnArticles":52,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":6456,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.37858149365899485,"acs":1612,"articleLive":2,"columnArticles":53,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.9052181601,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":4258,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.5892857142857143,"acs":495,"articleLive":2,"columnArticles":13,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":840,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7755888016590134,"acs":5236,"articleLive":2,"columnArticles":28,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":6751,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.5703065619457816,"acs":4502,"articleLive":2,"columnArticles":59,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":7894,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.4145108891830105,"acs":3445,"articleLive":2,"columnArticles":87,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":8311,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.3366422097539922,"acs":780,"articleLive":2,"columnArticles":16,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2317,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.5588235294117647,"acs":19,"articleLive":2,"columnArticles":3,"formTitle":"[2061]Number of Spaces Cleaning Robot Cleaned","frequency":0.0,"frontendQuestionId":"2061","leaf":true,"level":2,"nodeType":"def","questionId":"2203","status":"","submitted":34,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.5909479077711358,"acs":2768,"articleLive":2,"columnArticles":26,"formTitle":"[5918]统计字符串中的元音子字符串","frequency":0.0,"frontendQuestionId":"5918","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":4684,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.42084406578165245,"acs":2124,"articleLive":2,"columnArticles":44,"formTitle":"[5919]所有子字符串中的元音","frequency":0.0,"frontendQuestionId":"5919","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":5047,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.3268206039076377,"acs":1288,"articleLive":2,"columnArticles":16,"formTitle":"[5920]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"5920","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"","submitted":3941,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.4823943661971831,"acs":685,"articleLive":2,"columnArticles":22,"formTitle":"[5921]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"5921","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":1420,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8452890958078269,"acs":81884,"articleLive":2,"columnArticles":631,"formTitle":"[LCP 01]猜数字","frequency":0.9052181601,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96871,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.691028250831637,"acs":13918,"articleLive":2,"columnArticles":241,"formTitle":"[LCP 02]分式化简","frequency":1.5329530755,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20141,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2201363539795662,"acs":11398,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 03]机器人大冒险","frequency":0.8756739138,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51777,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3799089356858281,"acs":2670,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7028,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20040214477211796,"acs":2093,"articleLive":2,"columnArticles":51,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10444,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8397942589160773,"acs":44410,"articleLive":2,"columnArticles":673,"formTitle":"[LCP 06]拿硬币","frequency":1.5013798136,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52882,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.768515295664617,"acs":39743,"articleLive":2,"columnArticles":482,"formTitle":"[LCP 07]传递信息","frequency":3.2667310856,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":51714,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2906832996178917,"acs":5173,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 08]剧情触发时间","frequency":0.967905138,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17796,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27637296693291397,"acs":6678,"articleLive":2,"columnArticles":110,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.0631698886,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24163,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5924155513065646,"acs":1859,"articleLive":2,"columnArticles":36,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.7104716115,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3138,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6915934011656624,"acs":7001,"articleLive":2,"columnArticles":72,"formTitle":"[LCP 11]期望个数统计","frequency":0.3996908763,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10123,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4131452468634917,"acs":6619,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 12]小张刷题计划","frequency":1.2675539073,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16021,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.611792026835247,"acs":9484,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15502,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2114689830117611,"acs":2751,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":1.9839016612,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13009,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5791201575837164,"acs":882,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.0012304478,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1523,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30713596914175506,"acs":637,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.2366872594,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2074,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7988423538804431,"acs":24014,"articleLive":2,"columnArticles":255,"formTitle":"[LCP 17]速算机器人","frequency":1.2675539073,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":30061,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2880203225235944,"acs":17914,"articleLive":2,"columnArticles":235,"formTitle":"[LCP 18]早餐组合","frequency":1.9222298405,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":62197,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162799205602592,"acs":19757,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.403741344,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38268,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.31288659793814433,"acs":1821,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5820,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.31943381790359604,"acs":835,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2614,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3343417945690673,"acs":9062,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":1.9491276429,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27104,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3401111391765597,"acs":2693,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.4607785683,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7918,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2818955042527339,"acs":928,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3292,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3354072398190045,"acs":1186,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3536,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3372711163614885,"acs":571,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.8197934554,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1693,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3277027027027027,"acs":1261,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3848,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.284452904010363,"acs":10760,"articleLive":2,"columnArticles":181,"formTitle":"[LCP 28]采购方案","frequency":0.2925507746,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":37827,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1887597733304641,"acs":5263,"articleLive":2,"columnArticles":128,"formTitle":"[LCP 29]乐团站位","frequency":2.4162539713,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27882,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3512857836001941,"acs":5792,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16488,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25456389452332656,"acs":1757,"articleLive":2,"columnArticles":36,"formTitle":"[LCP 31]变换的迷宫","frequency":2.0968885246,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6902,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4075882794891059,"acs":1085,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":1.2366872594,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2662,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22013397841458876,"acs":4732,"articleLive":2,"columnArticles":87,"formTitle":"[LCP 33]蓄水","frequency":1.2996010848,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21496,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4867431737237831,"acs":2460,"articleLive":2,"columnArticles":62,"formTitle":"[LCP 34]二叉树染色","frequency":1.9491276429,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5054,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.4017207147584381,"acs":1214,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":1.2834247372,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3022,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2641509433962264,"acs":812,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.7706176193,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3074,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19636274268862128,"acs":799,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":1.8833144243,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4069,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5654692931633836,"acs":488,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":1.6351347948,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":863,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5089633671083398,"acs":3918,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 39]无人机方阵","frequency":0.3176777246,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7698,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23544445331842503,"acs":2948,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12521,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4198473282442748,"acs":1320,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3144,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.20084647941515968,"acs":1044,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5198,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.40080563947633435,"acs":398,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":993,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8317214700193424,"acs":2580,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":3102,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.1915233197375421,"acs":1080,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5639,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.37256562235393736,"acs":880,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2362,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3595258999122037,"acs":819,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2278,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.1570203644158628,"acs":293,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":1.0012304478,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1866,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22949526813880125,"acs":291,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1268,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5426556991774383,"acs":4618,"articleLive":2,"columnArticles":102,"formTitle":"[LCS 01]下载插件","frequency":1.5013798136,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":8510,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6856248849622676,"acs":3725,"articleLive":2,"columnArticles":70,"formTitle":"[LCS 02]完成一半题目","frequency":0.9052181601,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":5433,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41152815013404825,"acs":1842,"articleLive":2,"columnArticles":57,"formTitle":"[LCS 03]主题空间","frequency":0.3996908763,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4476,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6782550706722402,"acs":416998,"articleLive":2,"columnArticles":2854,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.1979977895,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":614810,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40315654774570303,"acs":272837,"articleLive":2,"columnArticles":2162,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.406767313,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":676752,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7605709228595421,"acs":302511,"articleLive":2,"columnArticles":2003,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2659390565,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":397742,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7505512308660987,"acs":318272,"articleLive":2,"columnArticles":2185,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.5683446988,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":424051,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6982755228696215,"acs":195212,"articleLive":2,"columnArticles":1481,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.3787079482,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":279563,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7144130249375668,"acs":279777,"articleLive":2,"columnArticles":1759,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.5432475732,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":391618,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3604324605760356,"acs":274137,"articleLive":2,"columnArticles":1904,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.6568717164,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":760578,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.444683283786874,"acs":204183,"articleLive":2,"columnArticles":1357,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.3702283508,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":459165,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49252503085996435,"acs":272916,"articleLive":2,"columnArticles":1672,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0603802205,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":554116,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4522633640201414,"acs":177839,"articleLive":2,"columnArticles":1181,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.5141184743,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":393220,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5269728438622318,"acs":184001,"articleLive":2,"columnArticles":1759,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.4803201642,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":349166,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5695452147820043,"acs":163042,"articleLive":2,"columnArticles":1345,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.677266304,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":286267,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31238907414493705,"acs":85718,"articleLive":2,"columnArticles":501,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.2684066756,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":274395,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7474241838691565,"acs":205005,"articleLive":2,"columnArticles":1281,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.3749086861,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":274282,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3404394510040735,"acs":128537,"articleLive":2,"columnArticles":786,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.0975744569,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":377562,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7774415571991763,"acs":154410,"articleLive":2,"columnArticles":1147,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.1794440751,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":198613,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5969777664289493,"acs":196383,"articleLive":2,"columnArticles":1507,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.3983125159,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":328962,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37775241565111467,"acs":68845,"articleLive":2,"columnArticles":460,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.6071222572,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":182249,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2431842999550361,"acs":79504,"articleLive":2,"columnArticles":882,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.9267946423,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":326929,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6435371028787705,"acs":201996,"articleLive":2,"columnArticles":1695,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.528281011,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":313884,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7982899511710374,"acs":269917,"articleLive":2,"columnArticles":2503,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.937102925,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":338119,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7426206374838156,"acs":306282,"articleLive":2,"columnArticles":1900,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1834107315,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":412434,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7279207219160629,"acs":193113,"articleLive":2,"columnArticles":1221,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.2216903342,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":265294,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4655929542969871,"acs":152464,"articleLive":2,"columnArticles":1233,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.3438510128,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":327462,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.792144837735879,"acs":199691,"articleLive":2,"columnArticles":1456,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.6115529247,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":252089,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5797749652541621,"acs":156850,"articleLive":2,"columnArticles":1138,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.3749086861,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":270536,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43974330033216164,"acs":149996,"articleLive":2,"columnArticles":1514,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.767080333,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":341099,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5655059395808925,"acs":152526,"articleLive":2,"columnArticles":1016,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.7921701777,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":269716,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.61615788696441,"acs":116826,"articleLive":2,"columnArticles":972,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1719612822,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":189604,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6431026346484315,"acs":144455,"articleLive":2,"columnArticles":1007,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.6616961327,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":224622,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6867199678662624,"acs":143611,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.5248897977,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":209126,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5886471594590689,"acs":126276,"articleLive":2,"columnArticles":1191,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.4022701741,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":214519,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5524200380278244,"acs":117376,"articleLive":2,"columnArticles":983,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.3224582801,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":212476,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.577351855546688,"acs":138897,"articleLive":2,"columnArticles":900,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.9407650354,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":240576,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7191064238421753,"acs":128052,"articleLive":2,"columnArticles":883,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.7176391298,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":178071,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544094658618119,"acs":108844,"articleLive":2,"columnArticles":934,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.0263971276,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":166324,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5615489254928495,"acs":79672,"articleLive":2,"columnArticles":571,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.1014718636,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":141879,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5794960407280205,"acs":162318,"articleLive":2,"columnArticles":1140,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.2628633249,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":280102,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.691847856308736,"acs":174181,"articleLive":2,"columnArticles":1052,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.2103888985,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":251762,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5705668594941952,"acs":256245,"articleLive":2,"columnArticles":1848,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.4252161297,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":449106,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5813193187211081,"acs":66146,"articleLive":2,"columnArticles":488,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.0108756499,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":113786,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6058051867738582,"acs":230209,"articleLive":2,"columnArticles":1554,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.9507797749,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":380005,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48718293878963864,"acs":50668,"articleLive":2,"columnArticles":523,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.7362263345,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":104002,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.416294974724948,"acs":57400,"articleLive":2,"columnArticles":477,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3430892661,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":137883,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5600468658465143,"acs":113764,"articleLive":2,"columnArticles":841,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.1600823861,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":203133,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5340798732387168,"acs":125387,"articleLive":2,"columnArticles":1491,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4224831409,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":234772,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6888687492746975,"acs":124657,"articleLive":2,"columnArticles":1035,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.5248897977,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":180959,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46439347154830174,"acs":157917,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.3725227016,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":340050,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6512970980785058,"acs":91009,"articleLive":2,"columnArticles":533,"formTitle":"[剑指 Offer 49]丑数","frequency":2.8950323292,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":139735,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6152401272550626,"acs":161479,"articleLive":2,"columnArticles":1089,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.0041328322,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":262465,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48340270813585556,"acs":105565,"articleLive":2,"columnArticles":868,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.8560718234,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":218379,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6503671430314601,"acs":181217,"articleLive":2,"columnArticles":1075,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.901695023,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":278638,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5368973204057264,"acs":199183,"articleLive":2,"columnArticles":1648,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.7464150827,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":370989,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44752350589954465,"acs":177013,"articleLive":2,"columnArticles":1526,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":3.0392110952,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":395539,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7579892021379586,"acs":168335,"articleLive":2,"columnArticles":1176,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8833144243,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":222081,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7901889236748354,"acs":182988,"articleLive":2,"columnArticles":1297,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.49818696,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":231575,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5886418830562301,"acs":141795,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.0673180673,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":240885,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6968340374665268,"acs":118921,"articleLive":2,"columnArticles":1059,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":2.9898318925,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":170659,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8013362456636258,"acs":93552,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.6496995731,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":116745,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6672260814425273,"acs":139946,"articleLive":2,"columnArticles":877,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.901695023,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":209743,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7079937969794846,"acs":143356,"articleLive":2,"columnArticles":1882,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.7706176193,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":202482,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4420773784216895,"acs":135174,"articleLive":2,"columnArticles":1015,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.7112177374,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":305770,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8579786664764011,"acs":216450,"articleLive":2,"columnArticles":1854,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.3983125159,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":252279,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4440468530458419,"acs":135262,"articleLive":2,"columnArticles":1224,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.2054229358,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":304612,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4755167334835494,"acs":97499,"articleLive":2,"columnArticles":1080,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.4047973425,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":205038,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5625657027482521,"acs":67428,"articleLive":2,"columnArticles":601,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.3430892661,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":119858,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45971925606694203,"acs":107846,"articleLive":2,"columnArticles":1014,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":2.677266304,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":234591,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.655238624008143,"acs":113296,"articleLive":2,"columnArticles":783,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.6345825322,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":172908,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.634288168785102,"acs":137331,"articleLive":2,"columnArticles":989,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.9091129043,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":216512,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8565531040384743,"acs":142127,"articleLive":2,"columnArticles":1321,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.5083686884,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":165929,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5854267399555857,"acs":74341,"articleLive":2,"columnArticles":515,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.4801304959,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":126986,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597573569407109,"acs":75804,"articleLive":2,"columnArticles":550,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.5083686884,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":126853,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2870987793851718,"acs":71127,"articleLive":2,"columnArticles":577,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.441481672,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":247744,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.694318291348449,"acs":122459,"articleLive":2,"columnArticles":707,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.1504269151,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":176373,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7008486317977138,"acs":121401,"articleLive":2,"columnArticles":710,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.426057651,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":173220,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.20631215364761255,"acs":10871,"articleLive":2,"columnArticles":129,"formTitle":"[剑指 Offer II 001]整数除法","frequency":1.8521106446,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":52692,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5674212884828028,"acs":9750,"articleLive":2,"columnArticles":143,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.1235724549,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":17183,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7831648970193169,"acs":12244,"articleLive":2,"columnArticles":176,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.8197934554,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":15634,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6951404185022027,"acs":10099,"articleLive":2,"columnArticles":115,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.2684066756,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":14528,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7133841951587078,"acs":7574,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.8472224926,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":10617,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.658217558380136,"acs":8907,"articleLive":2,"columnArticles":115,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.8197934554,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":13532,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4506343713956171,"acs":7814,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":1.8521106446,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":17340,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.501387365296509,"acs":7770,"articleLive":2,"columnArticles":103,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":15497,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.552804269839881,"acs":6318,"articleLive":2,"columnArticles":92,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":11429,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.43858213183907324,"acs":6966,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.5013798136,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":15883,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5602720193045958,"acs":5108,"articleLive":2,"columnArticles":75,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":2.0200458196,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":9117,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6654955818162461,"acs":6251,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":9393,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6600123800680904,"acs":4265,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":6462,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5027371354633224,"acs":5051,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":10047,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6332642982316393,"acs":3975,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":6277,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.49246025241763647,"acs":6009,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.5013798136,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":12202,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5152858453072455,"acs":3371,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":6542,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5266135014836796,"acs":5679,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":10784,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4736582964057115,"acs":4810,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.2366872594,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":10155,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7127996381727725,"acs":4728,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.8197934554,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":6633,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5336556621590995,"acs":7064,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.2366872594,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":13237,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.531650460428875,"acs":8256,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.1504269151,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":15529,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7080481472740147,"acs":6000,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.8197934554,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":8474,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7704942511572346,"acs":15480,"articleLive":2,"columnArticles":141,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.4130221531,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":20091,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6039783001808319,"acs":5010,"articleLive":2,"columnArticles":86,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.1274345769,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":8295,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6586239847109412,"acs":5514,"articleLive":2,"columnArticles":94,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.6208058493,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":8372,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6131016233998426,"acs":8573,"articleLive":2,"columnArticles":110,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.6496995731,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":13983,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6299409359382099,"acs":2773,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.8472224926,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":4402,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29694928684627575,"acs":2998,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":10096,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5485772357723577,"acs":2699,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":4920,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5511500171644352,"acs":3211,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":5826,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6000288892098801,"acs":4154,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":6923,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.788235294117647,"acs":3417,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":4335,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5751748251748252,"acs":2961,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":5148,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6748586341887778,"acs":3103,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":4598,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5699715766594216,"acs":3409,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":5981,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.43524841064280667,"acs":3697,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":8494,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7738343771746694,"acs":4448,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":5748,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5126660761736049,"acs":2894,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":5645,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.584173088322466,"acs":1971,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.2996010848,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":3374,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7770965189873418,"acs":3929,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":5056,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8413985305295161,"acs":3321,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.2925507746,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3947,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6597750076010945,"acs":2170,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.2925507746,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":3289,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6489886112527622,"acs":3818,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":5883,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8083314868158653,"acs":3648,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":4513,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7235926628716003,"acs":3432,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.9359331053,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":4743,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6852791878172588,"acs":3375,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":4925,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6925996204933587,"acs":2190,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":3162,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7555793991416309,"acs":3521,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":4660,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6035151791828349,"acs":2644,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":4381,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4145631067961165,"acs":2135,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.2366872594,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":5150,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7453570744782692,"acs":3893,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.2043185188,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":5223,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6418772563176895,"acs":3556,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.3711664096,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":5540,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8548850574712644,"acs":2975,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":3480,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.88881069669247,"acs":2526,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2842,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.716623758734829,"acs":3897,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.8472224926,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":5438,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.36126864104179796,"acs":1720,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":4761,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6064446053584359,"acs":1675,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.3711664096,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2762,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6269995152690256,"acs":2587,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":4126,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6758720930232558,"acs":2790,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.2684066756,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":4128,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5334231805929919,"acs":1979,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":3710,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7691007437457742,"acs":2275,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2958,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7117480823576907,"acs":1763,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":2477,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6251035625517812,"acs":1509,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":2414,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6358620689655172,"acs":1383,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":2175,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6418829740431148,"acs":1459,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":2273,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6676499508357916,"acs":1358,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":2034,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.504254112308565,"acs":3556,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":7052,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7235568869356142,"acs":36714,"articleLive":2,"columnArticles":387,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.3767711771,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":50741,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6576646590246745,"acs":3385,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":5147,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5072046109510087,"acs":1408,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.9359331053,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2776,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42073338847532393,"acs":4578,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.8756739138,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":10881,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5299415774099319,"acs":2177,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":4108,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5594149908592322,"acs":3060,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.2675539073,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":5470,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7122586648057688,"acs":3062,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":4299,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6826766729205753,"acs":5458,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.5997391338,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":7995,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5866246668282045,"acs":4842,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.2925507746,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":8254,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6346153846153846,"acs":3795,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.2366872594,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":5980,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8551610627792147,"acs":3637,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.9359331053,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":4253,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.818809318377912,"acs":2847,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":3477,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.785806214377643,"acs":4274,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":5439,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6502338269680437,"acs":3337,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":5132,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8626373626373627,"acs":3925,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.9359331053,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":4550,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6825261361211863,"acs":3199,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.2675539073,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":4687,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8517543859649123,"acs":3884,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.2069231575,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":4560,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7732610659439928,"acs":2568,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":3321,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6458486407053637,"acs":2637,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.2069231575,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":4083,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7407350922678054,"acs":4857,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":6557,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6198179979777553,"acs":3065,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":4945,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5005219206680585,"acs":1918,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":3832,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7807125307125307,"acs":2542,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":3256,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6854007316262055,"acs":2061,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.2925507746,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":3007,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5755775577557756,"acs":1744,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":3030,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5912828947368421,"acs":1438,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":2432,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6579076862513532,"acs":6685,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.4594899283,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":10161,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49850249584026624,"acs":1498,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.2996010848,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":3005,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5368191721132898,"acs":1232,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.3711664096,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":2295,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7727994915792818,"acs":2432,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":3147,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6983435047951178,"acs":3204,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.7756837601,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":4588,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7386211512717537,"acs":2207,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.3711664096,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2988,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48636779505946937,"acs":2658,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.3996908763,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":5465,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5925682341335087,"acs":1802,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":3041,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.49656181419166057,"acs":3394,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":1.8833144243,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":6835,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5889967637540453,"acs":1456,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.3711664096,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":2472,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6997370727432077,"acs":3992,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.8756739138,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":5705,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5549340791050739,"acs":1389,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":2503,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5372833534864974,"acs":1333,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":2481,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.6026666666666667,"acs":904,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1500,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5909281814363713,"acs":1407,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":2381,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8352459016393443,"acs":2038,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":2440,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6969162995594713,"acs":791,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.3996908763,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1135,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5666131621187801,"acs":1412,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.3176777246,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":2492,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5958549222797928,"acs":1495,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.9052181601,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":2509,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.434918648310388,"acs":695,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1598,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.31029619181946405,"acs":880,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.3438572302,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2836,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6396203306797306,"acs":4178,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":6532,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.631189948263119,"acs":854,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1353,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6987577639751553,"acs":1125,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1610,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4721427598419834,"acs":3466,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.2366872594,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":7341,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7190156737873682,"acs":93032,"articleLive":2,"columnArticles":1574,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.816336759,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":129388,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6460228749675071,"acs":59646,"articleLive":2,"columnArticles":1135,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.4130221531,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":92328,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5798783648800718,"acs":45862,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 01.03]URL化","frequency":1.8219454779,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":79089,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5508377962776393,"acs":41553,"articleLive":2,"columnArticles":796,"formTitle":"[面试题 01.04]回文排列","frequency":1.8521106446,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":75436,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3309401675546137,"acs":33419,"articleLive":2,"columnArticles":572,"formTitle":"[面试题 01.05]一次编辑","frequency":1.441481672,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":100982,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47130987845192757,"acs":74992,"articleLive":2,"columnArticles":1188,"formTitle":"[面试题 01.06]字符串压缩","frequency":2.9174223268,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":159114,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7517915017214116,"acs":67038,"articleLive":2,"columnArticles":976,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.9267946423,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":89171,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6220908550986864,"acs":45040,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 01.08]零矩阵","frequency":0.8756739138,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":72401,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5495571216137584,"acs":34000,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 01.09]字符串轮转","frequency":2.2103888985,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":61868,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6820241055248851,"acs":64735,"articleLive":2,"columnArticles":699,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.3430892661,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":94916,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7805285576447886,"acs":66334,"articleLive":2,"columnArticles":960,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.6305288261,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":84986,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.854948443900372,"acs":72633,"articleLive":2,"columnArticles":692,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.0673180673,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":84956,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.652791675005003,"acs":26096,"articleLive":2,"columnArticles":371,"formTitle":"[面试题 02.04]分割链表","frequency":2.1917163117,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":39976,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4666364604890952,"acs":38106,"articleLive":2,"columnArticles":531,"formTitle":"[面试题 02.05]链表求和","frequency":3.18080449,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":81661,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48365253241928136,"acs":40355,"articleLive":2,"columnArticles":515,"formTitle":"[面试题 02.06]回文链表","frequency":0.7933228787,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":83438,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6846743089779301,"acs":51126,"articleLive":2,"columnArticles":455,"formTitle":"[面试题 02.07]链表相交","frequency":0.2925507746,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":74672,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5331645280432548,"acs":28005,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 02.08]环路检测","frequency":1.9992182418,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":52526,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5365349372679855,"acs":11418,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 03.01]三合一","frequency":0.3438572302,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":21281,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6138659746037631,"acs":26492,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.9156274133,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":43156,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3872187138664058,"acs":8707,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 03.03]堆盘子","frequency":1.2996010848,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":22486,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7129665600812838,"acs":23858,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 03.04]化栈为队","frequency":1.2069231575,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":33463,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5420439378088814,"acs":15026,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 03.05]栈排序","frequency":0.2684066756,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":27721,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5887228763000898,"acs":11151,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 03.06]动物收容所","frequency":0.9052181601,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18941,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5323384534670204,"acs":18264,"articleLive":2,"columnArticles":249,"formTitle":"[面试题 04.01]节点间通路","frequency":1.2996010848,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":34309,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894831178724262,"acs":35237,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1917163117,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":44633,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8073071094419187,"acs":24505,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.2069231575,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":30354,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5852903315589882,"acs":33646,"articleLive":2,"columnArticles":387,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.3711664096,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":57486,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3519435487135205,"acs":26085,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.9052181601,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":74117,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5915206687278141,"acs":20663,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 04.06]后继者","frequency":0.8756739138,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34932,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7164253827860987,"acs":17172,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.2675539073,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23969,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47581544466127684,"acs":6827,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.4295260248,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14348,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.716977884863609,"acs":16664,"articleLive":2,"columnArticles":260,"formTitle":"[面试题 04.10]检查子树","frequency":0.9359331053,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":23242,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4858173206308197,"acs":18052,"articleLive":2,"columnArticles":264,"formTitle":"[面试题 04.12]求和路径","frequency":1.6795668033,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":37158,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5044862818318552,"acs":9727,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":19281,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6913623289462215,"acs":7932,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.3438572302,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11473,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38419646526921497,"acs":11217,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 05.03]翻转数位","frequency":1.0012304478,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":29196,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3850655760823579,"acs":5461,"articleLive":2,"columnArticles":140,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":14182,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5288041319030592,"acs":11979,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 05.06]整数转换","frequency":1.2675539073,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22653,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7042936702796575,"acs":11761,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.07]配对交换","frequency":0.3996908763,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16699,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5523351854632828,"acs":3678,"articleLive":2,"columnArticles":73,"formTitle":"[面试题 05.08]绘制直线","frequency":0.9359331053,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6659,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36319112428992656,"acs":43604,"articleLive":2,"columnArticles":480,"formTitle":"[面试题 08.01]三步问题","frequency":1.7104716115,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":120058,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3609185565539866,"acs":12652,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.9359331053,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":35055,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6758802067889695,"acs":52426,"articleLive":2,"columnArticles":437,"formTitle":"[面试题 08.03]魔术索引","frequency":0.3438572302,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77567,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8199552165167558,"acs":21605,"articleLive":2,"columnArticles":336,"formTitle":"[面试题 08.04]幂集","frequency":2.2410640594,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":26349,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6785161818678153,"acs":22370,"articleLive":2,"columnArticles":496,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32969,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6559300341296929,"acs":24600,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.0968885246,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":37504,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813685536455246,"acs":21963,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.7424845884,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26992,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7180979900565164,"acs":16899,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":1.2069231575,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23533,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.814065230052417,"acs":22364,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 08.09]括号","frequency":2.7706176193,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":27472,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5577484803031499,"acs":14130,"articleLive":2,"columnArticles":224,"formTitle":"[面试题 08.10]颜色填充","frequency":0.9052181601,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":25334,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4947879275191684,"acs":34460,"articleLive":2,"columnArticles":336,"formTitle":"[面试题 08.11]硬币","frequency":1.7424845884,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":69646,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7610409052881864,"acs":17284,"articleLive":2,"columnArticles":301,"formTitle":"[面试题 08.12]八皇后","frequency":2.0968885246,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22711,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5032317636195752,"acs":7085,"articleLive":2,"columnArticles":93,"formTitle":"[面试题 08.13]堆箱子","frequency":1.3329152915,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14079,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5346115537848606,"acs":4294,"articleLive":2,"columnArticles":76,"formTitle":"[面试题 08.14]布尔运算","frequency":1.2675539073,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8032,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5550065621863661,"acs":57512,"articleLive":2,"columnArticles":2381,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.3531900672,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":103624,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.740168301759134,"acs":35007,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 10.02]变位词组","frequency":2.9174223268,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":47296,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39434712458222887,"acs":13687,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.7384811777,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":34708,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5538169748696065,"acs":19856,"articleLive":2,"columnArticles":260,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.9052181601,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35853,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45434085794175816,"acs":13324,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.2996010848,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":29326,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6234552008238929,"acs":4843,"articleLive":2,"columnArticles":90,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7768,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6664715719063545,"acs":7971,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 10.11]峰与谷","frequency":1.8833144243,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11960,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8296776654587068,"acs":26100,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 16.01]交换数字","frequency":0.2925507746,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":31458,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7652186983315797,"acs":15273,"articleLive":2,"columnArticles":202,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19959,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.441800878477306,"acs":9656,"articleLive":2,"columnArticles":234,"formTitle":"[面试题 16.03]交点","frequency":0.4607785683,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21856,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4591120769947221,"acs":7394,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":16105,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4635733781230317,"acs":11040,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.3176777246,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23815,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.423548520653524,"acs":13299,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.06]最小差","frequency":1.8833144243,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":31399,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7319745781284243,"acs":20040,"articleLive":2,"columnArticles":298,"formTitle":"[面试题 16.07]最大数值","frequency":1.5013798136,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":27378,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3755341034973888,"acs":2373,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6319,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.547711781888997,"acs":2250,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 16.09]运算","frequency":0.2925507746,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4108,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6801119735335285,"acs":10690,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.10]生存人数","frequency":0.9052181601,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15718,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4407845654700973,"acs":50811,"articleLive":2,"columnArticles":590,"formTitle":"[面试题 16.11]跳水板","frequency":1.2366872594,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":115274,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4273164609914244,"acs":2043,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4781,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5499478934047938,"acs":3694,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.9359331053,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6717,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5029907558455683,"acs":9250,"articleLive":2,"columnArticles":234,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.3438572302,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":18390,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4545776100925544,"acs":15422,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 16.16]部分排序","frequency":1.2996010848,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33926,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5996081104106321,"acs":35191,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 16.17]连续数列","frequency":2.3056048954,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":58690,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3436489399928135,"acs":15302,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.18]模式匹配","frequency":0.967905138,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44528,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6121145830253939,"acs":20706,"articleLive":2,"columnArticles":367,"formTitle":"[面试题 16.19]水域大小","frequency":1.7104716115,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33827,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7225447316103379,"acs":9086,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 16.20]T9键盘","frequency":1.2675539073,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12575,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4639916721869973,"acs":9806,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":21134,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5875155537121526,"acs":2833,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.4295260248,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4822,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47318504656998256,"acs":11126,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.24]数对和","frequency":0.3438572302,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23513,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5453492987562847,"acs":32974,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.7832443105,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":60464,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3887216484143873,"acs":14979,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 16.26]计算器","frequency":2.3056048954,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":38534,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.59704049103107,"acs":12548,"articleLive":2,"columnArticles":175,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.2675539073,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":21017,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.640780776797754,"acs":28987,"articleLive":2,"columnArticles":469,"formTitle":"[面试题 17.04]消失的数字","frequency":1.7424845884,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":45237,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38898427305816907,"acs":5664,"articleLive":2,"columnArticles":98,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.9052181601,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14561,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.45200224550898205,"acs":4831,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.8472224926,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10688,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4113511263240668,"acs":8893,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.9052181601,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21619,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27184372901946996,"acs":8503,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7756837601,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":31279,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.548799512956128,"acs":14423,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.9156274133,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":26281,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705935934416274,"acs":67653,"articleLive":2,"columnArticles":939,"formTitle":"[面试题 17.10]主要元素","frequency":2.7706176193,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":118566,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6869358890853261,"acs":14765,"articleLive":2,"columnArticles":269,"formTitle":"[面试题 17.11]单词距离","frequency":1.5329530755,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21494,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6329765090692834,"acs":21287,"articleLive":2,"columnArticles":298,"formTitle":"[面试题 17.12]BiNode","frequency":0.9359331053,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33630,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5516881154008579,"acs":24821,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 17.13]恢复空格","frequency":1.7756837601,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44991,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5967198878698315,"acs":78335,"articleLive":2,"columnArticles":765,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5483221879,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":131276,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40402969247083775,"acs":6096,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":1.8101556691,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":15088,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5181767853847573,"acs":61776,"articleLive":2,"columnArticles":1150,"formTitle":"[面试题 17.16]按摩师","frequency":1.7104716115,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":119218,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44559698640607087,"acs":8162,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 17.17]多次搜索","frequency":0.8756739138,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":18317,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44397197101275676,"acs":7413,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.18]最短超串","frequency":1.5329530755,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16697,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5777215518359933,"acs":8905,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.3711664096,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15414,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5736257476502421,"acs":4028,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 17.20]连续中值","frequency":0.3438572302,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7022,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.635834116608277,"acs":44647,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.4894502279,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70218,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37718098553607693,"acs":9101,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":1.2996010848,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":24129,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3775910364145658,"acs":4718,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3711664096,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12495,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5225579375599945,"acs":11432,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.7030242876,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":21877,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5060975609756098,"acs":1660,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.2366872594,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3280,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3436694971853831,"acs":3602,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.3996908763,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10481,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.5382950062542096,"acs":22378,"articleLive":2,"columnArticles":187,"formTitle":"[375]猜数字大小 II","frequency":1.4301900306,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":41572,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.5217438585085489,"acs":2667596,"articleLive":2,"columnArticles":14802,"formTitle":"[1]两数之和","frequency":4.6887670946,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":5112846,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4099363450352577,"acs":1057637,"articleLive":2,"columnArticles":7480,"formTitle":"[2]两数相加","frequency":4.6543046905,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2580003,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3819700288758339,"acs":1319627,"articleLive":2,"columnArticles":7866,"formTitle":"[3]无重复字符的最长子串","frequency":4.5509174779,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3454792,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4096263826196309,"acs":546578,"articleLive":2,"columnArticles":4066,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.4184142711,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1334333,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35685066300125673,"acs":781706,"articleLive":2,"columnArticles":4215,"formTitle":"[5]最长回文子串","frequency":4.4973792883,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2190569,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.508338503083604,"acs":320390,"articleLive":2,"columnArticles":2611,"formTitle":"[6]Z 字形变换","frequency":3.5767616036,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":630269,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35150804270781427,"acs":878955,"articleLive":2,"columnArticles":5498,"formTitle":"[7]整数反转","frequency":4.5164550737,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2500526,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2172316611164183,"acs":364972,"articleLive":2,"columnArticles":2806,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.3231603907,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1680105,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5823993799925374,"acs":810089,"articleLive":2,"columnArticles":5136,"formTitle":"[9]回文数","frequency":3.612058555,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1390951,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3156315539028216,"acs":214911,"articleLive":2,"columnArticles":1289,"formTitle":"[10]正则表达式匹配","frequency":4.1626360651,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":680892,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6249541649179386,"acs":565846,"articleLive":2,"columnArticles":3195,"formTitle":"[11]盛最多水的容器","frequency":4.1712159994,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":905420,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6641341118938895,"acs":237938,"articleLive":2,"columnArticles":1857,"formTitle":"[12]整数转罗马数字","frequency":3.3827273612,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":358268,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.631134171557736,"acs":491420,"articleLive":2,"columnArticles":4034,"formTitle":"[13]罗马数字转整数","frequency":3.8663110955,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":778630,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41186141417610855,"acs":657108,"articleLive":2,"columnArticles":4106,"formTitle":"[14]最长公共前缀","frequency":4.4506380028,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1595459,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3384376852834298,"acs":699814,"articleLive":2,"columnArticles":3301,"formTitle":"[15]三数之和","frequency":4.3830740948,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":2067778,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4584982416278934,"acs":274441,"articleLive":2,"columnArticles":1505,"formTitle":"[16]最接近的三数之和","frequency":3.9200470264,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":598565,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5738617445152328,"acs":360209,"articleLive":2,"columnArticles":3254,"formTitle":"[17]电话号码的字母组合","frequency":3.6294999703,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":627693,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.3951889453571954,"acs":233825,"articleLive":2,"columnArticles":1615,"formTitle":"[18]四数之和","frequency":3.33179986,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":591679,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.43071478532353175,"acs":557904,"articleLive":2,"columnArticles":4165,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.4741562762,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1295298,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4452696996135574,"acs":829834,"articleLive":2,"columnArticles":5861,"formTitle":"[20]有效的括号","frequency":4.336424886,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1863666,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6671687949360203,"acs":760449,"articleLive":2,"columnArticles":3668,"formTitle":"[21]合并两个有序链表","frequency":3.9851262737,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1139815,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727156137135576,"acs":373557,"articleLive":2,"columnArticles":2792,"formTitle":"[22]括号生成","frequency":4.2934686321,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":483434,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5608544129933714,"acs":345041,"articleLive":2,"columnArticles":2219,"formTitle":"[23]合并K个升序链表","frequency":3.8450071461,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":615206,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7037092303068643,"acs":334834,"articleLive":2,"columnArticles":2632,"formTitle":"[24]两两交换链表中的节点","frequency":2.8117065276,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":475813,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6579218093106269,"acs":243662,"articleLive":2,"columnArticles":2300,"formTitle":"[25]K 个一组翻转链表","frequency":4.3723027714,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":370351,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5375089217750008,"acs":860777,"articleLive":2,"columnArticles":4767,"formTitle":"[26]删除有序数组中的重复项","frequency":3.5906134615,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1601419,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5963604255903286,"acs":512635,"articleLive":2,"columnArticles":4319,"formTitle":"[27]移除元素","frequency":3.2078325346,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":859606,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40425689821237354,"acs":495680,"articleLive":2,"columnArticles":3381,"formTitle":"[28]实现 strStr()","frequency":3.0126628353,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1226151,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21972378876263476,"acs":133754,"articleLive":2,"columnArticles":1057,"formTitle":"[29]两数相除","frequency":3.3157733052,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":608737,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.36038081477850303,"acs":83808,"articleLive":2,"columnArticles":631,"formTitle":"[30]串联所有单词的子串","frequency":2.7631425209,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":232554,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3727710563775039,"acs":228096,"articleLive":2,"columnArticles":1847,"formTitle":"[31]下一个排列","frequency":3.4957788777,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":611893,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35681805313742976,"acs":201665,"articleLive":2,"columnArticles":1364,"formTitle":"[32]最长有效括号","frequency":3.7128843253,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":565176,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42875920749744323,"acs":389469,"articleLive":2,"columnArticles":2577,"formTitle":"[33]搜索旋转排序数组","frequency":3.2223903736,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":908363,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4228606834405898,"acs":369217,"articleLive":2,"columnArticles":3517,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.4553366499,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":873141,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46118464102619605,"acs":553963,"articleLive":2,"columnArticles":4199,"formTitle":"[35]搜索插入位置","frequency":3.5430012733,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1201174,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6389103863036196,"acs":216298,"articleLive":2,"columnArticles":1533,"formTitle":"[36]有效的数独","frequency":3.4131896618,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":338542,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6710275091068961,"acs":106841,"articleLive":2,"columnArticles":900,"formTitle":"[37]解数独","frequency":2.8766994852,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":159220,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5965245926992765,"acs":246855,"articleLive":2,"columnArticles":2626,"formTitle":"[38]外观数列","frequency":1.3556655281,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"ac","submitted":413822,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7274018397979926,"acs":357494,"articleLive":2,"columnArticles":2068,"formTitle":"[39]组合总和","frequency":3.4131896618,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":491467,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6193765466685344,"acs":212243,"articleLive":2,"columnArticles":1459,"formTitle":"[40]组合总和 II","frequency":2.8428305458,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":342672,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.419956416464891,"acs":173442,"articleLive":2,"columnArticles":1477,"formTitle":"[41]缺失的第一个正数","frequency":3.9397327015,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":413000,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5865988307345004,"acs":350274,"articleLive":2,"columnArticles":2590,"formTitle":"[42]接雨水","frequency":4.1817199995,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":597127,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4489921185760609,"acs":178482,"articleLive":2,"columnArticles":1202,"formTitle":"[43]字符串相乘","frequency":3.6503105352,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":397517,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32807047758824676,"acs":87625,"articleLive":2,"columnArticles":572,"formTitle":"[44]通配符匹配","frequency":2.4967489037,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":267092,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4321509842238029,"acs":220483,"articleLive":2,"columnArticles":1755,"formTitle":"[45]跳跃游戏 II","frequency":3.5720644217,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":510199,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7834709562482896,"acs":449453,"articleLive":2,"columnArticles":2876,"formTitle":"[46]全排列","frequency":4.0075552978,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":573669,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6395583890530244,"acs":230328,"articleLive":2,"columnArticles":1575,"formTitle":"[47]全排列 II","frequency":3.0898020661,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":360136,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7354680769554208,"acs":236136,"articleLive":2,"columnArticles":1970,"formTitle":"[48]旋转图像","frequency":3.1514929157,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":321069,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6660507958008804,"acs":245856,"articleLive":2,"columnArticles":1389,"formTitle":"[49]字母异位词分组","frequency":2.6209732911,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":369125,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37608839377210673,"acs":227541,"articleLive":2,"columnArticles":1347,"formTitle":"[50]Pow(x, n)","frequency":3.5938596906,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":605020,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7379161945835313,"acs":161521,"articleLive":2,"columnArticles":1610,"formTitle":"[51]N 皇后","frequency":3.5265290624,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":218888,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8220019037229548,"acs":76858,"articleLive":2,"columnArticles":625,"formTitle":"[52]N皇后 II","frequency":0.7790706138,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":93501,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5532763938493365,"acs":738162,"articleLive":2,"columnArticles":3977,"formTitle":"[53]最大子序和","frequency":3.5959497739,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1334165,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48217883474478673,"acs":198879,"articleLive":2,"columnArticles":2102,"formTitle":"[54]螺旋矩阵","frequency":3.614310301,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":412459,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4331588603630259,"acs":349891,"articleLive":2,"columnArticles":2683,"formTitle":"[55]跳跃游戏","frequency":3.4757621966,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":807766,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4716049891096695,"acs":320673,"articleLive":2,"columnArticles":2466,"formTitle":"[56]合并区间","frequency":4.0965735179,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":679961,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41241318134639215,"acs":90196,"articleLive":2,"columnArticles":965,"formTitle":"[57]插入区间","frequency":1.8425915827,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":218703,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3800669671264257,"acs":259821,"articleLive":2,"columnArticles":2786,"formTitle":"[58]最后一个单词的长度","frequency":2.6365434624,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":683619,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.786857159450591,"acs":135485,"articleLive":2,"columnArticles":1662,"formTitle":"[59]螺旋矩阵 II","frequency":3.1993535962,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":172185,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5252692954969147,"acs":92699,"articleLive":2,"columnArticles":987,"formTitle":"[60]排列序列","frequency":2.022447047,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":176479,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41792140050453613,"acs":205591,"articleLive":2,"columnArticles":2094,"formTitle":"[61]旋转链表","frequency":2.5577677589,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":491937,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6634832147387278,"acs":331104,"articleLive":2,"columnArticles":2548,"formTitle":"[62]不同路径","frequency":3.0126628353,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":499039,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39325980818993334,"acs":191945,"articleLive":2,"columnArticles":1815,"formTitle":"[63]不同路径 II","frequency":2.8683900627,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":488087,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6887237066376241,"acs":282042,"articleLive":2,"columnArticles":2179,"formTitle":"[64]最小路径和","frequency":3.2286326189,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":409514,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2703624223726228,"acs":47497,"articleLive":2,"columnArticles":660,"formTitle":"[65]有效数字","frequency":2.4940660669,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":175679,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4641075891080268,"acs":397620,"articleLive":2,"columnArticles":3655,"formTitle":"[66]加一","frequency":1.773075288,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":856741,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5417314988490067,"acs":203327,"articleLive":2,"columnArticles":1865,"formTitle":"[67]二进制求和","frequency":2.889468197,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":375328,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5236320926653436,"acs":38787,"articleLive":2,"columnArticles":593,"formTitle":"[68]文本左右对齐","frequency":3.2663525617,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":74073,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3912345626959608,"acs":408283,"articleLive":2,"columnArticles":2064,"formTitle":"[69]Sqrt(x)","frequency":3.3648944246,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1043576,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5312520368160751,"acs":611308,"articleLive":2,"columnArticles":3772,"formTitle":"[70]爬楼梯","frequency":4.3839518669,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1150693,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42191327146651947,"acs":97840,"articleLive":2,"columnArticles":869,"formTitle":"[71]简化路径","frequency":2.9971490275,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":231896,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142544740776846,"acs":186511,"articleLive":2,"columnArticles":1297,"formTitle":"[72]编辑距离","frequency":4.1574226773,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":303638,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6062619572584312,"acs":141333,"articleLive":2,"columnArticles":1046,"formTitle":"[73]矩阵置零","frequency":2.4796640667,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":233122,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4637098853942089,"acs":179810,"articleLive":2,"columnArticles":1816,"formTitle":"[74]搜索二维矩阵","frequency":2.4187670867,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":387764,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5977153455346247,"acs":285534,"articleLive":2,"columnArticles":1972,"formTitle":"[75]颜色分类","frequency":2.3341858445,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":477709,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4281262081194265,"acs":198228,"articleLive":2,"columnArticles":1357,"formTitle":"[76]最小覆盖子串","frequency":3.4376407577,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":463013,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7701225345055346,"acs":236691,"articleLive":2,"columnArticles":1403,"formTitle":"[77]组合","frequency":3.2381734405,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":307342,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8016680331757591,"acs":329504,"articleLive":2,"columnArticles":2156,"formTitle":"[78]子集","frequency":3.2042075035,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":411023,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4589974769169904,"acs":236677,"articleLive":2,"columnArticles":1485,"formTitle":"[79]单词搜索","frequency":2.6843080332,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":515639,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6172438236549785,"acs":153253,"articleLive":2,"columnArticles":1367,"formTitle":"[80]删除有序数组中的重复项 II","frequency":2.5577677589,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":248286,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41451928945424177,"acs":129044,"articleLive":2,"columnArticles":1032,"formTitle":"[81]搜索旋转排序数组 II","frequency":1.7812226363,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":311310,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5310081479047654,"acs":192320,"articleLive":2,"columnArticles":1753,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.281071697,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":362179,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.538063984630559,"acs":334403,"articleLive":2,"columnArticles":2058,"formTitle":"[83]删除排序链表中的重复元素","frequency":2.8234208357,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":621493,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4338945000531822,"acs":191728,"articleLive":2,"columnArticles":1225,"formTitle":"[84]柱状图中最大的矩形","frequency":3.3581854215,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":441877,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5156854232085701,"acs":102148,"articleLive":2,"columnArticles":718,"formTitle":"[85]最大矩形","frequency":2.5991605897,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":198082,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6324107856157866,"acs":124282,"articleLive":2,"columnArticles":1149,"formTitle":"[86]分隔链表","frequency":2.3341858445,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":196521,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48578199052132703,"acs":42640,"articleLive":2,"columnArticles":320,"formTitle":"[87]扰乱字符串","frequency":0.8349510722,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":87776,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5182146047365922,"acs":495437,"articleLive":2,"columnArticles":3479,"formTitle":"[88]合并两个有序数组","frequency":4.2542322448,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":956046,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7111452355936313,"acs":61593,"articleLive":2,"columnArticles":503,"formTitle":"[89]格雷编码","frequency":2.056165683,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":86611,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6340512811580066,"acs":145601,"articleLive":2,"columnArticles":1285,"formTitle":"[90]子集 II","frequency":2.4487273863,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":229636,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.31111709413992644,"acs":171022,"articleLive":2,"columnArticles":1581,"formTitle":"[91]解码方法","frequency":2.7014837759,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":549703,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5494041500469696,"acs":223413,"articleLive":2,"columnArticles":2103,"formTitle":"[92]反转链表 II","frequency":3.5425967426,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":406646,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5431345076060848,"acs":162810,"articleLive":2,"columnArticles":1407,"formTitle":"[93]复原 IP 地址","frequency":3.7540767569,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":299760,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7557169185588966,"acs":601132,"articleLive":2,"columnArticles":2465,"formTitle":"[94]二叉树的中序遍历","frequency":3.0382593185,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":795446,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7042054225876325,"acs":105009,"articleLive":2,"columnArticles":653,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.7014837759,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":149117,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6996551891210956,"acs":173285,"articleLive":2,"columnArticles":1377,"formTitle":"[96]不同的二叉搜索树","frequency":2.966846302,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":247672,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45490642547419763,"acs":64730,"articleLive":2,"columnArticles":574,"formTitle":"[97]交错字符串","frequency":1.9584954002,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":142293,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.35109221491134335,"acs":369619,"articleLive":2,"columnArticles":2054,"formTitle":"[98]验证二叉搜索树","frequency":3.2730446833,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1052769,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6104896682892235,"acs":75752,"articleLive":2,"columnArticles":622,"formTitle":"[99]恢复二叉搜索树","frequency":2.4967489037,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":124084,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.600727443656203,"acs":263267,"articleLive":2,"columnArticles":1965,"formTitle":"[100]相同的树","frequency":2.7560468957,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":438247,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5652061885703853,"acs":436524,"articleLive":2,"columnArticles":2382,"formTitle":"[101]对称二叉树","frequency":3.2252162149,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"ac","submitted":772327,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6418566294500894,"acs":421850,"articleLive":2,"columnArticles":2658,"formTitle":"[102]二叉树的层序遍历","frequency":4.2026792689,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":657234,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5716852205374634,"acs":182973,"articleLive":2,"columnArticles":1662,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.7847842553,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":320059,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7664545231425453,"acs":543381,"articleLive":2,"columnArticles":2683,"formTitle":"[104]二叉树的最大深度","frequency":3.5113460723,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"ac","submitted":708954,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7050762851737048,"acs":262722,"articleLive":2,"columnArticles":1519,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.3289115544,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":372615,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212148847980572,"acs":140766,"articleLive":2,"columnArticles":938,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2381734405,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":195179,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6991542190127609,"acs":169626,"articleLive":2,"columnArticles":1371,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.5708300831,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":242616,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7606101797311584,"acs":201440,"articleLive":2,"columnArticles":1248,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.5991605897,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":264840,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7626439698590559,"acs":97668,"articleLive":2,"columnArticles":760,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.5991605897,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":128065,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5642197137058765,"acs":269956,"articleLive":2,"columnArticles":1545,"formTitle":"[110]平衡二叉树","frequency":2.8026012079,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":478459,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4881087703774291,"acs":286842,"articleLive":2,"columnArticles":1894,"formTitle":"[111]二叉树的最小深度","frequency":2.009296749,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":587660,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263785829141281,"acs":285453,"articleLive":2,"columnArticles":1777,"formTitle":"[112]路径总和","frequency":3.145967342,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"ac","submitted":542296,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.627636592558232,"acs":189427,"articleLive":2,"columnArticles":1323,"formTitle":"[113]路径总和 II","frequency":2.8105836889,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":301810,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7263470808577095,"acs":187898,"articleLive":2,"columnArticles":1407,"formTitle":"[114]二叉树展开为链表","frequency":1.9550695661,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":258689,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.521323358057232,"acs":64874,"articleLive":2,"columnArticles":704,"formTitle":"[115]不同的子序列","frequency":2.8454967874,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":124441,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7052822610513494,"acs":171385,"articleLive":2,"columnArticles":1311,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.5116412117,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":243002,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6170517539295601,"acs":96062,"articleLive":2,"columnArticles":819,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.1374682111,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":155679,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7336900032521154,"acs":230116,"articleLive":2,"columnArticles":1860,"formTitle":"[118]杨辉三角","frequency":3.32707797,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":313642,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6708754061702945,"acs":153609,"articleLive":2,"columnArticles":1271,"formTitle":"[119]杨辉三角 II","frequency":2.3341858445,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":228968,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6822153828243803,"acs":187526,"articleLive":2,"columnArticles":1645,"formTitle":"[120]三角形最小路径和","frequency":2.2648820538,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":274878,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733880854448817,"acs":595393,"articleLive":2,"columnArticles":3571,"formTitle":"[121]买卖股票的最佳时机","frequency":4.0621111137,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1038377,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6905490630567147,"acs":488020,"articleLive":2,"columnArticles":2765,"formTitle":"[122]买卖股票的最佳时机 II","frequency":2.8718329995,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":706713,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5384914753853471,"acs":136982,"articleLive":2,"columnArticles":849,"formTitle":"[123]买卖股票的最佳时机 III","frequency":3.0429865657,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":254381,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4453173465535766,"acs":168692,"articleLive":2,"columnArticles":1145,"formTitle":"[124]二叉树中的最大路径和","frequency":3.9004606391,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":378813,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47196959722499904,"acs":290359,"articleLive":2,"columnArticles":1914,"formTitle":"[125]验证回文串","frequency":2.8152708313,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":615207,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.396993209475821,"acs":38527,"articleLive":2,"columnArticles":343,"formTitle":"[126]单词接龙 II","frequency":1.7017617468,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":97047,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4699640923004474,"acs":127740,"articleLive":2,"columnArticles":680,"formTitle":"[127]单词接龙","frequency":2.2988963676,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":271808,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5435364467241364,"acs":182157,"articleLive":2,"columnArticles":1201,"formTitle":"[128]最长连续序列","frequency":3.8765114225,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":335133,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6842293285989565,"acs":126410,"articleLive":2,"columnArticles":1164,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0126628353,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":184748,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.446817048541901,"acs":135844,"articleLive":2,"columnArticles":1233,"formTitle":"[130]被围绕的区域","frequency":2.2498188058,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":304026,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230284754365326,"acs":140744,"articleLive":2,"columnArticles":930,"formTitle":"[131]分割回文串","frequency":3.0429865657,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":194659,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49240339521723964,"acs":50818,"articleLive":2,"columnArticles":452,"formTitle":"[132]分割回文串 II","frequency":2.220036974,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":103204,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6773925550066553,"acs":75828,"articleLive":2,"columnArticles":538,"formTitle":"[133]克隆图","frequency":1.3722993115,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":111941,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5719633221715218,"acs":131865,"articleLive":2,"columnArticles":1009,"formTitle":"[134]加油站","frequency":2.8812404066,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":230548,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48603491502530277,"acs":105072,"articleLive":2,"columnArticles":836,"formTitle":"[135]分发糖果","frequency":4.1457811023,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":216182,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7192666887897115,"acs":531031,"articleLive":2,"columnArticles":2404,"formTitle":"[136]只出现一次的数字","frequency":3.7630631581,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":738295,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7202741692781314,"acs":104349,"articleLive":2,"columnArticles":788,"formTitle":"[137]只出现一次的数字 II","frequency":2.1111850586,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":144874,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6615330037277714,"acs":117479,"articleLive":2,"columnArticles":886,"formTitle":"[138]复制带随机指针的链表","frequency":3.0689998939,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":177586,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5173656733195114,"acs":207117,"articleLive":2,"columnArticles":1300,"formTitle":"[139]单词拆分","frequency":3.7425214689,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":400330,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.49591776641593277,"acs":55578,"articleLive":2,"columnArticles":574,"formTitle":"[140]单词拆分 II","frequency":1.1097040735,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":112071,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124816339128601,"acs":561213,"articleLive":2,"columnArticles":2892,"formTitle":"[141]环形链表","frequency":3.4131896618,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1095089,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5531022393619353,"acs":315531,"articleLive":2,"columnArticles":1843,"formTitle":"[142]环形链表 II","frequency":2.9935344786,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":570475,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6230316555622948,"acs":134563,"articleLive":2,"columnArticles":1135,"formTitle":"[143]重排链表","frequency":3.8948821353,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":215981,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7040796886481779,"acs":439790,"articleLive":2,"columnArticles":1960,"formTitle":"[144]二叉树的前序遍历","frequency":2.204806707,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":624631,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7516027782270636,"acs":320636,"articleLive":2,"columnArticles":1656,"formTitle":"[145]二叉树的后序遍历","frequency":3.0126628353,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":426603,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5250831153345936,"acs":247489,"articleLive":2,"columnArticles":1448,"formTitle":"[146]LRU 缓存机制","frequency":4.3398075375,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":471333,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6823522414886868,"acs":103259,"articleLive":2,"columnArticles":801,"formTitle":"[147]对链表进行插入排序","frequency":2.056165683,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":151328,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.667034797407394,"acs":221058,"articleLive":2,"columnArticles":1305,"formTitle":"[148]排序链表","frequency":3.2736100895,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":331404,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.34570298707718383,"acs":48955,"articleLive":2,"columnArticles":529,"formTitle":"[149]直线上最多的点数","frequency":3.3010483901,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":141610,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5344456033253063,"acs":139377,"articleLive":2,"columnArticles":1095,"formTitle":"[150]逆波兰表达式求值","frequency":2.3023664245,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":260788,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4863624763114883,"acs":179138,"articleLive":2,"columnArticles":1497,"formTitle":"[151]翻转字符串里的单词","frequency":2.5399316415,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":368322,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42179243953470724,"acs":194537,"articleLive":2,"columnArticles":1309,"formTitle":"[152]乘积最大子数组","frequency":3.6916643706,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":461215,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5672081509063382,"acs":221792,"articleLive":2,"columnArticles":1555,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.056165683,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":391024,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.53149845156383,"acs":117391,"articleLive":2,"columnArticles":922,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":2.022447047,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":220868,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5739768549098365,"acs":300664,"articleLive":2,"columnArticles":1662,"formTitle":"[155]最小栈","frequency":2.893927712,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":523826,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7241199206100492,"acs":6932,"articleLive":2,"columnArticles":125,"formTitle":"[156]上下翻转二叉树","frequency":0.8644953185,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":9573,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5360920393393951,"acs":5778,"articleLive":2,"columnArticles":84,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":10778,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5910004017677782,"acs":2942,"articleLive":2,"columnArticles":68,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4146373721,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4978,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5483302895903992,"acs":16814,"articleLive":2,"columnArticles":200,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":1.4301900306,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"ac","submitted":30664,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6159492281398936,"acs":354634,"articleLive":2,"columnArticles":2067,"formTitle":"[160]相交链表","frequency":2.9157503874,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":575752,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3364573570759138,"acs":7898,"articleLive":2,"columnArticles":108,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.2715365284,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":23474,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49668107553666935,"acs":169480,"articleLive":2,"columnArticles":1147,"formTitle":"[162]寻找峰值","frequency":3.3844932881,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":341225,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3280615009482525,"acs":9687,"articleLive":2,"columnArticles":149,"formTitle":"[163]缺失的区间","frequency":0.3250252134,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":29528,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6095901425154274,"acs":60653,"articleLive":2,"columnArticles":507,"formTitle":"[164]最大间距","frequency":2.3671160508,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":99498,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5198242255888326,"acs":89075,"articleLive":2,"columnArticles":947,"formTitle":"[165]比较版本号","frequency":3.7289394706,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":171356,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.33108196873333695,"acs":42843,"articleLive":2,"columnArticles":387,"formTitle":"[166]分数到小数","frequency":2.426844675,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":129403,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5868960288053547,"acs":314257,"articleLive":2,"columnArticles":2068,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":3.1367935778,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":535456,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43295937261736195,"acs":87450,"articleLive":2,"columnArticles":777,"formTitle":"[168]Excel表列名称","frequency":2.6073426023,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":201982,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.664945784873988,"acs":407135,"articleLive":2,"columnArticles":2281,"formTitle":"[169]多数元素","frequency":3.1479675027,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":612283,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4208926350697803,"acs":9138,"articleLive":2,"columnArticles":91,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.8349510722,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"ac","submitted":21711,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7174595962874019,"acs":110539,"articleLive":2,"columnArticles":944,"formTitle":"[171]Excel 表列序号","frequency":2.0265952257,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":154070,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4419544244529613,"acs":93636,"articleLive":2,"columnArticles":609,"formTitle":"[172]阶乘后的零","frequency":2.5116412117,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":211868,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8049304100723901,"acs":77613,"articleLive":2,"columnArticles":655,"formTitle":"[173]二叉搜索树迭代器","frequency":1.1374682111,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":96422,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48053088708890407,"acs":39392,"articleLive":2,"columnArticles":416,"formTitle":"[174]地下城游戏","frequency":2.9955303279,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":81976,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.738595335476497,"acs":317288,"articleLive":2,"columnArticles":1512,"formTitle":"[175]组合两个表","frequency":4.4629168841,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":429583,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3553749202080702,"acs":261659,"articleLive":2,"columnArticles":1051,"formTitle":"[176]第二高的薪水","frequency":4.1310359221,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":736290,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4629332355403638,"acs":133809,"articleLive":2,"columnArticles":524,"formTitle":"[177]第N高的薪水","frequency":3.6811322665,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":289046,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6035216718266254,"acs":124760,"articleLive":2,"columnArticles":687,"formTitle":"[178]分数排名","frequency":2.6997356765,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":206720,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096809350710375,"acs":125550,"articleLive":2,"columnArticles":1003,"formTitle":"[179]最大数","frequency":3.446761126,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":306458,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48605724149688856,"acs":91231,"articleLive":2,"columnArticles":534,"formTitle":"[180]连续出现的数字","frequency":3.446761126,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":187696,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.700127002535967,"acs":171445,"articleLive":2,"columnArticles":698,"formTitle":"[181]超过经理收入的员工","frequency":2.9971490275,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":244877,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7956554205989934,"acs":188595,"articleLive":2,"columnArticles":616,"formTitle":"[182]查找重复的电子邮箱","frequency":3.060749022,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":237031,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6759854530412451,"acs":156880,"articleLive":2,"columnArticles":572,"formTitle":"[183]从不订购的客户","frequency":2.426844675,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":232076,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.479223248842256,"acs":107104,"articleLive":2,"columnArticles":703,"formTitle":"[184]部门工资最高的员工","frequency":3.1690980254,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":223495,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49879296084351527,"acs":74176,"articleLive":2,"columnArticles":655,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.4732317028,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":148711,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7590488014516283,"acs":7948,"articleLive":2,"columnArticles":121,"formTitle":"[186]翻转字符串里的单词 II","frequency":1.2268310657,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":10471,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5215092395504277,"acs":76932,"articleLive":2,"columnArticles":562,"formTitle":"[187]重复的DNA序列","frequency":3.060749022,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":147518,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3945085608787651,"acs":93594,"articleLive":2,"columnArticles":721,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.7298947777,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":237242,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.44840565205879424,"acs":369193,"articleLive":2,"columnArticles":1849,"formTitle":"[189]轮转数组","frequency":3.7142755912,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":823346,"title":"轮转数组","titleSlug":"rotate-array"},{"acceptance":0.7000010174803117,"acs":137595,"articleLive":2,"columnArticles":864,"formTitle":"[190]颠倒二进制位","frequency":1.7520320056,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":196564,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7497421170958417,"acs":198423,"articleLive":2,"columnArticles":1248,"formTitle":"[191]位1的个数","frequency":0.9835288807,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":264655,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.357106347634412,"acs":22357,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":2.426844675,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":62606,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3257367434842917,"acs":26771,"articleLive":2,"columnArticles":141,"formTitle":"[193]有效电话号码","frequency":0.8644953185,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":82186,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34577033368091764,"acs":10611,"articleLive":2,"columnArticles":72,"formTitle":"[194]转置文件","frequency":0.297716034,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30688,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4368455536363095,"acs":36671,"articleLive":2,"columnArticles":147,"formTitle":"[195]第十行","frequency":1.8425915827,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":83945,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6652086475615887,"acs":105848,"articleLive":2,"columnArticles":409,"formTitle":"[196]删除重复的电子邮箱","frequency":2.7893653313,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":159120,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338101817984774,"acs":98512,"articleLive":2,"columnArticles":527,"formTitle":"[197]上升的温度","frequency":2.6704948958,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":184545,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5178753085472783,"acs":411845,"articleLive":2,"columnArticles":2831,"formTitle":"[198]打家劫舍","frequency":3.5480609155,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":795259,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6527549691375503,"acs":149851,"articleLive":2,"columnArticles":1668,"formTitle":"[199]二叉树的右视图","frequency":3.2280144841,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":229567,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5603605365096104,"acs":349642,"articleLive":2,"columnArticles":2214,"formTitle":"[200]岛屿数量","frequency":4.1416879921,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":623959,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5255734988801047,"acs":51389,"articleLive":2,"columnArticles":335,"formTitle":"[201]数字范围按位与","frequency":1.1374682111,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":97777,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6200853872873967,"acs":179227,"articleLive":2,"columnArticles":1460,"formTitle":"[202]快乐数","frequency":2.6997356765,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":289036,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5187761557228048,"acs":250282,"articleLive":2,"columnArticles":1750,"formTitle":"[203]移除链表元素","frequency":2.2817354385,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":482447,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37739541746224614,"acs":173934,"articleLive":2,"columnArticles":751,"formTitle":"[204]计数质数","frequency":2.7298947777,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":460880,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.4999619572568646,"acs":118279,"articleLive":2,"columnArticles":910,"formTitle":"[205]同构字符串","frequency":2.5447294245,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":236576,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7234635134967113,"acs":756418,"articleLive":2,"columnArticles":7561,"formTitle":"[206]反转链表","frequency":3.9706096537,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1045551,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.542097558330773,"acs":149974,"articleLive":2,"columnArticles":982,"formTitle":"[207]课程表","frequency":3.3124672256,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":276655,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7171535249416898,"acs":152507,"articleLive":2,"columnArticles":1032,"formTitle":"[208]实现 Trie (前缀树)","frequency":2.6407886717,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":212656,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4745825770301807,"acs":210475,"articleLive":2,"columnArticles":1476,"formTitle":"[209]长度最小的子数组","frequency":2.5363490776,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":443495,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5446424454792752,"acs":94502,"articleLive":2,"columnArticles":712,"formTitle":"[210]课程表 II","frequency":2.2715871882,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":173512,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.5115305485327083,"acs":49975,"articleLive":2,"columnArticles":546,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.3608816288,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"ac","submitted":97697,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4646990448274119,"acs":64365,"articleLive":2,"columnArticles":586,"formTitle":"[212]单词搜索 II","frequency":1.9584954002,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":138509,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4336724983529756,"acs":177732,"articleLive":2,"columnArticles":1624,"formTitle":"[213]打家劫舍 II","frequency":3.1203321653,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":409830,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3728194206845186,"acs":32036,"articleLive":2,"columnArticles":321,"formTitle":"[214]最短回文串","frequency":2.6446643451,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":85929,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6463323145318144,"acs":465230,"articleLive":2,"columnArticles":2406,"formTitle":"[215]数组中的第K个最大元素","frequency":4.3215288345,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":719800,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.736624000444247,"acs":106121,"articleLive":2,"columnArticles":1083,"formTitle":"[216]组合总和 III","frequency":3.1288024853,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":144064,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5561808327744414,"acs":398889,"articleLive":2,"columnArticles":1878,"formTitle":"[217]存在重复元素","frequency":4.2590062279,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":717193,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5417760462822078,"acs":32402,"articleLive":2,"columnArticles":286,"formTitle":"[218]天际线问题","frequency":3.3424638357,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":59807,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42379855167873604,"acs":115875,"articleLive":2,"columnArticles":944,"formTitle":"[219]存在重复元素 II","frequency":2.2648820538,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":273420,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28694688070267776,"acs":66514,"articleLive":2,"columnArticles":436,"formTitle":"[220]存在重复元素 III","frequency":1.5249878304,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":231799,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47904501296184765,"acs":146354,"articleLive":2,"columnArticles":1042,"formTitle":"[221]最大正方形","frequency":3.2431941195,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":305512,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7828903297564428,"acs":123883,"articleLive":2,"columnArticles":922,"formTitle":"[222]完全二叉树的节点个数","frequency":1.7897391245,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":158238,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5240455258635719,"acs":42084,"articleLive":2,"columnArticles":526,"formTitle":"[223]矩形面积","frequency":3.226008244,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":80306,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4177729428362598,"acs":73734,"articleLive":2,"columnArticles":674,"formTitle":"[224]基本计算器","frequency":3.2186294436,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":176493,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.674139696893894,"acs":142832,"articleLive":2,"columnArticles":4801,"formTitle":"[225]用队列实现栈","frequency":2.3341858445,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":211873,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7884372725066732,"acs":324915,"articleLive":2,"columnArticles":1955,"formTitle":"[226]翻转二叉树","frequency":3.4697978693,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":412100,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4378438538851844,"acs":90089,"articleLive":2,"columnArticles":717,"formTitle":"[227]基本计算器 II","frequency":2.9491090509,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":205756,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5785373282956975,"acs":59259,"articleLive":2,"columnArticles":674,"formTitle":"[228]汇总区间","frequency":0.2464095784,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":102429,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.5337862878319951,"acs":69136,"articleLive":2,"columnArticles":648,"formTitle":"[229]求众数 II","frequency":1.2523703457,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"ac","submitted":129520,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7520222343936013,"acs":166136,"articleLive":2,"columnArticles":1140,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0344624042,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":220919,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5045762240619166,"acs":177850,"articleLive":2,"columnArticles":1287,"formTitle":"[231]2 的幂","frequency":1.4242230697,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":352474,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6898946759871836,"acs":169454,"articleLive":2,"columnArticles":1328,"formTitle":"[232]用栈实现队列","frequency":2.3096145838,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":245623,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4769349051768324,"acs":35359,"articleLive":2,"columnArticles":430,"formTitle":"[233]数字 1 的个数","frequency":3.0429865657,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":74138,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49911551118878345,"acs":327293,"articleLive":2,"columnArticles":2073,"formTitle":"[234]回文链表","frequency":3.652227824,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":655746,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6667385316497102,"acs":179368,"articleLive":2,"columnArticles":1039,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.6145597237,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"ac","submitted":269023,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6814389300315034,"acs":273195,"articleLive":2,"columnArticles":1470,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.202970446,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":400909,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8565454808706624,"acs":248465,"articleLive":2,"columnArticles":1308,"formTitle":"[237]删除链表中的节点","frequency":1.2156759627,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":290078,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7237832226532427,"acs":145720,"articleLive":2,"columnArticles":915,"formTitle":"[238]除自身以外数组的乘积","frequency":2.3640745009,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":201331,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4968683950282135,"acs":204992,"articleLive":2,"columnArticles":1405,"formTitle":"[239]滑动窗口最大值","frequency":3.1861670557,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":412568,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.49491750234240955,"acs":209701,"articleLive":2,"columnArticles":1070,"formTitle":"[240]搜索二维矩阵 II","frequency":1.7694328275,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"ac","submitted":423709,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7350251789027299,"acs":33279,"articleLive":2,"columnArticles":299,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5898059845,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":45276,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6462932740429924,"acs":309283,"articleLive":2,"columnArticles":1791,"formTitle":"[242]有效的字母异位词","frequency":2.2817354385,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":478549,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6559642781203487,"acs":9255,"articleLive":2,"columnArticles":110,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":14109,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.555752028292074,"acs":5343,"articleLive":2,"columnArticles":62,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":9614,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.5994694960212201,"acs":4520,"articleLive":2,"columnArticles":61,"formTitle":"[245]最短单词距离 III","frequency":0.8952102637,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":7540,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47574261305744964,"acs":6070,"articleLive":2,"columnArticles":109,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":12759,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5255382832866661,"acs":5443,"articleLive":2,"columnArticles":95,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":10357,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46729131175468486,"acs":2743,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5870,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6406282504680674,"acs":6159,"articleLive":2,"columnArticles":107,"formTitle":"[249]移位字符串分组","frequency":0.3250252134,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"ac","submitted":9614,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.63695919202948,"acs":4667,"articleLive":2,"columnArticles":80,"formTitle":"[250]统计同值子树","frequency":0.4146373721,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":7327,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5458262831359278,"acs":3871,"articleLive":2,"columnArticles":72,"formTitle":"[251]展开二维向量","frequency":0.8952102637,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":7092,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.563963322353779,"acs":12670,"articleLive":2,"columnArticles":165,"formTitle":"[252]会议室","frequency":0.297716034,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":22466,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.503190087782926,"acs":33992,"articleLive":2,"columnArticles":364,"formTitle":"[253]会议室 II","frequency":2.8766994852,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":67553,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.569891349770163,"acs":5455,"articleLive":2,"columnArticles":78,"formTitle":"[254]因子的组合","frequency":0.3250252134,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":9572,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4767228578915189,"acs":5458,"articleLive":2,"columnArticles":64,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":11449,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.644534115920763,"acs":12299,"articleLive":2,"columnArticles":192,"formTitle":"[256]粉刷房子","frequency":0.8349510722,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":19082,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6847615000434093,"acs":149858,"articleLive":2,"columnArticles":1106,"formTitle":"[257]二叉树的所有路径","frequency":2.6365434624,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":218847,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6915388944792182,"acs":81094,"articleLive":2,"columnArticles":680,"formTitle":"[258]各位相加","frequency":2.1182974641,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":117266,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.563860338573156,"acs":7461,"articleLive":2,"columnArticles":88,"formTitle":"[259]较小的三数之和","frequency":0.297716034,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":13232,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7419225097198016,"acs":77476,"articleLive":2,"columnArticles":687,"formTitle":"[260]只出现一次的数字 III","frequency":1.6089767315,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":104426,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49567992955808704,"acs":9007,"articleLive":2,"columnArticles":124,"formTitle":"[261]以图判树","frequency":1.2268310657,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":18171,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43281933555680685,"acs":39970,"articleLive":2,"columnArticles":383,"formTitle":"[262]行程和用户","frequency":2.9563733571,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":92348,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5146527461271361,"acs":109532,"articleLive":2,"columnArticles":859,"formTitle":"[263]丑数","frequency":1.870217649,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":212827,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5804302218243867,"acs":103749,"articleLive":2,"columnArticles":637,"formTitle":"[264]丑数 II","frequency":2.3640745009,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":178745,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5945087176144697,"acs":7297,"articleLive":2,"columnArticles":165,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":12274,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6771896053897979,"acs":7036,"articleLive":2,"columnArticles":106,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":10390,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4481588538393867,"acs":3566,"articleLive":2,"columnArticles":78,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7957,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6497575087211775,"acs":190915,"articleLive":2,"columnArticles":1491,"formTitle":"[268]丢失的数字","frequency":0.67252033,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":293825,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.34070286258585253,"acs":6796,"articleLive":2,"columnArticles":110,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":19947,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5565156342820111,"acs":10305,"articleLive":2,"columnArticles":143,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.8952102637,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":18517,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5597923737272908,"acs":2804,"articleLive":2,"columnArticles":47,"formTitle":"[271]字符串的编码与解码","frequency":0.4474271949,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":5009,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.645506419400856,"acs":3620,"articleLive":2,"columnArticles":77,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.3535496801,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5608,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.36713184964004203,"acs":29017,"articleLive":2,"columnArticles":354,"formTitle":"[273]整数转换英文表示","frequency":2.529546793,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":79037,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.439724987008834,"acs":55003,"articleLive":2,"columnArticles":574,"formTitle":"[274]H 指数","frequency":2.6955034929,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":125085,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4617339205791623,"acs":51789,"articleLive":2,"columnArticles":424,"formTitle":"[275]H 指数 II","frequency":1.8425915827,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":112162,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.49567625996486964,"acs":7337,"articleLive":2,"columnArticles":135,"formTitle":"[276]栅栏涂色","frequency":0.3250252134,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":14802,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5711898881301758,"acs":7863,"articleLive":2,"columnArticles":89,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":13766,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4531334043183789,"acs":206400,"articleLive":2,"columnArticles":1180,"formTitle":"[278]第一个错误的版本","frequency":3.597227264,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":455495,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6337932554026452,"acs":212862,"articleLive":2,"columnArticles":1261,"formTitle":"[279]完全平方数","frequency":3.4969439445,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":335854,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6846541027742011,"acs":5849,"articleLive":2,"columnArticles":74,"formTitle":"[280]摆动排序","frequency":0.8952102637,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"ac","submitted":8543,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7597222222222222,"acs":2735,"articleLive":2,"columnArticles":69,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3600,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.48545521382183554,"acs":19809,"articleLive":2,"columnArticles":167,"formTitle":"[282]给表达式添加运算符","frequency":0.3157915375,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"ac","submitted":40805,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6400724967325925,"acs":531858,"articleLive":2,"columnArticles":3547,"formTitle":"[283]移动零","frequency":3.793986734,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":830934,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7706666666666667,"acs":25432,"articleLive":2,"columnArticles":213,"formTitle":"[284]窥探迭代器","frequency":1.6697487699,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":33000,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.63478654397345,"acs":8416,"articleLive":2,"columnArticles":110,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":13258,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5126394994927291,"acs":12127,"articleLive":2,"columnArticles":158,"formTitle":"[286]墙与门","frequency":0.297716034,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":23656,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6573254514626933,"acs":186476,"articleLive":2,"columnArticles":1269,"formTitle":"[287]寻找重复数","frequency":2.6145597237,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":283689,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.43878155742562525,"acs":3702,"articleLive":2,"columnArticles":58,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"ac","submitted":8437,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7538292608345147,"acs":54235,"articleLive":2,"columnArticles":841,"formTitle":"[289]生命游戏","frequency":1.5249878304,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":71946,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4557500956754688,"acs":85743,"articleLive":2,"columnArticles":1145,"formTitle":"[290]单词规律","frequency":1.9584954002,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":188136,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5273780975219824,"acs":2639,"articleLive":2,"columnArticles":57,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":5004,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7080337435370242,"acs":117084,"articleLive":2,"columnArticles":780,"formTitle":"[292]Nim 游戏","frequency":2.2648820538,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":165365,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7125940373363053,"acs":5115,"articleLive":2,"columnArticles":85,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":7178,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5801937567276642,"acs":3773,"articleLive":2,"columnArticles":56,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":6503,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5223383619843408,"acs":66513,"articleLive":2,"columnArticles":519,"formTitle":"[295]数据流的中位数","frequency":3.0126628353,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":127337,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.619812904773327,"acs":2584,"articleLive":2,"columnArticles":47,"formTitle":"[296]最佳的碰头地点","frequency":0.9605076062,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":4169,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5615391239596578,"acs":110854,"articleLive":2,"columnArticles":794,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.6997356765,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":197411,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5797101449275363,"acs":5200,"articleLive":2,"columnArticles":83,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":8970,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5637591803427328,"acs":62177,"articleLive":2,"columnArticles":714,"formTitle":"[299]猜数字游戏","frequency":0.6783820115,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"ac","submitted":110290,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5187879002704825,"acs":380533,"articleLive":2,"columnArticles":2097,"formTitle":"[300]最长递增子序列","frequency":3.6299321318,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":733504,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5472076263266111,"acs":52695,"articleLive":2,"columnArticles":380,"formTitle":"[301]删除无效的括号","frequency":1.8095852862,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"ac","submitted":96298,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.656559405940594,"acs":2122,"articleLive":2,"columnArticles":40,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":3232,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7280930176224792,"acs":132253,"articleLive":2,"columnArticles":814,"formTitle":"[303]区域和检索 - 数组不可变","frequency":1.811387803,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":181643,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5510945848617322,"acs":65804,"articleLive":2,"columnArticles":590,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":1.4007588304,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":119406,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3883429345984412,"acs":4584,"articleLive":2,"columnArticles":69,"formTitle":"[305]岛屿数量 II","frequency":0.3833848286,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":11804,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3376892920285956,"acs":17572,"articleLive":2,"columnArticles":266,"formTitle":"[306]累加数","frequency":1.8425915827,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":52036,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5353500432152117,"acs":24776,"articleLive":2,"columnArticles":241,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.2464095784,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":46280,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6148595431871883,"acs":2342,"articleLive":2,"columnArticles":46,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3809,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.61384050115035,"acs":125132,"articleLive":2,"columnArticles":983,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.1861670557,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":203851,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3807925562847886,"acs":22918,"articleLive":2,"columnArticles":222,"formTitle":"[310]最小高度树","frequency":1.5944119532,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":60185,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7620109466855869,"acs":3759,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.9952937223,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"ac","submitted":4933,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6837707012341627,"acs":58340,"articleLive":2,"columnArticles":393,"formTitle":"[312]戳气球","frequency":2.5447294245,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":85321,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6235594054239411,"acs":41824,"articleLive":2,"columnArticles":360,"formTitle":"[313]超级丑数","frequency":2.4598608791,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":67073,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5457847237508254,"acs":4959,"articleLive":2,"columnArticles":91,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":9086,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4174194331001577,"acs":51616,"articleLive":2,"columnArticles":486,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.8026012079,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":123655,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4764023355794322,"acs":69923,"articleLive":2,"columnArticles":554,"formTitle":"[316]去除重复字母","frequency":2.8026012079,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":146773,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4854195178439836,"acs":4611,"articleLive":2,"columnArticles":66,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":9499,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6887123234792678,"acs":21410,"articleLive":2,"columnArticles":194,"formTitle":"[318]最大单词长度乘积","frequency":0.297716034,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":31087,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.52117649639199,"acs":23762,"articleLive":2,"columnArticles":234,"formTitle":"[319]灯泡开关","frequency":0.297716034,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":45593,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6799474605954466,"acs":3106,"articleLive":2,"columnArticles":54,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4568,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42399575848303395,"acs":27190,"articleLive":2,"columnArticles":237,"formTitle":"[321]拼接最大数","frequency":1.5944119532,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":64128,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44636882885154333,"acs":322210,"articleLive":2,"columnArticles":1890,"formTitle":"[322]零钱兑换","frequency":3.6983934182,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":721847,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6329079106612389,"acs":11505,"articleLive":2,"columnArticles":158,"formTitle":"[323]无向图中连通分量的数目","frequency":1.5944119532,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":18178,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37819025522041766,"acs":26406,"articleLive":2,"columnArticles":178,"formTitle":"[324]摆动排序 II","frequency":1.8749045717,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":69822,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5374415405777166,"acs":9768,"articleLive":2,"columnArticles":115,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.2588782432,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":18175,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5044766200886295,"acs":139681,"articleLive":2,"columnArticles":604,"formTitle":"[326]3的幂","frequency":2.3671160508,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":276883,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.41981454042985333,"acs":25217,"articleLive":2,"columnArticles":210,"formTitle":"[327]区间和的个数","frequency":1.9431788196,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":60067,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6551579838717618,"acs":133077,"articleLive":2,"columnArticles":1095,"formTitle":"[328]奇偶链表","frequency":2.9374620522,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":203122,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.488259311724023,"acs":58596,"articleLive":2,"columnArticles":517,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.3341858445,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":120010,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5327401640483803,"acs":19160,"articleLive":2,"columnArticles":151,"formTitle":"[330]按要求补齐数组","frequency":1.2588782432,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35965,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47911735751837964,"acs":45749,"articleLive":2,"columnArticles":516,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.3250252134,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":95486,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4478593521080905,"acs":41268,"articleLive":2,"columnArticles":338,"formTitle":"[332]重新安排行程","frequency":1.2921924499,"frontendQuestionId":"332","leaf":true,"level":3,"nodeType":"def","questionId":"332","status":"","submitted":92145,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46979611190137505,"acs":4954,"articleLive":2,"columnArticles":82,"formTitle":"[333]最大 BST 子树","frequency":0.297716034,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":10545,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41171118805125223,"acs":48873,"articleLive":2,"columnArticles":321,"formTitle":"[334]递增的三元子序列","frequency":1.7520320056,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":118707,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.4308207616837219,"acs":16335,"articleLive":2,"columnArticles":145,"formTitle":"[335]路径交叉","frequency":0.6119966872,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"ac","submitted":37916,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4009353134370984,"acs":22462,"articleLive":2,"columnArticles":195,"formTitle":"[336]回文对","frequency":1.631282489,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":56024,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6073454269585202,"acs":136097,"articleLive":2,"columnArticles":961,"formTitle":"[337]打家劫舍 III","frequency":3.0953545512,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":224085,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869524079856183,"acs":166346,"articleLive":2,"columnArticles":1431,"formTitle":"[338]比特位计数","frequency":2.6365434624,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":211380,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8124354472216484,"acs":3933,"articleLive":2,"columnArticles":62,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4841,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49486468543757567,"acs":12672,"articleLive":2,"columnArticles":192,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.1662003159,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":25607,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7273724858317591,"acs":52365,"articleLive":2,"columnArticles":496,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":1.5800830077,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":71992,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5169351483775538,"acs":89467,"articleLive":2,"columnArticles":789,"formTitle":"[342]4的幂","frequency":2.3341858445,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":173072,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6076252404449276,"acs":116246,"articleLive":2,"columnArticles":1092,"formTitle":"[343]整数拆分","frequency":3.1479675027,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":191312,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7712528272742318,"acs":391454,"articleLive":2,"columnArticles":2085,"formTitle":"[344]反转字符串","frequency":3.1193595445,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":507556,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.539441191168123,"acs":111188,"articleLive":2,"columnArticles":1060,"formTitle":"[345]反转字符串中的元音字母","frequency":2.6365434624,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":206117,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7070512467661144,"acs":12845,"articleLive":2,"columnArticles":142,"formTitle":"[346]数据流中的移动平均值","frequency":0.2715365284,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":18167,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6227894161075004,"acs":212918,"articleLive":2,"columnArticles":1572,"formTitle":"[347]前 K 个高频元素","frequency":3.3245052904,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":341878,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6007863999074824,"acs":5195,"articleLive":2,"columnArticles":81,"formTitle":"[348]设计井字棋","frequency":0.3250252134,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":8647,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7380783525734473,"acs":224798,"articleLive":2,"columnArticles":1591,"formTitle":"[349]两个数组的交集","frequency":3.3217740433,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":304572,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5510817669309441,"acs":265590,"articleLive":2,"columnArticles":1491,"formTitle":"[350]两个数组的交集 II","frequency":3.1611677698,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":481943,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5917879643710624,"acs":5448,"articleLive":2,"columnArticles":101,"formTitle":"[351]安卓系统手势解锁","frequency":0.5546415198,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":9206,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6793166447642552,"acs":21194,"articleLive":2,"columnArticles":348,"formTitle":"[352]将数据流变为多个不相交区间","frequency":1.6388439617,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":31199,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4289919058130979,"acs":2332,"articleLive":2,"columnArticles":51,"formTitle":"[353]贪吃蛇","frequency":0.9952937223,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":5436,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4557767315047398,"acs":72216,"articleLive":2,"columnArticles":556,"formTitle":"[354]俄罗斯套娃信封问题","frequency":2.7631425209,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":158446,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40814880425155003,"acs":27648,"articleLive":2,"columnArticles":457,"formTitle":"[355]设计推特","frequency":0.8644953185,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":67740,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3529033640454253,"acs":1647,"articleLive":2,"columnArticles":42,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4667,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5204551055614886,"acs":25342,"articleLive":2,"columnArticles":400,"formTitle":"[357]计算各个位数不同的数字个数","frequency":1.7349609185,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":48692,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35106136626785023,"acs":4548,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12955,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7282687040507424,"acs":5052,"articleLive":2,"columnArticles":60,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6937,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6058453419930993,"acs":2985,"articleLive":2,"columnArticles":64,"formTitle":"[360]有序转化数组","frequency":0.4474271949,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4927,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5673347689249627,"acs":3425,"articleLive":2,"columnArticles":67,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":6037,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6907907710510748,"acs":3503,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.3535496801,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":5071,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4891635426429241,"acs":33404,"articleLive":2,"columnArticles":218,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":68288,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.725975975975976,"acs":1934,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2664,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3673056555814446,"acs":34681,"articleLive":2,"columnArticles":490,"formTitle":"[365]水壶问题","frequency":2.6514847234,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":94420,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7657580919931857,"acs":4495,"articleLive":2,"columnArticles":121,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.3535496801,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5870,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.44783960341169193,"acs":117982,"articleLive":2,"columnArticles":950,"formTitle":"[367]有效的完全平方数","frequency":0.5490417739,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":263447,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45833556902935024,"acs":42710,"articleLive":2,"columnArticles":457,"formTitle":"[368]最大整除子集","frequency":2.1848777892,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":93185,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6190917516218721,"acs":4676,"articleLive":2,"columnArticles":135,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7553,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7285201604390965,"acs":3451,"articleLive":2,"columnArticles":56,"formTitle":"[370]区间加法","frequency":0.8952102637,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":4737,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6130776941605949,"acs":81955,"articleLive":2,"columnArticles":511,"formTitle":"[371]两整数之和","frequency":2.9089430091,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":133678,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5109489051094891,"acs":14840,"articleLive":2,"columnArticles":140,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":29044,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4125887582504282,"acs":21441,"articleLive":2,"columnArticles":222,"formTitle":"[373]查找和最小的K对数字","frequency":1.7017617468,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":51967,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5164636626863529,"acs":86330,"articleLive":2,"columnArticles":589,"formTitle":"[374]猜数字大小","frequency":1.6697487699,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":167156,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46543257398140697,"acs":79804,"articleLive":2,"columnArticles":848,"formTitle":"[376]摆动序列","frequency":1.5521044593,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":171462,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5109385494253394,"acs":67706,"articleLive":2,"columnArticles":571,"formTitle":"[377]组合总和 Ⅳ","frequency":1.9899162974,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":132513,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6393109093035039,"acs":82014,"articleLive":2,"columnArticles":580,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":1.8425915827,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":128285,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6367951395481298,"acs":3354,"articleLive":2,"columnArticles":73,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":5267,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5046660994153652,"acs":36773,"articleLive":2,"columnArticles":232,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.8987072854,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":72866,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44043380733850557,"acs":21402,"articleLive":2,"columnArticles":177,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":48593,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6338200443391178,"acs":16582,"articleLive":2,"columnArticles":130,"formTitle":"[382]链表随机节点","frequency":0.2715365284,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":26162,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6072564449202541,"acs":77710,"articleLive":2,"columnArticles":851,"formTitle":"[383]赎金信","frequency":1.2268310657,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":127969,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5803966389400386,"acs":54844,"articleLive":2,"columnArticles":207,"formTitle":"[384]打乱数组","frequency":2.2003412178,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":94494,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41865617902841634,"acs":7558,"articleLive":2,"columnArticles":86,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":18053,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7501205671478636,"acs":23331,"articleLive":2,"columnArticles":249,"formTitle":"[386]字典序排数","frequency":2.6572939648,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":31103,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5366580732016686,"acs":234394,"articleLive":2,"columnArticles":1287,"formTitle":"[387]字符串中的第一个唯一字符","frequency":3.0126628353,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":436766,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5322806151821696,"acs":6472,"articleLive":2,"columnArticles":117,"formTitle":"[388]文件的最长绝对路径","frequency":0.8349510722,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":12159,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6914862473219869,"acs":103929,"articleLive":2,"columnArticles":1026,"formTitle":"[389]找不同","frequency":0.297716034,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":150298,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46686650934370816,"acs":7320,"articleLive":2,"columnArticles":99,"formTitle":"[390]消除游戏","frequency":1.9084048013,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15679,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.36078168121130755,"acs":4837,"articleLive":2,"columnArticles":69,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13407,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.515486650952635,"acs":152649,"articleLive":2,"columnArticles":1648,"formTitle":"[392]判断子序列","frequency":2.3052151046,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":296126,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39138916458468803,"acs":11436,"articleLive":2,"columnArticles":131,"formTitle":"[393]UTF-8 编码验证","frequency":0.9271822964,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":29219,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.553112961839987,"acs":126784,"articleLive":2,"columnArticles":1345,"formTitle":"[394]字符串解码","frequency":3.7668898886,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":229219,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5200971214603323,"acs":53337,"articleLive":2,"columnArticles":438,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":2.2320563495,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":102552,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.43231657792617995,"acs":9581,"articleLive":2,"columnArticles":155,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":22162,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37607549264501805,"acs":16260,"articleLive":2,"columnArticles":209,"formTitle":"[397]整数替换","frequency":1.6388439617,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":43236,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6603153745072273,"acs":15075,"articleLive":2,"columnArticles":124,"formTitle":"[398]随机数索引","frequency":0.806499651,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22830,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5913848082636068,"acs":43397,"articleLive":2,"columnArticles":544,"formTitle":"[399]除法求值","frequency":0.8349510722,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":73382,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4185455303188164,"acs":20086,"articleLive":2,"columnArticles":206,"formTitle":"[400]第 N 位数字","frequency":2.1182974641,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":47990,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.61480653097741,"acs":54976,"articleLive":2,"columnArticles":664,"formTitle":"[401]二进制手表","frequency":2.3949394166,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":89420,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32683942926594783,"acs":83632,"articleLive":2,"columnArticles":606,"formTitle":"[402]移掉 K 位数字","frequency":2.9089430091,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":255881,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45524361564058274,"acs":46652,"articleLive":2,"columnArticles":469,"formTitle":"[403]青蛙过河","frequency":1.979322978,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":102477,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.586344072357189,"acs":106123,"articleLive":2,"columnArticles":1178,"formTitle":"[404]左叶子之和","frequency":2.8205364957,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":180991,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5611156196295589,"acs":47017,"articleLive":2,"columnArticles":475,"formTitle":"[405]数字转换为十六进制数","frequency":2.4796640667,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":83792,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7380508595308196,"acs":124335,"articleLive":2,"columnArticles":821,"formTitle":"[406]根据身高重建队列","frequency":2.7298947777,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":168464,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.5787241101474003,"acs":24421,"articleLive":2,"columnArticles":242,"formTitle":"[407]接雨水 II","frequency":2.0911587565,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"ac","submitted":42198,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32797062166652097,"acs":3751,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":11437,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.556097450834293,"acs":98516,"articleLive":2,"columnArticles":1378,"formTitle":"[409]最长回文串","frequency":2.8527484508,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":177156,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5662828626390476,"acs":40624,"articleLive":2,"columnArticles":333,"formTitle":"[410]分割数组的最大值","frequency":2.9089430091,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":71738,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5035538545653363,"acs":921,"articleLive":2,"columnArticles":23,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1829,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7088784824408181,"acs":104298,"articleLive":2,"columnArticles":601,"formTitle":"[412]Fizz Buzz","frequency":2.0832676128,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":147131,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6885476776193655,"acs":75292,"articleLive":2,"columnArticles":972,"formTitle":"[413]等差数列划分","frequency":2.6623014866,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":109349,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39361897034574816,"acs":90234,"articleLive":2,"columnArticles":1170,"formTitle":"[414]第三大的数","frequency":2.3897248248,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":229242,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5394529858976708,"acs":156033,"articleLive":2,"columnArticles":1131,"formTitle":"[415]字符串相加","frequency":4.1560600936,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":289243,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5085043907033436,"acs":183565,"articleLive":2,"columnArticles":1054,"formTitle":"[416]分割等和子集","frequency":3.5046889833,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":360990,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4845348817862669,"acs":29122,"articleLive":2,"columnArticles":338,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.4598608791,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":60103,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3645683165144962,"acs":2276,"articleLive":2,"columnArticles":34,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":6243,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7546925566343042,"acs":12826,"articleLive":2,"columnArticles":168,"formTitle":"[419]甲板上的战舰","frequency":0.2715365284,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16995,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2096212289674598,"acs":2828,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":2.0169449698,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13491,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6221261725216112,"acs":33825,"articleLive":2,"columnArticles":313,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.5447294245,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":54370,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4275154004106776,"acs":2082,"articleLive":2,"columnArticles":51,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4870,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.568371912079362,"acs":8766,"articleLive":2,"columnArticles":142,"formTitle":"[423]从英文中重建数字","frequency":0.8644953185,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":15423,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5316456967274845,"acs":52945,"articleLive":2,"columnArticles":464,"formTitle":"[424]替换后的最长重复字符","frequency":2.4012350808,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":99587,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6170712607674237,"acs":1576,"articleLive":2,"columnArticles":34,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2554,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6725607544432354,"acs":7417,"articleLive":2,"columnArticles":119,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.8644953185,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":11028,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.615506329113924,"acs":4279,"articleLive":2,"columnArticles":70,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6952,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.658662900188324,"acs":2798,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":4248,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7016132691958613,"acs":61843,"articleLive":2,"columnArticles":504,"formTitle":"[429]N 叉树的层序遍历","frequency":1.7017617468,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":88144,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5879075607172284,"acs":44952,"articleLive":2,"columnArticles":681,"formTitle":"[430]扁平化多级双向链表","frequency":1.8749045717,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":76461,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7280701754385965,"acs":913,"articleLive":2,"columnArticles":30,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1254,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.38056297285269247,"acs":6841,"articleLive":2,"columnArticles":90,"formTitle":"[432]全 O(1) 的数据结构","frequency":1.8749045717,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17976,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5322779872578338,"acs":16375,"articleLive":2,"columnArticles":225,"formTitle":"[433]最小基因变化","frequency":0.3250252134,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":30764,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3990585709526571,"acs":64685,"articleLive":2,"columnArticles":888,"formTitle":"[434]字符串中的单词数","frequency":3.0806699995,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":162094,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.506739848273207,"acs":102666,"articleLive":2,"columnArticles":901,"formTitle":"[435]无重叠区间","frequency":2.6421191668,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":202601,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4891500904159132,"acs":9197,"articleLive":2,"columnArticles":153,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18802,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5742574257425742,"acs":128818,"articleLive":2,"columnArticles":1054,"formTitle":"[437]路径总和 III","frequency":2.9089430091,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":224321,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5206763368827074,"acs":102051,"articleLive":2,"columnArticles":892,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.1111850586,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":195997,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.592607472880675,"acs":2950,"articleLive":2,"columnArticles":70,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4978,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3810553054948973,"acs":17101,"articleLive":2,"columnArticles":126,"formTitle":"[440]字典序的第K小数字","frequency":2.9205845842,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":44878,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4590138200084885,"acs":78949,"articleLive":2,"columnArticles":756,"formTitle":"[441]排列硬币","frequency":2.3949394166,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":171997,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6972660762418175,"acs":45270,"articleLive":2,"columnArticles":458,"formTitle":"[442]数组中重复的数据","frequency":2.9955303279,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":64925,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47741016252754354,"acs":57632,"articleLive":2,"columnArticles":701,"formTitle":"[443]压缩字符串","frequency":2.6977583361,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":120718,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2519903326698891,"acs":3545,"articleLive":2,"columnArticles":55,"formTitle":"[444]序列重建","frequency":0.3833848286,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":14068,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5896292706566513,"acs":85169,"articleLive":2,"columnArticles":953,"formTitle":"[445]两数相加 II","frequency":2.2771090134,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":144445,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5500831665304051,"acs":19512,"articleLive":2,"columnArticles":176,"formTitle":"[446]等差数列划分 II - 子序列","frequency":2.220036974,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35471,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6633790274704517,"acs":49167,"articleLive":2,"columnArticles":380,"formTitle":"[447]回旋镖的数量","frequency":2.220036974,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":74116,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6495343346380089,"acs":143879,"articleLive":2,"columnArticles":1139,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.4187670867,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":221511,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5597928109573802,"acs":16103,"articleLive":2,"columnArticles":144,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.297716034,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":28766,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48871945549894,"acs":65701,"articleLive":2,"columnArticles":660,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.1182974641,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":134435,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7120722120426585,"acs":84330,"articleLive":2,"columnArticles":973,"formTitle":"[451]根据字符出现频率排序","frequency":3.1647000942,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":118429,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.508463574174864,"acs":101830,"articleLive":2,"columnArticles":888,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.5116412117,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":200270,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.6114734431235685,"acs":56066,"articleLive":2,"columnArticles":672,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.2670844274,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"ac","submitted":91690,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6051199766610751,"acs":82968,"articleLive":2,"columnArticles":517,"formTitle":"[454]四数相加 II","frequency":2.8766994852,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":137110,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5762678845862464,"acs":159738,"articleLive":2,"columnArticles":1304,"formTitle":"[455]分发饼干","frequency":2.8543094876,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":277194,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3627779337013129,"acs":58166,"articleLive":2,"columnArticles":466,"formTitle":"[456]132 模式","frequency":1.6697487699,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":160335,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43561362214343174,"acs":29241,"articleLive":2,"columnArticles":336,"formTitle":"[457]环形数组是否存在循环","frequency":2.1182974641,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":67126,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6150623963696658,"acs":7048,"articleLive":2,"columnArticles":70,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11459,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5101165684993962,"acs":82796,"articleLive":2,"columnArticles":668,"formTitle":"[459]重复的子字符串","frequency":1.8425915827,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":162308,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43653416149068325,"acs":35141,"articleLive":2,"columnArticles":412,"formTitle":"[460]LFU 缓存","frequency":2.2988963676,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":80500,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8126880058113004,"acs":174528,"articleLive":2,"columnArticles":1395,"formTitle":"[461]汉明距离","frequency":2.6704948958,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":214754,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6081854607899256,"acs":14875,"articleLive":2,"columnArticles":142,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.2268310657,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":24458,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7079156768022892,"acs":80158,"articleLive":2,"columnArticles":962,"formTitle":"[463]岛屿的周长","frequency":2.2320563495,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":113231,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35547042598835427,"acs":11599,"articleLive":2,"columnArticles":113,"formTitle":"[464]我能赢吗","frequency":0.9271822964,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":32630,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5314505776636713,"acs":1656,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":3116,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3732641100777169,"acs":11719,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.3535496801,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31396,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4418672643991814,"acs":9068,"articleLive":2,"columnArticles":116,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":1.2588782432,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":20522,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25231551077015585,"acs":26016,"articleLive":2,"columnArticles":304,"formTitle":"[468]验证IP地址","frequency":2.426844675,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":103109,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43387142452563016,"acs":1532,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.4818895991,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3531,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5473380387993597,"acs":65992,"articleLive":2,"columnArticles":342,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1601399148,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":120569,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6092884533446954,"acs":1430,"articleLive":2,"columnArticles":25,"formTitle":"[471]编码最短长度的字符串","frequency":1.3630185024,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":2347,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3940518290915415,"acs":6797,"articleLive":2,"columnArticles":83,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":17249,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4209095260890378,"acs":21982,"articleLive":2,"columnArticles":187,"formTitle":"[473]火柴拼正方形","frequency":1.9431788196,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":52225,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6132163495087777,"acs":78209,"articleLive":2,"columnArticles":625,"formTitle":"[474]一和零","frequency":2.9491090509,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":127539,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33671372408863476,"acs":22611,"articleLive":2,"columnArticles":260,"formTitle":"[475]供暖器","frequency":2.8264949236,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":67152,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7133486931310837,"acs":64710,"articleLive":2,"columnArticles":867,"formTitle":"[476]数字的补数","frequency":0.6132165566,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"ac","submitted":90713,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6034398260177045,"acs":39401,"articleLive":2,"columnArticles":332,"formTitle":"[477]汉明距离总和","frequency":2.426844675,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":65294,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4434380888699775,"acs":7295,"articleLive":2,"columnArticles":51,"formTitle":"[478]在圆内随机生成点","frequency":1.2921924499,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":16451,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.424008517434123,"acs":3186,"articleLive":2,"columnArticles":27,"formTitle":"[479]最大回文数乘积","frequency":0.9271822964,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7514,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4477144646211647,"acs":30030,"articleLive":2,"columnArticles":409,"formTitle":"[480]滑动窗口中位数","frequency":2.1848777892,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":67074,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5440917923568058,"acs":5880,"articleLive":2,"columnArticles":100,"formTitle":"[481]神奇字符串","frequency":0.297716034,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10807,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.47239514236146546,"acs":41661,"articleLive":2,"columnArticles":443,"formTitle":"[482]密钥格式化","frequency":1.2268310657,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":88191,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5915893445076325,"acs":15812,"articleLive":2,"columnArticles":119,"formTitle":"[483]最小好进制","frequency":1.7017617468,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"ac","submitted":26728,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6364406779661017,"acs":1502,"articleLive":2,"columnArticles":36,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2360,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6073977221567669,"acs":126821,"articleLive":2,"columnArticles":1033,"formTitle":"[485]最大连续 1 的个数","frequency":2.3640745009,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":208794,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5864232743867656,"acs":47288,"articleLive":2,"columnArticles":406,"formTitle":"[486]预测赢家","frequency":1.9084048013,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":80638,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5781264252485634,"acs":6338,"articleLive":2,"columnArticles":119,"formTitle":"[487]最大连续1的个数 II","frequency":1.4922302339,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":10963,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.5324859201459899,"acs":16924,"articleLive":2,"columnArticles":170,"formTitle":"[488]祖玛游戏","frequency":1.2820596243,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"ac","submitted":31783,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7252382925818484,"acs":1750,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2413,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4858243875584916,"acs":7060,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.3250252134,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":14532,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5434459085132037,"acs":50028,"articleLive":2,"columnArticles":423,"formTitle":"[491]递增子序列","frequency":2.2648820538,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":92057,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.605586999689311,"acs":44831,"articleLive":2,"columnArticles":427,"formTitle":"[492]构造矩形","frequency":0.5434862923,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":74029,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3461686462635643,"acs":26988,"articleLive":2,"columnArticles":273,"formTitle":"[493]翻转对","frequency":1.4922302339,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":77962,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4924302118793194,"acs":158109,"articleLive":2,"columnArticles":1080,"formTitle":"[494]目标和","frequency":3.3245052904,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":321079,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.6080176464946773,"acs":63398,"articleLive":2,"columnArticles":918,"formTitle":"[495]提莫攻击","frequency":0.9543431187,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"ac","submitted":104270,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.7049570708719963,"acs":140321,"articleLive":2,"columnArticles":1441,"formTitle":"[496]下一个更大元素 I","frequency":1.0548858195,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":199049,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4030158525583194,"acs":3127,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.3535496801,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7759,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4729291610991993,"acs":45658,"articleLive":2,"columnArticles":467,"formTitle":"[498]对角线遍历","frequency":2.6955034929,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":96543,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3736309441286566,"acs":2695,"articleLive":2,"columnArticles":50,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":7213,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7440067009415978,"acs":51518,"articleLive":2,"columnArticles":756,"formTitle":"[500]键盘行","frequency":0.8775106866,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"ac","submitted":69244,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5149024559725637,"acs":68913,"articleLive":2,"columnArticles":568,"formTitle":"[501]二叉搜索树中的众数","frequency":2.220036974,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":133837,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4408817037523116,"acs":29562,"articleLive":2,"columnArticles":359,"formTitle":"[502]IPO","frequency":2.1182974641,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":67052,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6378696274143889,"acs":108353,"articleLive":2,"columnArticles":1024,"formTitle":"[503]下一个更大元素 II","frequency":2.2232997261,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":169867,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5036606205026103,"acs":32127,"articleLive":2,"columnArticles":340,"formTitle":"[504]七进制数","frequency":0.8349510722,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":63787,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48634061280411855,"acs":5857,"articleLive":2,"columnArticles":70,"formTitle":"[505]迷宫 II","frequency":0.9271822964,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":12043,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5618121699649608,"acs":22768,"articleLive":2,"columnArticles":307,"formTitle":"[506]相对名次","frequency":1.4007588304,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":40526,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41628716129985627,"acs":30988,"articleLive":2,"columnArticles":245,"formTitle":"[507]完美数","frequency":0.8952102637,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":74439,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6768880557043385,"acs":15165,"articleLive":2,"columnArticles":215,"formTitle":"[508]出现次数最多的子树元素和","frequency":1.1959644178,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":22404,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6723698589564205,"acs":263335,"articleLive":2,"columnArticles":1569,"formTitle":"[509]斐波那契数","frequency":2.9453879779,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"ac","submitted":391652,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6068654019873532,"acs":3359,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5535,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7311193465980642,"acs":20320,"articleLive":2,"columnArticles":115,"formTitle":"[511]游戏玩法分析 I","frequency":1.7017617468,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":27793,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5378604755747934,"acs":19136,"articleLive":2,"columnArticles":155,"formTitle":"[512]游戏玩法分析 II","frequency":0.2715365284,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":35578,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7318586205048502,"acs":54623,"articleLive":2,"columnArticles":611,"formTitle":"[513]找树左下角的值","frequency":0.2222654794,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":74636,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.49912451848516687,"acs":19954,"articleLive":2,"columnArticles":245,"formTitle":"[514]自由之路","frequency":0.3833848286,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39978,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6456217231395258,"acs":41252,"articleLive":2,"columnArticles":450,"formTitle":"[515]在每个树行中找最大值","frequency":1.1374682111,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":63895,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6557122779934026,"acs":90047,"articleLive":2,"columnArticles":646,"formTitle":"[516]最长回文子序列","frequency":2.9984882536,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":137327,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5090091268077094,"acs":19464,"articleLive":2,"columnArticles":169,"formTitle":"[517]超级洗衣机","frequency":2.6572939648,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":38239,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6599023799261442,"acs":113296,"articleLive":2,"columnArticles":711,"formTitle":"[518]零钱兑换 II","frequency":3.2966434847,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":171686,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39630100240011296,"acs":2807,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":7083,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.562489833541181,"acs":41496,"articleLive":2,"columnArticles":687,"formTitle":"[520]检测大写字母","frequency":0.8644953185,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":73772,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7129893628687356,"acs":26007,"articleLive":2,"columnArticles":261,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.2222654794,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":36476,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3623248358239826,"acs":7007,"articleLive":2,"columnArticles":111,"formTitle":"[522]最长特殊序列 II","frequency":1.2588782432,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":19339,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2753212492220739,"acs":70341,"articleLive":2,"columnArticles":612,"formTitle":"[523]连续的子数组和","frequency":2.8609721814,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":255487,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4962762626733636,"acs":74500,"articleLive":2,"columnArticles":775,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":2.5116412117,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":150118,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364845994945356,"acs":46488,"articleLive":2,"columnArticles":528,"formTitle":"[525]连续数组","frequency":3.5371873035,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":86653,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7348790760279623,"acs":33850,"articleLive":2,"columnArticles":389,"formTitle":"[526]优美的排列","frequency":2.8860718007,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":46062,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789624534250501,"acs":2020,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3489,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4781113980081151,"acs":32404,"articleLive":2,"columnArticles":262,"formTitle":"[528]按权重随机选择","frequency":2.3671160508,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":67775,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6443749101997158,"acs":40363,"articleLive":2,"columnArticles":468,"formTitle":"[529]扫雷游戏","frequency":1.9084048013,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":62639,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6213430072176246,"acs":82213,"articleLive":2,"columnArticles":665,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.8349510722,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":132315,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6610311349179779,"acs":3949,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5974,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3766905560050861,"acs":26070,"articleLive":2,"columnArticles":286,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":69208,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5282131661442007,"acs":1685,"articleLive":2,"columnArticles":35,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":3190,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6747138212106365,"acs":15148,"articleLive":2,"columnArticles":145,"formTitle":"[534]游戏玩法分析 III","frequency":0.9605076062,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":22451,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8430932888355843,"acs":16168,"articleLive":2,"columnArticles":107,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.4922302339,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":19177,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5407541577474065,"acs":3284,"articleLive":2,"columnArticles":51,"formTitle":"[536]从字符串生成二叉树","frequency":0.8644953185,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":6073,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7131663302861213,"acs":12014,"articleLive":2,"columnArticles":181,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16846,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7049493562868697,"acs":114003,"articleLive":2,"columnArticles":886,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.1374682111,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":161718,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5990072826396518,"acs":14723,"articleLive":2,"columnArticles":203,"formTitle":"[539]最小时间差","frequency":1.6388439617,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":24579,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5813437535783809,"acs":40615,"articleLive":2,"columnArticles":431,"formTitle":"[540]有序数组中的单一元素","frequency":1.9584954002,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":69864,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6053554954542946,"acs":76773,"articleLive":2,"columnArticles":832,"formTitle":"[541]反转字符串 II","frequency":2.7298947777,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":126823,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45787025551972216,"acs":73827,"articleLive":2,"columnArticles":679,"formTitle":"[542]01 矩阵","frequency":2.5991605897,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":161240,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.55436682922686,"acs":156643,"articleLive":2,"columnArticles":1274,"formTitle":"[543]二叉树的直径","frequency":3.3581854215,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":282562,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7128953771289538,"acs":2344,"articleLive":2,"columnArticles":54,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3288,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.42089693527393207,"acs":3557,"articleLive":2,"columnArticles":80,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":8451,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6279922541304438,"acs":15242,"articleLive":2,"columnArticles":122,"formTitle":"[546]移除盒子","frequency":0.3833848286,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24271,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6185615698621612,"acs":168957,"articleLive":2,"columnArticles":1185,"formTitle":"[547]省份数量","frequency":1.8915010857,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":273145,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3549217242118808,"acs":1655,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.5163520033,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4663,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4864282636794485,"acs":2258,"articleLive":2,"columnArticles":53,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4642,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4373075663282018,"acs":13351,"articleLive":2,"columnArticles":189,"formTitle":"[550]游戏玩法分析 IV","frequency":0.8644953185,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":30530,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.567573975720789,"acs":59845,"articleLive":2,"columnArticles":767,"formTitle":"[551]学生出勤记录 I","frequency":2.2320563495,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":105440,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5778020880401437,"acs":24296,"articleLive":2,"columnArticles":288,"formTitle":"[552]学生出勤记录 II","frequency":2.3341858445,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":42049,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6068197633959638,"acs":6104,"articleLive":2,"columnArticles":90,"formTitle":"[553]最优除法","frequency":0.297716034,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":10059,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5036336109008327,"acs":46571,"articleLive":2,"columnArticles":490,"formTitle":"[554]砖墙","frequency":2.022447047,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":92470,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3446275946275946,"acs":1129,"articleLive":2,"columnArticles":24,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3276,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3280557314756175,"acs":15540,"articleLive":2,"columnArticles":227,"formTitle":"[556]下一个更大元素 III","frequency":1.8749045717,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":47370,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7443428394296342,"acs":172890,"articleLive":2,"columnArticles":1446,"formTitle":"[557]反转字符串中的单词 III","frequency":3.3493109889,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":232272,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5047185709470846,"acs":2995,"articleLive":2,"columnArticles":40,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5934,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7285161172077252,"acs":63598,"articleLive":2,"columnArticles":566,"formTitle":"[559]N 叉树的最大深度","frequency":1.2588782432,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":87298,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44612401145617897,"acs":159194,"articleLive":2,"columnArticles":972,"formTitle":"[560]和为 K 的子数组","frequency":3.7502005827,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":356838,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7752394245402796,"acs":92200,"articleLive":2,"columnArticles":771,"formTitle":"[561]数组拆分 I","frequency":1.2268310657,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":118931,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4685355356519716,"acs":4028,"articleLive":2,"columnArticles":65,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":8597,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.607232033827255,"acs":33317,"articleLive":2,"columnArticles":337,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":54867,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.18021006080707574,"acs":4564,"articleLive":2,"columnArticles":82,"formTitle":"[564]寻找最近的回文数","frequency":1.3268699883,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":25326,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6091854419410745,"acs":14763,"articleLive":2,"columnArticles":143,"formTitle":"[565]数组嵌套","frequency":1.1959644178,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":24234,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.684036484885227,"acs":74469,"articleLive":2,"columnArticles":698,"formTitle":"[566]重塑矩阵","frequency":2.1399667843,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":108867,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4324406727984145,"acs":127650,"articleLive":2,"columnArticles":1165,"formTitle":"[567]字符串的排列","frequency":2.8281090768,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":295185,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5070656691604323,"acs":1220,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2406,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.565550448675859,"acs":10336,"articleLive":2,"columnArticles":160,"formTitle":"[569]员工薪水中位数","frequency":1.9084048013,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":18276,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.661382586775257,"acs":13643,"articleLive":2,"columnArticles":117,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.8349510722,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":20628,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48281494589260193,"acs":7094,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.3250252134,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":14693,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4725314566005545,"acs":88628,"articleLive":2,"columnArticles":770,"formTitle":"[572]另一棵树的子树","frequency":2.2771090134,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":187560,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6628930817610063,"acs":1054,"articleLive":2,"columnArticles":33,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1590,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6491065325651791,"acs":13295,"articleLive":2,"columnArticles":119,"formTitle":"[574]当选者","frequency":0.297716034,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":20482,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.7131480853947815,"acs":84180,"articleLive":2,"columnArticles":821,"formTitle":"[575]分糖果","frequency":1.6697487699,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"ac","submitted":118040,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4679696367763905,"acs":26386,"articleLive":2,"columnArticles":286,"formTitle":"[576]出界的路径数","frequency":2.056165683,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":56384,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7012326183269728,"acs":15986,"articleLive":2,"columnArticles":89,"formTitle":"[577]员工奖金","frequency":1.2588782432,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":22797,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.48992116319690315,"acs":10378,"articleLive":2,"columnArticles":115,"formTitle":"[578]查询回答率最高的问题","frequency":0.297716034,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":21183,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.40947623372691494,"acs":8115,"articleLive":2,"columnArticles":134,"formTitle":"[579]查询员工的累计薪水","frequency":0.8952102637,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":19818,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5223498102607067,"acs":10599,"articleLive":2,"columnArticles":83,"formTitle":"[580]统计各专业学生人数","frequency":0.8952102637,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":20291,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.405298659275033,"acs":102207,"articleLive":2,"columnArticles":886,"formTitle":"[581]最短无序连续子数组","frequency":2.6666625925,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":252177,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.41268162589663415,"acs":8975,"articleLive":2,"columnArticles":137,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":21748,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6221042867710083,"acs":52984,"articleLive":2,"columnArticles":504,"formTitle":"[583]两个字符串的删除操作","frequency":3.1839675849,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":85169,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7749933208656158,"acs":14504,"articleLive":2,"columnArticles":64,"formTitle":"[584]寻找用户推荐人","frequency":0.297716034,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":18715,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5872108481786759,"acs":8834,"articleLive":2,"columnArticles":107,"formTitle":"[585]2016年的投资","frequency":0.297716034,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":15044,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7452949165696546,"acs":15365,"articleLive":2,"columnArticles":91,"formTitle":"[586]订单最多的客户","frequency":0.9271822964,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":20616,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38669475162366157,"acs":2203,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5697,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42203070293563155,"acs":1567,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":1.0316613665,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3713,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7455796804588284,"acs":90998,"articleLive":2,"columnArticles":580,"formTitle":"[589]N 叉树的前序遍历","frequency":1.4922302339,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":122050,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7620780939774984,"acs":64484,"articleLive":2,"columnArticles":480,"formTitle":"[590]N 叉树的后序遍历","frequency":0.297716034,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":84616,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3403322987036699,"acs":1864,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":1.1097040735,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5477,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5244464426211083,"acs":4666,"articleLive":2,"columnArticles":114,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8897,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.441771571275674,"acs":8668,"articleLive":2,"columnArticles":141,"formTitle":"[593]有效的正方形","frequency":1.5249878304,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19621,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5191064977357146,"acs":30606,"articleLive":2,"columnArticles":284,"formTitle":"[594]最长和谐子序列","frequency":0.8349510722,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":58959,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7968490008844383,"acs":106314,"articleLive":2,"columnArticles":246,"formTitle":"[595]大的国家","frequency":1.5800830077,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":133418,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4246213853801728,"acs":84478,"articleLive":2,"columnArticles":301,"formTitle":"[596]超过5名学生的课","frequency":1.9899162974,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":198949,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44175725744065797,"acs":10850,"articleLive":2,"columnArticles":86,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.2715365284,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":24561,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.57162488081216,"acs":40766,"articleLive":2,"columnArticles":482,"formTitle":"[598]范围求和 II","frequency":0.9835288807,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":71316,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5218985043658684,"acs":30184,"articleLive":2,"columnArticles":291,"formTitle":"[599]两个列表的最小索引总和","frequency":0.2464095784,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":57835,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48140541878015586,"acs":19456,"articleLive":2,"columnArticles":233,"formTitle":"[600]不含连续1的非负整数","frequency":2.2648820538,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40415,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5030998710944693,"acs":32784,"articleLive":2,"columnArticles":388,"formTitle":"[601]体育馆的人流量","frequency":2.3949394166,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":65164,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6242495240884464,"acs":8526,"articleLive":2,"columnArticles":94,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.9271822964,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":13658,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6707969023232575,"acs":13426,"articleLive":2,"columnArticles":117,"formTitle":"[603]连续空余座位","frequency":1.4922302339,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":20015,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37422406148389004,"acs":2532,"articleLive":2,"columnArticles":59,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6766,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33312157055098707,"acs":112738,"articleLive":2,"columnArticles":1295,"formTitle":"[605]种花问题","frequency":2.3615473325,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":338429,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5686527499614852,"acs":29529,"articleLive":2,"columnArticles":323,"formTitle":"[606]根据二叉树创建字符串","frequency":0.3250252134,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":51928,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6625232102331339,"acs":12845,"articleLive":2,"columnArticles":89,"formTitle":"[607]销售员","frequency":1.2268310657,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":19388,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6480969420949902,"acs":7969,"articleLive":2,"columnArticles":106,"formTitle":"[608]树节点","frequency":0.8952102637,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":12296,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48380581403736567,"acs":6707,"articleLive":2,"columnArticles":104,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13863,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6636944210145801,"acs":11016,"articleLive":2,"columnArticles":75,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":16598,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5323920861466583,"acs":51962,"articleLive":2,"columnArticles":408,"formTitle":"[611]有效三角形的个数","frequency":3.8038651624,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":97601,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6670105751870002,"acs":7758,"articleLive":2,"columnArticles":69,"formTitle":"[612]平面上的最近距离","frequency":0.8644953185,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":11631,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8157435966206249,"acs":12166,"articleLive":2,"columnArticles":85,"formTitle":"[613]直线上的最近距离","frequency":0.297716034,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":14914,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34816318246397404,"acs":8577,"articleLive":2,"columnArticles":71,"formTitle":"[614]二级关注者","frequency":0.8644953185,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":24635,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42301852414211966,"acs":5572,"articleLive":2,"columnArticles":94,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":13172,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4648785021909441,"acs":3501,"articleLive":2,"columnArticles":58,"formTitle":"[616]给字符串添加加粗标签","frequency":2.0169449698,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":7531,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7874422687586993,"acs":199141,"articleLive":2,"columnArticles":1312,"formTitle":"[617]合并二叉树","frequency":2.9894841409,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":252896,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6199408968264165,"acs":4825,"articleLive":2,"columnArticles":48,"formTitle":"[618]学生地理信息报告","frequency":0.297716034,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":7783,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46422570434918525,"acs":11880,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.297716034,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":25591,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7733339781410195,"acs":95946,"articleLive":2,"columnArticles":322,"formTitle":"[620]有趣的电影","frequency":1.8425915827,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":124068,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.571896635231773,"acs":80292,"articleLive":2,"columnArticles":516,"formTitle":"[621]任务调度器","frequency":2.8527484508,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":140396,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4386577559637848,"acs":68460,"articleLive":2,"columnArticles":437,"formTitle":"[622]设计循环队列","frequency":1.6089767315,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":156067,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.54601930612635,"acs":11426,"articleLive":2,"columnArticles":195,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20926,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.422331011109019,"acs":2243,"articleLive":2,"columnArticles":53,"formTitle":"[624]数组列表中的最大距离","frequency":0.6783820115,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5311,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3432534338809588,"acs":2549,"articleLive":2,"columnArticles":55,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7426,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.683972944940324,"acs":46820,"articleLive":2,"columnArticles":368,"formTitle":"[626]换座位","frequency":1.2268310657,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":68453,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8087053489143657,"acs":87751,"articleLive":2,"columnArticles":351,"formTitle":"[627]变更性别","frequency":0.2464095784,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":108508,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5245601688951442,"acs":81994,"articleLive":2,"columnArticles":783,"formTitle":"[628]三个数的最大乘积","frequency":1.1097040735,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":156310,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.525904408241495,"acs":17561,"articleLive":2,"columnArticles":158,"formTitle":"[629]K个逆序对数组","frequency":1.310931872,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"ac","submitted":33392,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3708520179372197,"acs":6616,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17840,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28963175763907023,"acs":1109,"articleLive":2,"columnArticles":36,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3829,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5983394200455723,"acs":19169,"articleLive":2,"columnArticles":242,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":32037,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3965312582432076,"acs":96208,"articleLive":2,"columnArticles":783,"formTitle":"[633]平方数之和","frequency":1.5800830077,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":242624,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44071020925808496,"acs":1390,"articleLive":2,"columnArticles":22,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3154,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5542560103963613,"acs":4265,"articleLive":2,"columnArticles":70,"formTitle":"[635]设计日志存储系统","frequency":0.4474271949,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":7695,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5545953584433937,"acs":10204,"articleLive":2,"columnArticles":115,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":18399,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900276223528579,"acs":77940,"articleLive":2,"columnArticles":676,"formTitle":"[637]二叉树的层平均值","frequency":1.1374682111,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":112952,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.647170119829016,"acs":27706,"articleLive":2,"columnArticles":266,"formTitle":"[638]大礼包","frequency":0.9702924201,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"ac","submitted":42811,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37674997214898437,"acs":20291,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":2.1182974641,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53858,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4255983350676379,"acs":11043,"articleLive":2,"columnArticles":216,"formTitle":"[640]求解方程","frequency":0.3250252134,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25947,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5324728293467047,"acs":22194,"articleLive":2,"columnArticles":249,"formTitle":"[641]设计循环双端队列","frequency":1.1959644178,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":41681,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49480249480249483,"acs":2618,"articleLive":2,"columnArticles":59,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":5291,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.44903108461086116,"acs":65669,"articleLive":2,"columnArticles":592,"formTitle":"[643]子数组最大平均数 I","frequency":1.5800830077,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":146246,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4053497942386831,"acs":1182,"articleLive":2,"columnArticles":25,"formTitle":"[644]子数组最大平均数 II","frequency":0.7270297357,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2916,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4315767497267491,"acs":70284,"articleLive":2,"columnArticles":715,"formTitle":"[645]错误的集合","frequency":1.7017617468,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":162854,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5785640999974976,"acs":23120,"articleLive":2,"columnArticles":212,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":39961,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6572787069528627,"acs":129804,"articleLive":2,"columnArticles":953,"formTitle":"[647]回文子串","frequency":2.9374620522,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":197487,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.587077834492608,"acs":22198,"articleLive":2,"columnArticles":292,"formTitle":"[648]单词替换","frequency":0.3250252134,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":37811,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4815315682281059,"acs":29554,"articleLive":2,"columnArticles":311,"formTitle":"[649]Dota2 参议院","frequency":0.8644953185,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":61375,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5674386457884838,"acs":50081,"articleLive":2,"columnArticles":663,"formTitle":"[650]只有两个键的键盘","frequency":2.1182974641,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":88258,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5849856213107311,"acs":3865,"articleLive":2,"columnArticles":66,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6607,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.570482763175274,"acs":34553,"articleLive":2,"columnArticles":247,"formTitle":"[652]寻找重复的子树","frequency":2.6229553737,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":60568,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.6004294839353859,"acs":43898,"articleLive":2,"columnArticles":436,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"ac","submitted":73111,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8104009628175081,"acs":63969,"articleLive":2,"columnArticles":649,"formTitle":"[654]最大二叉树","frequency":2.2128986754,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":78935,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5991758410726367,"acs":9742,"articleLive":2,"columnArticles":144,"formTitle":"[655]输出二叉树","frequency":1.2268310657,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":16259,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3097884546432413,"acs":864,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2789,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833367887366417,"acs":83123,"articleLive":2,"columnArticles":640,"formTitle":"[657]机器人能否返回原点","frequency":0.297716034,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":106114,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4552819235806801,"acs":28156,"articleLive":2,"columnArticles":247,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.4922302339,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":61843,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5413774894387448,"acs":28706,"articleLive":2,"columnArticles":262,"formTitle":"[659]分割数组为连续子序列","frequency":0.2715365284,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":53024,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6556473829201102,"acs":714,"articleLive":2,"columnArticles":24,"formTitle":"[660]移除 9","frequency":1.0316613665,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1089,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5616663922278939,"acs":17055,"articleLive":2,"columnArticles":217,"formTitle":"[661]图片平滑器","frequency":0.297716034,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":30365,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40921009948096887,"acs":30275,"articleLive":2,"columnArticles":287,"formTitle":"[662]二叉树最大宽度","frequency":2.3949394166,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":73984,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46552166111253523,"acs":1816,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3901,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6536947838345865,"acs":22257,"articleLive":2,"columnArticles":191,"formTitle":"[664]奇怪的打印机","frequency":2.6955034929,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":34048,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27082267144319344,"acs":76203,"articleLive":2,"columnArticles":954,"formTitle":"[665]非递减数列","frequency":2.1848777892,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":281376,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6187624750499002,"acs":2170,"articleLive":2,"columnArticles":79,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3507,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6232466449313823,"acs":8220,"articleLive":2,"columnArticles":124,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":13189,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5106171436687735,"acs":7190,"articleLive":2,"columnArticles":74,"formTitle":"[668]乘法表中第k小的数","frequency":1.2268310657,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":14081,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6649131031130093,"acs":38297,"articleLive":2,"columnArticles":320,"formTitle":"[669]修剪二叉搜索树","frequency":0.806499651,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":57597,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.45306476264342904,"acs":19861,"articleLive":2,"columnArticles":296,"formTitle":"[670]最大交换","frequency":2.4940660669,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":43837,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48541742780000535,"acs":54475,"articleLive":2,"columnArticles":684,"formTitle":"[671]二叉树中第二小的节点","frequency":2.529546793,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":112223,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5472350230414746,"acs":3800,"articleLive":2,"columnArticles":43,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.297716034,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6944,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.43613982649912014,"acs":49320,"articleLive":2,"columnArticles":421,"formTitle":"[673]最长递增子序列的个数","frequency":3.2451224629,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":113083,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4994896099161502,"acs":95907,"articleLive":2,"columnArticles":796,"formTitle":"[674]最长连续递增序列","frequency":1.9584954002,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":192010,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.4003480123142819,"acs":2991,"articleLive":2,"columnArticles":49,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.4474271949,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7471,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.592910765420633,"acs":7661,"articleLive":2,"columnArticles":138,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12921,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6186869693466736,"acs":15521,"articleLive":2,"columnArticles":265,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":25087,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.38583688028812185,"acs":44781,"articleLive":2,"columnArticles":484,"formTitle":"[678]有效的括号字符串","frequency":3.1504953099,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":116062,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5411983487963379,"acs":26483,"articleLive":2,"columnArticles":266,"formTitle":"[679]24 点游戏","frequency":3.1066286278,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48934,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4013920801924188,"acs":89616,"articleLive":2,"columnArticles":846,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.2003412178,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":223263,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5075320810861075,"acs":2729,"articleLive":2,"columnArticles":65,"formTitle":"[681]最近时刻","frequency":0.3535496801,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":5377,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6935032410135533,"acs":47075,"articleLive":2,"columnArticles":523,"formTitle":"[682]棒球比赛","frequency":1.1374682111,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":67880,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4351015801354402,"acs":2313,"articleLive":2,"columnArticles":53,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":5316,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6661705707260256,"acs":61770,"articleLive":2,"columnArticles":625,"formTitle":"[684]冗余连接","frequency":1.2588782432,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":92724,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43001199974737375,"acs":20426,"articleLive":2,"columnArticles":257,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":47501,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35703623012991204,"acs":17699,"articleLive":2,"columnArticles":201,"formTitle":"[686]重复叠加字符串匹配","frequency":0.2464095784,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":49572,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4424475050801535,"acs":39192,"articleLive":2,"columnArticles":275,"formTitle":"[687]最长同值路径","frequency":2.2003412178,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":88580,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.512952086553323,"acs":8297,"articleLive":2,"columnArticles":109,"formTitle":"[688]“马”在棋盘上的概率","frequency":1.4922302339,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":16175,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4890196641309028,"acs":3407,"articleLive":2,"columnArticles":71,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.8749045717,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6967,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.647989062321978,"acs":56874,"articleLive":2,"columnArticles":579,"formTitle":"[690]员工的重要性","frequency":1.7349609185,"frontendQuestionId":"690","leaf":true,"level":2,"nodeType":"def","questionId":"690","status":"ac","submitted":87770,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4890016920473773,"acs":3757,"articleLive":2,"columnArticles":53,"formTitle":"[691]贴纸拼词","frequency":0.4146373721,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7683,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.576511896893589,"acs":69781,"articleLive":2,"columnArticles":761,"formTitle":"[692]前K个高频单词","frequency":2.9089430091,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":121040,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6087649402390438,"acs":26740,"articleLive":2,"columnArticles":297,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":43925,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5356921166977033,"acs":4315,"articleLive":2,"columnArticles":87,"formTitle":"[694]不同岛屿的数量","frequency":0.297716034,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":8055,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6667466813893757,"acs":138880,"articleLive":2,"columnArticles":1382,"formTitle":"[695]岛屿的最大面积","frequency":2.9412038714,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":208295,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6323602705589177,"acs":53289,"articleLive":2,"columnArticles":481,"formTitle":"[696]计数二进制子串","frequency":1.1662003159,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":84270,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6045124296602322,"acs":67894,"articleLive":2,"columnArticles":866,"formTitle":"[697]数组的度","frequency":0.806499651,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":112312,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4473079612426331,"acs":31346,"articleLive":2,"columnArticles":225,"formTitle":"[698]划分为k个相等的子集","frequency":2.9205845842,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":70077,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4772803769774487,"acs":2836,"articleLive":2,"columnArticles":42,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5942,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7614674138646741,"acs":88050,"articleLive":2,"columnArticles":562,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.7023065976,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":115632,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7225930817834577,"acs":80968,"articleLive":2,"columnArticles":605,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.3722993115,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"ac","submitted":112052,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7423994769532527,"acs":4542,"articleLive":2,"columnArticles":79,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":6118,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5132499751252031,"acs":61900,"articleLive":2,"columnArticles":567,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.6089767315,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":120604,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5522704218125228,"acs":327202,"articleLive":2,"columnArticles":1610,"formTitle":"[704]二分查找","frequency":4.6198422863,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":592467,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.644195726574785,"acs":69644,"articleLive":2,"columnArticles":445,"formTitle":"[705]设计哈希集合","frequency":2.4487273863,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":108110,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6427085203688252,"acs":60851,"articleLive":2,"columnArticles":403,"formTitle":"[706]设计哈希映射","frequency":1.1374682111,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":94679,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3237466882852911,"acs":69286,"articleLive":2,"columnArticles":470,"formTitle":"[707]设计链表","frequency":2.6572939648,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":214013,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3418958536925869,"acs":2449,"articleLive":2,"columnArticles":54,"formTitle":"[708]循环有序列表的插入","frequency":0.297716034,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":7163,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7577411754806681,"acs":72043,"articleLive":2,"columnArticles":527,"formTitle":"[709]转换成小写字母","frequency":0.806499651,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":95076,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3551263001485884,"acs":5497,"articleLive":2,"columnArticles":66,"formTitle":"[710]黑名单中的随机数","frequency":0.9271822964,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":15479,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5611237661351557,"acs":739,"articleLive":2,"columnArticles":26,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1317,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6742844938060658,"acs":15785,"articleLive":2,"columnArticles":179,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.297716034,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":23410,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41974810920643113,"acs":26029,"articleLive":2,"columnArticles":237,"formTitle":"[713]乘积小于K的子数组","frequency":2.022447047,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":62011,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7235814499965444,"acs":104695,"articleLive":2,"columnArticles":703,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.2003412178,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":144690,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40865313379759965,"acs":2758,"articleLive":2,"columnArticles":47,"formTitle":"[715]Range 模块","frequency":0.3833848286,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6749,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46316365626710454,"acs":4231,"articleLive":2,"columnArticles":80,"formTitle":"[716]最大栈","frequency":0.2715365284,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":9135,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5113329735563951,"acs":32215,"articleLive":2,"columnArticles":396,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":63002,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5646602812570074,"acs":88135,"articleLive":2,"columnArticles":604,"formTitle":"[718]最长重复子数组","frequency":2.7560468957,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":156085,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3740972748673343,"acs":9376,"articleLive":2,"columnArticles":88,"formTitle":"[719]找出第 k 小的距离对","frequency":2.022447047,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":25063,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48401520232506146,"acs":21650,"articleLive":2,"columnArticles":291,"formTitle":"[720]词典中最长的单词","frequency":0.8952102637,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":44730,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4696316333837219,"acs":29514,"articleLive":2,"columnArticles":342,"formTitle":"[721]账户合并","frequency":0.9271822964,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":62845,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3230451386715082,"acs":5160,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":1.9084048013,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15973,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7223382045929019,"acs":1384,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.5951328811,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1916,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.46545535381537395,"acs":142380,"articleLive":2,"columnArticles":890,"formTitle":"[724]寻找数组的中心下标","frequency":1.5521044593,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":305894,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.608938478760964,"acs":49500,"articleLive":2,"columnArticles":627,"formTitle":"[725]分隔链表","frequency":2.3023664245,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":81289,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5523933376681839,"acs":22088,"articleLive":2,"columnArticles":403,"formTitle":"[726]原子的数量","frequency":2.7975796045,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39986,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4089328697512704,"acs":3058,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":1.631282489,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":7478,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7598059750854371,"acs":34461,"articleLive":2,"columnArticles":318,"formTitle":"[728]自除数","frequency":0.2715365284,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":45355,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5161821819465694,"acs":8772,"articleLive":2,"columnArticles":105,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16994,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49337748344370863,"acs":4023,"articleLive":2,"columnArticles":50,"formTitle":"[730]统计不同回文子序列","frequency":1.5944119532,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8154,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.505019120458891,"acs":4226,"articleLive":2,"columnArticles":45,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8368,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6111972437553833,"acs":3548,"articleLive":2,"columnArticles":56,"formTitle":"[732]我的日程安排表 III","frequency":0.8349510722,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5805,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.580307821712511,"acs":71751,"articleLive":2,"columnArticles":613,"formTitle":"[733]图像渲染","frequency":2.63021072,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":123643,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4810580587312262,"acs":2146,"articleLive":2,"columnArticles":39,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":4461,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4090510789002884,"acs":22407,"articleLive":2,"columnArticles":284,"formTitle":"[735]行星碰撞","frequency":2.5447294245,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":54778,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46674479929680635,"acs":1593,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3413,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4632814315593772,"acs":3987,"articleLive":2,"columnArticles":68,"formTitle":"[737]句子相似性 II","frequency":0.4474271949,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":8606,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5011769136616138,"acs":42584,"articleLive":2,"columnArticles":602,"formTitle":"[738]单调递增的数字","frequency":0.9271822964,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":84968,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6810730619553833,"acs":221739,"articleLive":2,"columnArticles":1581,"formTitle":"[739]每日温度","frequency":3.5326919037,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":325573,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6280807759580219,"acs":55300,"articleLive":2,"columnArticles":626,"formTitle":"[740]删除并获得点数","frequency":2.5898059845,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":88046,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36939218523878437,"acs":4084,"articleLive":2,"columnArticles":47,"formTitle":"[741]摘樱桃","frequency":1.3630185024,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":11056,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49553708833487226,"acs":1610,"articleLive":2,"columnArticles":46,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":3249,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5228524156767309,"acs":59727,"articleLive":2,"columnArticles":538,"formTitle":"[743]网络延迟时间","frequency":2.5116412117,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":114233,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590699233405776,"acs":42458,"articleLive":2,"columnArticles":381,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.2222654794,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":92487,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3972152896361487,"acs":3024,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7613,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5928544220584802,"acs":144746,"articleLive":2,"columnArticles":1370,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.4394076543,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":244151,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4181938357900837,"acs":46187,"articleLive":2,"columnArticles":419,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.2715365284,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":110444,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6004673989249825,"acs":12847,"articleLive":2,"columnArticles":183,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":21395,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.506108202443281,"acs":1450,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2865,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7205056179775281,"acs":2052,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.5163520033,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2848,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5019197207678883,"acs":1438,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2865,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5298388459814375,"acs":72101,"articleLive":2,"columnArticles":606,"formTitle":"[752]打开转盘锁","frequency":1.9584954002,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":136081,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5941616233535066,"acs":3338,"articleLive":2,"columnArticles":43,"formTitle":"[753]破解保险箱","frequency":0.4818895991,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5618,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4316353887399464,"acs":8211,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":19023,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4976041282712864,"acs":1350,"articleLive":2,"columnArticles":32,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2713,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5615476190476191,"acs":4717,"articleLive":2,"columnArticles":69,"formTitle":"[756]金字塔转换矩阵","frequency":0.4474271949,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8400,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41954408313778074,"acs":2503,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.4818895991,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5966,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46337954486005756,"acs":3543,"articleLive":2,"columnArticles":69,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7646,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6675585284280936,"acs":1996,"articleLive":2,"columnArticles":47,"formTitle":"[759]员工空闲时间","frequency":0.4818895991,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2990,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8386363636363636,"acs":4059,"articleLive":2,"columnArticles":94,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4840,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5925619834710744,"acs":2151,"articleLive":2,"columnArticles":35,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3630,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.700388058554578,"acs":18229,"articleLive":2,"columnArticles":151,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":26027,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7625842003095172,"acs":85247,"articleLive":2,"columnArticles":1023,"formTitle":"[763]划分字母区间","frequency":2.7298947777,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":111787,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4950266018968309,"acs":4280,"articleLive":2,"columnArticles":56,"formTitle":"[764]最大加号标志","frequency":0.3535496801,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8646,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6647044285168625,"acs":29584,"articleLive":2,"columnArticles":449,"formTitle":"[765]情侣牵手","frequency":1.6697487699,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":44507,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080399583132101,"acs":55710,"articleLive":2,"columnArticles":643,"formTitle":"[766]托普利茨矩阵","frequency":0.3250252134,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":78682,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4780382994211645,"acs":40715,"articleLive":2,"columnArticles":502,"formTitle":"[767]重构字符串","frequency":2.3671160508,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":85171,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5089569882695281,"acs":5597,"articleLive":2,"columnArticles":83,"formTitle":"[768]最多能完成排序的块 II","frequency":0.3833848286,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10997,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5867775948747609,"acs":13189,"articleLive":2,"columnArticles":157,"formTitle":"[769]最多能完成排序的块","frequency":0.3250252134,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":22477,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5556552962298025,"acs":1238,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2228,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8511325258792339,"acs":154741,"articleLive":2,"columnArticles":1144,"formTitle":"[771]宝石与石头","frequency":1.7017617468,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":181806,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4970096610949241,"acs":6482,"articleLive":2,"columnArticles":130,"formTitle":"[772]基本计算器 III","frequency":1.0316613665,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":13042,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7113340499223695,"acs":23824,"articleLive":2,"columnArticles":340,"formTitle":"[773]滑动谜题","frequency":1.9899162974,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":33492,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5902140672782875,"acs":1158,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.8349510722,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1962,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4592161016949153,"acs":5202,"articleLive":2,"columnArticles":84,"formTitle":"[775]全局倒置与局部倒置","frequency":0.4146373721,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11328,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5650419124495498,"acs":1820,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3221,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.324440668365902,"acs":5728,"articleLive":2,"columnArticles":62,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.9605076062,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17655,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5938660329719293,"acs":23991,"articleLive":2,"columnArticles":351,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":40398,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43658414489851644,"acs":19187,"articleLive":2,"columnArticles":239,"formTitle":"[779]第K个语法符号","frequency":1.4922302339,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43948,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2861989990669268,"acs":3374,"articleLive":2,"columnArticles":53,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11789,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6155630535638971,"acs":43785,"articleLive":2,"columnArticles":669,"formTitle":"[781]森林中的兔子","frequency":2.7631425209,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":71130,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4116229244777718,"acs":1537,"articleLive":2,"columnArticles":32,"formTitle":"[782]变为棋盘","frequency":0.6783820115,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3734,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5961618020786721,"acs":70610,"articleLive":2,"columnArticles":686,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.8349510722,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":118441,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6892611887283921,"acs":46572,"articleLive":2,"columnArticles":524,"formTitle":"[784]字母大小写全排列","frequency":1.6697487699,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":67568,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5137622570101497,"acs":41811,"articleLive":2,"columnArticles":418,"formTitle":"[785]判断二分图","frequency":2.056165683,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":81382,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.478115567054765,"acs":4435,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.3250252134,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9276,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.390301538240368,"acs":43439,"articleLive":2,"columnArticles":413,"formTitle":"[787]K 站中转内最便宜的航班","frequency":2.6572939648,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":111296,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6086644249289935,"acs":18644,"articleLive":2,"columnArticles":193,"formTitle":"[788]旋转数字","frequency":0.9271822964,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30631,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6921229270860753,"acs":21035,"articleLive":2,"columnArticles":299,"formTitle":"[789]逃脱阻碍者","frequency":2.0867117353,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30392,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4491031390134529,"acs":4006,"articleLive":2,"columnArticles":70,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.3250252134,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8920,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6954063604240283,"acs":11808,"articleLive":2,"columnArticles":210,"formTitle":"[791]自定义字符串排序","frequency":1.4922302339,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16980,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4648669911983085,"acs":9454,"articleLive":2,"columnArticles":102,"formTitle":"[792]匹配子序列的单词数","frequency":0.3250252134,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":20337,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3923082689856811,"acs":5233,"articleLive":2,"columnArticles":70,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":13339,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3418358017919181,"acs":7478,"articleLive":2,"columnArticles":107,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21876,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5322096660920641,"acs":8336,"articleLive":2,"columnArticles":92,"formTitle":"[795]区间子数组个数","frequency":1.4922302339,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15663,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5341989284479779,"acs":24727,"articleLive":2,"columnArticles":305,"formTitle":"[796]旋转字符串","frequency":2.1182974641,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":46288,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7911454648976001,"acs":45854,"articleLive":2,"columnArticles":566,"formTitle":"[797]所有可能的路径","frequency":2.1399667843,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":57959,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46713917525773196,"acs":1450,"articleLive":2,"columnArticles":36,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":3104,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4097713562225367,"acs":5502,"articleLive":2,"columnArticles":71,"formTitle":"[799]香槟塔","frequency":1.6697487699,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13427,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7100142382534409,"acs":1496,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":2107,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4192073170731707,"acs":7425,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":1.5249878304,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17712,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5766948226898712,"acs":31679,"articleLive":2,"columnArticles":335,"formTitle":"[802]找到最终的安全状态","frequency":2.2988963676,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54932,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4804191732971085,"acs":12378,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.3833848286,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25765,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7724593301435406,"acs":40361,"articleLive":2,"columnArticles":409,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1662003159,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":52250,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.29148124602670056,"acs":2751,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9438,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6563534866117892,"acs":13874,"articleLive":2,"columnArticles":160,"formTitle":"[806]写字符串需要的行数","frequency":0.297716034,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":21138,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8465339122623147,"acs":16962,"articleLive":2,"columnArticles":229,"formTitle":"[807]保持城市天际线","frequency":1.1959644178,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":20037,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4809381023773827,"acs":4491,"articleLive":2,"columnArticles":43,"formTitle":"[808]分汤","frequency":0.3535496801,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9338,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.42077185963157454,"acs":5048,"articleLive":2,"columnArticles":93,"formTitle":"[809]情感丰富的文字","frequency":0.3535496801,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11997,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7323739744658447,"acs":16693,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":2.2565673805,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22793,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7054421467475535,"acs":15931,"articleLive":2,"columnArticles":202,"formTitle":"[811]子域名访问计数","frequency":0.8349510722,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22583,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6304077713769344,"acs":11162,"articleLive":2,"columnArticles":102,"formTitle":"[812]最大三角形面积","frequency":0.297716034,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17706,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5516000612463635,"acs":7205,"articleLive":2,"columnArticles":85,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":13062,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998782768755752,"acs":23574,"articleLive":2,"columnArticles":370,"formTitle":"[814]二叉树剪枝","frequency":0.806499651,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":33683,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4334546731807006,"acs":27149,"articleLive":2,"columnArticles":321,"formTitle":"[815]公交路线","frequency":3.4492036367,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":62634,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5124843074347887,"acs":3674,"articleLive":2,"columnArticles":66,"formTitle":"[816]模糊坐标","frequency":0.3833848286,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7169,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5920041224717654,"acs":13786,"articleLive":2,"columnArticles":170,"formTitle":"[817]链表组件","frequency":0.297716034,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":23287,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43262741447521524,"acs":3718,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8594,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42180147882590185,"acs":22590,"articleLive":2,"columnArticles":258,"formTitle":"[819]最常见的单词","frequency":0.3250252134,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":53556,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5086813915666482,"acs":55987,"articleLive":2,"columnArticles":614,"formTitle":"[820]单词的压缩编码","frequency":0.8349510722,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":110063,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.692862914085645,"acs":25726,"articleLive":2,"columnArticles":347,"formTitle":"[821]字符的最短距离","frequency":1.460656972,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":37130,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5029676106494828,"acs":2966,"articleLive":2,"columnArticles":42,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5897,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4280525286392847,"acs":3064,"articleLive":2,"columnArticles":55,"formTitle":"[823]带因子的二叉树","frequency":0.4474271949,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":7158,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6161745827984596,"acs":17280,"articleLive":2,"columnArticles":244,"formTitle":"[824]山羊拉丁文","frequency":0.3250252134,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":28044,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3938528336380256,"acs":6894,"articleLive":2,"columnArticles":95,"formTitle":"[825]适龄的朋友","frequency":0.806499651,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17504,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3765618468112778,"acs":8107,"articleLive":2,"columnArticles":120,"formTitle":"[826]安排工作以达到最大收益","frequency":0.8952102637,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":21529,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.38908535605208167,"acs":9682,"articleLive":2,"columnArticles":187,"formTitle":"[827]最大人工岛","frequency":0.8644953185,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":24884,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4949992536199433,"acs":3316,"articleLive":2,"columnArticles":55,"formTitle":"[828]统计子串中的唯一字符","frequency":0.3833848286,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6699,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36693202694427435,"acs":8988,"articleLive":2,"columnArticles":104,"formTitle":"[829]连续整数求和","frequency":0.8644953185,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":24495,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5429691551370076,"acs":52352,"articleLive":2,"columnArticles":587,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":96418,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40682622708300314,"acs":7700,"articleLive":2,"columnArticles":74,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18927,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7959292490990659,"acs":86578,"articleLive":2,"columnArticles":931,"formTitle":"[832]翻转图像","frequency":1.6697487699,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":108776,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4329771733851384,"acs":5349,"articleLive":2,"columnArticles":81,"formTitle":"[833]字符串中的查找与替换","frequency":0.297716034,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12354,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5272890414699801,"acs":13516,"articleLive":2,"columnArticles":133,"formTitle":"[834]树中距离之和","frequency":0.9271822964,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25633,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5746015155474262,"acs":4398,"articleLive":2,"columnArticles":50,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7654,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47993918299134236,"acs":38195,"articleLive":2,"columnArticles":663,"formTitle":"[836]矩形重叠","frequency":1.2588782432,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":79583,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39673340358271864,"acs":19578,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.9605076062,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49348,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5009073190402581,"acs":7453,"articleLive":2,"columnArticles":129,"formTitle":"[838]推多米诺","frequency":2.2648820538,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14879,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5740911387889778,"acs":19313,"articleLive":2,"columnArticles":274,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33641,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.36054207374724234,"acs":9152,"articleLive":2,"columnArticles":115,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25384,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6584379828301251,"acs":56679,"articleLive":2,"columnArticles":558,"formTitle":"[841]钥匙和房间","frequency":1.460656972,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":86081,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48762144595123447,"acs":28658,"articleLive":2,"columnArticles":322,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0911587565,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58771,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3823066841415465,"acs":2917,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7630,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5100397715958689,"acs":94771,"articleLive":2,"columnArticles":1031,"formTitle":"[844]比较含退格的字符串","frequency":1.1662003159,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":185811,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4212774389572646,"acs":38268,"articleLive":2,"columnArticles":562,"formTitle":"[845]数组中的最长山脉","frequency":1.4301900306,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":90838,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5127781888553703,"acs":9009,"articleLive":2,"columnArticles":127,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17569,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6793056354226567,"acs":18901,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":2.8026012079,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27824,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44984612425466436,"acs":9355,"articleLive":2,"columnArticles":100,"formTitle":"[848]字母移位","frequency":0.8644953185,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20796,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42713251495121185,"acs":16284,"articleLive":2,"columnArticles":191,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":38124,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44940583363341735,"acs":2496,"articleLive":2,"columnArticles":43,"formTitle":"[850]矩形面积 II","frequency":2.056165683,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5554,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48692845615922536,"acs":4526,"articleLive":2,"columnArticles":76,"formTitle":"[851]喧闹和富有","frequency":0.3833848286,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9295,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7154871912920517,"acs":87029,"articleLive":2,"columnArticles":756,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.6704948958,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":121636,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3864482230168576,"acs":10591,"articleLive":2,"columnArticles":130,"formTitle":"[853]车队","frequency":1.8749045717,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":27406,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3608289313287282,"acs":4440,"articleLive":2,"columnArticles":70,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12305,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4088552054248105,"acs":5125,"articleLive":2,"columnArticles":59,"formTitle":"[855]考场就座","frequency":0.2715365284,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":12535,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6279858337728883,"acs":16668,"articleLive":2,"columnArticles":222,"formTitle":"[856]括号的分数","frequency":2.5447294245,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26542,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4693908097590181,"acs":3136,"articleLive":2,"columnArticles":50,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.4474271949,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6681,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5543295305778941,"acs":2964,"articleLive":2,"columnArticles":50,"formTitle":"[858]镜面反射","frequency":1.3630185024,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5347,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30417572264045944,"acs":28970,"articleLive":2,"columnArticles":384,"formTitle":"[859]亲密字符串","frequency":0.3535496801,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":95241,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.587440260955319,"acs":92926,"articleLive":2,"columnArticles":797,"formTitle":"[860]柠檬水找零","frequency":1.4301900306,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":158188,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8088591768518282,"acs":31700,"articleLive":2,"columnArticles":444,"formTitle":"[861]翻转矩阵后的得分","frequency":0.3250252134,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":39191,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19483962078505365,"acs":16832,"articleLive":2,"columnArticles":132,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.3341858445,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":86389,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6041172738504692,"acs":36183,"articleLive":2,"columnArticles":566,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":2.529546793,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":59894,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45857163807009826,"acs":3127,"articleLive":2,"columnArticles":45,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.3833848286,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6819,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6613288383199888,"acs":9416,"articleLive":2,"columnArticles":135,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":14238,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22461914176066985,"acs":7726,"articleLive":2,"columnArticles":90,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":34396,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6699277543648404,"acs":84569,"articleLive":2,"columnArticles":760,"formTitle":"[867]转置矩阵","frequency":0.8644953185,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":126236,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6240604315470626,"acs":16688,"articleLive":2,"columnArticles":241,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26741,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.6430854760250174,"acs":32389,"articleLive":2,"columnArticles":457,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.5314170668,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"ac","submitted":50365,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4319478856379277,"acs":15516,"articleLive":2,"columnArticles":201,"formTitle":"[870]优势洗牌","frequency":0.9605076062,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":35921,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3438287588468842,"acs":9959,"articleLive":2,"columnArticles":133,"formTitle":"[871]最低加油次数","frequency":1.9084048013,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":28965,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6519962108713931,"acs":61257,"articleLive":2,"columnArticles":732,"formTitle":"[872]叶子相似的树","frequency":0.8349510722,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":93953,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5146863564234593,"acs":15893,"articleLive":2,"columnArticles":116,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.7349609185,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":30879,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4174378281977608,"acs":21066,"articleLive":2,"columnArticles":234,"formTitle":"[874]模拟行走机器人","frequency":2.056165683,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":50465,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.48131609393711816,"acs":47426,"articleLive":2,"columnArticles":380,"formTitle":"[875]爱吃香蕉的珂珂","frequency":2.022447047,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":98534,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7059058603116218,"acs":164277,"articleLive":2,"columnArticles":1750,"formTitle":"[876]链表的中间结点","frequency":2.3341858445,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":232718,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7572122469027998,"acs":69372,"articleLive":2,"columnArticles":488,"formTitle":"[877]石子游戏","frequency":2.9768423868,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":91615,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2827824992130941,"acs":4492,"articleLive":2,"columnArticles":64,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15885,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5537082771087405,"acs":21748,"articleLive":2,"columnArticles":184,"formTitle":"[879]盈利计划","frequency":3.0941809799,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":39277,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25353978637078745,"acs":6124,"articleLive":2,"columnArticles":80,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":24154,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.537722340306522,"acs":48067,"articleLive":2,"columnArticles":588,"formTitle":"[881]救生艇","frequency":3.3449037539,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":89390,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4860220569376763,"acs":1895,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3899,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6908707255011481,"acs":11132,"articleLive":2,"columnArticles":116,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":16113,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6621957277694983,"acs":19995,"articleLive":2,"columnArticles":261,"formTitle":"[884]两句话中的不常见单词","frequency":0.8644953185,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":30195,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6948107798165137,"acs":4847,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":1.2588782432,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6976,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.43258558516367723,"acs":9237,"articleLive":2,"columnArticles":122,"formTitle":"[886]可能的二分法","frequency":0.8349510722,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":21353,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2911162034545323,"acs":52467,"articleLive":2,"columnArticles":348,"formTitle":"[887]鸡蛋掉落","frequency":2.8703778188,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":180227,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6407327961041219,"acs":55260,"articleLive":2,"columnArticles":463,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":86245,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.676955513388151,"acs":16054,"articleLive":2,"columnArticles":155,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":1.811387803,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23715,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7276333900089061,"acs":8987,"articleLive":2,"columnArticles":128,"formTitle":"[890]查找和替换模式","frequency":0.297716034,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12351,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33070866141732286,"acs":2898,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8763,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6381720327862617,"acs":33557,"articleLive":2,"columnArticles":686,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52583,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.725271793503635,"acs":10874,"articleLive":2,"columnArticles":106,"formTitle":"[893]特殊等价字符串组","frequency":0.3833848286,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14993,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7752718485702779,"acs":13475,"articleLive":2,"columnArticles":125,"formTitle":"[894]所有可能的满二叉树","frequency":0.3250252134,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17381,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5511318145425431,"acs":7572,"articleLive":2,"columnArticles":85,"formTitle":"[895]最大频率栈","frequency":1.5590162922,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13739,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5852161218906194,"acs":60533,"articleLive":2,"columnArticles":725,"formTitle":"[896]单调数列","frequency":0.2715365284,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":103437,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7435501367795491,"acs":63059,"articleLive":2,"columnArticles":728,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":84808,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33974833456698744,"acs":5508,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.3833848286,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":16212,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5384423676012461,"acs":4321,"articleLive":2,"columnArticles":50,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":8025,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.495379445533464,"acs":3538,"articleLive":2,"columnArticles":52,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":7142,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5475855989863097,"acs":19879,"articleLive":2,"columnArticles":245,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":36303,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.331755385953048,"acs":3434,"articleLive":2,"columnArticles":81,"formTitle":"[902]最大为 N 的数字组合","frequency":1.1097040735,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10351,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.533999643048367,"acs":2992,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.6783820115,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5603,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.452445598709322,"acs":22996,"articleLive":2,"columnArticles":317,"formTitle":"[904]水果成篮","frequency":2.1182974641,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":50826,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.6999373663125302,"acs":59228,"articleLive":2,"columnArticles":617,"formTitle":"[905]按奇偶排序数组","frequency":1.2268310657,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":84619,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2797966017611311,"acs":2256,"articleLive":2,"columnArticles":41,"formTitle":"[906]超级回文数","frequency":0.4474271949,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":8063,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3202090592334495,"acs":11947,"articleLive":2,"columnArticles":134,"formTitle":"[907]子数组的最小值之和","frequency":1.7349609185,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":37310,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6985933922145895,"acs":21356,"articleLive":2,"columnArticles":198,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":30570,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45937596540006176,"acs":16357,"articleLive":2,"columnArticles":197,"formTitle":"[909]蛇梯棋","frequency":2.056165683,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35607,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3196941809429421,"acs":6774,"articleLive":2,"columnArticles":71,"formTitle":"[910]最小差值 II","frequency":0.297716034,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":21189,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4271992818671454,"acs":4759,"articleLive":2,"columnArticles":71,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":11140,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5586995370274541,"acs":242922,"articleLive":2,"columnArticles":1109,"formTitle":"[912]排序数组","frequency":3.8496106406,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":434799,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.39824453970198,"acs":1951,"articleLive":2,"columnArticles":34,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4899,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889678569465277,"acs":49530,"articleLive":2,"columnArticles":626,"formTitle":"[914]卡牌分组","frequency":0.8644953185,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":127337,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4701922611264468,"acs":9709,"articleLive":2,"columnArticles":119,"formTitle":"[915]分割数组","frequency":0.8952102637,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20649,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4439410332702191,"acs":6565,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14788,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5684263807131341,"acs":30321,"articleLive":2,"columnArticles":444,"formTitle":"[917]仅仅反转字母","frequency":1.5249878304,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":53342,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35759195699055374,"acs":23546,"articleLive":2,"columnArticles":243,"formTitle":"[918]环形子数组的最大和","frequency":1.9281137561,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":65846,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6404001798561151,"acs":5697,"articleLive":2,"columnArticles":106,"formTitle":"[919]完全二叉树插入器","frequency":0.297716034,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8896,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48297604035308955,"acs":1915,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3965,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.740467111534795,"acs":21749,"articleLive":2,"columnArticles":326,"formTitle":"[921]使括号有效的最少添加","frequency":0.2464095784,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":29372,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7140938437612906,"acs":90917,"articleLive":2,"columnArticles":838,"formTitle":"[922]按奇偶排序数组 II","frequency":1.460656972,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":127318,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3410179483130691,"acs":6479,"articleLive":2,"columnArticles":87,"formTitle":"[923]三数之和的多种可能","frequency":0.9271822964,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18999,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35895456550507276,"acs":6510,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":18136,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38773354810768096,"acs":51030,"articleLive":2,"columnArticles":688,"formTitle":"[925]长按键入","frequency":0.8349510722,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":131611,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.52718955212868,"acs":7145,"articleLive":2,"columnArticles":130,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.2464095784,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13553,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3379257558362036,"acs":3532,"articleLive":2,"columnArticles":71,"formTitle":"[927]三等分","frequency":1.0697467005,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10452,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.421759941089838,"acs":2291,"articleLive":2,"columnArticles":43,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5432,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6443394136326711,"acs":26175,"articleLive":2,"columnArticles":234,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40623,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5451515103414339,"acs":34344,"articleLive":2,"columnArticles":349,"formTitle":"[930]和相同的二元子数组","frequency":2.7298947777,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62999,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6683148158920366,"acs":22978,"articleLive":2,"columnArticles":293,"formTitle":"[931]下降路径最小和","frequency":0.8349510722,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":34382,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6335300892600058,"acs":8801,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.3250252134,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13892,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7251915782955337,"acs":37475,"articleLive":2,"columnArticles":326,"formTitle":"[933]最近的请求次数","frequency":2.2648820538,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":51676,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47180232002599043,"acs":24688,"articleLive":2,"columnArticles":279,"formTitle":"[934]最短的桥","frequency":0.8644953185,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":52327,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4771108079430044,"acs":6295,"articleLive":2,"columnArticles":82,"formTitle":"[935]骑士拨号器","frequency":0.8952102637,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":13194,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3814309643455372,"acs":1594,"articleLive":2,"columnArticles":28,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4179,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5880375071036181,"acs":12417,"articleLive":2,"columnArticles":131,"formTitle":"[937]重新排列日志文件","frequency":1.2588782432,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":21116,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8189926024436871,"acs":98533,"articleLive":2,"columnArticles":812,"formTitle":"[938]二叉搜索树的范围和","frequency":0.2464095784,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":120310,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4552144326633961,"acs":5753,"articleLive":2,"columnArticles":64,"formTitle":"[939]最小面积矩形","frequency":0.297716034,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12638,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4202862783810464,"acs":5109,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":12156,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39271422139962986,"acs":62806,"articleLive":2,"columnArticles":625,"formTitle":"[941]有效的山脉数组","frequency":0.8349510722,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":159928,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7305697843546449,"acs":23105,"articleLive":2,"columnArticles":218,"formTitle":"[942]增减字符串匹配","frequency":0.2715365284,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31626,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.468059558117195,"acs":1949,"articleLive":2,"columnArticles":44,"formTitle":"[943]最短超级串","frequency":0.5163520033,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":4164,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6881151849138343,"acs":21602,"articleLive":2,"columnArticles":182,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":31393,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4848779302805782,"acs":35928,"articleLive":2,"columnArticles":542,"formTitle":"[945]使数组唯一的最小增量","frequency":0.3250252134,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":74097,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.625481679474329,"acs":28081,"articleLive":2,"columnArticles":313,"formTitle":"[946]验证栈序列","frequency":2.022447047,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":44895,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6122069654515462,"acs":26350,"articleLive":2,"columnArticles":341,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":43041,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.392108229988726,"acs":6956,"articleLive":2,"columnArticles":102,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17740,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37190298183082676,"acs":8556,"articleLive":2,"columnArticles":120,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.4922302339,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":23006,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7754440154440154,"acs":10042,"articleLive":2,"columnArticles":155,"formTitle":"[950]按递增顺序显示卡牌","frequency":1.2268310657,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12950,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6652772953571842,"acs":11492,"articleLive":2,"columnArticles":175,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":17274,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3542825361512792,"acs":3185,"articleLive":2,"columnArticles":61,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8990,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5517254341778813,"acs":14677,"articleLive":2,"columnArticles":174,"formTitle":"[953]验证外星语词典","frequency":0.297716034,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":26602,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.3021948273707884,"acs":7256,"articleLive":2,"columnArticles":107,"formTitle":"[954]二倍数对数组","frequency":1.4922302339,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":24011,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32981267437225986,"acs":3310,"articleLive":2,"columnArticles":52,"formTitle":"[955]删列造序 II","frequency":0.4146373721,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":10036,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4389676327480432,"acs":4150,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.5163520033,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9454,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36080311657177105,"acs":14448,"articleLive":2,"columnArticles":141,"formTitle":"[957]N 天后的牢房","frequency":2.1848777892,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":40044,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363013557718024,"acs":26068,"articleLive":2,"columnArticles":248,"formTitle":"[958]二叉树的完全性检验","frequency":1.7017617468,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":48607,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7430607651912978,"acs":19810,"articleLive":2,"columnArticles":306,"formTitle":"[959]由斜杠划分区域","frequency":0.9952937223,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26660,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5558265582655827,"acs":2051,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3690,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6765704584040747,"acs":37459,"articleLive":2,"columnArticles":317,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":55366,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4447977613838718,"acs":13988,"articleLive":2,"columnArticles":140,"formTitle":"[962]最大宽度坡","frequency":0.8644953185,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":31448,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5072829675665178,"acs":2612,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.4146373721,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5149,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.435934769947583,"acs":1497,"articleLive":2,"columnArticles":28,"formTitle":"[964]表示数字的最少运算符","frequency":1.1097040735,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3434,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840097956561886,"acs":34076,"articleLive":2,"columnArticles":407,"formTitle":"[965]单值二叉树","frequency":0.8349510722,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":49818,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4063144329896907,"acs":3153,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7760,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4672798019101521,"acs":7926,"articleLive":2,"columnArticles":158,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16962,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49957633646587585,"acs":25942,"articleLive":2,"columnArticles":341,"formTitle":"[968]监控二叉树","frequency":1.2268310657,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"ac","submitted":51928,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6497763919090798,"acs":15837,"articleLive":2,"columnArticles":201,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":24373,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4134466769706337,"acs":11235,"articleLive":2,"columnArticles":128,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":27174,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44293820933165196,"acs":7025,"articleLive":2,"columnArticles":111,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15860,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40744186046511627,"acs":1314,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.7270297357,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3225,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6416375594530321,"acs":69071,"articleLive":2,"columnArticles":644,"formTitle":"[973]最接近原点的 K 个点","frequency":1.2588782432,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":107648,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4667306500795743,"acs":38418,"articleLive":2,"columnArticles":391,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.1509934701,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":82313,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4473905723905724,"acs":3189,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.4146373721,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":7128,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971771487662402,"acs":54284,"articleLive":2,"columnArticles":508,"formTitle":"[976]三角形的最大周长","frequency":0.8644953185,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":90901,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.706521217844903,"acs":191516,"articleLive":2,"columnArticles":1465,"formTitle":"[977]有序数组的平方","frequency":2.7078674554,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":271069,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4733652899358343,"acs":43747,"articleLive":2,"columnArticles":604,"formTitle":"[978]最长湍流子数组","frequency":0.2222654794,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":92417,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7138989169675091,"acs":8701,"articleLive":2,"columnArticles":136,"formTitle":"[979]在二叉树中分配硬币","frequency":1.460656972,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":12188,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7354011868548347,"acs":14747,"articleLive":2,"columnArticles":219,"formTitle":"[980]不同路径 III","frequency":2.1848777892,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":20053,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5316402895350264,"acs":21667,"articleLive":2,"columnArticles":316,"formTitle":"[981]基于时间的键值存储","frequency":2.3671160508,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40755,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5467279949822287,"acs":2615,"articleLive":2,"columnArticles":30,"formTitle":"[982]按位与为零的三元组","frequency":0.5951328811,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4783,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336452204109193,"acs":32845,"articleLive":2,"columnArticles":458,"formTitle":"[983]最低票价","frequency":1.7349609185,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51835,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41875366635079647,"acs":9280,"articleLive":2,"columnArticles":148,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.297716034,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":22161,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6011765565624086,"acs":16453,"articleLive":2,"columnArticles":188,"formTitle":"[985]查询后的偶数和","frequency":0.297716034,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27368,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6802674605886085,"acs":27876,"articleLive":2,"columnArticles":268,"formTitle":"[986]区间列表的交集","frequency":1.7520320056,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":40978,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5330103650292924,"acs":23655,"articleLive":2,"columnArticles":419,"formTitle":"[987]二叉树的垂序遍历","frequency":2.529546793,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":44380,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4996383923959087,"acs":9672,"articleLive":2,"columnArticles":115,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.297716034,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":19358,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4707727829527729,"acs":53420,"articleLive":2,"columnArticles":602,"formTitle":"[989]数组形式的整数加法","frequency":0.8952102637,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":113473,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5042350371856924,"acs":34171,"articleLive":2,"columnArticles":513,"formTitle":"[990]等式方程的可满足性","frequency":0.3833848286,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":67768,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5208842350203606,"acs":8954,"articleLive":2,"columnArticles":112,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":17190,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4538119981105338,"acs":24018,"articleLive":2,"columnArticles":276,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8349510722,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52925,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5569924553815774,"acs":51900,"articleLive":2,"columnArticles":819,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.6229553737,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":93179,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5100114691951426,"acs":58253,"articleLive":2,"columnArticles":1456,"formTitle":"[994]腐烂的橘子","frequency":1.9899162974,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":114219,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5406865307544868,"acs":21721,"articleLive":2,"columnArticles":253,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.3250252134,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":40173,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49484193011647254,"acs":4461,"articleLive":2,"columnArticles":92,"formTitle":"[996]正方形数组的数目","frequency":0.3833848286,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":9015,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5099045827173767,"acs":37942,"articleLive":2,"columnArticles":407,"formTitle":"[997]找到小镇的法官","frequency":0.8644953185,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":74410,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6156754627806222,"acs":7816,"articleLive":2,"columnArticles":118,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12695,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6909994825995995,"acs":30717,"articleLive":2,"columnArticles":576,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.3250252134,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44453,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4098814667109782,"acs":3700,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":1.4007588304,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":9027,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29352419904567145,"acs":2153,"articleLive":2,"columnArticles":56,"formTitle":"[1001]网格照明","frequency":0.6380579259,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7335,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7332862582906716,"acs":58154,"articleLive":2,"columnArticles":614,"formTitle":"[1002]查找共用字符","frequency":2.1182974641,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":79306,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5778160331270646,"acs":12419,"articleLive":2,"columnArticles":189,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21493,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5964179666441328,"acs":69698,"articleLive":2,"columnArticles":734,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4598608791,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":116861,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.528424905631601,"acs":27718,"articleLive":2,"columnArticles":440,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.1662003159,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":52454,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.627173086134513,"acs":44518,"articleLive":2,"columnArticles":608,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70982,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4657622739018088,"acs":6489,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13932,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7222736977802844,"acs":17929,"articleLive":2,"columnArticles":231,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.8749045717,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24823,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5887757986994628,"acs":16660,"articleLive":2,"columnArticles":232,"formTitle":"[1009]十进制整数的反码","frequency":0.5745982787,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":28296,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4541374067907044,"acs":18819,"articleLive":2,"columnArticles":248,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.3535496801,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":41439,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6259185307562105,"acs":61755,"articleLive":2,"columnArticles":595,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":1.4301900306,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":98663,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33593582887700535,"acs":3141,"articleLive":2,"columnArticles":67,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.0316613665,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9350,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3957869924637296,"acs":47686,"articleLive":2,"columnArticles":931,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.5249878304,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":120484,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5531827739697971,"acs":40514,"articleLive":2,"columnArticles":475,"formTitle":"[1014]最佳观光组合","frequency":0.7270297357,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":73238,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3570822731128075,"acs":5052,"articleLive":2,"columnArticles":43,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":14148,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5823574477399585,"acs":5321,"articleLive":2,"columnArticles":83,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.297716034,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":9137,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.56013586536977,"acs":3628,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6477,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5159369038202039,"acs":44352,"articleLive":2,"columnArticles":380,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85964,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5999191755910285,"acs":20783,"articleLive":2,"columnArticles":273,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.297716034,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":34643,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5424726202800632,"acs":9956,"articleLive":2,"columnArticles":147,"formTitle":"[1020]飞地的数量","frequency":0.9952937223,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":18353,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7827417544234778,"acs":58571,"articleLive":2,"columnArticles":667,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":74828,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7050868615416623,"acs":20334,"articleLive":2,"columnArticles":274,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2715365284,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28839,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5644413537320352,"acs":7305,"articleLive":2,"columnArticles":165,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12942,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5562883561083382,"acs":33992,"articleLive":2,"columnArticles":391,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":61105,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096756209290008,"acs":76376,"articleLive":2,"columnArticles":655,"formTitle":"[1025]除数博弈","frequency":0.8349510722,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":107621,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.672218564845293,"acs":10211,"articleLive":2,"columnArticles":175,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":15190,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4338358458961474,"acs":13727,"articleLive":2,"columnArticles":123,"formTitle":"[1027]最长等差数列","frequency":0.9271822964,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":31641,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7314982751875956,"acs":20569,"articleLive":2,"columnArticles":429,"formTitle":"[1028]从先序遍历还原二叉树","frequency":1.4922302339,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":28119,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6576611051584265,"acs":17186,"articleLive":2,"columnArticles":186,"formTitle":"[1029]两地调度","frequency":0.2715365284,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":26132,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7103068915696207,"acs":40805,"articleLive":2,"columnArticles":445,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.2715365284,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57447,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5692777903554449,"acs":5029,"articleLive":2,"columnArticles":77,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8834,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.40033373786407767,"acs":2639,"articleLive":2,"columnArticles":44,"formTitle":"[1032]字符流","frequency":0.3535496801,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6592,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.39140382990706846,"acs":11119,"articleLive":2,"columnArticles":169,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28408,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4357687302472579,"acs":4688,"articleLive":2,"columnArticles":100,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10758,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6358348381719683,"acs":36619,"articleLive":2,"columnArticles":395,"formTitle":"[1035]不相交的线","frequency":2.7298947777,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":57592,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.299874304183875,"acs":3340,"articleLive":2,"columnArticles":56,"formTitle":"[1036]逃离大迷宫","frequency":0.4146373721,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":11138,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.44001417685628214,"acs":9932,"articleLive":2,"columnArticles":118,"formTitle":"[1037]有效的回旋镖","frequency":0.8952102637,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22572,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7940704400230156,"acs":26221,"articleLive":2,"columnArticles":335,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.2464095784,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":33021,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5554355651547876,"acs":4629,"articleLive":2,"columnArticles":62,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8334,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.521806551657298,"acs":2692,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5159,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4842746026378086,"acs":7160,"articleLive":2,"columnArticles":116,"formTitle":"[1041]困于环中的机器人","frequency":1.2588782432,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14785,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5315181071073783,"acs":11771,"articleLive":2,"columnArticles":156,"formTitle":"[1042]不邻接植花","frequency":0.8952102637,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":22146,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6896912611198326,"acs":7908,"articleLive":2,"columnArticles":103,"formTitle":"[1043]分隔数组以得到最大和","frequency":1.2268310657,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11466,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20901369388108856,"acs":6029,"articleLive":2,"columnArticles":74,"formTitle":"[1044]最长重复子串","frequency":2.8332925842,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":28845,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6421250180453298,"acs":8896,"articleLive":2,"columnArticles":108,"formTitle":"[1045]买下所有产品的客户","frequency":0.3250252134,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":13854,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6588701645745615,"acs":66818,"articleLive":2,"columnArticles":933,"formTitle":"[1046]最后一块石头的重量","frequency":1.2268310657,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":101413,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7243984404741589,"acs":110365,"articleLive":2,"columnArticles":1005,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":2.7932070571,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":152354,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4584201889386615,"acs":10336,"articleLive":2,"columnArticles":143,"formTitle":"[1048]最长字符串链","frequency":2.4598608791,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":22547,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6467595728429578,"acs":44878,"articleLive":2,"columnArticles":423,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8026012079,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":69389,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7593276454858016,"acs":11926,"articleLive":2,"columnArticles":57,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":1.2268310657,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":15706,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7541836759053689,"acs":31592,"articleLive":2,"columnArticles":376,"formTitle":"[1051]高度检查器","frequency":0.8644953185,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41889,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5814539918165382,"acs":48884,"articleLive":2,"columnArticles":757,"formTitle":"[1052]爱生气的书店老板","frequency":0.2222654794,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":84072,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45874136491307976,"acs":6043,"articleLive":2,"columnArticles":97,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":13173,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37776332899869963,"acs":8134,"articleLive":2,"columnArticles":111,"formTitle":"[1054]距离相等的条形码","frequency":0.2715365284,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21532,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5890835418901204,"acs":4943,"articleLive":2,"columnArticles":90,"formTitle":"[1055]形成字符串的最短路径","frequency":0.8349510722,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":8391,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.41252390057361377,"acs":3452,"articleLive":2,"columnArticles":68,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":8368,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4677298029186099,"acs":3109,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6647,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34349798387096775,"acs":1363,"articleLive":2,"columnArticles":33,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3968,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.363905325443787,"acs":2337,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":6422,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5281462490246349,"acs":4738,"articleLive":2,"columnArticles":71,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":8971,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6075463653805159,"acs":2850,"articleLive":2,"columnArticles":63,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4691,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5446646341463415,"acs":3573,"articleLive":2,"columnArticles":50,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":6560,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7111605487578792,"acs":1918,"articleLive":2,"columnArticles":41,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2697,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6494954859267127,"acs":4892,"articleLive":2,"columnArticles":69,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7532,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5426406926406926,"acs":2507,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4620,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47659090909090907,"acs":2097,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4400,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4210789210789211,"acs":843,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":2002,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.864405705229794,"acs":13636,"articleLive":2,"columnArticles":66,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":15775,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8183361629881154,"acs":11568,"articleLive":2,"columnArticles":57,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":14136,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48115703451114117,"acs":8184,"articleLive":2,"columnArticles":72,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":17009,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866832273116367,"acs":34954,"articleLive":2,"columnArticles":674,"formTitle":"[1071]字符串的最大公因子","frequency":0.8644953185,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59579,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5828063578875405,"acs":3410,"articleLive":2,"columnArticles":56,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5851,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3350494512938626,"acs":2473,"articleLive":2,"columnArticles":55,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7381,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6686881010477967,"acs":18635,"articleLive":2,"columnArticles":190,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.4089870576,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27868,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6942143006335724,"acs":9971,"articleLive":2,"columnArticles":74,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":14363,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4962584243551011,"acs":10677,"articleLive":2,"columnArticles":91,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":21515,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7213069489185457,"acs":7837,"articleLive":2,"columnArticles":88,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":10865,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6214738796348822,"acs":12051,"articleLive":2,"columnArticles":192,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":19391,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7353591509255164,"acs":11640,"articleLive":2,"columnArticles":193,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15829,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4924464487034949,"acs":4368,"articleLive":2,"columnArticles":98,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8870,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5717763379648703,"acs":15267,"articleLive":2,"columnArticles":157,"formTitle":"[1081]不同字符的最小子序列","frequency":1.7017617468,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":26701,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7612569457750527,"acs":11919,"articleLive":2,"columnArticles":96,"formTitle":"[1082]销售分析 I ","frequency":0.8644953185,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":15657,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5278561522643584,"acs":11038,"articleLive":2,"columnArticles":102,"formTitle":"[1083]销售分析 II","frequency":1.2268310657,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":20911,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.53678391959799,"acs":10682,"articleLive":2,"columnArticles":101,"formTitle":"[1084]销售分析III","frequency":0.297716034,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":19900,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7734145317093658,"acs":3683,"articleLive":2,"columnArticles":74,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4762,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6875658587987356,"acs":5220,"articleLive":2,"columnArticles":82,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7592,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.534596612115992,"acs":1862,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3483,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.45473684210526316,"acs":1080,"articleLive":2,"columnArticles":35,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2375,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5852286118312515,"acs":19865,"articleLive":2,"columnArticles":296,"formTitle":"[1089]复写零","frequency":0.3833848286,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33944,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.546530612244898,"acs":4017,"articleLive":2,"columnArticles":83,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7350,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3792060587577514,"acs":29842,"articleLive":2,"columnArticles":302,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":2.3640745009,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":78696,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48944995491433724,"acs":2714,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.9952937223,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5545,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3757070556713308,"acs":3786,"articleLive":2,"columnArticles":61,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":10077,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6043754921364575,"acs":28399,"articleLive":2,"columnArticles":397,"formTitle":"[1094]拼车","frequency":1.9899162974,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":46989,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727139654245956,"acs":20115,"articleLive":2,"columnArticles":390,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":53969,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5472,"acs":1710,"articleLive":2,"columnArticles":49,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3125,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.522508038585209,"acs":6500,"articleLive":2,"columnArticles":118,"formTitle":"[1097]游戏玩法分析 V","frequency":1.9084048013,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":12440,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47487452754197906,"acs":7664,"articleLive":2,"columnArticles":105,"formTitle":"[1098]小众书籍","frequency":0.2715365284,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":16139,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5816044260027663,"acs":5046,"articleLive":2,"columnArticles":95,"formTitle":"[1099]小于 K 的两数之和","frequency":0.3250252134,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":8676,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7011084718923198,"acs":5313,"articleLive":2,"columnArticles":106,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.9605076062,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":7578,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6687551076001089,"acs":2455,"articleLive":2,"columnArticles":57,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3671,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3692817082235286,"acs":5465,"articleLive":2,"columnArticles":69,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":14799,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6369308540723982,"acs":36035,"articleLive":2,"columnArticles":1107,"formTitle":"[1103]分糖果 II","frequency":0.8349510722,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":56576,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7606294646387431,"acs":28856,"articleLive":2,"columnArticles":677,"formTitle":"[1104]二叉树寻路","frequency":2.2648820538,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37937,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5596545473931123,"acs":5249,"articleLive":2,"columnArticles":69,"formTitle":"[1105]填充书架","frequency":0.9271822964,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9379,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5789263354202744,"acs":4346,"articleLive":2,"columnArticles":128,"formTitle":"[1106]解析布尔表达式","frequency":0.3535496801,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7507,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41154639175257735,"acs":6986,"articleLive":2,"columnArticles":95,"formTitle":"[1107]每日新用户统计","frequency":0.3250252134,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":16975,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8398099104004753,"acs":67860,"articleLive":2,"columnArticles":694,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80804,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5783643194297274,"acs":60040,"articleLive":2,"columnArticles":599,"formTitle":"[1109]航班预订统计","frequency":2.3949394166,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":103810,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6299263401258132,"acs":11716,"articleLive":2,"columnArticles":212,"formTitle":"[1110]删点成林","frequency":0.8644953185,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":18599,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7714186171729009,"acs":24356,"articleLive":2,"columnArticles":403,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.2588782432,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31573,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6471551371264839,"acs":7905,"articleLive":2,"columnArticles":92,"formTitle":"[1112]每位学生的最高成绩","frequency":0.3250252134,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":12215,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.540015015015015,"acs":7193,"articleLive":2,"columnArticles":51,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":13320,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6538562888058104,"acs":79403,"articleLive":2,"columnArticles":588,"formTitle":"[1114]按序打印","frequency":3.2451224629,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":121438,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5615482072722666,"acs":44323,"articleLive":2,"columnArticles":483,"formTitle":"[1115]交替打印FooBar","frequency":1.3722993115,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":78930,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5204199919746756,"acs":23345,"articleLive":2,"columnArticles":373,"formTitle":"[1116]打印零与奇偶数","frequency":2.5447294245,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":44858,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5222987831696232,"acs":17813,"articleLive":2,"columnArticles":254,"formTitle":"[1117]H2O 生成","frequency":2.2003412178,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":34105,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6423127463863337,"acs":2444,"articleLive":2,"columnArticles":39,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3805,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8663442741022739,"acs":8420,"articleLive":2,"columnArticles":148,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9719,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.611674554879423,"acs":2714,"articleLive":2,"columnArticles":50,"formTitle":"[1120]子树的最大平均值","frequency":0.5163520033,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4437,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5763673890608875,"acs":1117,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1938,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7069457964720104,"acs":66086,"articleLive":2,"columnArticles":880,"formTitle":"[1122]数组的相对排序","frequency":2.1509934701,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":93481,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7028528149457208,"acs":8352,"articleLive":2,"columnArticles":108,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.3250252134,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11883,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31925954717714505,"acs":13142,"articleLive":2,"columnArticles":138,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3535496801,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":41164,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49298245614035086,"acs":3091,"articleLive":2,"columnArticles":51,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6270,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6920659007153696,"acs":6385,"articleLive":2,"columnArticles":95,"formTitle":"[1126]查询活跃业务","frequency":0.8952102637,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":9226,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.42089402310396784,"acs":4190,"articleLive":2,"columnArticles":75,"formTitle":"[1127]用户购买平台","frequency":0.8349510722,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":9955,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.544859867426445,"acs":37482,"articleLive":2,"columnArticles":484,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.8952102637,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68792,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.38108383844445776,"acs":6350,"articleLive":2,"columnArticles":118,"formTitle":"[1129]颜色交替的最短路径","frequency":0.9605076062,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16663,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.630048800747586,"acs":6068,"articleLive":2,"columnArticles":109,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.297716034,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9631,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45574007220216606,"acs":3156,"articleLive":2,"columnArticles":48,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6925,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.39015091342335184,"acs":4912,"articleLive":2,"columnArticles":56,"formTitle":"[1132]报告的记录 II","frequency":0.3250252134,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":12590,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6491944146079485,"acs":3022,"articleLive":2,"columnArticles":65,"formTitle":"[1133]最大唯一数","frequency":0.4818895991,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4655,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7768694397691753,"acs":3231,"articleLive":2,"columnArticles":54,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":4159,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5378308166910213,"acs":6625,"articleLive":2,"columnArticles":75,"formTitle":"[1135]最低成本联通所有城市","frequency":0.4474271949,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":12318,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5707129094412331,"acs":2962,"articleLive":2,"columnArticles":53,"formTitle":"[1136]平行课程","frequency":0.4146373721,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":5190,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6092121436031517,"acs":85746,"articleLive":2,"columnArticles":908,"formTitle":"[1137]第 N 个泰波那契数","frequency":1.8667182053,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":140749,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4338602329450915,"acs":6258,"articleLive":2,"columnArticles":141,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14424,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.48028387225748415,"acs":9610,"articleLive":2,"columnArticles":156,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.8644953185,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":20009,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6520553099426206,"acs":6932,"articleLive":2,"columnArticles":98,"formTitle":"[1140]石子游戏 II","frequency":1.0316613665,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10631,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5094833547367381,"acs":10315,"articleLive":2,"columnArticles":69,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.8644953185,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":20246,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37119570824306203,"acs":7196,"articleLive":2,"columnArticles":52,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":19386,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6377513372223221,"acs":173719,"articleLive":2,"columnArticles":1155,"formTitle":"[1143]最长公共子序列","frequency":2.7716370647,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":272393,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44247825164438787,"acs":10427,"articleLive":2,"columnArticles":148,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.297716034,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23565,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690222652468538,"acs":6783,"articleLive":2,"columnArticles":109,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14462,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2886516409648082,"acs":4380,"articleLive":2,"columnArticles":65,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":15174,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5624585158635338,"acs":4237,"articleLive":2,"columnArticles":85,"formTitle":"[1147]段式回文","frequency":2.056165683,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7533,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7139701334275869,"acs":8080,"articleLive":2,"columnArticles":37,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":11317,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4430299675812446,"acs":5603,"articleLive":2,"columnArticles":48,"formTitle":"[1149]文章浏览 II","frequency":0.3250252134,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":12647,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.603431251542829,"acs":4889,"articleLive":2,"columnArticles":86,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.806499651,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":8102,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48812142542894854,"acs":4438,"articleLive":2,"columnArticles":65,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.9605076062,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":9092,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.39242219215155616,"acs":1450,"articleLive":2,"columnArticles":33,"formTitle":"[1152]用户网站访问行为分析","frequency":0.4474271949,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3695,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3703068011156404,"acs":1726,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4661,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.57135815575946,"acs":15069,"articleLive":2,"columnArticles":230,"formTitle":"[1154]一年中的第几天","frequency":1.6089767315,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":26374,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47854442344045367,"acs":10126,"articleLive":2,"columnArticles":130,"formTitle":"[1155]掷骰子的N种方法","frequency":1.2268310657,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":21160,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43127406663318263,"acs":5152,"articleLive":2,"columnArticles":92,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.3535496801,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11946,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3219849375838234,"acs":3121,"articleLive":2,"columnArticles":48,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9693,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5513973503529639,"acs":5702,"articleLive":2,"columnArticles":62,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":10341,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49083302571674664,"acs":3989,"articleLive":2,"columnArticles":86,"formTitle":"[1159]市场分析 II","frequency":0.9271822964,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":8127,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6871825310762839,"acs":60202,"articleLive":2,"columnArticles":913,"formTitle":"[1160]拼写单词","frequency":0.8644953185,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":87607,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6333899994137991,"acs":10805,"articleLive":2,"columnArticles":181,"formTitle":"[1161]最大层内元素和","frequency":0.8644953185,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":17059,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4703169889669491,"acs":38962,"articleLive":2,"columnArticles":500,"formTitle":"[1162]地图分析","frequency":0.8644953185,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":82842,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2674975605428901,"acs":6031,"articleLive":2,"columnArticles":103,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22546,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6081523965587874,"acs":5938,"articleLive":2,"columnArticles":87,"formTitle":"[1164]指定日期的产品价格","frequency":0.9271822964,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":9764,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8378172312384272,"acs":7692,"articleLive":2,"columnArticles":114,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":9181,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48291335864687607,"acs":2798,"articleLive":2,"columnArticles":50,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5794,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.44125090383224874,"acs":2441,"articleLive":2,"columnArticles":36,"formTitle":"[1167]连接棒材的最低费用","frequency":0.4146373721,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5532,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5699754472115047,"acs":1625,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.7790706138,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2851,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32222534683164605,"acs":6875,"articleLive":2,"columnArticles":82,"formTitle":"[1169]查询无效交易","frequency":0.3535496801,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":21336,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.617263045318836,"acs":13852,"articleLive":2,"columnArticles":219,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.297716034,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22441,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47521990989058144,"acs":13290,"articleLive":2,"columnArticles":160,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":1.4301900306,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27966,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2670305447675029,"acs":2544,"articleLive":2,"columnArticles":55,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9527,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.757371449119022,"acs":8425,"articleLive":2,"columnArticles":80,"formTitle":"[1173]即时食物配送 I","frequency":0.3250252134,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":11124,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6177150504927607,"acs":5077,"articleLive":2,"columnArticles":64,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":8219,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.492283443882577,"acs":7496,"articleLive":2,"columnArticles":120,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":15227,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4524812493578547,"acs":4404,"articleLive":2,"columnArticles":64,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9733,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2669969251793645,"acs":6252,"articleLive":2,"columnArticles":96,"formTitle":"[1177]构建回文串检测","frequency":0.8644953185,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23416,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4624932008109578,"acs":18706,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40446,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6368571313683703,"acs":31676,"articleLive":2,"columnArticles":190,"formTitle":"[1179]重新格式化部门表","frequency":2.2648820538,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":49738,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7766634050880626,"acs":3175,"articleLive":2,"columnArticles":71,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":4088,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37444279346210996,"acs":1512,"articleLive":2,"columnArticles":29,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":4038,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.4070442992011619,"acs":2242,"articleLive":2,"columnArticles":43,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":5508,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6009132420091324,"acs":658,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1095,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5843605546995377,"acs":13653,"articleLive":2,"columnArticles":269,"formTitle":"[1184]公交站间的距离","frequency":0.8349510722,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":23364,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6028802320762536,"acs":11638,"articleLive":2,"columnArticles":212,"formTitle":"[1185]一周中的第几天","frequency":0.3250252134,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":19304,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3949235949235949,"acs":7624,"articleLive":2,"columnArticles":111,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.3535496801,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19305,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4427302477793361,"acs":1894,"articleLive":2,"columnArticles":34,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4278,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6988832487309644,"acs":3442,"articleLive":2,"columnArticles":67,"formTitle":"[1188]设计有限阻塞队列","frequency":0.8952102637,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4925,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6460422960725075,"acs":21384,"articleLive":2,"columnArticles":334,"formTitle":"[1189]“气球” 的最大数量","frequency":0.8644953185,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":33100,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6505672149744753,"acs":45878,"articleLive":2,"columnArticles":620,"formTitle":"[1190]反转每对括号间的子串","frequency":3.5412005526,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":70520,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2664825530422585,"acs":6079,"articleLive":2,"columnArticles":96,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22812,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.5006768953068592,"acs":4438,"articleLive":2,"columnArticles":53,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8864,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6049600498080315,"acs":5830,"articleLive":2,"columnArticles":74,"formTitle":"[1193]每月交易 I","frequency":0.3250252134,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":9637,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5071743929359823,"acs":3676,"articleLive":2,"columnArticles":65,"formTitle":"[1194]锦标赛优胜者","frequency":0.3535496801,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":7248,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6373302358827734,"acs":14266,"articleLive":2,"columnArticles":270,"formTitle":"[1195]交替打印字符串","frequency":1.5249878304,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":22384,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6936370777690495,"acs":3532,"articleLive":2,"columnArticles":61,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.4146373721,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":5092,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.371865671641791,"acs":4983,"articleLive":2,"columnArticles":62,"formTitle":"[1197]进击的骑士","frequency":0.5546415198,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":13400,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7440330764893817,"acs":3959,"articleLive":2,"columnArticles":60,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":5321,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43997668997669,"acs":755,"articleLive":2,"columnArticles":19,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1716,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6834717205942584,"acs":18356,"articleLive":2,"columnArticles":258,"formTitle":"[1200]最小绝对差","frequency":0.8644953185,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26857,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24777448071216618,"acs":6179,"articleLive":2,"columnArticles":88,"formTitle":"[1201]丑数 III","frequency":1.460656972,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24938,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5026969916031808,"acs":27120,"articleLive":2,"columnArticles":298,"formTitle":"[1202]交换字符串中的元素","frequency":0.3250252134,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53949,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6198384884961146,"acs":12204,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19689,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7273864631552609,"acs":5814,"articleLive":2,"columnArticles":84,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7993,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46889226100151743,"acs":5562,"articleLive":2,"columnArticles":84,"formTitle":"[1205]每月交易II","frequency":0.3535496801,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":11862,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6085007471359788,"acs":7330,"articleLive":2,"columnArticles":92,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":12046,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304560063797395,"acs":60454,"articleLive":2,"columnArticles":839,"formTitle":"[1207]独一无二的出现次数","frequency":0.8644953185,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82762,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49738321777158717,"acs":48564,"articleLive":2,"columnArticles":622,"formTitle":"[1208]尽可能使字符串相等","frequency":0.3833848286,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":97639,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5278443239608288,"acs":12559,"articleLive":2,"columnArticles":160,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.297716034,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23793,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.45094434230319236,"acs":2698,"articleLive":2,"columnArticles":56,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.7790706138,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5983,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6579082505991098,"acs":7687,"articleLive":2,"columnArticles":64,"formTitle":"[1211]查询结果的质量和占比","frequency":0.3250252134,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":11684,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5121134528264724,"acs":5200,"articleLive":2,"columnArticles":100,"formTitle":"[1212]查询球队积分","frequency":0.3535496801,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":10154,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7747759282970551,"acs":6051,"articleLive":2,"columnArticles":127,"formTitle":"[1213]三个有序数组的交集","frequency":0.3535496801,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7810,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.636896046852123,"acs":3480,"articleLive":2,"columnArticles":72,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4818895991,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5464,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121312837557125,"acs":1984,"articleLive":2,"columnArticles":41,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4814,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5374465049928673,"acs":1507,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2804,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6941800592916212,"acs":22245,"articleLive":2,"columnArticles":361,"formTitle":"[1217]玩筹码","frequency":1.1662003159,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":32045,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.5139671177401646,"acs":36044,"articleLive":2,"columnArticles":353,"formTitle":"[1218]最长定差子序列","frequency":1.2358633269,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"ac","submitted":70129,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6300854353132628,"acs":12390,"articleLive":2,"columnArticles":176,"formTitle":"[1219]黄金矿工","frequency":1.2268310657,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19664,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5280646015356103,"acs":3989,"articleLive":2,"columnArticles":78,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7554,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8439660625095422,"acs":77390,"articleLive":2,"columnArticles":1118,"formTitle":"[1221]分割平衡字符串","frequency":2.3671160508,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":91698,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6734488541084405,"acs":6024,"articleLive":2,"columnArticles":134,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.297716034,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8945,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4759336099585062,"acs":3441,"articleLive":2,"columnArticles":59,"formTitle":"[1223]掷骰子模拟","frequency":0.6783820115,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7230,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3290167865707434,"acs":4802,"articleLive":2,"columnArticles":71,"formTitle":"[1224]最大相等频率","frequency":1.0697467005,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14595,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5374076354679803,"acs":3491,"articleLive":2,"columnArticles":82,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.9271822964,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":6496,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5964920852061755,"acs":12209,"articleLive":2,"columnArticles":138,"formTitle":"[1226]哲学家进餐","frequency":2.2988963676,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":20468,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6634155793825087,"acs":10271,"articleLive":2,"columnArticles":160,"formTitle":"[1227]飞机座位分配概率","frequency":0.3250252134,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15482,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.539611617116343,"acs":3140,"articleLive":2,"columnArticles":55,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5819,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.42481020836698435,"acs":2630,"articleLive":2,"columnArticles":49,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":6191,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4980213089802131,"acs":3272,"articleLive":2,"columnArticles":67,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":6570,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5673845085098993,"acs":3267,"articleLive":2,"columnArticles":44,"formTitle":"[1231]分享巧克力","frequency":0.9605076062,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":5758,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46944735247121055,"acs":34080,"articleLive":2,"columnArticles":425,"formTitle":"[1232]缀点成线","frequency":0.297716034,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72596,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48408015423263423,"acs":8286,"articleLive":2,"columnArticles":120,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":17117,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3456713028668748,"acs":6089,"articleLive":2,"columnArticles":93,"formTitle":"[1234]替换子串得到平衡字符串","frequency":1.3268699883,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17615,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.46517135692393424,"acs":6678,"articleLive":2,"columnArticles":117,"formTitle":"[1235]规划兼职工作","frequency":1.5249878304,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":14356,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5659494855004678,"acs":1210,"articleLive":2,"columnArticles":33,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":2138,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7109185441941075,"acs":10255,"articleLive":2,"columnArticles":136,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14425,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6610274396533938,"acs":3204,"articleLive":2,"columnArticles":75,"formTitle":"[1238]循环码排列","frequency":0.4474271949,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4847,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49107479836173273,"acs":35131,"articleLive":2,"columnArticles":386,"formTitle":"[1239]串联字符串的最大长度","frequency":1.7017617468,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":71539,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4953413196425176,"acs":2605,"articleLive":2,"columnArticles":40,"formTitle":"[1240]铺瓷砖","frequency":1.1517094088,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5259,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5931152255976991,"acs":6599,"articleLive":2,"columnArticles":67,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":11126,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4688279301745636,"acs":1316,"articleLive":2,"columnArticles":21,"formTitle":"[1242]多线程网页爬虫","frequency":0.9605076062,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2807,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5395167895167895,"acs":2635,"articleLive":2,"columnArticles":59,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4884,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6209134615384615,"acs":2583,"articleLive":2,"columnArticles":43,"formTitle":"[1244]力扣排行榜","frequency":0.4474271949,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":4160,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5110330288123682,"acs":3636,"articleLive":2,"columnArticles":65,"formTitle":"[1245]树的直径","frequency":0.4146373721,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":7115,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4820354413916436,"acs":2965,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.7790706138,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":6151,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6183796359655125,"acs":9037,"articleLive":2,"columnArticles":159,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.3250252134,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14614,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5604378322272199,"acs":35636,"articleLive":2,"columnArticles":489,"formTitle":"[1248]统计「优美子数组」","frequency":0.8349510722,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":63586,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5762176752705276,"acs":23909,"articleLive":2,"columnArticles":334,"formTitle":"[1249]移除无效的括号","frequency":1.2921924499,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":41493,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5621086649161785,"acs":2783,"articleLive":2,"columnArticles":40,"formTitle":"[1250]检查「好数组」","frequency":0.4146373721,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4951,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7729648991784914,"acs":8280,"articleLive":2,"columnArticles":99,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":10712,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7491293481378293,"acs":18284,"articleLive":2,"columnArticles":320,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24407,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3944415927256728,"acs":5379,"articleLive":2,"columnArticles":83,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13637,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.6015318222464134,"acs":15472,"articleLive":2,"columnArticles":245,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.2715365284,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":25721,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6838251608608831,"acs":3082,"articleLive":2,"columnArticles":68,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4507,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6695315857327031,"acs":1558,"articleLive":2,"columnArticles":38,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2327,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5664441747572816,"acs":1867,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3296,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5559471365638766,"acs":1262,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2270,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.48125,"acs":2002,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4160,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6039715778081032,"acs":12835,"articleLive":2,"columnArticles":260,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":21251,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7271821803694314,"acs":8031,"articleLive":2,"columnArticles":106,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":11044,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5260447149713215,"acs":13482,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":1.2268310657,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":25629,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4250127746550843,"acs":3327,"articleLive":2,"columnArticles":61,"formTitle":"[1263]推箱子","frequency":0.9271822964,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7828,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5673271785633867,"acs":5039,"articleLive":2,"columnArticles":88,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":8882,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9229773462783172,"acs":2852,"articleLive":2,"columnArticles":73,"formTitle":"[1265]逆序打印不可变链表","frequency":0.9605076062,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":3090,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241019191863962,"acs":30144,"articleLive":2,"columnArticles":458,"formTitle":"[1266]访问所有点的最小时间","frequency":0.297716034,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36578,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6077030103718695,"acs":9609,"articleLive":2,"columnArticles":152,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15812,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.583961474036851,"acs":8367,"articleLive":2,"columnArticles":148,"formTitle":"[1268]搜索推荐系统","frequency":0.3833848286,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":14328,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49115868976806754,"acs":30304,"articleLive":2,"columnArticles":322,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61699,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8022892819979188,"acs":6168,"articleLive":2,"columnArticles":87,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":7688,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5079559363525091,"acs":2490,"articleLive":2,"columnArticles":42,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4902,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5189068954559898,"acs":1633,"articleLive":2,"columnArticles":33,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":3147,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5458544839255499,"acs":1613,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2955,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6037282020444978,"acs":1004,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1663,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5442955214122263,"acs":8325,"articleLive":2,"columnArticles":173,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.3250252134,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15295,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5022593764121103,"acs":6669,"articleLive":2,"columnArticles":100,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13278,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7259196336238736,"acs":19655,"articleLive":2,"columnArticles":244,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.5249878304,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":27076,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.6005788712011577,"acs":3735,"articleLive":2,"columnArticles":60,"formTitle":"[1278]分割回文串 III","frequency":1.5706578672,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6219,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6224098234842671,"acs":1622,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2606,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5071846342696223,"acs":7024,"articleLive":2,"columnArticles":72,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":13849,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8310344202570191,"acs":45849,"articleLive":2,"columnArticles":625,"formTitle":"[1281]整数的各位积和之差","frequency":0.297716034,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":55171,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8101831174631532,"acs":12698,"articleLive":2,"columnArticles":235,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15673,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41847638745260257,"acs":7284,"articleLive":2,"columnArticles":102,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.9605076062,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":17406,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6648460774577954,"acs":2678,"articleLive":2,"columnArticles":61,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.1097040735,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":4028,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8134871339840284,"acs":4584,"articleLive":2,"columnArticles":64,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5635,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6486915146708961,"acs":4908,"articleLive":2,"columnArticles":99,"formTitle":"[1286]字母组合迭代器","frequency":0.3535496801,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7566,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6017933487193069,"acs":15906,"articleLive":2,"columnArticles":223,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.8644953185,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":26431,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5638935507072644,"acs":14112,"articleLive":2,"columnArticles":174,"formTitle":"[1288]删除被覆盖区间","frequency":1.2268310657,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":25026,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6249552131852383,"acs":6977,"articleLive":2,"columnArticles":106,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":11164,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8082737142101629,"acs":55020,"articleLive":2,"columnArticles":717,"formTitle":"[1290]二进制链表转整数","frequency":0.2715365284,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":68071,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5186330935251798,"acs":7209,"articleLive":2,"columnArticles":163,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13900,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.47286645444899195,"acs":6239,"articleLive":2,"columnArticles":97,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.3250252134,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":13194,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.36253213704811377,"acs":13819,"articleLive":2,"columnArticles":131,"formTitle":"[1293]网格中的最短路径","frequency":2.529546793,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":38118,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6558759521218716,"acs":7233,"articleLive":2,"columnArticles":80,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":11028,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8077146219768926,"acs":48727,"articleLive":2,"columnArticles":646,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.8644953185,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":60327,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.453344058837049,"acs":7890,"articleLive":2,"columnArticles":128,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17404,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4596445120686078,"acs":6646,"articleLive":2,"columnArticles":94,"formTitle":"[1297]子串的最大出现次数","frequency":0.8644953185,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14459,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.597647581003107,"acs":2693,"articleLive":2,"columnArticles":93,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4506,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.787221570926143,"acs":30889,"articleLive":2,"columnArticles":444,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":39238,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4654932397642976,"acs":24410,"articleLive":2,"columnArticles":371,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.297716034,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":52439,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3615884325230511,"acs":3451,"articleLive":2,"columnArticles":84,"formTitle":"[1301]最大得分的路径数目","frequency":0.3833848286,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":9544,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8198705319448354,"acs":20391,"articleLive":2,"columnArticles":304,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.9271822964,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24871,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8237837837837838,"acs":9144,"articleLive":2,"columnArticles":88,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":11100,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7227636849132176,"acs":21654,"articleLive":2,"columnArticles":391,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29960,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7482548206004394,"acs":15328,"articleLive":2,"columnArticles":232,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.2715365284,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20485,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5752407064974814,"acs":18043,"articleLive":2,"columnArticles":278,"formTitle":"[1306]跳跃游戏 III","frequency":0.8644953185,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":31366,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3302654867256637,"acs":1866,"articleLive":2,"columnArticles":56,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5650,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7517701525054467,"acs":5521,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":7344,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7541217360306568,"acs":16924,"articleLive":2,"columnArticles":292,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22442,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7133228660054379,"acs":37254,"articleLive":2,"columnArticles":501,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52226,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3824789184848079,"acs":5715,"articleLive":2,"columnArticles":89,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14942,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6661443895383874,"acs":11054,"articleLive":2,"columnArticles":155,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.3250252134,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16594,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8322431885558327,"acs":35372,"articleLive":2,"columnArticles":549,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42502,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7434959589404755,"acs":12603,"articleLive":2,"columnArticles":207,"formTitle":"[1314]矩阵区域和","frequency":1.7349609185,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16951,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8100216517166718,"acs":13094,"articleLive":2,"columnArticles":271,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":16165,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4421461897356143,"acs":2843,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.6783820115,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6430,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143860270254322,"acs":10412,"articleLive":2,"columnArticles":196,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16947,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6553764537849418,"acs":6424,"articleLive":2,"columnArticles":115,"formTitle":"[1318]或运算的最小翻转次数","frequency":1.5249878304,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9802,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6171675505794539,"acs":31420,"articleLive":2,"columnArticles":517,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50910,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5893105043961129,"acs":2547,"articleLive":2,"columnArticles":59,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4322,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6174099946265449,"acs":4596,"articleLive":2,"columnArticles":83,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.3535496801,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":7444,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5949176267901367,"acs":5525,"articleLive":2,"columnArticles":65,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":9287,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7539622868485159,"acs":25070,"articleLive":2,"columnArticles":494,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.297716034,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":33251,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.587732089044425,"acs":6046,"articleLive":2,"columnArticles":119,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10287,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7296812474127226,"acs":10576,"articleLive":2,"columnArticles":188,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.3250252134,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14494,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47329901881936626,"acs":5885,"articleLive":2,"columnArticles":93,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12434,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6887409200968523,"acs":5689,"articleLive":2,"columnArticles":55,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":8260,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46423413150893195,"acs":6107,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.297716034,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":13155,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7710960232783706,"acs":7155,"articleLive":2,"columnArticles":162,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.8644953185,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9279,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3788167938931298,"acs":1191,"articleLive":2,"columnArticles":30,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.8349510722,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3144,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5338332752005581,"acs":12244,"articleLive":2,"columnArticles":209,"formTitle":"[1331]数组序号转换","frequency":1.2268310657,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22936,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6885001066780456,"acs":9681,"articleLive":2,"columnArticles":137,"formTitle":"[1332]删除回文子序列","frequency":0.8644953185,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":14061,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.546583850931677,"acs":5808,"articleLive":2,"columnArticles":121,"formTitle":"[1333]餐厅过滤器","frequency":0.8952102637,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10626,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4928265794110244,"acs":5874,"articleLive":2,"columnArticles":94,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.9271822964,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11919,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5886571056062582,"acs":3612,"articleLive":2,"columnArticles":59,"formTitle":"[1335]工作计划的最低难度","frequency":0.5163520033,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":6136,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4260810504867557,"acs":1882,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":4417,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7051904105419583,"acs":39387,"articleLive":2,"columnArticles":631,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":1.9899162974,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55853,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6386821064240419,"acs":9266,"articleLive":2,"columnArticles":137,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14508,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39877358048963163,"acs":8519,"articleLive":2,"columnArticles":138,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":21363,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5730179028132992,"acs":4481,"articleLive":2,"columnArticles":99,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7820,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4736275565123789,"acs":3520,"articleLive":2,"columnArticles":51,"formTitle":"[1341]电影评分","frequency":0.4146373721,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":7432,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8195121951219512,"acs":42504,"articleLive":2,"columnArticles":643,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51865,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5461195661313377,"acs":12990,"articleLive":2,"columnArticles":219,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23786,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.596203132415757,"acs":6281,"articleLive":2,"columnArticles":123,"formTitle":"[1344]时钟指针的夹角","frequency":0.8349510722,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10535,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3655227454110136,"acs":5954,"articleLive":2,"columnArticles":111,"formTitle":"[1345]跳跃游戏 IV","frequency":0.8952102637,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":16289,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43418904087587334,"acs":16220,"articleLive":2,"columnArticles":271,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":37357,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7414620638729924,"acs":8033,"articleLive":2,"columnArticles":122,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10834,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3067078151946991,"acs":3379,"articleLive":2,"columnArticles":52,"formTitle":"[1348]推文计数","frequency":1.3268699883,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":11017,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5048678720445062,"acs":3267,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.4474271949,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6471,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8477855248944319,"acs":8633,"articleLive":2,"columnArticles":88,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":10183,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7542917114370674,"acs":30186,"articleLive":2,"columnArticles":549,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.297716034,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":40019,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44623795886487894,"acs":6856,"articleLive":2,"columnArticles":74,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":15364,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2859139318587056,"acs":11866,"articleLive":2,"columnArticles":159,"formTitle":"[1353]最多可以参加的会议数目","frequency":1.2921924499,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":41502,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2816201757737868,"acs":2948,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.7270297357,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10468,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6636453526697429,"acs":4027,"articleLive":2,"columnArticles":62,"formTitle":"[1355]活动参与者","frequency":0.2715365284,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":6068,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7312646370023419,"acs":46213,"articleLive":2,"columnArticles":511,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.8644953185,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":63196,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5315802717664821,"acs":4225,"articleLive":2,"columnArticles":43,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7948,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4965115324632685,"acs":6049,"articleLive":2,"columnArticles":115,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.3535496801,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":12183,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5510087552341073,"acs":2895,"articleLive":2,"columnArticles":68,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5254,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.505435710626672,"acs":8880,"articleLive":2,"columnArticles":145,"formTitle":"[1360]日期之间隔几天","frequency":1.4922302339,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":17569,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.39981341349642374,"acs":7714,"articleLive":2,"columnArticles":207,"formTitle":"[1361]验证二叉树","frequency":0.9605076062,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":19294,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5275441746196731,"acs":5583,"articleLive":2,"columnArticles":71,"formTitle":"[1362]最接近的因数","frequency":0.3250252134,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10583,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3657292625912021,"acs":5163,"articleLive":2,"columnArticles":100,"formTitle":"[1363]形成三的最大倍数","frequency":1.1662003159,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":14117,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6857733508738959,"acs":3649,"articleLive":2,"columnArticles":69,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.4146373721,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":5321,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8246503045195094,"acs":86251,"articleLive":2,"columnArticles":1097,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.297716034,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":104591,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5391433891992551,"acs":7238,"articleLive":2,"columnArticles":141,"formTitle":"[1366]通过投票对团队排名","frequency":0.3535496801,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13425,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41777478084962916,"acs":15489,"articleLive":2,"columnArticles":228,"formTitle":"[1367]二叉树中的列表","frequency":0.2715365284,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":37075,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5302318964290795,"acs":3727,"articleLive":2,"columnArticles":93,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":7029,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6055260361317747,"acs":2849,"articleLive":2,"columnArticles":43,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3833848286,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4705,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7902319503430252,"acs":48378,"articleLive":2,"columnArticles":580,"formTitle":"[1370]上升下降字符串","frequency":0.297716034,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":61220,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5805805263727932,"acs":21442,"articleLive":2,"columnArticles":274,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.4922302339,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36932,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5141648270787343,"acs":8385,"articleLive":2,"columnArticles":169,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":16308,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.4053439741388019,"acs":8025,"articleLive":2,"columnArticles":174,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1959644178,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":19798,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7402949142341257,"acs":17220,"articleLive":2,"columnArticles":229,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":23261,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5769960112469757,"acs":8824,"articleLive":2,"columnArticles":175,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15293,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5049783833355168,"acs":7709,"articleLive":2,"columnArticles":157,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":15266,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32662515188335356,"acs":4301,"articleLive":2,"columnArticles":132,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":13168,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8627793296089385,"acs":7413,"articleLive":2,"columnArticles":63,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":8592,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8377331647170407,"acs":10599,"articleLive":2,"columnArticles":167,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12652,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7289820153170984,"acs":16943,"articleLive":2,"columnArticles":254,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":23242,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7330188108631223,"acs":12119,"articleLive":2,"columnArticles":165,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.297716034,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16533,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6973001966744145,"acs":11700,"articleLive":2,"columnArticles":181,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16779,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32461645746164575,"acs":4655,"articleLive":2,"columnArticles":88,"formTitle":"[1383]最大的团队表现值","frequency":1.0697467005,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14340,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5415891575870316,"acs":2038,"articleLive":2,"columnArticles":47,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3763,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.6999200719352583,"acs":14011,"articleLive":2,"columnArticles":208,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":20018,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3152577118313159,"acs":6459,"articleLive":2,"columnArticles":132,"formTitle":"[1386]安排电影院座位","frequency":0.8644953185,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20488,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6937192715185929,"acs":10018,"articleLive":2,"columnArticles":180,"formTitle":"[1387]将整数按权重排序","frequency":0.297716034,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14441,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5430655098704891,"acs":4319,"articleLive":2,"columnArticles":54,"formTitle":"[1388]3n 块披萨","frequency":0.297716034,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7953,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.831275720164609,"acs":28482,"articleLive":2,"columnArticles":489,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.2715365284,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":34263,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.36207355367502264,"acs":6803,"articleLive":2,"columnArticles":120,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":18789,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.400732687307965,"acs":6782,"articleLive":2,"columnArticles":207,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.3833848286,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16924,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40792529275161815,"acs":8256,"articleLive":2,"columnArticles":148,"formTitle":"[1392]最长快乐前缀","frequency":0.8644953185,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":20239,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.856708552898257,"acs":4227,"articleLive":2,"columnArticles":65,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4934,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6653260993284517,"acs":17536,"articleLive":2,"columnArticles":282,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":26357,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7460555584294656,"acs":14422,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.297716034,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19331,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.412435271765451,"acs":11071,"articleLive":2,"columnArticles":151,"formTitle":"[1396]设计地铁系统","frequency":0.9271822964,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":26843,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.377196127644317,"acs":1052,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2789,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7587470843052316,"acs":4554,"articleLive":2,"columnArticles":72,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":6002,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6705784320533297,"acs":9657,"articleLive":2,"columnArticles":156,"formTitle":"[1399]统计最大组的数目","frequency":0.3250252134,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14401,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6061197248177431,"acs":5903,"articleLive":2,"columnArticles":100,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.297716034,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9739,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4184004181913225,"acs":4002,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9565,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7530364372469636,"acs":9858,"articleLive":2,"columnArticles":179,"formTitle":"[1402]做菜顺序","frequency":0.3250252134,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":13091,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6913926714928086,"acs":21680,"articleLive":2,"columnArticles":366,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.8644953185,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":31357,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4941793957337999,"acs":7344,"articleLive":2,"columnArticles":155,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14861,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5092778116560676,"acs":5846,"articleLive":2,"columnArticles":144,"formTitle":"[1405]最长快乐字符串","frequency":1.2921924499,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11479,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5682517960998974,"acs":4983,"articleLive":2,"columnArticles":82,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8769,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6683233929754805,"acs":6051,"articleLive":2,"columnArticles":70,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":9054,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6149907935509947,"acs":13694,"articleLive":2,"columnArticles":206,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":22267,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8062395761797312,"acs":8218,"articleLive":2,"columnArticles":133,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10193,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4755174154467441,"acs":7536,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.3535496801,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15848,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5507022471910112,"acs":7842,"articleLive":2,"columnArticles":143,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":1.4402272523,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14240,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5519332827899924,"acs":2912,"articleLive":2,"columnArticles":69,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":5276,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6931259222823414,"acs":11273,"articleLive":2,"columnArticles":233,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.2464095784,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":16264,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6034441329595515,"acs":7534,"articleLive":2,"columnArticles":151,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":1.2921924499,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12485,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6856881293866341,"acs":6741,"articleLive":2,"columnArticles":182,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.297716034,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9831,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4091363311920057,"acs":2866,"articleLive":2,"columnArticles":53,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":7005,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5201837744443571,"acs":13247,"articleLive":2,"columnArticles":185,"formTitle":"[1417]重新格式化字符串","frequency":0.2222654794,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":25466,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7321828149474156,"acs":26177,"articleLive":2,"columnArticles":417,"formTitle":"[1418]点菜展示表","frequency":2.4012350808,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35752,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.419509650495566,"acs":8042,"articleLive":2,"columnArticles":158,"formTitle":"[1419]数青蛙","frequency":1.2588782432,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":19170,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5996140858658948,"acs":2486,"articleLive":2,"columnArticles":45,"formTitle":"[1420]生成数组","frequency":0.5951328811,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4146,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7473291925465838,"acs":3008,"articleLive":2,"columnArticles":39,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":1,"nodeType":"def","questionId":"1551","status":"","submitted":4025,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5409086340335713,"acs":10763,"articleLive":2,"columnArticles":196,"formTitle":"[1422]分割字符串的最大得分","frequency":0.8644953185,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19898,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5532738465365005,"acs":35591,"articleLive":2,"columnArticles":522,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":64328,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.40002309602171027,"acs":6928,"articleLive":2,"columnArticles":150,"formTitle":"[1424]对角线遍历 II","frequency":1.2268310657,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":17319,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4414245548266167,"acs":3297,"articleLive":2,"columnArticles":71,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7469,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7096330275229358,"acs":1547,"articleLive":2,"columnArticles":50,"formTitle":"[1426]数元素","frequency":1.0697467005,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":2180,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6603466955579632,"acs":1219,"articleLive":2,"columnArticles":47,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1846,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5895096921322691,"acs":1034,"articleLive":2,"columnArticles":21,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1754,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5040064102564102,"acs":1258,"articleLive":2,"columnArticles":43,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2496,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5786212238574748,"acs":747,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1291,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8461127037781866,"acs":79098,"articleLive":2,"columnArticles":1040,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":93484,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3958690435378814,"acs":4619,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11668,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6412476528270394,"acs":6147,"articleLive":2,"columnArticles":104,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9586,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4668109668109668,"acs":2588,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5544,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6216724537037037,"acs":4297,"articleLive":2,"columnArticles":48,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6912,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.821593237704918,"acs":44905,"articleLive":2,"columnArticles":653,"formTitle":"[1436]旅行终点站","frequency":0.8349510722,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":54656,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5854913858489544,"acs":10807,"articleLive":2,"columnArticles":180,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":18458,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4828410203259055,"acs":33542,"articleLive":2,"columnArticles":472,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.1959644178,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":69468,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5646198830409357,"acs":3862,"articleLive":2,"columnArticles":60,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6840,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.7009040683073833,"acs":2791,"articleLive":2,"columnArticles":38,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3982,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6490204399179574,"acs":18353,"articleLive":2,"columnArticles":379,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":28278,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916808573439593,"acs":34868,"articleLive":2,"columnArticles":375,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.5447294245,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":44043,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41212941847206386,"acs":5783,"articleLive":2,"columnArticles":142,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":14032,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5251671254423909,"acs":2671,"articleLive":2,"columnArticles":61,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5086,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8566440747586773,"acs":4171,"articleLive":2,"columnArticles":56,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4869,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5755520778994957,"acs":13240,"articleLive":2,"columnArticles":221,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":23004,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6161142274349821,"acs":6041,"articleLive":2,"columnArticles":75,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9805,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7132698149682408,"acs":10331,"articleLive":2,"columnArticles":168,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.3250252134,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":14484,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6280713691691238,"acs":16615,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.2921924499,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26454,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8029559893347378,"acs":24393,"articleLive":2,"columnArticles":346,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.1990410264,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30379,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5258182557430372,"acs":10346,"articleLive":2,"columnArticles":157,"formTitle":"[1451]重新排列句子中的单词","frequency":0.2715365284,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19676,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4985547939549096,"acs":6037,"articleLive":2,"columnArticles":91,"formTitle":"[1452]收藏清单","frequency":0.3833848286,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":12109,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3662533215234721,"acs":1654,"articleLive":2,"columnArticles":33,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.8952102637,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4516,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.3963840777879064,"acs":5218,"articleLive":2,"columnArticles":83,"formTitle":"[1454]活跃用户","frequency":0.3250252134,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":13164,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6320920156798019,"acs":12255,"articleLive":2,"columnArticles":210,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":19388,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5263235565393839,"acs":14266,"articleLive":2,"columnArticles":218,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":27105,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6298151001540832,"acs":8175,"articleLive":2,"columnArticles":141,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12980,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44353518821603927,"acs":5691,"articleLive":2,"columnArticles":91,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12831,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5987437185929648,"acs":2383,"articleLive":2,"columnArticles":50,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3980,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7440611934625617,"acs":15661,"articleLive":2,"columnArticles":316,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":21048,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5037806398005816,"acs":6063,"articleLive":2,"columnArticles":87,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":12035,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4299475753604194,"acs":6561,"articleLive":2,"columnArticles":128,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":15260,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5937635339974014,"acs":2742,"articleLive":2,"columnArticles":66,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4618,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7668671989204993,"acs":27279,"articleLive":2,"columnArticles":386,"formTitle":"[1464]数组中两元素的最大乘积","frequency":1.2268310657,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":35572,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.31164988307163655,"acs":6530,"articleLive":2,"columnArticles":83,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.3250252134,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20953,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48316861113175297,"acs":6502,"articleLive":2,"columnArticles":126,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13457,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6178297405918889,"acs":1691,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2737,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.6999773396782234,"acs":3089,"articleLive":2,"columnArticles":52,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":4413,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8,"acs":2348,"articleLive":2,"columnArticles":88,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2935,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8427980209727106,"acs":54170,"articleLive":2,"columnArticles":736,"formTitle":"[1470]重新排列数组","frequency":0.8349510722,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":64274,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5458294147435434,"acs":7545,"articleLive":2,"columnArticles":108,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13823,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6203080928617921,"acs":8577,"articleLive":2,"columnArticles":138,"formTitle":"[1472]设计浏览器历史记录","frequency":0.806499651,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13827,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6736660185785267,"acs":15592,"articleLive":2,"columnArticles":168,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23145,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7192732454577841,"acs":2019,"articleLive":2,"columnArticles":64,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2807,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7217363284846253,"acs":15679,"articleLive":2,"columnArticles":241,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":21724,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8659557235421166,"acs":12830,"articleLive":2,"columnArticles":120,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14816,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.29118230791040545,"acs":5135,"articleLive":2,"columnArticles":99,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.8349510722,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":17635,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5825995807127883,"acs":2779,"articleLive":2,"columnArticles":58,"formTitle":"[1478]安排邮筒","frequency":0.4474271949,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4770,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5693248124479022,"acs":2049,"articleLive":2,"columnArticles":40,"formTitle":"[1479]周内每天的销售情况","frequency":0.9271822964,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3599,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8693196646168053,"acs":129912,"articleLive":2,"columnArticles":1304,"formTitle":"[1480]一维数组的动态和","frequency":1.4922302339,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":149441,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5147336045242583,"acs":10376,"articleLive":2,"columnArticles":150,"formTitle":"[1481]不同整数的最少数目","frequency":1.1959644178,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":20158,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5868928324842785,"acs":31451,"articleLive":2,"columnArticles":409,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53589,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.300561797752809,"acs":3424,"articleLive":2,"columnArticles":72,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11392,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8098522167487685,"acs":822,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":1015,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6585528509503168,"acs":3950,"articleLive":2,"columnArticles":47,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5998,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8583277318993663,"acs":71509,"articleLive":2,"columnArticles":694,"formTitle":"[1486]数组异或操作","frequency":0.8349510722,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":83312,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31247023337037627,"acs":7873,"articleLive":2,"columnArticles":107,"formTitle":"[1487]保证文件名唯一","frequency":0.8952102637,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":25196,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23870722674179354,"acs":7541,"articleLive":2,"columnArticles":115,"formTitle":"[1488]避免洪水泛滥","frequency":3.1418745668,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":31591,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6908172362555721,"acs":11623,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.7790706138,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16825,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8544568245125348,"acs":1227,"articleLive":2,"columnArticles":31,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1436,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6708412020011265,"acs":20248,"articleLive":2,"columnArticles":303,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":30183,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6572843128266251,"acs":7169,"articleLive":2,"columnArticles":84,"formTitle":"[1492]n 的第 k 个因子","frequency":0.8644953185,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10907,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5684816166152119,"acs":8102,"articleLive":2,"columnArticles":155,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.2268310657,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":14252,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3718051760167176,"acs":2313,"articleLive":2,"columnArticles":37,"formTitle":"[1494]并行课程 II","frequency":1.6188212686,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6221,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5421226104152933,"acs":4112,"articleLive":2,"columnArticles":40,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":7585,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5363718112546737,"acs":11333,"articleLive":2,"columnArticles":170,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":21129,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3923248712456132,"acs":8608,"articleLive":2,"columnArticles":117,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.9271822964,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21941,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33469259723964867,"acs":5335,"articleLive":2,"columnArticles":68,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15940,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3751656506758548,"acs":2831,"articleLive":2,"columnArticles":61,"formTitle":"[1499]满足不等式的最大值","frequency":0.4818895991,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7546,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.301879971077368,"acs":835,"articleLive":2,"columnArticles":28,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":2766,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5929030455434479,"acs":4244,"articleLive":2,"columnArticles":62,"formTitle":"[1501]可以放心投资的国家","frequency":0.3250252134,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":7158,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.716441422767598,"acs":25923,"articleLive":2,"columnArticles":310,"formTitle":"[1502]判断能否形成等差数列","frequency":1.5249878304,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":36183,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5144566891811826,"acs":8683,"articleLive":2,"columnArticles":89,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16878,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5967300320738481,"acs":7628,"articleLive":2,"columnArticles":136,"formTitle":"[1504]统计全 1 子矩形","frequency":0.297716034,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12783,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3614209899274342,"acs":3337,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9233,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8337912087912088,"acs":607,"articleLive":2,"columnArticles":18,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":728,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5890636968947027,"acs":9997,"articleLive":2,"columnArticles":133,"formTitle":"[1507]转变日期格式","frequency":0.297716034,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16971,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5527629233511586,"acs":6202,"articleLive":2,"columnArticles":54,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11220,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5497147514262428,"acs":5396,"articleLive":2,"columnArticles":79,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.2715365284,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9816,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5782343142698501,"acs":5207,"articleLive":2,"columnArticles":64,"formTitle":"[1510]石子游戏 IV","frequency":1.2921924499,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":9005,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6801990978379219,"acs":4373,"articleLive":2,"columnArticles":64,"formTitle":"[1511]消费者下单频率","frequency":0.3535496801,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":6429,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848308449922432,"acs":59603,"articleLive":2,"columnArticles":758,"formTitle":"[1512]好数对的数目","frequency":0.2715365284,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":70261,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38099114684033786,"acs":11232,"articleLive":2,"columnArticles":155,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29481,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3286613612067942,"acs":8301,"articleLive":2,"columnArticles":146,"formTitle":"[1514]概率最大的路径","frequency":0.8644953185,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":25257,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3435377816104344,"acs":3187,"articleLive":2,"columnArticles":60,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9277,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5855421686746988,"acs":243,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":415,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7178137651821862,"acs":3546,"articleLive":2,"columnArticles":37,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4940,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6740809802876931,"acs":25305,"articleLive":2,"columnArticles":402,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37540,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29849547571879853,"acs":5575,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.4146373721,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18677,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33447054192363207,"acs":2549,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7621,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39563357427349166,"acs":2682,"articleLive":2,"columnArticles":53,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6779,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7104810996563574,"acs":827,"articleLive":2,"columnArticles":30,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":1164,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5772284979308803,"acs":10322,"articleLive":2,"columnArticles":174,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17882,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.43232257540037394,"acs":5318,"articleLive":2,"columnArticles":105,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.8952102637,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":12301,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6610591162184575,"acs":5580,"articleLive":2,"columnArticles":112,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8441,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6192191053828658,"acs":3267,"articleLive":2,"columnArticles":51,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5276,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.49707602339181284,"acs":3740,"articleLive":2,"columnArticles":40,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":7524,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7848804319876574,"acs":30524,"articleLive":2,"columnArticles":362,"formTitle":"[1528]重新排列字符串","frequency":0.8349510722,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38890,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6916323102763781,"acs":9059,"articleLive":2,"columnArticles":135,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":13098,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5687395605807529,"acs":8853,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.9271822964,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15566,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3428474919777065,"acs":2030,"articleLive":2,"columnArticles":35,"formTitle":"[1531]压缩字符串 II","frequency":1.8425915827,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5921,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6208469055374592,"acs":2859,"articleLive":2,"columnArticles":51,"formTitle":"[1532]最近的三笔订单","frequency":0.8952102637,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":4605,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6026365348399246,"acs":320,"articleLive":2,"columnArticles":19,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":531,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7885151542404892,"acs":17535,"articleLive":2,"columnArticles":165,"formTitle":"[1534]统计好三元组","frequency":0.8644953185,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":22238,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4533238799419292,"acs":13427,"articleLive":2,"columnArticles":184,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3250252134,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29619,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44175684277530236,"acs":4164,"articleLive":2,"columnArticles":81,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.5163520033,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9426,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36665861708122033,"acs":4555,"articleLive":2,"columnArticles":91,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12423,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6055045871559633,"acs":132,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":218,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5397527898081118,"acs":17074,"articleLive":2,"columnArticles":253,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.8644953185,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":31633,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3180296200901481,"acs":4939,"articleLive":2,"columnArticles":88,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15530,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4614012928152166,"acs":6210,"articleLive":2,"columnArticles":96,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":13459,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38630178409434535,"acs":2555,"articleLive":2,"columnArticles":49,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6614,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5551005875022254,"acs":3118,"articleLive":2,"columnArticles":45,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":5617,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5482915533536175,"acs":20363,"articleLive":2,"columnArticles":326,"formTitle":"[1544]整理字符串","frequency":1.460656972,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":37139,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5545341796162545,"acs":7601,"articleLive":2,"columnArticles":102,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.9605076062,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13707,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.415615141955836,"acs":5270,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12680,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5366427171783148,"acs":4108,"articleLive":2,"columnArticles":73,"formTitle":"[1547]切棍子的最小成本","frequency":1.2427018956,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7655,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7077798861480076,"acs":373,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":527,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.666406858924396,"acs":2565,"articleLive":2,"columnArticles":50,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3849,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6576923076923077,"acs":21717,"articleLive":2,"columnArticles":294,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.297716034,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":33020,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8170670491215489,"acs":11394,"articleLive":2,"columnArticles":157,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.3250252134,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13945,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.510827745410575,"acs":9294,"articleLive":2,"columnArticles":125,"formTitle":"[1552]两球之间的磁力","frequency":0.297716034,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":18194,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2956305933669249,"acs":7862,"articleLive":2,"columnArticles":123,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.9952937223,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26594,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7132075471698113,"acs":567,"articleLive":2,"columnArticles":20,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":795,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43818488339421185,"acs":3119,"articleLive":2,"columnArticles":59,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":7118,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5776728914426431,"acs":11260,"articleLive":2,"columnArticles":173,"formTitle":"[1556]千位分隔数","frequency":2.4012350808,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":19492,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7701448199034534,"acs":8296,"articleLive":2,"columnArticles":116,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.8644953185,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10772,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6225824026150912,"acs":4571,"articleLive":2,"columnArticles":73,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.3535496801,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7342,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.37173194430531903,"acs":3711,"articleLive":2,"columnArticles":69,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9983,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5723397331597787,"acs":8794,"articleLive":2,"columnArticles":92,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15365,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7790629670543895,"acs":11989,"articleLive":2,"columnArticles":174,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":1.2588782432,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":15389,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3098093036694597,"acs":4289,"articleLive":2,"columnArticles":89,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13844,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3805984192698532,"acs":4045,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10628,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5502008032128514,"acs":685,"articleLive":2,"columnArticles":25,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1245,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7274064733081127,"acs":3461,"articleLive":2,"columnArticles":45,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.3250252134,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4758,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.446012236124125,"acs":8092,"articleLive":2,"columnArticles":122,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.3250252134,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":18143,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.40221088435374147,"acs":14663,"articleLive":2,"columnArticles":233,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":1.460656972,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":36456,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45792767732962447,"acs":2634,"articleLive":2,"columnArticles":48,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5752,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47452660054102797,"acs":2105,"articleLive":2,"columnArticles":47,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4436,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8926919518963923,"acs":1930,"articleLive":2,"columnArticles":40,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.2715365284,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":2162,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7581573896353166,"acs":3555,"articleLive":2,"columnArticles":45,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4689,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049576533774013,"acs":19484,"articleLive":2,"columnArticles":328,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.8644953185,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":24205,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29634676529751475,"acs":4567,"articleLive":2,"columnArticles":66,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15411,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32954241370082954,"acs":4926,"articleLive":2,"columnArticles":86,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.297716034,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14948,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5975609756097561,"acs":4606,"articleLive":2,"columnArticles":70,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7708,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4770216756982076,"acs":18310,"articleLive":2,"columnArticles":260,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":38384,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32659360040312424,"acs":5185,"articleLive":2,"columnArticles":80,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4146373721,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15876,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5828481510621558,"acs":11112,"articleLive":2,"columnArticles":209,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":19065,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6196607320241461,"acs":16219,"articleLive":2,"columnArticles":296,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26174,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6363636363636364,"acs":294,"articleLive":2,"columnArticles":20,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":462,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8027613412228797,"acs":3663,"articleLive":2,"columnArticles":52,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":4563,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6690490776665986,"acs":9829,"articleLive":2,"columnArticles":113,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.297716034,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14691,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6852968036529681,"acs":18760,"articleLive":2,"columnArticles":244,"formTitle":"[1583]统计不开心的朋友","frequency":2.6446643451,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27375,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.663340102025655,"acs":26787,"articleLive":2,"columnArticles":336,"formTitle":"[1584]连接所有点的最小费用","frequency":1.5944119532,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":40382,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.430055525703027,"acs":2401,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5583,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6207951070336392,"acs":406,"articleLive":2,"columnArticles":22,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":654,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8277272727272728,"acs":3642,"articleLive":2,"columnArticles":43,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":4400,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389939242990302,"acs":44465,"articleLive":2,"columnArticles":708,"formTitle":"[1588]所有奇数长度子数组的和","frequency":2.220036974,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52998,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29389426656738643,"acs":3947,"articleLive":2,"columnArticles":57,"formTitle":"[1589]所有排列中的最大和","frequency":0.297716034,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13430,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.27138874991065687,"acs":3797,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.8952102637,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13991,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5793103448275863,"acs":1176,"articleLive":2,"columnArticles":33,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":2030,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4447991934128718,"acs":7941,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.297716034,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17853,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5369108188537967,"acs":5593,"articleLive":2,"columnArticles":93,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.3250252134,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10417,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31406112253893625,"acs":4275,"articleLive":2,"columnArticles":101,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13612,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4675103431491847,"acs":1921,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4109,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7511792452830188,"acs":2548,"articleLive":2,"columnArticles":44,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":3392,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6659242761692651,"acs":299,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":449,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6717760549209919,"acs":11351,"articleLive":2,"columnArticles":151,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16897,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.42024308916854897,"acs":3907,"articleLive":2,"columnArticles":70,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9297,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6774296166693177,"acs":17036,"articleLive":2,"columnArticles":208,"formTitle":"[1600]皇位继承顺序","frequency":0.8349510722,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":25148,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.49210584834334,"acs":2213,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4497,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7776639344262295,"acs":759,"articleLive":2,"columnArticles":31,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":976,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8442735592526535,"acs":57750,"articleLive":2,"columnArticles":462,"formTitle":"[1603]设计停车系统","frequency":1.2268310657,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":68402,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41576260370134016,"acs":3909,"articleLive":2,"columnArticles":65,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.3833848286,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9402,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7386694386694387,"acs":3553,"articleLive":2,"columnArticles":71,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4810,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3403249023236685,"acs":1655,"articleLive":2,"columnArticles":35,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4863,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5431252255503428,"acs":3010,"articleLive":2,"columnArticles":41,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":5542,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6391381271325667,"acs":10115,"articleLive":2,"columnArticles":168,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15826,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5119170984455959,"acs":7410,"articleLive":2,"columnArticles":135,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14475,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27088265133581335,"acs":2403,"articleLive":2,"columnArticles":41,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8871,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6090289608177172,"acs":2145,"articleLive":2,"columnArticles":58,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3522,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7346938775510204,"acs":468,"articleLive":2,"columnArticles":22,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":637,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.727896649172386,"acs":1803,"articleLive":2,"columnArticles":37,"formTitle":"[1613]找到遗失的ID","frequency":0.4146373721,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2477,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8227782244714563,"acs":17396,"articleLive":2,"columnArticles":294,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.297716034,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":21143,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4986385913958976,"acs":5494,"articleLive":2,"columnArticles":67,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":11018,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2758732038103439,"acs":5126,"articleLive":2,"columnArticles":94,"formTitle":"[1616]分割两个字符串得到回文串","frequency":1.3268699883,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18581,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6222144846796658,"acs":1787,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2872,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5726210350584308,"acs":343,"articleLive":2,"columnArticles":18,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":599,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6732438831886346,"acs":7677,"articleLive":2,"columnArticles":133,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":11403,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.374195435927443,"acs":2558,"articleLive":2,"columnArticles":44,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6836,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4423449612403101,"acs":1826,"articleLive":2,"columnArticles":37,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4128,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.1535300925925926,"acs":2653,"articleLive":2,"columnArticles":58,"formTitle":"[1622]奇妙序列","frequency":1.2921924499,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":17280,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7841283798637063,"acs":3567,"articleLive":2,"columnArticles":47,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4549,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6217415701678315,"acs":12188,"articleLive":2,"columnArticles":211,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.8349510722,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":19603,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.544013121924549,"acs":2985,"articleLive":2,"columnArticles":68,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5487,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3877116594097726,"acs":4007,"articleLive":2,"columnArticles":86,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10335,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.38390663390663393,"acs":2500,"articleLive":2,"columnArticles":39,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6512,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8359375,"acs":428,"articleLive":2,"columnArticles":19,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":512,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5242269296323351,"acs":8612,"articleLive":2,"columnArticles":100,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":16428,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7666869547575573,"acs":7558,"articleLive":2,"columnArticles":118,"formTitle":"[1630]等差子数组","frequency":1.2921924499,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9858,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4941984415976454,"acs":26194,"articleLive":2,"columnArticles":306,"formTitle":"[1631]最小体力消耗路径","frequency":1.2268310657,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":53003,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3195456493784826,"acs":1491,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4666,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6557528245330874,"acs":2844,"articleLive":2,"columnArticles":28,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":4337,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5340659340659341,"acs":486,"articleLive":2,"columnArticles":26,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":910,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5433729634522237,"acs":1234,"articleLive":2,"columnArticles":35,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.5163520033,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":2271,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7058823529411765,"acs":9384,"articleLive":2,"columnArticles":186,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.8349510722,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":13294,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8063010501750292,"acs":5528,"articleLive":2,"columnArticles":74,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6856,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7130077369439072,"acs":2949,"articleLive":2,"columnArticles":50,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.4474271949,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":4136,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4023977866584691,"acs":1309,"articleLive":2,"columnArticles":29,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3253,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6569146229775109,"acs":12911,"articleLive":2,"columnArticles":222,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19654,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7716763005780347,"acs":12282,"articleLive":2,"columnArticles":281,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.2921924499,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15916,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45159552982361656,"acs":6708,"articleLive":2,"columnArticles":109,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14854,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45161290322580644,"acs":2296,"articleLive":2,"columnArticles":49,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5084,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5510295434198746,"acs":1231,"articleLive":2,"columnArticles":26,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":2234,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.41295938104448743,"acs":854,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.6783820115,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":2068,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5353539909491377,"acs":35608,"articleLive":2,"columnArticles":363,"formTitle":"[1646]获取生成数组中的最大值","frequency":2.3671160508,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":66513,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5163643801990999,"acs":7573,"articleLive":2,"columnArticles":113,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.8952102637,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14666,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2773785346039681,"acs":3551,"articleLive":2,"columnArticles":92,"formTitle":"[1648]销售价值减少的颜色球","frequency":1.2921924499,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12802,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4740795017402455,"acs":2588,"articleLive":2,"columnArticles":66,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5459,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.795822454308094,"acs":1524,"articleLive":2,"columnArticles":31,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.3833848286,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1915,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6717299578059072,"acs":796,"articleLive":2,"columnArticles":24,"formTitle":"[1651]Hopper Company Queries III","frequency":0.8349510722,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":1185,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6520846353004196,"acs":7304,"articleLive":2,"columnArticles":180,"formTitle":"[1652]拆炸弹","frequency":0.8349510722,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":11201,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5101342458541721,"acs":3876,"articleLive":2,"columnArticles":89,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7598,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2772878844016302,"acs":3742,"articleLive":2,"columnArticles":50,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.1959644178,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":13495,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.38308457711442784,"acs":2079,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.5951328811,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5427,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7824776351614158,"acs":8047,"articleLive":2,"columnArticles":97,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10284,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4653539381854437,"acs":5601,"articleLive":2,"columnArticles":77,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.8952102637,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":12036,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3015562935469167,"acs":9262,"articleLive":2,"columnArticles":154,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.8644953185,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":30714,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4164391871398241,"acs":1373,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3297,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7430555555555556,"acs":428,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":576,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7284663865546218,"acs":2774,"articleLive":2,"columnArticles":57,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8952102637,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":3808,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128855380397533,"acs":21348,"articleLive":2,"columnArticles":295,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":26262,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5718987712112347,"acs":7819,"articleLive":2,"columnArticles":135,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13672,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5470500743678731,"acs":5517,"articleLive":2,"columnArticles":109,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":10085,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6596276396351368,"acs":5279,"articleLive":2,"columnArticles":84,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3250252134,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":8003,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6933333333333334,"acs":260,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":375,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6029679770892996,"acs":2316,"articleLive":2,"columnArticles":34,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3841,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4431007751937984,"acs":7145,"articleLive":2,"columnArticles":133,"formTitle":"[1668]最大重复子字符串","frequency":0.2715365284,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":16125,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7576680198466396,"acs":13438,"articleLive":2,"columnArticles":249,"formTitle":"[1669]合并两个链表","frequency":0.2464095784,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17736,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5253267973856209,"acs":4501,"articleLive":2,"columnArticles":80,"formTitle":"[1670]设计前中后队列","frequency":0.3535496801,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8568,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46865203761755486,"acs":2093,"articleLive":2,"columnArticles":43,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.6783820115,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4466,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8497857792011079,"acs":39272,"articleLive":2,"columnArticles":453,"formTitle":"[1672]最富有客户的资产总量","frequency":0.2464095784,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":46214,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.357454428577988,"acs":7785,"articleLive":2,"columnArticles":171,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.2715365284,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21779,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3658188053729637,"acs":2560,"articleLive":2,"columnArticles":54,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.5546415198,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6998,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4348668280871671,"acs":2694,"articleLive":2,"columnArticles":44,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6195,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7697654213727194,"acs":886,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.5546415198,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":1151,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.383745963401507,"acs":2139,"articleLive":2,"columnArticles":36,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":5574,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.828820431560796,"acs":17784,"articleLive":2,"columnArticles":293,"formTitle":"[1678]设计 Goal 解析器","frequency":0.297716034,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21457,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4981830887491265,"acs":7129,"articleLive":2,"columnArticles":116,"formTitle":"[1679]K 和数对的最大数目","frequency":0.2715365284,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":14310,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46744912606603056,"acs":5536,"articleLive":2,"columnArticles":73,"formTitle":"[1680]连接连续二进制数字","frequency":0.3250252134,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11843,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38468884290943817,"acs":2417,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6283,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5247376311844077,"acs":350,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":667,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8976184630493493,"acs":3656,"articleLive":2,"columnArticles":40,"formTitle":"[1683]无效的推文","frequency":0.3250252134,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":4073,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8276721866767031,"acs":17593,"articleLive":2,"columnArticles":363,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":21256,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.6043356207111665,"acs":3875,"articleLive":2,"columnArticles":89,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6412,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4717236708432103,"acs":2786,"articleLive":2,"columnArticles":50,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5906,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40261331155573704,"acs":986,"articleLive":2,"columnArticles":24,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2449,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8057751122055845,"acs":20287,"articleLive":2,"columnArticles":274,"formTitle":"[1688]比赛中的配对次数","frequency":0.8349510722,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":25177,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8659693644261546,"acs":15151,"articleLive":2,"columnArticles":202,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.297716034,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":17496,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5184286539572501,"acs":4487,"articleLive":2,"columnArticles":107,"formTitle":"[1690]石子游戏 VII","frequency":0.4474271949,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8655,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48943731490621917,"acs":2479,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5065,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6621160409556314,"acs":194,"articleLive":2,"columnArticles":13,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":293,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8044132397191575,"acs":2406,"articleLive":2,"columnArticles":36,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2991,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6355871317953221,"acs":7962,"articleLive":2,"columnArticles":139,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12527,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4683016467594883,"acs":6626,"articleLive":2,"columnArticles":138,"formTitle":"[1695]删除子数组的最大得分","frequency":0.297716034,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":14149,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39721830770173394,"acs":6483,"articleLive":2,"columnArticles":116,"formTitle":"[1696]跳跃游戏 VI","frequency":0.3250252134,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":16321,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5287846481876333,"acs":2232,"articleLive":2,"columnArticles":43,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4221,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5206611570247934,"acs":504,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.6380579259,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":968,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8029350104821803,"acs":1915,"articleLive":2,"columnArticles":43,"formTitle":"[1699]两人之间的通话次数","frequency":0.3250252134,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":2385,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7070110701107011,"acs":8622,"articleLive":2,"columnArticles":189,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2715365284,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":12195,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6126344493258598,"acs":4044,"articleLive":2,"columnArticles":83,"formTitle":"[1701]平均等待时间","frequency":0.297716034,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6601,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4784658912291732,"acs":3044,"articleLive":2,"columnArticles":68,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.4146373721,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6362,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38896746817538896,"acs":1375,"articleLive":2,"columnArticles":25,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.3833848286,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3535,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7801210457353216,"acs":12503,"articleLive":2,"columnArticles":196,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":16027,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34734722880151586,"acs":5866,"articleLive":2,"columnArticles":122,"formTitle":"[1705]吃苹果的最大数目","frequency":0.3833848286,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16888,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5883053313930414,"acs":4447,"articleLive":2,"columnArticles":112,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7559,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5029373482956344,"acs":14297,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":2.056165683,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28427,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7008547008547008,"acs":984,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1404,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7071593533487298,"acs":1531,"articleLive":2,"columnArticles":38,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.3833848286,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":2165,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6941598360655737,"acs":12195,"articleLive":2,"columnArticles":195,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1959644178,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":17568,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3588146112664045,"acs":30294,"articleLive":2,"columnArticles":362,"formTitle":"[1711]大餐计数","frequency":2.4366294889,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":84428,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2625487185543876,"acs":6669,"articleLive":2,"columnArticles":107,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.4474271949,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":25401,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4950143122267308,"acs":15737,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":2.3708468416,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31791,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6342710997442456,"acs":248,"articleLive":2,"columnArticles":10,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":391,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7344854673998429,"acs":1870,"articleLive":2,"columnArticles":37,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8952102637,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":2546,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6708456626693662,"acs":8615,"articleLive":2,"columnArticles":195,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12842,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43494068120933793,"acs":2273,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.4474271949,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5226,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4924695194836242,"acs":2060,"articleLive":2,"columnArticles":50,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4183,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3731257208765859,"acs":647,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1734,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8690200581556868,"acs":46921,"articleLive":2,"columnArticles":494,"formTitle":"[1720]解码异或后的数组","frequency":0.2715365284,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53993,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6451412077650122,"acs":11399,"articleLive":2,"columnArticles":174,"formTitle":"[1721]交换链表中的节点","frequency":0.297716034,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":17669,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5166810159276797,"acs":4801,"articleLive":2,"columnArticles":114,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9292,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5062478529714874,"acs":23579,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":1.1959644178,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":46576,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5674418604651162,"acs":366,"articleLive":2,"columnArticles":13,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":645,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7886254566291813,"acs":11010,"articleLive":2,"columnArticles":150,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13961,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.484328294474336,"acs":5671,"articleLive":2,"columnArticles":109,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11709,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5765171503957783,"acs":3496,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.4474271949,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":6064,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.36162827390343955,"acs":1146,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3169,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6193669527896996,"acs":2309,"articleLive":2,"columnArticles":24,"formTitle":"[1729]求关注者的数量","frequency":0.297716034,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":3728,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5285285285285285,"acs":704,"articleLive":2,"columnArticles":24,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":1332,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46246175570722525,"acs":1965,"articleLive":2,"columnArticles":29,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":4249,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.790761564017378,"acs":12377,"articleLive":2,"columnArticles":215,"formTitle":"[1732]找到最高海拔","frequency":0.8349510722,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15652,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.46322444678609065,"acs":2198,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4745,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.723163696301638,"acs":28079,"articleLive":2,"columnArticles":368,"formTitle":"[1734]解码异或后的排列","frequency":0.3833848286,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38828,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4900692840646651,"acs":1061,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2165,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4486955980325011,"acs":28826,"articleLive":2,"columnArticles":355,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":1.8749045717,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":64244,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31746031746031744,"acs":3800,"articleLive":2,"columnArticles":106,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11970,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6536528532919085,"acs":28613,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.2459841512,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43774,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47191204260436354,"acs":2747,"articleLive":2,"columnArticles":58,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5821,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7028824833702882,"acs":634,"articleLive":2,"columnArticles":21,"formTitle":"[1740]找到二叉树中的距离","frequency":0.4818895991,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":902,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8417649296310384,"acs":2213,"articleLive":2,"columnArticles":32,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2629,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7098109226649355,"acs":8747,"articleLive":2,"columnArticles":132,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":12323,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6966385776460784,"acs":22569,"articleLive":2,"columnArticles":332,"formTitle":"[1743]从相邻元素对还原数组","frequency":2.1509934701,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32397,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3629086823862838,"acs":28427,"articleLive":2,"columnArticles":369,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.7655618964,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78331,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4848022206800833,"acs":3493,"articleLive":2,"columnArticles":72,"formTitle":"[1745]回文串分割 IV","frequency":0.4818895991,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7205,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5861258083480305,"acs":997,"articleLive":2,"columnArticles":42,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":1.0316613665,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":1701,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.6976972072513474,"acs":1424,"articleLive":2,"columnArticles":35,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":2041,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7453989643770665,"acs":11948,"articleLive":2,"columnArticles":238,"formTitle":"[1748]唯一元素的和","frequency":0.2715365284,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":16029,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5316578728131075,"acs":3829,"articleLive":2,"columnArticles":89,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":7202,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45769595234872074,"acs":3381,"articleLive":2,"columnArticles":81,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7387,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4717566728739913,"acs":2280,"articleLive":2,"columnArticles":34,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.4474271949,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4833,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.676173209678544,"acs":9697,"articleLive":2,"columnArticles":113,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.3250252134,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":14341,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6295321045169131,"acs":6216,"articleLive":2,"columnArticles":131,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9874,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42254623740091984,"acs":4318,"articleLive":2,"columnArticles":92,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.4474271949,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10219,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.41675218060543867,"acs":3249,"articleLive":2,"columnArticles":56,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.9605076062,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7796,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7963963963963964,"acs":442,"articleLive":2,"columnArticles":15,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":555,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9209249214958607,"acs":3226,"articleLive":2,"columnArticles":33,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":3503,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6410698878343399,"acs":7430,"articleLive":2,"columnArticles":115,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11590,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.43226218732882965,"acs":4735,"articleLive":2,"columnArticles":99,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10954,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5422579429863117,"acs":4318,"articleLive":2,"columnArticles":78,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7963,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4362012987012987,"acs":2687,"articleLive":2,"columnArticles":42,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.5546415198,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6160,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.7082066869300911,"acs":932,"articleLive":2,"columnArticles":23,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":1316,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6061615320566195,"acs":4368,"articleLive":2,"columnArticles":86,"formTitle":"[1763]最长的美好子字符串","frequency":0.3250252134,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":7206,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47327790973871736,"acs":2391,"articleLive":2,"columnArticles":60,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.4474271949,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":5052,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5506905671466353,"acs":3748,"articleLive":2,"columnArticles":86,"formTitle":"[1765]地图中的最高点","frequency":0.9271822964,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6806,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37989556135770236,"acs":1455,"articleLive":2,"columnArticles":28,"formTitle":"[1766]互质树","frequency":1.2921924499,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3830,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7959542656112577,"acs":905,"articleLive":2,"columnArticles":22,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":1137,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7620656678355117,"acs":11953,"articleLive":2,"columnArticles":210,"formTitle":"[1768]交替合并字符串","frequency":0.297716034,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15685,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8560237486600148,"acs":10381,"articleLive":2,"columnArticles":178,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":12127,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3715222399432926,"acs":4193,"articleLive":2,"columnArticles":105,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11286,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3668061366806137,"acs":2367,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6453,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5153631284916201,"acs":369,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":716,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.843022659694453,"acs":16444,"articleLive":2,"columnArticles":205,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.297716034,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19506,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5483121986068941,"acs":6140,"articleLive":2,"columnArticles":92,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":11198,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47480134973331883,"acs":4362,"articleLive":2,"columnArticles":93,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9187,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4592039800995025,"acs":1846,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.0316613665,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":4020,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7837949565936337,"acs":5688,"articleLive":2,"columnArticles":63,"formTitle":"[1777]每家商店的产品价格","frequency":1.2921924499,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":7257,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5067750677506775,"acs":187,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":369,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6480178671133445,"acs":5803,"articleLive":2,"columnArticles":73,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.297716034,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8955,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6643047973051458,"acs":5719,"articleLive":2,"columnArticles":116,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8609,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5217499688395862,"acs":4186,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":8023,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.29403306973400434,"acs":1227,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4173,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7955097087378641,"acs":1311,"articleLive":2,"columnArticles":30,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1648,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4218895728408879,"acs":9047,"articleLive":2,"columnArticles":107,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":21444,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3513630229419703,"acs":6509,"articleLive":2,"columnArticles":65,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18525,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34360887492636955,"acs":3500,"articleLive":2,"columnArticles":92,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":10186,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6529213421038085,"acs":11812,"articleLive":2,"columnArticles":61,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.7859632732,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18091,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7191977077363897,"acs":251,"articleLive":2,"columnArticles":17,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":349,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7133917396745932,"acs":1710,"articleLive":2,"columnArticles":32,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":2397,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6404075190127708,"acs":13389,"articleLive":2,"columnArticles":149,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20907,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8086142901330035,"acs":10457,"articleLive":2,"columnArticles":143,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12932,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5135135135135135,"acs":6707,"articleLive":2,"columnArticles":108,"formTitle":"[1792]最大平均通过率","frequency":1.8425915827,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":13061,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41625846795205834,"acs":3994,"articleLive":2,"columnArticles":96,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9595,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5760517799352751,"acs":178,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":309,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7852477910103727,"acs":2044,"articleLive":2,"columnArticles":31,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.8644953185,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":2603,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.49063305244097777,"acs":7045,"articleLive":2,"columnArticles":125,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":14359,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5713103122043519,"acs":4831,"articleLive":2,"columnArticles":76,"formTitle":"[1797]设计一个验证系统","frequency":0.8952102637,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":8456,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5243296921549155,"acs":3168,"articleLive":2,"columnArticles":52,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":6042,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5187904967602592,"acs":2402,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":1.1959644178,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4630,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6818642350557245,"acs":10095,"articleLive":2,"columnArticles":160,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14805,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3810458682848474,"acs":4270,"articleLive":2,"columnArticles":111,"formTitle":"[1801]积压订单中的订单总数","frequency":0.297716034,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":11206,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2629220380601596,"acs":4283,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16290,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.40919452887537994,"acs":2154,"articleLive":2,"columnArticles":55,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5264,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5786578657865786,"acs":526,"articleLive":2,"columnArticles":31,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.4146373721,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":909,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4836133754782898,"acs":11628,"articleLive":2,"columnArticles":156,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":24044,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6632885736002027,"acs":5236,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7894,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5839808726838015,"acs":5862,"articleLive":2,"columnArticles":90,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":10038,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26758147512864494,"acs":2496,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9328,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6230591344565577,"acs":1886,"articleLive":2,"columnArticles":32,"formTitle":"[1809]没有广告的剧集","frequency":0.8952102637,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":3027,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6170886075949367,"acs":195,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":316,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6770480704129993,"acs":1000,"articleLive":2,"columnArticles":30,"formTitle":"[1811]寻找面试候选人","frequency":0.4818895991,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":1477,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7915811088295688,"acs":8481,"articleLive":2,"columnArticles":205,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10714,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5094057089377633,"acs":5443,"articleLive":2,"columnArticles":75,"formTitle":"[1813]句子相似性 III","frequency":0.9952937223,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10685,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34903256252949505,"acs":3698,"articleLive":2,"columnArticles":84,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10595,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29584599797365757,"acs":1752,"articleLive":2,"columnArticles":40,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5922,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7504145936981758,"acs":10860,"articleLive":2,"columnArticles":167,"formTitle":"[1816]截断句子","frequency":0.2715365284,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":14472,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.7005255941499086,"acs":6131,"articleLive":2,"columnArticles":103,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8752,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.373051705297061,"acs":25945,"articleLive":2,"columnArticles":340,"formTitle":"[1818]绝对差值和","frequency":2.4089870576,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":69548,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3765460375629867,"acs":2466,"articleLive":2,"columnArticles":34,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.6783820115,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6549,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5106382978723404,"acs":120,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":235,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9000343524562007,"acs":2620,"articleLive":2,"columnArticles":24,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2911,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8058191267372731,"acs":20467,"articleLive":2,"columnArticles":205,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":25399,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7186462122410249,"acs":9088,"articleLive":2,"columnArticles":114,"formTitle":"[1823]找出游戏的获胜者","frequency":0.9271822964,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":12646,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.653628023352794,"acs":7837,"articleLive":2,"columnArticles":156,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11990,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2850919137179896,"acs":2683,"articleLive":2,"columnArticles":51,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9411,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43333333333333335,"acs":299,"articleLive":2,"columnArticles":23,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":690,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.793624294459019,"acs":9983,"articleLive":2,"columnArticles":147,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12579,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8664236706689536,"acs":8082,"articleLive":2,"columnArticles":103,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":9328,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6859781696053736,"acs":4085,"articleLive":2,"columnArticles":85,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5955,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4866666666666667,"acs":876,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1800,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7371172516803585,"acs":987,"articleLive":2,"columnArticles":27,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":1339,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8243410578453918,"acs":13980,"articleLive":2,"columnArticles":220,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16959,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6842138051333168,"acs":43932,"articleLive":2,"columnArticles":391,"formTitle":"[1833]雪糕的最大数量","frequency":1.460656972,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":64208,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.354623715634546,"acs":6385,"articleLive":2,"columnArticles":136,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":18005,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5120356198692083,"acs":3680,"articleLive":2,"columnArticles":61,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.5163520033,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7187,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7259475218658892,"acs":498,"articleLive":2,"columnArticles":30,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.5163520033,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":686,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7954878406094346,"acs":8145,"articleLive":2,"columnArticles":98,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.4146373721,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":10239,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42910000292491735,"acs":29341,"articleLive":2,"columnArticles":313,"formTitle":"[1838]最高频元素的频数","frequency":2.9621470452,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":68378,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5694704580282649,"acs":6689,"articleLive":2,"columnArticles":130,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11746,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3889212827988338,"acs":2001,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5145,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5200783545543585,"acs":1062,"articleLive":2,"columnArticles":34,"formTitle":"[1841]联赛信息统计","frequency":0.8952102637,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":2042,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6613756613756614,"acs":125,"articleLive":2,"columnArticles":13,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":189,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5120702267739575,"acs":700,"articleLive":2,"columnArticles":25,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":1367,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.7981641350672057,"acs":7304,"articleLive":2,"columnArticles":121,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":9151,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5207223208999407,"acs":7036,"articleLive":2,"columnArticles":63,"formTitle":"[1845]座位预约管理系统","frequency":0.297716034,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":13512,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6333964804966562,"acs":27751,"articleLive":2,"columnArticles":378,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":2.056165683,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43813,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3615742827099294,"acs":2407,"articleLive":2,"columnArticles":44,"formTitle":"[1847]最近的房间","frequency":0.9952937223,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6657,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6832287603866373,"acs":8058,"articleLive":2,"columnArticles":106,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11794,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32829386065762245,"acs":5711,"articleLive":2,"columnArticles":110,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.3833848286,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17396,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6115,"acs":2446,"articleLive":2,"columnArticles":50,"formTitle":"[1850]邻位交换的最小次数","frequency":0.5163520033,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":4000,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40196656833824973,"acs":2044,"articleLive":2,"columnArticles":49,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.5546415198,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":5085,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6951219512195121,"acs":228,"articleLive":2,"columnArticles":13,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":328,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6421514818880352,"acs":1170,"articleLive":2,"columnArticles":20,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1822,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7818134647814243,"acs":12054,"articleLive":2,"columnArticles":126,"formTitle":"[1854]人口最多的年份","frequency":0.297716034,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":15418,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6749731878114945,"acs":10699,"articleLive":2,"columnArticles":104,"formTitle":"[1855]下标对中的最大距离","frequency":0.3250252134,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15851,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35649149922720247,"acs":4613,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.3250252134,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12940,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4560844453296156,"acs":2290,"articleLive":2,"columnArticles":33,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":5021,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.632688927943761,"acs":360,"articleLive":2,"columnArticles":20,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":569,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.766968802698145,"acs":7277,"articleLive":2,"columnArticles":152,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9488,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7698544315459739,"acs":4178,"articleLive":2,"columnArticles":73,"formTitle":"[1860]增长的内存泄露","frequency":0.3250252134,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5427,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6201508620689655,"acs":3453,"articleLive":2,"columnArticles":71,"formTitle":"[1861]旋转盒子","frequency":0.3250252134,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5568,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3118731363513147,"acs":2301,"articleLive":2,"columnArticles":44,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7378,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.8969701077746899,"acs":13233,"articleLive":2,"columnArticles":155,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":2.1509934701,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14753,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3901551260941156,"acs":4502,"articleLive":2,"columnArticles":108,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.9271822964,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11539,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5126281807823775,"acs":5399,"articleLive":2,"columnArticles":65,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.3535496801,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10532,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.6024314536989136,"acs":2329,"articleLive":2,"columnArticles":50,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":1.5249878304,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3866,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7373868046571799,"acs":570,"articleLive":2,"columnArticles":16,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":773,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5318021201413428,"acs":301,"articleLive":2,"columnArticles":17,"formTitle":"[1868]两个行程编码数组的积","frequency":0.3833848286,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":566,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7804687968347221,"acs":13019,"articleLive":2,"columnArticles":146,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.4922302339,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16681,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45182861877145225,"acs":7635,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.8952102637,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16898,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2753531899577072,"acs":6120,"articleLive":2,"columnArticles":130,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":22226,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6220609579100145,"acs":2143,"articleLive":2,"columnArticles":31,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3445,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.815625,"acs":2349,"articleLive":2,"columnArticles":35,"formTitle":"[1873]计算特殊奖金","frequency":1.7017617468,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":2880,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8785714285714286,"acs":369,"articleLive":2,"columnArticles":22,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":420,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7408536585365854,"acs":486,"articleLive":2,"columnArticles":21,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":656,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7271817676486937,"acs":6541,"articleLive":2,"columnArticles":104,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8995,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8199791612399062,"acs":31479,"articleLive":2,"columnArticles":406,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.6955034929,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":38390,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.430444140090002,"acs":2200,"articleLive":2,"columnArticles":57,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":5111,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41460771564802773,"acs":1913,"articleLive":2,"columnArticles":39,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.6783820115,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4614,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7702110712863401,"acs":7736,"articleLive":2,"columnArticles":107,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2464095784,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":10044,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3546184738955823,"acs":6181,"articleLive":2,"columnArticles":64,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17430,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27972442403140974,"acs":3776,"articleLive":2,"columnArticles":114,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13499,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37716484926234767,"acs":1764,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4677,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6899124229646448,"acs":2127,"articleLive":2,"columnArticles":39,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":2.1182974641,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":3083,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5174216027874564,"acs":297,"articleLive":2,"columnArticles":14,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":574,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5715164564749308,"acs":5574,"articleLive":2,"columnArticles":81,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.8644953185,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9753,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6480392156862745,"acs":5288,"articleLive":2,"columnArticles":67,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.3250252134,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":8160,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.32073774179037334,"acs":2852,"articleLive":2,"columnArticles":66,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.4474271949,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8892,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.26910216718266255,"acs":2173,"articleLive":2,"columnArticles":42,"formTitle":"[1889]装包裹的最小浪费空间","frequency":1.1517094088,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":8075,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7221860767729343,"acs":1110,"articleLive":2,"columnArticles":22,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":1537,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.3443579766536965,"acs":1062,"articleLive":2,"columnArticles":20,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":3084,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.34838709677419355,"acs":594,"articleLive":2,"columnArticles":15,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3535496801,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":1705,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5909360849231683,"acs":31842,"articleLive":2,"columnArticles":419,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.2648820538,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53884,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45741973970951677,"acs":37572,"articleLive":2,"columnArticles":518,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":1.8425915827,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":82139,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5358310284133769,"acs":2131,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3977,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5067369654364382,"acs":865,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1707,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5340714809085728,"acs":6560,"articleLive":2,"columnArticles":82,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.8644953185,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":12283,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.31094208901272685,"acs":4129,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.4818895991,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13279,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.631980115990058,"acs":3814,"articleLive":2,"columnArticles":44,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":6035,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.439246045102659,"acs":1305,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":2.2320563495,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2971,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6349583828775267,"acs":1068,"articleLive":2,"columnArticles":40,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1682,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4577114427860697,"acs":92,"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":201,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6423777564717162,"acs":8040,"articleLive":2,"columnArticles":106,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":12516,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2859005830009205,"acs":3727,"articleLive":2,"columnArticles":72,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":13036,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5826952526799387,"acs":5327,"articleLive":2,"columnArticles":119,"formTitle":"[1905]统计子岛屿","frequency":0.2715365284,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":9142,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4266777133388567,"acs":2575,"articleLive":2,"columnArticles":57,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.9605076062,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":6035,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5684523809523809,"acs":573,"articleLive":2,"columnArticles":20,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":1008,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6643109540636042,"acs":188,"articleLive":2,"columnArticles":9,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":283,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3235831809872029,"acs":4956,"articleLive":2,"columnArticles":77,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.2715365284,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":15316,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.67581265291856,"acs":3867,"articleLive":2,"columnArticles":62,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.2715365284,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5722,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.56421875,"acs":3611,"articleLive":2,"columnArticles":73,"formTitle":"[1911]最大子序列交替和","frequency":0.9271822964,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":6400,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2577999121136663,"acs":1760,"articleLive":2,"columnArticles":39,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6827,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8328887195121951,"acs":8742,"articleLive":2,"columnArticles":96,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.9271822964,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":10496,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4436827956989247,"acs":3301,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":1.1517094088,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7440,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39347331817573894,"acs":2942,"articleLive":2,"columnArticles":59,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7477,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.554698138901498,"acs":1222,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":1.3447531545,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2203,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2859463850528026,"acs":352,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":1231,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.5116279069767442,"acs":198,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":387,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3877551020408163,"acs":475,"articleLive":2,"columnArticles":14,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":1225,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9029479468329992,"acs":12160,"articleLive":2,"columnArticles":111,"formTitle":"[1920]基于排列构建数组","frequency":1.6388439617,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":13467,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3464504283965728,"acs":5661,"articleLive":2,"columnArticles":92,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.8644953185,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16340,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36226472605349386,"acs":4754,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.297716034,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":13123,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2379019669060256,"acs":1524,"articleLive":2,"columnArticles":31,"formTitle":"[1923]最长公共子路径","frequency":1.7237575748,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6406,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.38235294117647056,"acs":65,"articleLive":2,"columnArticles":5,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6924307036247335,"acs":5196,"articleLive":2,"columnArticles":68,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4922302339,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7504,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34530865323242455,"acs":3787,"articleLive":2,"columnArticles":64,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10967,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4169244365885992,"acs":1887,"articleLive":2,"columnArticles":38,"formTitle":"[1927]求和游戏","frequency":0.3250252134,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4526,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.40523420570095015,"acs":2431,"articleLive":2,"columnArticles":41,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.979322978,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5999,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.90313986679353,"acs":14238,"articleLive":2,"columnArticles":123,"formTitle":"[1929]数组串联","frequency":1.2268310657,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":15765,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48293718166383703,"acs":5689,"articleLive":2,"columnArticles":102,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.9605076062,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11780,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5623157330474403,"acs":2098,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.5951328811,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3731,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3337172473365966,"acs":1159,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":1.5706578672,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3473,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5423913043478261,"acs":499,"articleLive":2,"columnArticles":25,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.5951328811,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":920,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7473684210526316,"acs":355,"articleLive":2,"columnArticles":14,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":475,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7363834422657952,"acs":7098,"articleLive":2,"columnArticles":99,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9639,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45166588456123885,"acs":5775,"articleLive":2,"columnArticles":67,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12786,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24535399894665563,"acs":3261,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.8952102637,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13291,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.34921107472462043,"acs":1173,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":1.2921924499,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3359,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6341176470588236,"acs":539,"articleLive":2,"columnArticles":16,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":850,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7819253438113949,"acs":398,"articleLive":2,"columnArticles":26,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":509,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7686858464652306,"acs":5317,"articleLive":2,"columnArticles":94,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.2464095784,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6917,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3979202316703962,"acs":3023,"articleLive":2,"columnArticles":70,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7597,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4126417471650567,"acs":1965,"articleLive":2,"columnArticles":55,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4762,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5781420765027322,"acs":2116,"articleLive":2,"columnArticles":57,"formTitle":"[1944]队列中可以看到的人数","frequency":0.8952102637,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3660,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6621216516777875,"acs":6847,"articleLive":2,"columnArticles":81,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.2715365284,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":10341,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30599227885637553,"acs":5469,"articleLive":2,"columnArticles":83,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.8644953185,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17873,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5446628842855258,"acs":4128,"articleLive":2,"columnArticles":92,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7579,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5183652353854112,"acs":1002,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.5951328811,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1933,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5153473344103393,"acs":319,"articleLive":2,"columnArticles":15,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":619,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5415162454873647,"acs":150,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":277,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6903114186851211,"acs":399,"articleLive":2,"columnArticles":14,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":578,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5447761194029851,"acs":7227,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.2715365284,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":13266,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3293853073463268,"acs":4394,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.3250252134,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13340,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4798155852918025,"acs":4267,"articleLive":2,"columnArticles":70,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.3250252134,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8893,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49672223262783294,"acs":2652,"articleLive":2,"columnArticles":42,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.4146373721,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5339,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4236842105263158,"acs":161,"articleLive":2,"columnArticles":13,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":1.5249878304,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":380,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.605900430239705,"acs":4929,"articleLive":2,"columnArticles":59,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":8135,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42681712578825093,"acs":2572,"articleLive":2,"columnArticles":47,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":6026,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41684901531728663,"acs":1524,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3656,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.28064097011693373,"acs":648,"articleLive":2,"columnArticles":20,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":1.2921924499,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2309,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5363013193779023,"acs":7276,"articleLive":2,"columnArticles":67,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.297716034,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13567,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.43487410747839156,"acs":5786,"articleLive":2,"columnArticles":77,"formTitle":"[1962]移除石子使总数最小","frequency":1.2268310657,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":13305,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.616969696969697,"acs":4581,"articleLive":2,"columnArticles":56,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.3535496801,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7425,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38670039754246477,"acs":3210,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8301,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.759493670886076,"acs":480,"articleLive":2,"columnArticles":16,"formTitle":"[1965]丢失信息的雇员","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":632,"title":"丢失信息的雇员","titleSlug":"employees-with-missing-information"},{"acceptance":0.7571428571428571,"acs":53,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":70,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7797534376481745,"acs":6578,"articleLive":2,"columnArticles":64,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":8436,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35993964541682383,"acs":4771,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":13255,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.28034544936889055,"acs":2954,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.9646942795,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10537,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4793717277486911,"acs":2289,"articleLive":2,"columnArticles":51,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.0316613665,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4775,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5581583198707593,"acs":691,"articleLive":2,"columnArticles":22,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":1238,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4718162839248434,"acs":226,"articleLive":2,"columnArticles":10,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.4818895991,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":479,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5869565217391305,"acs":81,"articleLive":2,"columnArticles":10,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":138,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.736130374479889,"acs":4246,"articleLive":2,"columnArticles":58,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.8349510722,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5768,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.38521836506159013,"acs":3096,"articleLive":2,"columnArticles":47,"formTitle":"[1975]最大方阵和","frequency":1.2268310657,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":8037,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2942230801047842,"acs":2134,"articleLive":2,"columnArticles":47,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":7253,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24912947135169358,"acs":787,"articleLive":2,"columnArticles":16,"formTitle":"[1977]划分数字的方案数","frequency":1.1959644178,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3159,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5400291120815138,"acs":371,"articleLive":2,"columnArticles":13,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.3250252134,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"","submitted":687,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.7993109388458226,"acs":8352,"articleLive":2,"columnArticles":106,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":10449,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5846153846153846,"acs":6004,"articleLive":2,"columnArticles":101,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.8952102637,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10270,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.30099228224917307,"acs":4641,"articleLive":2,"columnArticles":85,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.5249878304,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15419,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4629333333333333,"acs":868,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.7270297357,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1875,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.65,"acs":65,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"","submitted":100,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5801868802440885,"acs":6085,"articleLive":2,"columnArticles":67,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":10488,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.411946446961895,"acs":6000,"articleLive":2,"columnArticles":85,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":14565,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.27976723366159356,"acs":3750,"articleLive":2,"columnArticles":77,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.3833848286,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13404,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.46577946768060835,"acs":1470,"articleLive":2,"columnArticles":26,"formTitle":"[1987]不同的好子序列数目","frequency":0.4146373721,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3156,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6577017114914425,"acs":269,"articleLive":2,"columnArticles":8,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":1.0316613665,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"","submitted":409,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.5048543689320388,"acs":52,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"","submitted":103,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6065573770491803,"acs":296,"articleLive":2,"columnArticles":9,"formTitle":"[1990]Count the Number of Experiments","frequency":0.3250252134,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"","submitted":488,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6574976632394178,"acs":4924,"articleLive":2,"columnArticles":66,"formTitle":"[1991]找到数组的中间位置","frequency":0.2464095784,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":7489,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5956221198156681,"acs":3102,"articleLive":2,"columnArticles":60,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":5208,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3860617208256693,"acs":1889,"articleLive":2,"columnArticles":43,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4893,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.37044593412999127,"acs":1271,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3431,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5573924478677438,"acs":5934,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10646,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.2526535065965678,"acs":5094,"articleLive":2,"columnArticles":98,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":20162,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3423028785982478,"acs":2188,"articleLive":2,"columnArticles":37,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.9271822964,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6392,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.42266232138380544,"acs":1686,"articleLive":2,"columnArticles":34,"formTitle":"[1998]数组的最大公因数排序","frequency":0.4474271949,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3989,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6283185840707964,"acs":71,"articleLive":2,"columnArticles":7,"formTitle":"[1999]Smallest Greater Multiple Made of Two Digits","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","questionId":"2141","status":"","submitted":113,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7743117345336543,"acs":7397,"articleLive":2,"columnArticles":100,"formTitle":"[2000]反转单词前缀","frequency":0.297716034,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":9553,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3609773932118701,"acs":5924,"articleLive":2,"columnArticles":129,"formTitle":"[2001]可互换矩形的组数","frequency":0.2715365284,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":16411,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5752487562189055,"acs":3700,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6432,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3938722031848418,"acs":1954,"articleLive":2,"columnArticles":41,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4961,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4099722991689751,"acs":148,"articleLive":2,"columnArticles":5,"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":361,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6739130434782609,"acs":31,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"","submitted":46,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8715953307392996,"acs":4704,"articleLive":2,"columnArticles":62,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":5397,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.3035462421922224,"acs":3013,"articleLive":2,"columnArticles":58,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.2715365284,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9926,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.4190782422293676,"acs":2346,"articleLive":2,"columnArticles":42,"formTitle":"[2008]出租车的最大盈利","frequency":0.8644953185,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":5598,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.42379835873388044,"acs":1446,"articleLive":2,"columnArticles":40,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3412,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6519607843137255,"acs":133,"articleLive":2,"columnArticles":7,"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":204,"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.8968671392636633,"acs":7844,"articleLive":2,"columnArticles":78,"formTitle":"[2011]执行操作后的变量值","frequency":0.2715365284,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":8746,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3613787375415282,"acs":4351,"articleLive":2,"columnArticles":78,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":12040,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.33545254883828457,"acs":2902,"articleLive":2,"columnArticles":51,"formTitle":"[2013]检测正方形","frequency":0.4146373721,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8651,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5271289974847287,"acs":1467,"articleLive":2,"columnArticles":25,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2783,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7733333333333333,"acs":58,"articleLive":2,"columnArticles":3,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"","submitted":75,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5517529991630242,"acs":5933,"articleLive":2,"columnArticles":81,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.2715365284,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":10753,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3514809590973202,"acs":3738,"articleLive":2,"columnArticles":97,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":10635,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.4096651293362743,"acs":2043,"articleLive":2,"columnArticles":52,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.3250252134,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4987,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.35243825205826473,"acs":1113,"articleLive":2,"columnArticles":34,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.4146373721,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":3158,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.7636363636363637,"acs":210,"articleLive":2,"columnArticles":8,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"","submitted":275,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.6981132075471698,"acs":74,"articleLive":2,"columnArticles":6,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":106,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6558829193144617,"acs":3406,"articleLive":2,"columnArticles":42,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":5193,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7486792452830189,"acs":2976,"articleLive":2,"columnArticles":47,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3975,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.48708267090620033,"acs":2451,"articleLive":2,"columnArticles":63,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":5032,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2620646244229962,"acs":1249,"articleLive":2,"columnArticles":41,"formTitle":"[2025]分割数组的最多方案数","frequency":0.3535496801,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4766,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.8961748633879781,"acs":328,"articleLive":2,"columnArticles":12,"formTitle":"[2026]Low-Quality Problems","frequency":0.8644953185,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":366,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5557290415565698,"acs":4627,"articleLive":2,"columnArticles":49,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":8326,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.42631193044935584,"acs":4070,"articleLive":2,"columnArticles":58,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":9547,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.22929666842940244,"acs":2168,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.297716034,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":9455,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.3421955403087479,"acs":1197,"articleLive":2,"columnArticles":39,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.4146373721,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3498,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.5882352941176471,"acs":40,"articleLive":2,"columnArticles":2,"formTitle":"[2031]Count Subarrays With More Ones Than Zeros","frequency":0.9605076062,"frontendQuestionId":"2031","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"","submitted":68,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6629201455791052,"acs":6193,"articleLive":2,"columnArticles":98,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":9342,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3924356472446799,"acs":4223,"articleLive":2,"columnArticles":84,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.806499651,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":10761,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.30346820809248554,"acs":3150,"articleLive":2,"columnArticles":65,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":10380,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.31504030183501974,"acs":1837,"articleLive":2,"columnArticles":44,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.3250252134,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":5831,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.5045871559633027,"acs":55,"articleLive":2,"columnArticles":6,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"","submitted":109,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8296537882589061,"acs":3307,"articleLive":2,"columnArticles":49,"formTitle":"[2037]使每位学生都有座位的最少移动次数","frequency":0.0,"frontendQuestionId":"2037","leaf":true,"level":1,"nodeType":"def","questionId":"2148","status":"ac","submitted":3986,"title":"使每位学生都有座位的最少移动次数","titleSlug":"minimum-number-of-moves-to-seat-everyone"},{"acceptance":0.5010518934081346,"acs":2858,"articleLive":2,"columnArticles":61,"formTitle":"[2038]如果相邻两个颜色均相同则删除当前颜色","frequency":0.0,"frontendQuestionId":"2038","leaf":true,"level":2,"nodeType":"def","questionId":"2149","status":"ac","submitted":5704,"title":"如果相邻两个颜色均相同则删除当前颜色","titleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color"},{"acceptance":0.352740413571572,"acs":1757,"articleLive":2,"columnArticles":43,"formTitle":"[2039]网络空闲的时刻","frequency":0.1206637724,"frontendQuestionId":"2039","leaf":true,"level":2,"nodeType":"def","questionId":"2151","status":"ac","submitted":4981,"title":"网络空闲的时刻","titleSlug":"the-time-when-the-network-becomes-idle"},{"acceptance":0.3159332321699545,"acs":1041,"articleLive":2,"columnArticles":20,"formTitle":"[2040]两个有序数组的第 K 小乘积","frequency":0.0,"frontendQuestionId":"2040","leaf":true,"level":3,"nodeType":"def","questionId":"2150","status":"","submitted":3295,"title":"两个有序数组的第 K 小乘积","titleSlug":"kth-smallest-product-of-two-sorted-arrays"},{"acceptance":0.6604651162790698,"acs":142,"articleLive":2,"columnArticles":8,"formTitle":"[2041]Accepted Candidates From the Interviews","frequency":0.0,"frontendQuestionId":"2041","leaf":true,"level":2,"nodeType":"def","questionId":"2185","status":"","submitted":215,"title":"Accepted Candidates From the Interviews","titleSlug":"accepted-candidates-from-the-interviews"},{"acceptance":0.6736368184092046,"acs":6733,"articleLive":2,"columnArticles":102,"formTitle":"[2042]检查句子中的数字是否递增","frequency":0.5546415198,"frontendQuestionId":"2042","leaf":true,"level":1,"nodeType":"def","questionId":"2168","status":"ac","submitted":9995,"title":"检查句子中的数字是否递增","titleSlug":"check-if-numbers-are-ascending-in-a-sentence"},{"acceptance":0.5942127274782412,"acs":5257,"articleLive":2,"columnArticles":64,"formTitle":"[2043]简易银行系统","frequency":0.051738964,"frontendQuestionId":"2043","leaf":true,"level":2,"nodeType":"def","questionId":"2169","status":"ac","submitted":8847,"title":"简易银行系统","titleSlug":"simple-bank-system"},{"acceptance":0.7450545972463998,"acs":4708,"articleLive":2,"columnArticles":95,"formTitle":"[2044]统计按位或能得到最大值的子集数目","frequency":0.0,"frontendQuestionId":"2044","leaf":true,"level":2,"nodeType":"def","questionId":"2170","status":"ac","submitted":6319,"title":"统计按位或能得到最大值的子集数目","titleSlug":"count-number-of-maximum-bitwise-or-subsets"},{"acceptance":0.32809879554810184,"acs":2152,"articleLive":2,"columnArticles":59,"formTitle":"[2045]到达目的地的第二短时间","frequency":0.1551261766,"frontendQuestionId":"2045","leaf":true,"level":3,"nodeType":"def","questionId":"2171","status":"ac","submitted":6559,"title":"到达目的地的第二短时间","titleSlug":"second-minimum-time-to-reach-destination"},{"acceptance":0.6538461538461539,"acs":102,"articleLive":2,"columnArticles":15,"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":156,"title":"Sort Linked List Already Sorted Using Absolute Values","titleSlug":"sort-linked-list-already-sorted-using-absolute-values"},{"acceptance":0.2803279706814088,"acs":4513,"articleLive":2,"columnArticles":98,"formTitle":"[2047]句子中的有效单词数","frequency":0.0862013682,"frontendQuestionId":"2047","leaf":true,"level":1,"nodeType":"def","questionId":"2173","status":"ac","submitted":16099,"title":"句子中的有效单词数","titleSlug":"number-of-valid-words-in-a-sentence"},{"acceptance":0.4087881392350666,"acs":3805,"articleLive":2,"columnArticles":88,"formTitle":"[2048]下一个更大的数值平衡数","frequency":0.0,"frontendQuestionId":"2048","leaf":true,"level":2,"nodeType":"def","questionId":"2174","status":"ac","submitted":9308,"title":"下一个更大的数值平衡数","titleSlug":"next-greater-numerically-balanced-number"},{"acceptance":0.38931980906921243,"acs":2610,"articleLive":2,"columnArticles":89,"formTitle":"[2049]统计最高分的节点数目","frequency":0.0,"frontendQuestionId":"2049","leaf":true,"level":2,"nodeType":"def","questionId":"2175","status":"","submitted":6704,"title":"统计最高分的节点数目","titleSlug":"count-nodes-with-the-highest-score"},{"acceptance":0.557583009273108,"acs":1864,"articleLive":2,"columnArticles":61,"formTitle":"[2050]并行课程 III","frequency":0.0,"frontendQuestionId":"2050","leaf":true,"level":3,"nodeType":"def","questionId":"2176","status":"","submitted":3343,"title":"并行课程 III","titleSlug":"parallel-courses-iii"},{"acceptance":0.7236842105263158,"acs":110,"articleLive":2,"columnArticles":6,"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":152,"title":"The Category of Each Member in the Store","titleSlug":"the-category-of-each-member-in-the-store"},{"acceptance":0.5555555555555556,"acs":25,"articleLive":2,"columnArticles":5,"formTitle":"[2052]Minimum Cost to Separate Sentence Into Rows","frequency":0.0,"frontendQuestionId":"2052","leaf":true,"level":2,"nodeType":"def","questionId":"2082","status":"","submitted":45,"title":"Minimum Cost to Separate Sentence Into Rows","titleSlug":"minimum-cost-to-separate-sentence-into-rows"},{"acceptance":0.7587610219308162,"acs":3356,"articleLive":2,"columnArticles":49,"formTitle":"[2053]数组中第 K 个独一无二的字符串","frequency":0.0,"frontendQuestionId":"2053","leaf":true,"level":1,"nodeType":"def","questionId":"2163","status":"","submitted":4423,"title":"数组中第 K 个独一无二的字符串","titleSlug":"kth-distinct-string-in-an-array"},{"acceptance":0.31694965743223114,"acs":2128,"articleLive":2,"columnArticles":54,"formTitle":"[2054]两个最好的不重叠活动","frequency":0.0,"frontendQuestionId":"2054","leaf":true,"level":2,"nodeType":"def","questionId":"2164","status":"","submitted":6714,"title":"两个最好的不重叠活动","titleSlug":"two-best-non-overlapping-events"},{"acceptance":0.3792498354902391,"acs":1729,"articleLive":2,"columnArticles":56,"formTitle":"[2055]蜡烛之间的盘子","frequency":0.7270297357,"frontendQuestionId":"2055","leaf":true,"level":2,"nodeType":"def","questionId":"2165","status":"","submitted":4559,"title":"蜡烛之间的盘子","titleSlug":"plates-between-candles"},{"acceptance":0.6021505376344086,"acs":560,"articleLive":2,"columnArticles":14,"formTitle":"[2056]棋盘上有效移动组合的数目","frequency":0.0,"frontendQuestionId":"2056","leaf":true,"level":3,"nodeType":"def","questionId":"2166","status":"","submitted":930,"title":"棋盘上有效移动组合的数目","titleSlug":"number-of-valid-move-combinations-on-chessboard"},{"acceptance":0.7765189066704433,"acs":5483,"articleLive":2,"columnArticles":31,"formTitle":"[2057]值相等的最小索引","frequency":0.0,"frontendQuestionId":"2057","leaf":true,"level":1,"nodeType":"def","questionId":"2181","status":"","submitted":7061,"title":"值相等的最小索引","titleSlug":"smallest-index-with-equal-value"},{"acceptance":0.570906432748538,"acs":4686,"articleLive":2,"columnArticles":61,"formTitle":"[2058]找出临界点之间的最小和最大距离","frequency":0.0,"frontendQuestionId":"2058","leaf":true,"level":2,"nodeType":"def","questionId":"2182","status":"","submitted":8208,"title":"找出临界点之间的最小和最大距离","titleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points"},{"acceptance":0.4175479372457873,"acs":3593,"articleLive":2,"columnArticles":88,"formTitle":"[2059]转化数字的最小运算数","frequency":0.0,"frontendQuestionId":"2059","leaf":true,"level":2,"nodeType":"def","questionId":"2183","status":"","submitted":8605,"title":"转化数字的最小运算数","titleSlug":"minimum-operations-to-convert-number"},{"acceptance":0.34680412371134023,"acs":841,"articleLive":2,"columnArticles":18,"formTitle":"[2060]同源字符串检测","frequency":0.0,"frontendQuestionId":"2060","leaf":true,"level":3,"nodeType":"def","questionId":"2184","status":"","submitted":2425,"title":"同源字符串检测","titleSlug":"check-if-an-original-string-exists-given-two-encoded-strings"},{"acceptance":0.6078431372549019,"acs":31,"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":51,"title":"Number of Spaces Cleaning Robot Cleaned","titleSlug":"number-of-spaces-cleaning-robot-cleaned"},{"acceptance":0.61,"acs":4270,"articleLive":2,"columnArticles":81,"formTitle":"[2062]统计字符串中的元音子字符串","frequency":0.3250252134,"frontendQuestionId":"2062","leaf":true,"level":1,"nodeType":"def","questionId":"2186","status":"ac","submitted":7000,"title":"统计字符串中的元音子字符串","titleSlug":"count-vowel-substrings-of-a-string"},{"acceptance":0.47391070467993546,"acs":3524,"articleLive":2,"columnArticles":89,"formTitle":"[2063]所有子字符串中的元音","frequency":0.297716034,"frontendQuestionId":"2063","leaf":true,"level":2,"nodeType":"def","questionId":"2187","status":"ac","submitted":7436,"title":"所有子字符串中的元音","titleSlug":"vowels-of-all-substrings"},{"acceptance":0.4015617960654753,"acs":2674,"articleLive":2,"columnArticles":54,"formTitle":"[2064]分配给商店的最多商品的最小值","frequency":0.0,"frontendQuestionId":"2064","leaf":true,"level":2,"nodeType":"def","questionId":"2188","status":"notac","submitted":6659,"title":"分配给商店的最多商品的最小值","titleSlug":"minimized-maximum-of-products-distributed-to-any-store"},{"acceptance":0.5380382000647459,"acs":1662,"articleLive":2,"columnArticles":52,"formTitle":"[2065]最大化一张图中的路径价值","frequency":0.0,"frontendQuestionId":"2065","leaf":true,"level":3,"nodeType":"def","questionId":"2189","status":"ac","submitted":3089,"title":"最大化一张图中的路径价值","titleSlug":"maximum-path-quality-of-a-graph"},{"acceptance":0.8545454545454545,"acs":47,"articleLive":2,"columnArticles":4,"formTitle":"[2066]Account Balance","frequency":0.0,"frontendQuestionId":"2066","leaf":true,"level":2,"nodeType":"def","questionId":"2208","status":"","submitted":55,"title":"Account Balance","titleSlug":"account-balance"},{"acceptance":0.46153846153846156,"acs":6,"articleLive":2,"columnArticles":2,"formTitle":"[2067]Number of Equal Count Substrings","frequency":0.0,"frontendQuestionId":"2067","leaf":true,"level":2,"nodeType":"def","questionId":"2209","status":"","submitted":13,"title":"Number of Equal Count Substrings","titleSlug":"number-of-equal-count-substrings"},{"acceptance":0.8452057053343227,"acs":82012,"articleLive":2,"columnArticles":634,"formTitle":"[LCP 01]猜数字","frequency":0.8644953185,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":97032,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6910234816209254,"acs":13949,"articleLive":2,"columnArticles":241,"formTitle":"[LCP 02]分式化简","frequency":1.4922302339,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":20186,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.22056812710640347,"acs":11453,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 03]机器人大冒险","frequency":0.8644953185,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51925,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3800056802044874,"acs":2676,"articleLive":2,"columnArticles":61,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":7042,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.20051536552777247,"acs":2101,"articleLive":2,"columnArticles":51,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10478,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.839720728370601,"acs":44501,"articleLive":2,"columnArticles":675,"formTitle":"[LCP 06]拿硬币","frequency":1.460656972,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52995,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7683727918938182,"acs":39887,"articleLive":2,"columnArticles":482,"formTitle":"[LCP 07]传递信息","frequency":3.2663525617,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":51911,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2908377696833847,"acs":5190,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 08]剧情触发时间","frequency":0.9605076062,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17845,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27670384138785625,"acs":6699,"articleLive":2,"columnArticles":110,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.0911587565,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":24210,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5925572519083969,"acs":1863,"articleLive":2,"columnArticles":36,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.7961795409,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3144,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6916937629323086,"acs":7020,"articleLive":2,"columnArticles":72,"formTitle":"[LCP 11]期望个数统计","frequency":0.3535496801,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10149,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4128912302448094,"acs":6662,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 12]小张刷题计划","frequency":1.1959644178,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":16135,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6118989299987109,"acs":9493,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15514,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21165761493153828,"acs":2767,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":1.9979420227,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":13073,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5787760416666666,"acs":889,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":1.0316613665,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1536,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30713596914175506,"acs":637,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":1.1097040735,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":2074,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7984467944481163,"acs":24161,"articleLive":2,"columnArticles":257,"formTitle":"[LCP 17]速算机器人","frequency":1.2268310657,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":30260,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2881461889877374,"acs":17976,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 18]早餐组合","frequency":1.8815069989,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":62385,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.516233427288861,"acs":19780,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.5944119532,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38316,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.315330712698684,"acs":1845,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5851,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3197124479757851,"acs":845,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2643,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33422932469253996,"acs":9077,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":1.9431788196,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":27158,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3405678233438486,"acs":2699,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 23]魔术排列","frequency":0.4818895991,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7925,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28289872650090964,"acs":933,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3298,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3378302417088252,"acs":1202,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3558,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3380530973451327,"acs":573,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.8952102637,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1695,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32729624838292365,"acs":1265,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3865,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2848082945185653,"acs":10823,"articleLive":2,"columnArticles":181,"formTitle":"[LCP 28]采购方案","frequency":0.297716034,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":38001,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18900135433744386,"acs":5303,"articleLive":2,"columnArticles":128,"formTitle":"[LCP 29]乐团站位","frequency":2.4187670867,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":28058,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3517781796262809,"acs":5836,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16590,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.25324768022840827,"acs":1774,"articleLive":2,"columnArticles":36,"formTitle":"[LCP 31]变换的迷宫","frequency":2.056165683,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":7005,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.40846125046798953,"acs":1091,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":1.1959644178,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2671,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.22077862030700943,"acs":4775,"articleLive":2,"columnArticles":87,"formTitle":"[LCP 33]蓄水","frequency":1.2268310657,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":21628,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.48759842519685037,"acs":2477,"articleLive":2,"columnArticles":62,"formTitle":"[LCP 34]二叉树染色","frequency":1.9084048013,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":5080,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.40177398160315375,"acs":1223,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":1.2427018956,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":3044,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.26474400518470514,"acs":817,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":2.6769162882,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":3086,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19722086786933204,"acs":809,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":1.7520320056,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4102,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5659722222222222,"acs":489,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":1.7520320056,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":864,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5090862224513468,"acs":3950,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 39]无人机方阵","frequency":0.297716034,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7759,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23655145013905443,"acs":2977,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12585,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.42030360531309297,"acs":1329,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.5163520033,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3162,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.2012276999808172,"acs":1049,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5213,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.4001996007984032,"acs":401,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":1002,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8291139240506329,"acs":2620,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":3160,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.19335559852346634,"acs":1100,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5689,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.3731155778894472,"acs":891,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2388,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.36050566695727987,"acs":827,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2294,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15820416889363975,"acs":296,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.9605076062,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1871,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22783825816485226,"acs":293,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1286,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5410232772528232,"acs":4695,"articleLive":2,"columnArticles":102,"formTitle":"[LCS 01]下载插件","frequency":1.6697487699,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":8678,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6852791878172588,"acs":3780,"articleLive":2,"columnArticles":71,"formTitle":"[LCS 02]完成一半题目","frequency":0.8644953185,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":5516,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41233910341766533,"acs":1858,"articleLive":2,"columnArticles":58,"formTitle":"[LCS 03]主题空间","frequency":0.3535496801,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4506,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6783362873609089,"acs":419842,"articleLive":2,"columnArticles":2870,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.232402083,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":618929,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031896943820884,"acs":274802,"articleLive":2,"columnArticles":2177,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.2536526881,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":681570,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7603914231261103,"acs":305615,"articleLive":2,"columnArticles":2018,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.260687787,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":401918,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7504696393356823,"acs":321192,"articleLive":2,"columnArticles":2197,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.4879768829,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":427988,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6982828264853995,"acs":196207,"articleLive":2,"columnArticles":1489,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":3.2566615304,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":280985,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7144734979473801,"acs":282640,"articleLive":2,"columnArticles":1769,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.5853798821,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":395592,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.360459043107433,"acs":276059,"articleLive":2,"columnArticles":1909,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.5859576344,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":765854,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4449026281532866,"acs":205747,"articleLive":2,"columnArticles":1362,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.33179986,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":462454,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4924394745802197,"acs":274796,"articleLive":2,"columnArticles":1684,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0276487095,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":558030,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4521371208852759,"acs":179205,"articleLive":2,"columnArticles":1188,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":2.5877718097,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":396351,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5269506230099676,"acs":185191,"articleLive":2,"columnArticles":1771,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.523372544,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":351439,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5695163850993389,"acs":163937,"articleLive":2,"columnArticles":1351,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":2.5790067435,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":287853,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3125147369833894,"acs":86150,"articleLive":2,"columnArticles":502,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.176678735,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":275667,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7475286853875929,"acs":206066,"articleLive":2,"columnArticles":1286,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.1399667843,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":275663,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.34046980608250843,"acs":129258,"articleLive":2,"columnArticles":789,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.0072341627,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":379646,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773230066328678,"acs":155163,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.0915681021,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":199612,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5968263838161875,"acs":197725,"articleLive":2,"columnArticles":1517,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.2251692699,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":331294,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3777245652695656,"acs":69249,"articleLive":2,"columnArticles":463,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.4598608791,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":183332,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2433085507515422,"acs":79949,"articleLive":2,"columnArticles":887,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":2.8527484508,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":328591,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6438110538016615,"acs":203584,"articleLive":2,"columnArticles":1703,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.3755311297,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":316217,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7983583270346657,"acs":271457,"articleLive":2,"columnArticles":2514,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":3.8339184681,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":340019,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.742627120071413,"acs":308644,"articleLive":2,"columnArticles":1907,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.1423311575,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":415611,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7279768029183425,"acs":194570,"articleLive":2,"columnArticles":1226,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.2374318263,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":267275,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4654716204269954,"acs":153749,"articleLive":2,"columnArticles":1247,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.2774435093,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":330308,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7920770245525606,"acs":201144,"articleLive":2,"columnArticles":1465,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":2.4640698167,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":253945,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5795563278818341,"acs":158085,"articleLive":2,"columnArticles":1149,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.105534049,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":272769,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4396424595333438,"acs":150851,"articleLive":2,"columnArticles":1522,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.6025215031,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":343122,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5646682280039605,"acs":154548,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.8779687947,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":273697,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6160397668047749,"acs":117610,"articleLive":2,"columnArticles":980,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":2.1576726293,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":190913,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6429094664007202,"acs":145691,"articleLive":2,"columnArticles":1018,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":2.6470659986,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":226612,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.686696133854384,"acs":144794,"articleLive":2,"columnArticles":1153,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.5116412117,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":210856,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5883561296040696,"acs":127455,"articleLive":2,"columnArticles":1200,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.3341858445,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":216629,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5526041398787119,"acs":118186,"articleLive":2,"columnArticles":991,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.3075956047,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":213871,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5776273228372446,"acs":140003,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":2.9707455505,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":242376,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7190666444703402,"acs":129583,"articleLive":2,"columnArticles":892,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.5560189869,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":180210,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6544531660065849,"acs":109723,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":2.9740330805,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":167656,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5616213601082589,"acs":80099,"articleLive":2,"columnArticles":574,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.0742871349,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":142621,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5795915614450475,"acs":163275,"articleLive":2,"columnArticles":1143,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.2934686321,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":281707,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6917858763639234,"acs":175302,"articleLive":2,"columnArticles":1057,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":1.9979420227,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":253405,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5707404964385162,"acs":257848,"articleLive":2,"columnArticles":1855,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.2999787111,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":451778,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5812528864838488,"acs":66704,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":1.8157803252,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":114759,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6058678939386015,"acs":231696,"articleLive":2,"columnArticles":1563,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":3.8703424162,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":382420,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48709369024856597,"acs":50950,"articleLive":2,"columnArticles":524,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.6623014866,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":104600,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41654167868474185,"acs":57766,"articleLive":2,"columnArticles":485,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3949394166,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":138680,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5599318578973573,"acs":114711,"articleLive":2,"columnArticles":846,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.0806699995,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":204866,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.533933365980513,"acs":126476,"articleLive":2,"columnArticles":1498,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4131896618,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":236876,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.689213783727483,"acs":125725,"articleLive":2,"columnArticles":1042,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.4574641184,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":182418,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4645123658422772,"acs":159272,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.2695534862,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":342880,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6511512152111154,"acs":91574,"articleLive":2,"columnArticles":534,"formTitle":"[剑指 Offer 49]丑数","frequency":2.8543094876,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":140634,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6152905244957207,"acs":162980,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":2.9165389439,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":264883,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48338032011640597,"acs":106305,"articleLive":2,"columnArticles":876,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":3.9537497512,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":219920,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6504982796427362,"acs":182442,"articleLive":2,"columnArticles":1081,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":2.8609721814,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":280465,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5367105509119555,"acs":200982,"articleLive":2,"columnArticles":1661,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.5708300831,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":374470,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4475858666058865,"acs":178700,"articleLive":2,"columnArticles":1540,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.9856742859,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":399253,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7581745545320742,"acs":169474,"articleLive":2,"columnArticles":1187,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":1.8157803252,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":223529,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7901692646894812,"acs":184209,"articleLive":2,"columnArticles":1306,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":2.3853348094,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":233126,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5888672680199865,"acs":142838,"articleLive":2,"columnArticles":963,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.0265952257,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":242564,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6966585318974203,"acs":119610,"articleLive":2,"columnArticles":1064,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":2.8986442569,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":171691,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8013019060585432,"acs":94169,"articleLive":2,"columnArticles":722,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":1.6089767315,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":117520,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6675324306679157,"acs":141099,"articleLive":2,"columnArticles":880,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":2.8281090768,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":211374,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7081845113808876,"acs":144146,"articleLive":2,"columnArticles":1888,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":2.6514847234,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":203543,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44224852992717784,"acs":136278,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.5690870113,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":308148,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8581607895790639,"acs":218589,"articleLive":2,"columnArticles":1861,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.3815880834,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":254718,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44407658686150436,"acs":136145,"articleLive":2,"columnArticles":1229,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.1479675027,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":306580,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47543010049008916,"acs":98076,"articleLive":2,"columnArticles":1086,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.3949394166,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":206289,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5628172799362952,"acs":67851,"articleLive":2,"columnArticles":602,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.3341858445,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":120556,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45977463146286746,"acs":108819,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":2.5790067435,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":236679,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6552420398653896,"acs":113904,"articleLive":2,"columnArticles":785,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.4436612455,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":173835,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6344882524218507,"acs":138590,"articleLive":2,"columnArticles":993,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":2.8152708313,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":218428,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8564537681185472,"acs":142931,"articleLive":2,"columnArticles":1331,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.4394076543,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":166887,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5857623143080531,"acs":74919,"articleLive":2,"columnArticles":518,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.3075956047,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":127900,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5974957375920915,"acs":76397,"articleLive":2,"columnArticles":555,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6623014866,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":127862,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2870784828387666,"acs":71639,"articleLive":2,"columnArticles":582,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":1.3722993115,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":249545,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6945059277407001,"acs":123313,"articleLive":2,"columnArticles":714,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":1.1097040735,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":177555,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7006306616213737,"acs":122204,"articleLive":2,"columnArticles":716,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.4119855606,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":174420,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2058775775288196,"acs":11412,"articleLive":2,"columnArticles":134,"formTitle":"[剑指 Offer II 001]整数除法","frequency":2.056165683,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":55431,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5660828468167918,"acs":10181,"articleLive":2,"columnArticles":146,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.0828496133,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":17985,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7817859976805225,"acs":12808,"articleLive":2,"columnArticles":180,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.7790706138,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":16383,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.696606394129979,"acs":10633,"articleLive":2,"columnArticles":119,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.7790706138,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":15264,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7141312184571017,"acs":7924,"articleLive":2,"columnArticles":106,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.806499651,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":11096,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6571932299012694,"acs":9319,"articleLive":2,"columnArticles":117,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.7790706138,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":14180,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.450123524567664,"acs":8199,"articleLive":2,"columnArticles":89,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":1.9281137561,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":18215,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5003975778335067,"acs":8181,"articleLive":2,"columnArticles":109,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":16349,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5517643142476698,"acs":6630,"articleLive":2,"columnArticles":96,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":12016,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4404560810810811,"acs":7301,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":1.6388439617,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":16576,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5607105538140021,"acs":5366,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":1.979322978,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":9570,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6650136625847586,"acs":6571,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":9881,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.657076091719001,"acs":4499,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":6847,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5015983452425724,"acs":5335,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":10636,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6338896406555405,"acs":4216,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":6651,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.4913393133312713,"acs":6354,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":1.460656972,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":12932,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5189964157706093,"acs":3620,"articleLive":2,"columnArticles":63,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":6975,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5260980547487017,"acs":5977,"articleLive":2,"columnArticles":83,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":11361,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4740277907302061,"acs":5083,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.1959644178,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":10723,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7157060518731988,"acs":4967,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.806499651,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":6940,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5331412103746398,"acs":7400,"articleLive":2,"columnArticles":93,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":1.1959644178,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":13880,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5336636729637658,"acs":8616,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":1.1097040735,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":16145,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7064631956912029,"acs":6296,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.7790706138,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":8912,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7716693803275548,"acs":16114,"articleLive":2,"columnArticles":147,"formTitle":"[剑指 Offer II 024]反转链表","frequency":1.3722993115,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":20882,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6057483110042368,"acs":5290,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":2.1182974641,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":8733,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.658001808318264,"acs":5822,"articleLive":2,"columnArticles":98,"formTitle":"[剑指 Offer II 026]重排链表","frequency":1.6089767315,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":8848,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6119786385452579,"acs":9053,"articleLive":2,"columnArticles":116,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.5800830077,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":14793,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6300405376573501,"acs":2953,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.806499651,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":4687,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29596662030598053,"acs":3192,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":10785,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5478344562078922,"acs":2846,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":5195,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5498276145132163,"acs":3349,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":6091,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5970880391890053,"acs":4388,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":7349,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7913385826771654,"acs":3618,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":4572,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5727554179566563,"acs":3145,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":5491,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6751227495908347,"acs":3300,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":4888,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5663048607833884,"acs":3600,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":6357,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4353084775854416,"acs":3923,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":9012,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7747971518463321,"acs":4679,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":6039,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.510427177934746,"acs":3035,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":5946,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5839395635142697,"acs":2087,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":1.2588782432,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":3574,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7811567164179104,"acs":4187,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":5360,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8412850635339247,"acs":3509,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.1990410264,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":4171,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6627405917839702,"acs":2307,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":3481,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6472204266321914,"acs":4005,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":6188,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.808515100671141,"acs":3855,"articleLive":2,"columnArticles":95,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":4768,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7230892356942777,"acs":3614,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":4998,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6861116476723972,"acs":3552,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":5177,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6924924924924925,"acs":2306,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":3330,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.757319587628866,"acs":3673,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":4850,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.604360025901144,"acs":2800,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":4633,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.416759568933482,"acs":2243,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":1.1959644178,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":5382,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7474396488661302,"acs":4087,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.176678735,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":5468,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6417275973473899,"acs":3774,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":5881,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8574567426531172,"acs":3122,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":3641,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8853396099529254,"acs":2633,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2974,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7183716441480962,"acs":4094,"articleLive":2,"columnArticles":82,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.806499651,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":5699,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.36143622297163264,"acs":1822,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":5041,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.6065857885615251,"acs":1750,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2885,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6247972190034763,"acs":2696,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":4315,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6763686763686764,"acs":2928,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.2222654794,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":4329,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5327342747111682,"acs":2075,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":3895,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7675312199807877,"acs":2397,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":3123,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.713020030816641,"acs":1851,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":2596,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6250996015936255,"acs":1569,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":2510,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.634061135371179,"acs":1452,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":2290,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6436015006252606,"acs":1544,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":2399,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6712962962962963,"acs":1450,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":2160,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5066269948606978,"acs":3746,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":7394,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7231215458785717,"acs":36898,"articleLive":2,"columnArticles":387,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.3653207536,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":51026,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.65625,"acs":3528,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":5376,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5050985723997281,"acs":1486,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.9271822964,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2942,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.41988756148981027,"acs":4780,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.8349510722,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":11384,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5281946339245112,"acs":2323,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":4398,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5594827586206896,"acs":3245,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 074]合并区间","frequency":1.2268310657,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":5800,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7159920371599203,"acs":3237,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":4521,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6838524883637666,"acs":5730,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":1.5944119532,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":8379,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.587968877017768,"acs":5063,"articleLive":2,"columnArticles":81,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":8611,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6358475263584753,"acs":3920,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":1.1959644178,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":6165,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8565042467590523,"acs":3832,"articleLive":2,"columnArticles":79,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.8952102637,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":4474,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8210211841390549,"acs":3023,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":3682,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7850418410041841,"acs":4503,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":5736,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6529094627254136,"acs":3512,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":5379,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8658511300020734,"acs":4176,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.8952102637,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":4823,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6821643286573146,"acs":3404,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":1.2268310657,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":4990,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8528553563984994,"acs":4092,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":1.1374682111,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":4798,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7684031710079275,"acs":2714,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":3532,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6487555245405908,"acs":2789,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":1.1662003159,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":4299,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7409559784977481,"acs":5100,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":6883,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6169125993189557,"acs":3261,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":5286,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.502577952369261,"acs":2047,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.8952102637,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":4073,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7815491731940818,"acs":2694,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":3447,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6831714196176747,"acs":2180,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":3191,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.579888957433683,"acs":1880,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":3242,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5928489042675894,"acs":1542,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.2464095784,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":2601,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.654732665784999,"acs":6931,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":2.4796640667,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":10586,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.49798199316982306,"acs":1604,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":1.3268699883,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":3221,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5363859362224039,"acs":1312,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":2446,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7701357466063349,"acs":2553,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":3315,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.7004820792286732,"acs":3342,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.7349609185,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":4771,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7428662016487001,"acs":2343,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":3154,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.48782623927132596,"acs":2785,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.3535496801,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":5709,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5921176102596184,"acs":1893,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":3197,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4922518497836102,"acs":3526,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":1.8749045717,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":7163,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5844748858447488,"acs":1536,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.2715365284,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":2628,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.699628754640567,"acs":4146,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.8349510722,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":5926,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5566428302596914,"acs":1479,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.8644953185,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":2657,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5411089866156787,"acs":1415,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":2615,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.6010165184243964,"acs":946,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1574,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5964771817453963,"acs":1490,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":2498,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8343848580441641,"acs":2116,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":2536,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6926298157453936,"acs":827,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.3535496801,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":1194,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5634285714285714,"acs":1479,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.297716034,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":2625,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5943074003795067,"acs":1566,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.8952102637,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":2635,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4337708830548926,"acs":727,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1676,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.31345261762756793,"acs":946,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.3250252134,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":3018,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6408914148967992,"acs":4285,"articleLive":2,"columnArticles":78,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":6686,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.6309859154929578,"acs":896,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":1420,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7024940617577197,"acs":1183,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1684,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4747982537372668,"acs":3589,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":1.1959644178,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":7559,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7185468040731199,"acs":93710,"articleLive":2,"columnArticles":1579,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.7847842553,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":130416,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6455405114979583,"acs":60074,"articleLive":2,"columnArticles":1139,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":1.4301900306,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":93060,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5798277117813999,"acs":46174,"articleLive":2,"columnArticles":506,"formTitle":"[面试题 01.03]URL化","frequency":1.7520320056,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":79634,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5504704425058641,"acs":41773,"articleLive":2,"columnArticles":798,"formTitle":"[面试题 01.04]回文排列","frequency":1.7812226363,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":75886,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3307650676506765,"acs":33614,"articleLive":2,"columnArticles":574,"formTitle":"[面试题 01.05]一次编辑","frequency":1.4007588304,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":101625,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47117513855700544,"acs":75323,"articleLive":2,"columnArticles":1191,"formTitle":"[面试题 01.06]字符串压缩","frequency":2.8527484508,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":159862,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7514552713161006,"acs":67386,"articleLive":2,"columnArticles":979,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.8860718007,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":89674,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6219867113283181,"acs":45308,"articleLive":2,"columnArticles":508,"formTitle":"[面试题 01.08]零矩阵","frequency":0.806499651,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":72844,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5493482309124768,"acs":34220,"articleLive":2,"columnArticles":435,"formTitle":"[面试题 01.09]字符串轮转","frequency":2.1696660569,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":62292,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6817700414198081,"acs":65017,"articleLive":2,"columnArticles":701,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.3341858445,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":95365,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7803236867049723,"acs":66681,"articleLive":2,"columnArticles":961,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.5898059845,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":85453,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8549967724898774,"acs":72850,"articleLive":2,"columnArticles":694,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.0265952257,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":85205,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6523101407470036,"acs":26232,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 02.04]分割链表","frequency":1.9899162974,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":40214,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4664792571769316,"acs":38332,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 02.05]链表求和","frequency":3.1288024853,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":82173,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4833587277402152,"acs":40606,"articleLive":2,"columnArticles":516,"formTitle":"[面试题 02.06]回文链表","frequency":0.7526000371,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":84008,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.684156446364822,"acs":51935,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 02.07]链表相交","frequency":0.2222654794,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":75911,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.53319961397998,"acs":28178,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 02.08]环路检测","frequency":1.7812226363,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":52847,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5365137101287073,"acs":11505,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 03.01]三合一","frequency":0.297716034,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":21444,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6138753112607213,"acs":26625,"articleLive":2,"columnArticles":303,"formTitle":"[面试题 03.02]栈的最小值","frequency":1.8749045717,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":43372,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3879066478076379,"acs":8776,"articleLive":2,"columnArticles":133,"formTitle":"[面试题 03.03]堆盘子","frequency":1.2588782432,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":22624,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7128745276562826,"acs":23959,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 03.04]化栈为队","frequency":1.4922302339,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":33609,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5419601673400793,"acs":15157,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 03.05]栈排序","frequency":0.2464095784,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":27967,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.588633146332512,"acs":11227,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 03.06]动物收容所","frequency":0.8644953185,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":19073,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.532201031824242,"acs":18362,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.01]节点间通路","frequency":1.2588782432,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":34502,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7893539175441727,"acs":35382,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 04.02]最小高度树","frequency":2.1182974641,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":44824,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8063776095434733,"acs":24605,"articleLive":2,"columnArticles":542,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.4007588304,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":30513,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5853315994798439,"acs":33759,"articleLive":2,"columnArticles":387,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.297716034,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":57675,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35204342101727704,"acs":26204,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.8644953185,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":74434,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5914366998577525,"acs":20789,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.06]后继者","frequency":0.297716034,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":35150,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7159542743538767,"acs":17286,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.2268310657,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":24144,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4758400444321022,"acs":6854,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.9271822964,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14404,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.717038496124695,"acs":16745,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 04.10]检查子树","frequency":0.8349510722,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":23353,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48607018483793196,"acs":18145,"articleLive":2,"columnArticles":265,"formTitle":"[面试题 04.12]求和路径","frequency":1.7349609185,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":37330,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5043192102015631,"acs":9808,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":19448,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6923410529967907,"acs":7982,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.297716034,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11529,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38316616969368394,"acs":11308,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 05.03]翻转数位","frequency":1.3630185024,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":29512,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.383866676003081,"acs":5482,"articleLive":2,"columnArticles":140,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":14281,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5288259038259038,"acs":12053,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 05.06]整数转换","frequency":1.2268310657,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22792,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7041339051703598,"acs":11821,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 05.07]配对交换","frequency":0.3535496801,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16788,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5527885475693409,"acs":3707,"articleLive":2,"columnArticles":74,"formTitle":"[面试题 05.08]绘制直线","frequency":0.8952102637,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6706,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3631602971077638,"acs":43759,"articleLive":2,"columnArticles":483,"formTitle":"[面试题 08.01]三步问题","frequency":1.8425915827,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":120495,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36103468814703465,"acs":12729,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.9605076062,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":35257,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6756840196040598,"acs":52527,"articleLive":2,"columnArticles":438,"formTitle":"[面试题 08.03]魔术索引","frequency":0.2715365284,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":77739,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8200808370792884,"acs":21710,"articleLive":2,"columnArticles":338,"formTitle":"[面试题 08.04]幂集","frequency":2.2003412178,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":26473,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6785283837531638,"acs":22519,"articleLive":2,"columnArticles":498,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":33188,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6558589607635207,"acs":24739,"articleLive":2,"columnArticles":272,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.056165683,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":37720,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8137905604719764,"acs":22070,"articleLive":2,"columnArticles":324,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":1.7017617468,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":27120,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7184815269372381,"acs":16977,"articleLive":2,"columnArticles":248,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.806499651,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":23629,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8141323273360418,"acs":22444,"articleLive":2,"columnArticles":365,"formTitle":"[面试题 08.09]括号","frequency":2.7298947777,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":27568,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5579869568633613,"acs":14203,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 08.10]颜色填充","frequency":0.8644953185,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":25454,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946412196240257,"acs":34522,"articleLive":2,"columnArticles":336,"formTitle":"[面试题 08.11]硬币","frequency":1.6697487699,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":69792,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7605301141582469,"acs":17388,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.12]八皇后","frequency":2.056165683,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22863,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5021867945823928,"acs":7119,"articleLive":2,"columnArticles":93,"formTitle":"[面试题 08.13]堆箱子","frequency":0.9605076062,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":14176,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5354359925788498,"acs":4329,"articleLive":2,"columnArticles":77,"formTitle":"[面试题 08.14]布尔运算","frequency":1.2268310657,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":8085,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5550102485637576,"acs":57675,"articleLive":2,"columnArticles":2384,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.276505062,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":103917,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7401772525849335,"acs":35077,"articleLive":2,"columnArticles":432,"formTitle":"[面试题 10.02]变位词组","frequency":2.8766994852,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":47390,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3939064511514805,"acs":13769,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.6623014866,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":34955,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5540951013420224,"acs":20066,"articleLive":2,"columnArticles":261,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.8644953185,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":36214,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4540362550071288,"acs":13375,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":1.2921924499,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":29458,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6235518777848504,"acs":4898,"articleLive":2,"columnArticles":93,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7855,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6668330421761917,"acs":8016,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 10.11]峰与谷","frequency":1.8425915827,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":12021,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8289906400202378,"acs":26216,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 16.01]交换数字","frequency":0.2464095784,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":31624,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7647117395200638,"acs":15360,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":20086,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44192,"acs":9667,"articleLive":2,"columnArticles":234,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21875,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4587647928994083,"acs":7443,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":16224,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46275713337757135,"acs":11158,"articleLive":2,"columnArticles":131,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.8644953185,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":24112,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4232299627360576,"acs":13402,"articleLive":2,"columnArticles":200,"formTitle":"[面试题 16.06]最小差","frequency":1.811387803,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":31666,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7317587209302325,"acs":20138,"articleLive":2,"columnArticles":303,"formTitle":"[面试题 16.07]最大数值","frequency":1.460656972,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":27520,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3759032359409362,"acs":2393,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6366,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5484496124031008,"acs":2264,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 16.09]运算","frequency":0.2715365284,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":4128,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6805546761223327,"acs":10748,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 16.10]生存人数","frequency":0.8644953185,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15793,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4407833762094085,"acs":50888,"articleLive":2,"columnArticles":592,"formTitle":"[面试题 16.11]跳水板","frequency":1.1959644178,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":115449,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4272632674297607,"acs":2053,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4805,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.550229323864477,"acs":3719,"articleLive":2,"columnArticles":62,"formTitle":"[面试题 16.14]最佳直线","frequency":0.9271822964,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6759,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5035327112884957,"acs":9336,"articleLive":2,"columnArticles":236,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.3250252134,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":18541,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45393967734393265,"acs":15532,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 16.16]部分排序","frequency":1.2588782432,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":34216,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.5994500924998727,"acs":35319,"articleLive":2,"columnArticles":382,"formTitle":"[面试题 16.17]连续数列","frequency":2.1509934701,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":58919,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3436869705526422,"acs":15336,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 16.18]模式匹配","frequency":0.3535496801,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44622,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6123441506764524,"acs":20775,"articleLive":2,"columnArticles":370,"formTitle":"[面试题 16.19]水域大小","frequency":1.6697487699,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33927,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7223581406360982,"acs":9153,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.20]T9键盘","frequency":1.2268310657,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12671,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46387671426551674,"acs":9843,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":21219,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5876630097288346,"acs":2839,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4831,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47334547148240674,"acs":11179,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.24]数对和","frequency":0.2715365284,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23617,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5449898086659215,"acs":33155,"articleLive":2,"columnArticles":266,"formTitle":"[面试题 16.25]LRU 缓存","frequency":3.7944364673,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":60836,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38854800453748584,"acs":15071,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 16.26]计算器","frequency":2.2648820538,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":38788,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5967902286607016,"acs":12606,"articleLive":2,"columnArticles":176,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.2268310657,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":21123,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6401299043272185,"acs":29172,"articleLive":2,"columnArticles":471,"formTitle":"[面试题 17.04]消失的数字","frequency":1.7017617468,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":45572,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38937811454706805,"acs":5704,"articleLive":2,"columnArticles":98,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.8644953185,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14649,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.451448199034534,"acs":4863,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.8644953185,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10772,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4112201188337709,"acs":8928,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.8952102637,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21711,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2718725099601594,"acs":8530,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.7017617468,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":31375,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5490307651454801,"acs":14473,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.09]第 k 个数","frequency":1.7017617468,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":26361,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705334433795415,"acs":67744,"articleLive":2,"columnArticles":941,"formTitle":"[面试题 17.10]主要元素","frequency":2.7610305431,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":118738,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870565320224459,"acs":14815,"articleLive":2,"columnArticles":270,"formTitle":"[面试题 17.11]单词距离","frequency":1.2268310657,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21563,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6329862754377662,"acs":21400,"articleLive":2,"columnArticles":298,"formTitle":"[面试题 17.12]BiNode","frequency":0.806499651,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33808,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5517976505074282,"acs":24848,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 17.13]恢复空格","frequency":1.7349609185,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":45031,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.596687681604722,"acs":78650,"articleLive":2,"columnArticles":767,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5707972674,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":131811,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40396700706991356,"acs":6171,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 17.15]最长单词","frequency":1.7694328275,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":15276,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5179796526220676,"acs":61911,"articleLive":2,"columnArticles":1150,"formTitle":"[面试题 17.16]按摩师","frequency":1.6697487699,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":119524,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44699264387710946,"acs":8264,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 17.17]多次搜索","frequency":0.8349510722,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":18488,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44392939917988944,"acs":7470,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 17.18]最短超串","frequency":1.5249878304,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16827,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.577950210151956,"acs":8938,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.3250252134,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":15465,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5740793201133144,"acs":4053,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 17.20]连续中值","frequency":0.297716034,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":7060,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.635904728048347,"acs":44720,"articleLive":2,"columnArticles":539,"formTitle":"[面试题 17.21]直方图的水量","frequency":2.4487273863,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":70325,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3770525620925819,"acs":9139,"articleLive":2,"columnArticles":155,"formTitle":"[面试题 17.22]单词转换","frequency":0.8644953185,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":24238,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37747130102040816,"acs":4735,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3250252134,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12544,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5223252657769736,"acs":11546,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 17.24]最大子矩阵","frequency":3.6274857222,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":22105,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5057645631067961,"acs":1667,"articleLive":2,"columnArticles":40,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.1097040735,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3296,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3438003984441704,"acs":3624,"articleLive":2,"columnArticles":57,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.3833848286,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10541,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file