1 line
791 KiB
JSON
1 line
791 KiB
JSON
[{"acceptance":0.5894859275543853,"acs":230601,"articleLive":2,"columnArticles":2454,"formTitle":"[38]外观数列","frequency":0.0,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":391190,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.5209619548425828,"acs":2574756,"articleLive":2,"columnArticles":14448,"formTitle":"[1]两数之和","frequency":0.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4942311,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40926113873541803,"acs":1025051,"articleLive":2,"columnArticles":7277,"formTitle":"[2]两数相加","frequency":0.0,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2504638,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3811343427996119,"acs":1273108,"articleLive":2,"columnArticles":7604,"formTitle":"[3]无重复字符的最长子串","frequency":0.0,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3340313,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4089344944049715,"acs":526569,"articleLive":2,"columnArticles":3925,"formTitle":"[4]寻找两个正序数组的中位数","frequency":0.0,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1287661,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3555939713099265,"acs":755533,"articleLive":2,"columnArticles":4089,"formTitle":"[5]最长回文子串","frequency":0.0,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":2124707,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5074789368383482,"acs":309959,"articleLive":2,"columnArticles":2514,"formTitle":"[6]Z 字形变换","frequency":0.0,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":610782,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35239464907821816,"acs":852714,"articleLive":2,"columnArticles":5368,"formTitle":"[7]整数反转","frequency":0.0,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2419770,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21729599574330877,"acs":354478,"articleLive":2,"columnArticles":2727,"formTitle":"[8]字符串转换整数 (atoi)","frequency":0.0,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1631314,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5835678736022266,"acs":785836,"articleLive":2,"columnArticles":5003,"formTitle":"[9]回文数","frequency":0.0,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1346606,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.316023080337328,"acs":208616,"articleLive":2,"columnArticles":1254,"formTitle":"[10]正则表达式匹配","frequency":0.0,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":660129,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6271229537863828,"acs":547526,"articleLive":2,"columnArticles":3109,"formTitle":"[11]盛最多水的容器","frequency":0.0,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":873076,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6647604425430123,"acs":231209,"articleLive":2,"columnArticles":1804,"formTitle":"[12]整数转罗马数字","frequency":0.0,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":347808,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6319064662877648,"acs":476860,"articleLive":2,"columnArticles":3944,"formTitle":"[13]罗马数字转整数","frequency":0.0,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":754637,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.41032827679323153,"acs":636985,"articleLive":2,"columnArticles":3975,"formTitle":"[14]最长公共前缀","frequency":0.0,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1552379,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33692550396143817,"acs":673819,"articleLive":2,"columnArticles":3182,"formTitle":"[15]三数之和","frequency":0.0,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1999905,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4591500727334294,"acs":265768,"articleLive":2,"columnArticles":1459,"formTitle":"[16]最接近的三数之和","frequency":0.0,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":578826,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.573289402225498,"acs":347297,"articleLive":2,"columnArticles":3128,"formTitle":"[17]电话号码的字母组合","frequency":0.0,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":605797,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.398358247858431,"acs":226191,"articleLive":2,"columnArticles":1552,"formTitle":"[18]四数之和","frequency":0.0,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"ac","submitted":567808,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4297989270292668,"acs":532116,"articleLive":2,"columnArticles":3972,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":0.0,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1238058,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44510118831390266,"acs":800109,"articleLive":2,"columnArticles":5668,"formTitle":"[20]有效的括号","frequency":0.0,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1797589,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6675921083734221,"acs":731476,"articleLive":2,"columnArticles":3546,"formTitle":"[21]合并两个有序链表","frequency":0.0,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1095693,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7727033092831643,"acs":359093,"articleLive":2,"columnArticles":2696,"formTitle":"[22]括号生成","frequency":0.0,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":464723,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5600508452347724,"acs":333088,"articleLive":2,"columnArticles":2153,"formTitle":"[23]合并K个升序链表","frequency":0.0,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":594746,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7033495738231448,"acs":323225,"articleLive":2,"columnArticles":2558,"formTitle":"[24]两两交换链表中的节点","frequency":0.0,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":459551,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.657771063646797,"acs":235559,"articleLive":2,"columnArticles":2238,"formTitle":"[25]K 个一组翻转链表","frequency":0.0,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":358117,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.538833827298397,"acs":830670,"articleLive":2,"columnArticles":4619,"formTitle":"[26]删除有序数组中的重复项","frequency":0.0,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1541607,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5971755114102217,"acs":493092,"articleLive":2,"columnArticles":4162,"formTitle":"[27]移除元素","frequency":0.0,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":825707,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4055391053933395,"acs":479082,"articleLive":2,"columnArticles":3284,"formTitle":"[28]实现 strStr()","frequency":0.0,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1181346,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.21973672657521665,"acs":130136,"articleLive":2,"columnArticles":1039,"formTitle":"[29]两数相除","frequency":0.0,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"ac","submitted":592236,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.359177557866636,"acs":81265,"articleLive":2,"columnArticles":603,"formTitle":"[30]串联所有单词的子串","frequency":0.0,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":226253,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3730874819621761,"acs":220022,"articleLive":2,"columnArticles":1778,"formTitle":"[31]下一个排列","frequency":0.0,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":589733,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.356788171758062,"acs":195222,"articleLive":2,"columnArticles":1317,"formTitle":"[32]最长有效括号","frequency":0.0,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":547165,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4279421486565331,"acs":374805,"articleLive":2,"columnArticles":2472,"formTitle":"[33]搜索旋转排序数组","frequency":0.0,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":875831,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42336599912736295,"acs":352224,"articleLive":2,"columnArticles":3371,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":0.0,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":831961,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46287798533453445,"acs":525641,"articleLive":2,"columnArticles":4027,"formTitle":"[35]搜索插入位置","frequency":0.0,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1135593,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6401411682100524,"acs":207866,"articleLive":2,"columnArticles":1471,"formTitle":"[36]有效的数独","frequency":0.0,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":324719,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6708426391972756,"acs":103026,"articleLive":2,"columnArticles":874,"formTitle":"[37]解数独","frequency":0.0,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":153577,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.7278007736206378,"acs":343570,"articleLive":2,"columnArticles":1998,"formTitle":"[39]组合总和","frequency":0.0,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":472066,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.622046885530574,"acs":204901,"articleLive":2,"columnArticles":1424,"formTitle":"[40]组合总和 II","frequency":0.0,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":329398,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41979837070764753,"acs":168353,"articleLive":2,"columnArticles":1440,"formTitle":"[41]缺失的第一个正数","frequency":0.0,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":401033,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5823656726072469,"acs":333112,"articleLive":2,"columnArticles":2478,"formTitle":"[42]接雨水","frequency":0.0,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":571998,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44909425780430373,"acs":173367,"articleLive":2,"columnArticles":1168,"formTitle":"[43]字符串相乘","frequency":0.0,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":386037,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32825708102725165,"acs":85703,"articleLive":2,"columnArticles":559,"formTitle":"[44]通配符匹配","frequency":0.0,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":261085,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.43059509369507637,"acs":208737,"articleLive":2,"columnArticles":1665,"formTitle":"[45]跳跃游戏 II","frequency":0.0,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":484764,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7832143725438256,"acs":431678,"articleLive":2,"columnArticles":2759,"formTitle":"[46]全排列","frequency":0.0,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":551162,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.63824553381509,"acs":220540,"articleLive":2,"columnArticles":1517,"formTitle":"[47]全排列 II","frequency":0.0,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":345541,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7353438438486977,"acs":227472,"articleLive":2,"columnArticles":1913,"formTitle":"[48]旋转图像","frequency":0.0,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":309341,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6655020834031524,"acs":238295,"articleLive":2,"columnArticles":1347,"formTitle":"[49]字母异位词分组","frequency":0.0,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"ac","submitted":358068,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37637169015379274,"acs":221086,"articleLive":2,"columnArticles":1312,"formTitle":"[50]Pow(x, n)","frequency":0.0,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":587414,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388607840080866,"acs":156422,"articleLive":2,"columnArticles":1567,"formTitle":"[51]N 皇后","frequency":0.0,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":211707,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8226413438223451,"acs":74978,"articleLive":2,"columnArticles":618,"formTitle":"[52]N皇后 II","frequency":0.0,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":91143,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5528800837155873,"acs":702694,"articleLive":2,"columnArticles":3864,"formTitle":"[53]最大子序和","frequency":0.0,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1270970,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.48160776375268016,"acs":192947,"articleLive":2,"columnArticles":2036,"formTitle":"[54]螺旋矩阵","frequency":0.0,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":400631,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4327179481863674,"acs":333957,"articleLive":2,"columnArticles":2567,"formTitle":"[55]跳跃游戏","frequency":0.0,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":771766,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4700186032633351,"acs":308743,"articleLive":2,"columnArticles":2370,"formTitle":"[56]合并区间","frequency":0.0,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"ac","submitted":656874,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4114882580003658,"acs":87733,"articleLive":2,"columnArticles":941,"formTitle":"[57]插入区间","frequency":0.0,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":213209,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.37703451335232235,"acs":252428,"articleLive":2,"columnArticles":2712,"formTitle":"[58]最后一个单词的长度","frequency":0.0,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"ac","submitted":669509,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7896449362900729,"acs":130079,"articleLive":2,"columnArticles":1603,"formTitle":"[59]螺旋矩阵 II","frequency":0.0,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":164731,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5243494627059819,"acs":91101,"articleLive":2,"columnArticles":967,"formTitle":"[60]排列序列","frequency":0.0,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":173741,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41763485823505353,"acs":200149,"articleLive":2,"columnArticles":2032,"formTitle":"[61]旋转链表","frequency":0.0,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":479244,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.662460743916987,"acs":320421,"articleLive":2,"columnArticles":2471,"formTitle":"[62]不同路径","frequency":0.0,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":483683,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.39211470139701504,"acs":185642,"articleLive":2,"columnArticles":1749,"formTitle":"[63]不同路径 II","frequency":0.0,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":473438,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6883494096689171,"acs":273961,"articleLive":2,"columnArticles":2116,"formTitle":"[64]最小路径和","frequency":0.0,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":397997,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2695788877457837,"acs":46642,"articleLive":2,"columnArticles":647,"formTitle":"[65]有效数字","frequency":0.0,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":173018,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45715530329722426,"acs":356812,"articleLive":2,"columnArticles":3223,"formTitle":"[66]加一","frequency":0.0,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":780505,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5426925537552478,"acs":197647,"articleLive":2,"columnArticles":1808,"formTitle":"[67]二进制求和","frequency":0.0,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":364197,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5242159751094468,"acs":38078,"articleLive":2,"columnArticles":577,"formTitle":"[68]文本左右对齐","frequency":0.0,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"ac","submitted":72638,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3919177693067124,"acs":394593,"articleLive":2,"columnArticles":1981,"formTitle":"[69]Sqrt(x)","frequency":0.0,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":1006826,"title":"Sqrt(x)","titleSlug":"sqrtx"},{"acceptance":0.5303637367754231,"acs":587730,"articleLive":2,"columnArticles":3662,"formTitle":"[70]爬楼梯","frequency":0.0,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1108164,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.421766812574612,"acs":95391,"articleLive":2,"columnArticles":836,"formTitle":"[71]简化路径","frequency":0.0,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":226170,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6142922427375845,"acs":180124,"articleLive":2,"columnArticles":1255,"formTitle":"[72]编辑距离","frequency":0.0,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":293222,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.604750011150261,"acs":135591,"articleLive":2,"columnArticles":997,"formTitle":"[73]矩阵置零","frequency":0.0,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":224210,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4615637468565519,"acs":172713,"articleLive":2,"columnArticles":1728,"formTitle":"[74]搜索二维矩阵","frequency":0.0,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":374191,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5966012499105192,"acs":275029,"articleLive":2,"columnArticles":1894,"formTitle":"[75]颜色分类","frequency":0.0,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":460993,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4273730495367544,"acs":189725,"articleLive":2,"columnArticles":1293,"formTitle":"[76]最小覆盖子串","frequency":0.0,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":443933,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7701343426077468,"acs":225865,"articleLive":2,"columnArticles":1326,"formTitle":"[77]组合","frequency":0.0,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":293280,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8016284736454323,"acs":318786,"articleLive":2,"columnArticles":2082,"formTitle":"[78]子集","frequency":0.0,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":397673,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45876298992879594,"acs":228853,"articleLive":2,"columnArticles":1442,"formTitle":"[79]单词搜索","frequency":0.0,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":498848,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6169728827083565,"acs":150004,"articleLive":2,"columnArticles":1341,"formTitle":"[80]删除有序数组中的重复项 II","frequency":0.0,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":243129,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4148742421098739,"acs":125972,"articleLive":2,"columnArticles":1003,"formTitle":"[81]搜索旋转排序数组 II","frequency":0.0,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":303639,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5308236533709747,"acs":185396,"articleLive":2,"columnArticles":1712,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":0.0,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":349261,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385314370508695,"acs":322995,"articleLive":2,"columnArticles":1973,"formTitle":"[83]删除排序链表中的重复元素","frequency":0.0,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":599770,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43355422163649826,"acs":186202,"articleLive":2,"columnArticles":1181,"formTitle":"[84]柱状图中最大的矩形","frequency":0.0,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":429478,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5158672851851659,"acs":99306,"articleLive":2,"columnArticles":700,"formTitle":"[85]最大矩形","frequency":0.0,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":192503,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6327170149751804,"acs":121345,"articleLive":2,"columnArticles":1117,"formTitle":"[86]分隔链表","frequency":0.0,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":191784,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.486897893932022,"acs":42030,"articleLive":2,"columnArticles":314,"formTitle":"[87]扰乱字符串","frequency":0.0,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":86322,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5174977904222278,"acs":476025,"articleLive":2,"columnArticles":3332,"formTitle":"[88]合并两个有序数组","frequency":0.0,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":919859,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7099584076054665,"acs":59743,"articleLive":2,"columnArticles":487,"formTitle":"[89]格雷编码","frequency":0.0,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":84150,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337983156207941,"acs":140804,"articleLive":2,"columnArticles":1240,"formTitle":"[90]子集 II","frequency":0.0,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":222159,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30975769238650736,"acs":166277,"articleLive":2,"columnArticles":1540,"formTitle":"[91]解码方法","frequency":0.0,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":536797,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5491016534048758,"acs":216133,"articleLive":2,"columnArticles":2061,"formTitle":"[92]反转链表 II","frequency":0.0,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":393612,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5411266468088926,"acs":156779,"articleLive":2,"columnArticles":1354,"formTitle":"[93]复原 IP 地址","frequency":0.0,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":289727,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7556636172116244,"acs":576059,"articleLive":2,"columnArticles":2354,"formTitle":"[94]二叉树的中序遍历","frequency":0.0,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":762322,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7026890988071434,"acs":101911,"articleLive":2,"columnArticles":636,"formTitle":"[95]不同的二叉搜索树 II","frequency":0.0,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":145030,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6995269233195265,"acs":166351,"articleLive":2,"columnArticles":1316,"formTitle":"[96]不同的二叉搜索树","frequency":0.0,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":237805,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4558139534883721,"acs":62622,"articleLive":2,"columnArticles":553,"formTitle":"[97]交错字符串","frequency":0.0,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":137385,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3504245690951565,"acs":355361,"articleLive":2,"columnArticles":1970,"formTitle":"[98]验证二叉搜索树","frequency":0.0,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":1014087,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6114655570966251,"acs":72743,"articleLive":2,"columnArticles":598,"formTitle":"[99]恢复二叉搜索树","frequency":0.0,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":118965,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.601968544943235,"acs":254298,"articleLive":2,"columnArticles":1908,"formTitle":"[100]相同的树","frequency":0.0,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":422444,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.564200091898675,"acs":419933,"articleLive":2,"columnArticles":2302,"formTitle":"[101]对称二叉树","frequency":0.0,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":744298,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6420607038865679,"acs":405731,"articleLive":2,"columnArticles":2546,"formTitle":"[102]二叉树的层序遍历","frequency":0.0,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":631920,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5717320831234582,"acs":177070,"articleLive":2,"columnArticles":1610,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":0.0,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":309708,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.766176522135371,"acs":524598,"articleLive":2,"columnArticles":2598,"formTitle":"[104]二叉树的最大深度","frequency":0.0,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":684696,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7048248185933796,"acs":253615,"articleLive":2,"columnArticles":1454,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":359827,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7216987152216455,"acs":135714,"articleLive":2,"columnArticles":899,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":0.0,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":188048,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.69759777879986,"acs":165323,"articleLive":2,"columnArticles":1324,"formTitle":"[107]二叉树的层序遍历 II","frequency":0.0,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":236989,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7605830990199787,"acs":195031,"articleLive":2,"columnArticles":1207,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":0.0,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":256423,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7631987826365529,"acs":95293,"articleLive":2,"columnArticles":733,"formTitle":"[109]有序链表转换二叉搜索树","frequency":0.0,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":124860,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5637141660441558,"acs":261100,"articleLive":2,"columnArticles":1494,"formTitle":"[110]平衡二叉树","frequency":0.0,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":463178,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4867649518109405,"acs":276519,"articleLive":2,"columnArticles":1820,"formTitle":"[111]二叉树的最小深度","frequency":0.0,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":568075,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5263976553296235,"acs":274798,"articleLive":2,"columnArticles":1725,"formTitle":"[112]路径总和","frequency":0.0,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":522035,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6277167755093632,"acs":182820,"articleLive":2,"columnArticles":1283,"formTitle":"[113]路径总和 II","frequency":0.0,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":291246,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7260859635133889,"acs":181210,"articleLive":2,"columnArticles":1360,"formTitle":"[114]二叉树展开为链表","frequency":0.0,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":249571,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5217123498614106,"acs":62678,"articleLive":2,"columnArticles":686,"formTitle":"[115]不同的子序列","frequency":0.0,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":120139,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7046749395145555,"acs":162522,"articleLive":2,"columnArticles":1240,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":0.0,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":230634,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6151813017323867,"acs":91937,"articleLive":2,"columnArticles":783,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":0.0,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":149447,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7314427279902894,"acs":220549,"articleLive":2,"columnArticles":1777,"formTitle":"[118]杨辉三角","frequency":0.0,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":301526,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6679891361025088,"acs":147323,"articleLive":2,"columnArticles":1224,"formTitle":"[119]杨辉三角 II","frequency":0.0,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":220547,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6816134753767639,"acs":181772,"articleLive":2,"columnArticles":1599,"formTitle":"[120]三角形最小路径和","frequency":0.0,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":266679,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5733971225031429,"acs":574693,"articleLive":2,"columnArticles":3447,"formTitle":"[121]买卖股票的最佳时机","frequency":0.0,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":1002260,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6897550150480719,"acs":471202,"articleLive":2,"columnArticles":2685,"formTitle":"[122]买卖股票的最佳时机 II","frequency":0.0,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","questionId":"122","status":"ac","submitted":683144,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5371092807387269,"acs":133549,"articleLive":2,"columnArticles":828,"formTitle":"[123]买卖股票的最佳时机 III","frequency":0.0,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":248644,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4449540533014464,"acs":162984,"articleLive":2,"columnArticles":1109,"formTitle":"[124]二叉树中的最大路径和","frequency":0.0,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":366294,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4728277540593681,"acs":282081,"articleLive":2,"columnArticles":1859,"formTitle":"[125]验证回文串","frequency":0.0,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":596583,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39646105367437057,"acs":37619,"articleLive":2,"columnArticles":332,"formTitle":"[126]单词接龙 II","frequency":0.0,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":94887,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46876125315088224,"acs":124968,"articleLive":2,"columnArticles":661,"formTitle":"[127]单词接龙","frequency":0.0,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":266592,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5433187175420593,"acs":174715,"articleLive":2,"columnArticles":1141,"formTitle":"[128]最长连续序列","frequency":0.0,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":321570,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6828984765644553,"acs":122779,"articleLive":2,"columnArticles":1131,"formTitle":"[129]求根节点到叶节点数字之和","frequency":0.0,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":179791,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4454762599496495,"acs":131297,"articleLive":2,"columnArticles":1194,"formTitle":"[130]被围绕的区域","frequency":0.0,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":294734,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7229943967920971,"acs":136129,"articleLive":2,"columnArticles":892,"formTitle":"[131]分割回文串","frequency":0.0,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":188285,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4923911865809095,"acs":49991,"articleLive":2,"columnArticles":443,"formTitle":"[132]分割回文串 II","frequency":0.0,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":101527,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6761623859597699,"acs":73818,"articleLive":2,"columnArticles":531,"formTitle":"[133]克隆图","frequency":0.0,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":109172,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5760054102795311,"acs":127758,"articleLive":2,"columnArticles":987,"formTitle":"[134]加油站","frequency":0.0,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":221800,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.485977539095322,"acs":101216,"articleLive":2,"columnArticles":812,"formTitle":"[135]分发糖果","frequency":0.0,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"ac","submitted":208273,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7191384039443306,"acs":510210,"articleLive":2,"columnArticles":2313,"formTitle":"[136]只出现一次的数字","frequency":0.0,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":709474,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7198410727588775,"acs":101458,"articleLive":2,"columnArticles":763,"formTitle":"[137]只出现一次的数字 II","frequency":0.0,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":140945,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6617625721830475,"acs":114025,"articleLive":2,"columnArticles":863,"formTitle":"[138]复制带随机指针的链表","frequency":0.0,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":172305,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5160380206760851,"acs":198268,"articleLive":2,"columnArticles":1233,"formTitle":"[139]单词拆分","frequency":0.0,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":384212,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.49109627662477034,"acs":53998,"articleLive":2,"columnArticles":550,"formTitle":"[140]单词拆分 II","frequency":0.0,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":109954,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.51249014285281,"acs":540714,"articleLive":2,"columnArticles":2785,"formTitle":"[141]环形链表","frequency":0.0,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":1055072,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5528390851087863,"acs":303439,"articleLive":2,"columnArticles":1775,"formTitle":"[142]环形链表 II","frequency":0.0,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":548874,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6216301615798923,"acs":129843,"articleLive":2,"columnArticles":1100,"formTitle":"[143]重排链表","frequency":0.0,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":208875,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.703914647708383,"acs":422189,"articleLive":2,"columnArticles":1872,"formTitle":"[144]二叉树的前序遍历","frequency":0.0,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":599773,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7507372758876606,"acs":307514,"articleLive":2,"columnArticles":1585,"formTitle":"[145]二叉树的后序遍历","frequency":0.0,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":409616,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5261238458914285,"acs":239047,"articleLive":2,"columnArticles":1405,"formTitle":"[146]LRU 缓存机制","frequency":0.0,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":454355,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6817715850385098,"acs":101089,"articleLive":2,"columnArticles":792,"formTitle":"[147]对链表进行插入排序","frequency":0.0,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":148274,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671419498648867,"acs":214294,"articleLive":2,"columnArticles":1265,"formTitle":"[148]排序链表","frequency":0.0,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":321212,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3421113371128518,"acs":47431,"articleLive":2,"columnArticles":521,"formTitle":"[149]直线上最多的点数","frequency":0.0,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":138642,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.535571178062192,"acs":134995,"articleLive":2,"columnArticles":1062,"formTitle":"[150]逆波兰表达式求值","frequency":0.0,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":252058,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48422814182759016,"acs":172745,"articleLive":2,"columnArticles":1450,"formTitle":"[151]翻转字符串里的单词","frequency":0.0,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":356743,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4215213299733628,"acs":187679,"articleLive":2,"columnArticles":1259,"formTitle":"[152]乘积最大子数组","frequency":0.0,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":445242,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5670505763920574,"acs":215008,"articleLive":2,"columnArticles":1521,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":0.0,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":379169,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5316538516865195,"acs":114573,"articleLive":2,"columnArticles":902,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":0.0,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":215503,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5736647798161352,"acs":291973,"articleLive":2,"columnArticles":1621,"formTitle":"[155]最小栈","frequency":0.0,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":508961,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.724817597734945,"acs":6656,"articleLive":2,"columnArticles":118,"formTitle":"[156]上下翻转二叉树","frequency":0.0,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"lock","submitted":9183,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5337599083182122,"acs":5589,"articleLive":2,"columnArticles":83,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"lock","submitted":10471,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5920615128844555,"acs":2849,"articleLive":2,"columnArticles":66,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.0,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"lock","submitted":4812,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5473737888832229,"acs":16101,"articleLive":2,"columnArticles":194,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"lock","submitted":29415,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6147770535768853,"acs":342014,"articleLive":2,"columnArticles":1999,"formTitle":"[160]相交链表","frequency":0.0,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":556322,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3364972443355787,"acs":7693,"articleLive":2,"columnArticles":105,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.0,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"lock","submitted":22862,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49705697346869937,"acs":163573,"articleLive":2,"columnArticles":1109,"formTitle":"[162]寻找峰值","frequency":0.0,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":329083,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3269130116193866,"acs":9369,"articleLive":2,"columnArticles":144,"formTitle":"[163]缺失的区间","frequency":0.0,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"lock","submitted":28659,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.609921382360167,"acs":59582,"articleLive":2,"columnArticles":491,"formTitle":"[164]最大间距","frequency":0.0,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":97688,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5193461889888862,"acs":86964,"articleLive":2,"columnArticles":930,"formTitle":"[165]比较版本号","frequency":0.0,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"ac","submitted":167449,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.3310689088701421,"acs":41717,"articleLive":2,"columnArticles":380,"formTitle":"[166]分数到小数","frequency":0.0,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":126007,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5866866153327954,"acs":299588,"articleLive":2,"columnArticles":1968,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":0.0,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":510644,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325736932109384,"acs":85246,"articleLive":2,"columnArticles":763,"formTitle":"[168]Excel表列名称","frequency":0.0,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":197067,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6646843688897444,"acs":393654,"articleLive":2,"columnArticles":2226,"formTitle":"[169]多数元素","frequency":0.0,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":592242,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4186502246439155,"acs":8759,"articleLive":2,"columnArticles":88,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.0,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"lock","submitted":20922,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7180483076391931,"acs":108151,"articleLive":2,"columnArticles":922,"formTitle":"[171]Excel 表列序号","frequency":0.0,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":150618,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4402745403985048,"acs":91987,"articleLive":2,"columnArticles":599,"formTitle":"[172]阶乘后的零","frequency":0.0,"frontendQuestionId":"172","leaf":true,"level":2,"nodeType":"def","questionId":"172","status":"","submitted":208931,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8047652313815149,"acs":76031,"articleLive":2,"columnArticles":637,"formTitle":"[173]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":94476,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.48083801737353093,"acs":38581,"articleLive":2,"columnArticles":410,"formTitle":"[174]地下城游戏","frequency":0.0,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":80237,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7393554474675557,"acs":308726,"articleLive":2,"columnArticles":1478,"formTitle":"[175]组合两个表","frequency":0.0,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":417561,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3558631695036093,"acs":255561,"articleLive":2,"columnArticles":1026,"formTitle":"[176]第二高的薪水","frequency":0.0,"frontendQuestionId":"176","leaf":true,"level":2,"nodeType":"def","questionId":"176","status":"","submitted":718144,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.462990490686278,"acs":130192,"articleLive":2,"columnArticles":503,"formTitle":"[177]第N高的薪水","frequency":0.0,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":281198,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6034662165862597,"acs":121208,"articleLive":2,"columnArticles":677,"formTitle":"[178]分数排名","frequency":0.0,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":200853,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4096153589493774,"acs":122765,"articleLive":2,"columnArticles":973,"formTitle":"[179]最大数","frequency":0.0,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":299708,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4869405138068416,"acs":88611,"articleLive":2,"columnArticles":522,"formTitle":"[180]连续出现的数字","frequency":0.0,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":181975,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7018252492817306,"acs":166108,"articleLive":2,"columnArticles":682,"formTitle":"[181]超过经理收入的员工","frequency":0.0,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":236680,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7967303517151542,"acs":183487,"articleLive":2,"columnArticles":596,"formTitle":"[182]查找重复的电子邮箱","frequency":0.0,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":230300,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6767659725613817,"acs":152428,"articleLive":2,"columnArticles":551,"formTitle":"[183]从不订购的客户","frequency":0.0,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":225230,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47731019124365776,"acs":103951,"articleLive":2,"columnArticles":681,"formTitle":"[184]部门工资最高的员工","frequency":0.0,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":217785,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49700867690947276,"acs":71943,"articleLive":2,"columnArticles":638,"formTitle":"[185]部门工资前三高的所有员工","frequency":0.0,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":144752,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7565815324165029,"acs":7702,"articleLive":2,"columnArticles":118,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.0,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"lock","submitted":10180,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.5211300195628852,"acs":74322,"articleLive":2,"columnArticles":544,"formTitle":"[187]重复的DNA序列","frequency":0.0,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"ac","submitted":142617,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3929356019814775,"acs":91220,"articleLive":2,"columnArticles":705,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":0.0,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":232150,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.45012726785945323,"acs":351386,"articleLive":2,"columnArticles":1752,"formTitle":"[189]旋转数组","frequency":0.0,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":780637,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6987372470312762,"acs":133688,"articleLive":2,"columnArticles":839,"formTitle":"[190]颠倒二进制位","frequency":0.0,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":191328,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7493624206664985,"acs":193047,"articleLive":2,"columnArticles":1216,"formTitle":"[191]位1的个数","frequency":0.0,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":257615,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3561592612463217,"acs":21907,"articleLive":2,"columnArticles":178,"formTitle":"[192]统计词频","frequency":0.0,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":61509,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32525574893927583,"acs":26294,"articleLive":2,"columnArticles":140,"formTitle":"[193]有效电话号码","frequency":0.0,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":80841,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3448344635021939,"acs":10374,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":0.0,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":30084,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4364700727794952,"acs":35863,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":0.0,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":82166,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6653796736891718,"acs":103056,"articleLive":2,"columnArticles":396,"formTitle":"[196]删除重复的电子邮箱","frequency":0.0,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":154883,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338955146414559,"acs":95665,"articleLive":2,"columnArticles":512,"formTitle":"[197]上升的温度","frequency":0.0,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":179183,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5160883806429103,"acs":396424,"articleLive":2,"columnArticles":2731,"formTitle":"[198]打家劫舍","frequency":0.0,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":768132,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6526142475246182,"acs":144278,"articleLive":2,"columnArticles":1609,"formTitle":"[199]二叉树的右视图","frequency":0.0,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":221077,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5578536161721297,"acs":336586,"articleLive":2,"columnArticles":2150,"formTitle":"[200]岛屿数量","frequency":0.0,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":603359,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.524394828630506,"acs":50215,"articleLive":2,"columnArticles":328,"formTitle":"[201]数字范围按位与","frequency":0.0,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":95758,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6193869613687444,"acs":172791,"articleLive":2,"columnArticles":1411,"formTitle":"[202]快乐数","frequency":0.0,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":278971,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5168012910054747,"acs":238264,"articleLive":2,"columnArticles":1686,"formTitle":"[203]移除链表元素","frequency":0.0,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":461036,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37790079245483715,"acs":170530,"articleLive":2,"columnArticles":738,"formTitle":"[204]计数质数","frequency":0.0,"frontendQuestionId":"204","leaf":true,"level":2,"nodeType":"def","questionId":"204","status":"","submitted":451256,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5005956987938186,"acs":115128,"articleLive":2,"columnArticles":885,"formTitle":"[205]同构字符串","frequency":0.0,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":229982,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7233952685875494,"acs":726176,"articleLive":2,"columnArticles":7422,"formTitle":"[206]反转链表","frequency":0.0,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":1003844,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5429926744325687,"acs":144688,"articleLive":2,"columnArticles":953,"formTitle":"[207]课程表","frequency":0.0,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":266464,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7167314604269053,"acs":146568,"articleLive":2,"columnArticles":993,"formTitle":"[208]实现 Trie (前缀树)","frequency":0.0,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":204495,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4732369265478882,"acs":199688,"articleLive":2,"columnArticles":1415,"formTitle":"[209]长度最小的子数组","frequency":0.0,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":421962,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5427795544280278,"acs":91143,"articleLive":2,"columnArticles":684,"formTitle":"[210]课程表 II","frequency":0.0,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":167919,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4827451427454685,"acs":29642,"articleLive":2,"columnArticles":328,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":0.0,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":61403,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4628424162982382,"acs":62499,"articleLive":2,"columnArticles":576,"formTitle":"[212]单词搜索 II","frequency":0.0,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"ac","submitted":135033,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43332228454869964,"acs":169949,"articleLive":2,"columnArticles":1557,"formTitle":"[213]打家劫舍 II","frequency":0.0,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":392200,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3715809433515051,"acs":31354,"articleLive":2,"columnArticles":309,"formTitle":"[214]最短回文串","frequency":0.0,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":84380,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6462863699366779,"acs":449487,"articleLive":2,"columnArticles":2335,"formTitle":"[215]数组中的第K个最大元素","frequency":0.0,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":695492,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7368946652386604,"acs":101830,"articleLive":2,"columnArticles":1048,"formTitle":"[216]组合总和 III","frequency":0.0,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":138188,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5577696970414832,"acs":376721,"articleLive":2,"columnArticles":1759,"formTitle":"[217]存在重复元素","frequency":0.0,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":675406,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5424215491898544,"acs":31736,"articleLive":2,"columnArticles":281,"formTitle":"[218]天际线问题","frequency":0.0,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":58508,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4247985608248046,"acs":112400,"articleLive":2,"columnArticles":903,"formTitle":"[219]存在重复元素 II","frequency":0.0,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"ac","submitted":264596,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28664238302670464,"acs":65079,"articleLive":2,"columnArticles":425,"formTitle":"[220]存在重复元素 III","frequency":0.0,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":227039,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4771624470800281,"acs":141900,"articleLive":2,"columnArticles":1008,"formTitle":"[221]最大正方形","frequency":0.0,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":297383,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7820935476639458,"acs":118617,"articleLive":2,"columnArticles":890,"formTitle":"[222]完全二叉树的节点个数","frequency":0.0,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":151666,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.5232675643584367,"acs":41425,"articleLive":2,"columnArticles":516,"formTitle":"[223]矩形面积","frequency":0.0,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"ac","submitted":79166,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4178251485332343,"acs":72013,"articleLive":2,"columnArticles":662,"formTitle":"[224]基本计算器","frequency":0.0,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":172352,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754600204017577,"acs":137729,"articleLive":2,"columnArticles":4765,"formTitle":"[225]用队列实现栈","frequency":0.0,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":203904,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7881406089547407,"acs":311604,"articleLive":2,"columnArticles":1884,"formTitle":"[226]翻转二叉树","frequency":0.0,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":395366,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43758100432857105,"acs":87444,"articleLive":2,"columnArticles":704,"formTitle":"[227]基本计算器 II","frequency":0.0,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":199835,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.579770165657214,"acs":57817,"articleLive":2,"columnArticles":653,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":99724,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4647791169643633,"acs":37444,"articleLive":2,"columnArticles":320,"formTitle":"[229]求众数 II","frequency":0.0,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":80563,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7421789866802087,"acs":140303,"articleLive":2,"columnArticles":885,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":0.0,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":189042,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5043657394526695,"acs":170404,"articleLive":2,"columnArticles":1227,"formTitle":"[231]2 的幂","frequency":0.0,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":337858,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6911082408524668,"acs":162662,"articleLive":2,"columnArticles":1286,"formTitle":"[232]用栈实现队列","frequency":0.0,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":235364,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47713603032050755,"acs":34746,"articleLive":2,"columnArticles":417,"formTitle":"[233]数字 1 的个数","frequency":0.0,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":72822,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4972791061761618,"acs":316363,"articleLive":2,"columnArticles":2024,"formTitle":"[234]回文链表","frequency":0.0,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":636188,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6661473360261588,"acs":173165,"articleLive":2,"columnArticles":997,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":259950,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6809295539269075,"acs":263214,"articleLive":2,"columnArticles":1416,"formTitle":"[236]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":386551,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481257586501135,"acs":211710,"articleLive":2,"columnArticles":1019,"formTitle":"[237]删除链表中的节点","frequency":0.0,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":249621,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7235069168185201,"acs":140950,"articleLive":2,"columnArticles":892,"formTitle":"[238]除自身以外数组的乘积","frequency":0.0,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":194815,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4969472103383435,"acs":196888,"articleLive":2,"columnArticles":1346,"formTitle":"[239]滑动窗口最大值","frequency":0.0,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":396195,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47870054389881367,"acs":171977,"articleLive":2,"columnArticles":780,"formTitle":"[240]搜索二维矩阵 II","frequency":0.0,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":359258,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7383035898849307,"acs":32145,"articleLive":2,"columnArticles":288,"formTitle":"[241]为运算表达式设计优先级","frequency":0.0,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":43539,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6458962369763646,"acs":297131,"articleLive":2,"columnArticles":1720,"formTitle":"[242]有效的字母异位词","frequency":0.0,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":460029,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6568541300527241,"acs":8970,"articleLive":2,"columnArticles":105,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"lock","submitted":13656,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5516980315812243,"acs":5101,"articleLive":2,"columnArticles":59,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"lock","submitted":9246,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6011536876802637,"acs":4377,"articleLive":2,"columnArticles":60,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"lock","submitted":7281,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4755909349362359,"acs":5855,"articleLive":2,"columnArticles":108,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"lock","submitted":12311,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5253493013972056,"acs":5264,"articleLive":2,"columnArticles":92,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"lock","submitted":10020,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4650270364556079,"acs":2666,"articleLive":2,"columnArticles":52,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"lock","submitted":5733,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.638177874186551,"acs":5884,"articleLive":2,"columnArticles":102,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"lock","submitted":9220,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.634847210541071,"acs":4529,"articleLive":2,"columnArticles":77,"formTitle":"[250]统计同值子树","frequency":0.0,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"lock","submitted":7134,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5441154809250258,"acs":3694,"articleLive":2,"columnArticles":68,"formTitle":"[251]展开二维向量","frequency":0.0,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"lock","submitted":6789,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5645257964866983,"acs":12244,"articleLive":2,"columnArticles":159,"formTitle":"[252]会议室","frequency":0.0,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"lock","submitted":21689,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.5016373280036898,"acs":32629,"articleLive":2,"columnArticles":352,"formTitle":"[253]会议室 II","frequency":0.0,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"lock","submitted":65045,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5694716242661448,"acs":5238,"articleLive":2,"columnArticles":77,"formTitle":"[254]因子的组合","frequency":0.0,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"lock","submitted":9198,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47552826440310636,"acs":5266,"articleLive":2,"columnArticles":62,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"lock","submitted":11074,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6414777952074431,"acs":11859,"articleLive":2,"columnArticles":187,"formTitle":"[256]粉刷房子","frequency":0.0,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"lock","submitted":18487,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6830329749171615,"acs":144706,"articleLive":2,"columnArticles":1074,"formTitle":"[257]二叉树的所有路径","frequency":0.0,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":211858,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6922546099352731,"acs":79250,"articleLive":2,"columnArticles":657,"formTitle":"[258]各位相加","frequency":0.0,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":114481,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5650496141124587,"acs":7175,"articleLive":2,"columnArticles":85,"formTitle":"[259]较小的三数之和","frequency":0.0,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"lock","submitted":12698,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7233683343627754,"acs":52701,"articleLive":2,"columnArticles":449,"formTitle":"[260]只出现一次的数字 III","frequency":0.0,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":72855,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49441612736956647,"acs":8633,"articleLive":2,"columnArticles":119,"formTitle":"[261]以图判树","frequency":0.0,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"lock","submitted":17461,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4343171944282707,"acs":38788,"articleLive":2,"columnArticles":377,"formTitle":"[262]行程和用户","frequency":0.0,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":89308,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515247557034494,"acs":107459,"articleLive":2,"columnArticles":840,"formTitle":"[263]丑数","frequency":0.0,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":208558,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5801804073492498,"acs":101238,"articleLive":2,"columnArticles":617,"formTitle":"[264]丑数 II","frequency":0.0,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":174494,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5902434871445599,"acs":6933,"articleLive":2,"columnArticles":155,"formTitle":"[265]粉刷房子 II","frequency":0.0,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"lock","submitted":11746,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6746055373623102,"acs":6798,"articleLive":2,"columnArticles":103,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"lock","submitted":10077,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44707250872431176,"acs":3459,"articleLive":2,"columnArticles":77,"formTitle":"[267]回文排列 II","frequency":0.0,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"lock","submitted":7737,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6259541052974205,"acs":153847,"articleLive":2,"columnArticles":1120,"formTitle":"[268]丢失的数字","frequency":0.0,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":245780,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3387467362924282,"acs":6487,"articleLive":2,"columnArticles":108,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"lock","submitted":19150,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5544692737430168,"acs":9925,"articleLive":2,"columnArticles":139,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.0,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"lock","submitted":17900,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5541744354671638,"acs":2675,"articleLive":2,"columnArticles":46,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"lock","submitted":4827,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6482169390787519,"acs":3490,"articleLive":2,"columnArticles":76,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.0,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"lock","submitted":5384,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3667153209243448,"acs":28390,"articleLive":2,"columnArticles":350,"formTitle":"[273]整数转换英文表示","frequency":0.0,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"ac","submitted":77417,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44005272236144105,"acs":54086,"articleLive":2,"columnArticles":564,"formTitle":"[274]H 指数","frequency":0.0,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":122908,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4621034847266518,"acs":51147,"articleLive":2,"columnArticles":419,"formTitle":"[275]H 指数 II","frequency":0.0,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":110683,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4924817216167747,"acs":7140,"articleLive":2,"columnArticles":130,"formTitle":"[276]栅栏涂色","frequency":0.0,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"lock","submitted":14498,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5702134123186755,"acs":7508,"articleLive":2,"columnArticles":85,"formTitle":"[277]搜寻名人","frequency":0.0,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"lock","submitted":13167,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45333625632056274,"acs":190248,"articleLive":2,"columnArticles":1084,"formTitle":"[278]第一个错误的版本","frequency":0.0,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":419662,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6324119038342961,"acs":206153,"articleLive":2,"columnArticles":1214,"formTitle":"[279]完全平方数","frequency":0.0,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":325979,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6848206738316629,"acs":5671,"articleLive":2,"columnArticles":71,"formTitle":"[280]摆动排序","frequency":0.0,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"lock","submitted":8281,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7595084844938561,"acs":2596,"articleLive":2,"columnArticles":65,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"lock","submitted":3418,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.39387024840533114,"acs":7595,"articleLive":2,"columnArticles":82,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":19283,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6391580990908121,"acs":503066,"articleLive":2,"columnArticles":3426,"formTitle":"[283]移动零","frequency":0.0,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":787076,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7712744520569179,"acs":24879,"articleLive":2,"columnArticles":210,"formTitle":"[284]窥探迭代器","frequency":0.0,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"ac","submitted":32257,"title":"窥探迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6352092804514814,"acs":8104,"articleLive":2,"columnArticles":104,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"lock","submitted":12758,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5095388115865932,"acs":11645,"articleLive":2,"columnArticles":150,"formTitle":"[286]墙与门","frequency":0.0,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"lock","submitted":22854,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6592387034827897,"acs":181259,"articleLive":2,"columnArticles":1238,"formTitle":"[287]寻找重复数","frequency":0.0,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":274952,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4340498290180752,"acs":3554,"articleLive":2,"columnArticles":55,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"lock","submitted":8188,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533989619767573,"acs":53419,"articleLive":2,"columnArticles":831,"formTitle":"[289]生命游戏","frequency":0.0,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":70904,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45651473535338094,"acs":83602,"articleLive":2,"columnArticles":1112,"formTitle":"[290]单词规律","frequency":0.0,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":183131,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5313085084252133,"acs":2554,"articleLive":2,"columnArticles":56,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"lock","submitted":4807,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.7084505830742575,"acs":115306,"articleLive":2,"columnArticles":768,"formTitle":"[292]Nim 游戏","frequency":0.0,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"ac","submitted":162758,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7120778477389811,"acs":4976,"articleLive":2,"columnArticles":84,"formTitle":"[293]翻转游戏","frequency":0.0,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"lock","submitted":6988,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5809266899397016,"acs":3661,"articleLive":2,"columnArticles":55,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"lock","submitted":6302,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5232909714137887,"acs":64729,"articleLive":2,"columnArticles":506,"formTitle":"[295]数据流的中位数","frequency":0.0,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":123696,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.620955699352912,"acs":2495,"articleLive":2,"columnArticles":46,"formTitle":"[296]最佳的碰头地点","frequency":0.0,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"lock","submitted":4018,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.560557375672043,"acs":106766,"articleLive":2,"columnArticles":767,"formTitle":"[297]二叉树的序列化与反序列化","frequency":0.0,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":190464,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5777442562079369,"acs":4979,"articleLive":2,"columnArticles":82,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"lock","submitted":8618,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.504665347840422,"acs":30613,"articleLive":2,"columnArticles":363,"formTitle":"[299]猜数字游戏","frequency":0.0,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":60660,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5169856018974527,"acs":367934,"articleLive":2,"columnArticles":2037,"formTitle":"[300]最长递增子序列","frequency":0.0,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":711691,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.524036886205121,"acs":33585,"articleLive":2,"columnArticles":236,"formTitle":"[301]删除无效的括号","frequency":0.0,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":64089,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6562197092084007,"acs":2031,"articleLive":2,"columnArticles":39,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"lock","submitted":3095,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7266973275881315,"acs":130198,"articleLive":2,"columnArticles":799,"formTitle":"[303]区域和检索 - 数组不可变","frequency":0.0,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":179164,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5477388654958748,"acs":64000,"articleLive":2,"columnArticles":571,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":0.0,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":116844,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.38330539133503927,"acs":4344,"articleLive":2,"columnArticles":65,"formTitle":"[305]岛屿数量 II","frequency":0.0,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"lock","submitted":11333,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3374421273396383,"acs":17055,"articleLive":2,"columnArticles":253,"formTitle":"[306]累加数","frequency":0.0,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":50542,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5394968469371838,"acs":24211,"articleLive":2,"columnArticles":232,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.0,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":44877,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6106931757119828,"acs":2273,"articleLive":2,"columnArticles":43,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"lock","submitted":3722,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.60889848459328,"acs":119296,"articleLive":2,"columnArticles":948,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":0.0,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":195921,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37941691562789737,"acs":22098,"articleLive":2,"columnArticles":214,"formTitle":"[310]最小高度树","frequency":0.0,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":58242,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.761500953996184,"acs":3592,"articleLive":2,"columnArticles":45,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.0,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"lock","submitted":4717,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.683209363246374,"acs":56856,"articleLive":2,"columnArticles":385,"formTitle":"[312]戳气球","frequency":0.0,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":83219,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6284620684375718,"acs":41048,"articleLive":2,"columnArticles":356,"formTitle":"[313]超级丑数","frequency":0.0,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":65315,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5470206489675516,"acs":4636,"articleLive":2,"columnArticles":87,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"lock","submitted":8475,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41788565743276024,"acs":50822,"articleLive":2,"columnArticles":481,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":0.0,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":121617,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4763165246542813,"acs":68199,"articleLive":2,"columnArticles":539,"formTitle":"[316]去除重复字母","frequency":0.0,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":143180,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4840728735889125,"acs":4331,"articleLive":2,"columnArticles":64,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"lock","submitted":8947,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6857785084040662,"acs":20441,"articleLive":2,"columnArticles":181,"formTitle":"[318]最大单词长度乘积","frequency":0.0,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":29807,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5187364370567574,"acs":23187,"articleLive":2,"columnArticles":229,"formTitle":"[319]灯泡开关","frequency":0.0,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":44699,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.677397415552029,"acs":2988,"articleLive":2,"columnArticles":50,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"lock","submitted":4411,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42407307728841465,"acs":26787,"articleLive":2,"columnArticles":232,"formTitle":"[321]拼接最大数","frequency":0.0,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":63166,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44505439364136323,"acs":310429,"articleLive":2,"columnArticles":1840,"formTitle":"[322]零钱兑换","frequency":0.0,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":697508,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.632249182584753,"acs":11022,"articleLive":2,"columnArticles":152,"formTitle":"[323]无向图中连通分量的数目","frequency":0.0,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"lock","submitted":17433,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3785083371554543,"acs":25583,"articleLive":2,"columnArticles":169,"formTitle":"[324]摆动排序 II","frequency":0.0,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"ac","submitted":67589,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5372759447425505,"acs":9412,"articleLive":2,"columnArticles":105,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":0.0,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"lock","submitted":17518,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.5045538820644265,"acs":136612,"articleLive":2,"columnArticles":583,"formTitle":"[326]3的幂","frequency":0.0,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"ac","submitted":270758,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42092040265494235,"acs":24796,"articleLive":2,"columnArticles":206,"formTitle":"[327]区间和的个数","frequency":0.0,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":58909,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6558144220839736,"acs":130189,"articleLive":2,"columnArticles":1073,"formTitle":"[328]奇偶链表","frequency":0.0,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":198515,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4865511875651921,"acs":56908,"articleLive":2,"columnArticles":499,"formTitle":"[329]矩阵中的最长递增路径","frequency":0.0,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":116962,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5337623289403434,"acs":18995,"articleLive":2,"columnArticles":149,"formTitle":"[330]按要求补齐数组","frequency":0.0,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":35587,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799600369870439,"acs":45158,"articleLive":2,"columnArticles":507,"formTitle":"[331]验证二叉树的前序序列化","frequency":0.0,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":94087,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4498430845101995,"acs":40135,"articleLive":2,"columnArticles":331,"formTitle":"[332]重新安排行程","frequency":0.0,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":89220,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4696300657442842,"acs":4786,"articleLive":2,"columnArticles":81,"formTitle":"[333]最大 BST 子树","frequency":0.0,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"lock","submitted":10191,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4119778551813085,"acs":46956,"articleLive":2,"columnArticles":310,"formTitle":"[334]递增的三元子序列","frequency":0.0,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":113977,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3701196663846247,"acs":3062,"articleLive":2,"columnArticles":38,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":8273,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40132149046793764,"acs":22230,"articleLive":2,"columnArticles":193,"formTitle":"[336]回文对","frequency":0.0,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":55392,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6079450580285474,"acs":132163,"articleLive":2,"columnArticles":933,"formTitle":"[337]打家劫舍 III","frequency":0.0,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":217393,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7868570453936308,"acs":161467,"articleLive":2,"columnArticles":1388,"formTitle":"[338]比特位计数","frequency":0.0,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":205205,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8096572537184739,"acs":3756,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"lock","submitted":4639,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49450006179705847,"acs":12003,"articleLive":2,"columnArticles":178,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":0.0,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"lock","submitted":24273,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7270564242012236,"acs":51336,"articleLive":2,"columnArticles":490,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":0.0,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":70608,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5161806491084613,"acs":87744,"articleLive":2,"columnArticles":774,"formTitle":"[342]4的幂","frequency":0.0,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":169987,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6064662875710805,"acs":111984,"articleLive":2,"columnArticles":1063,"formTitle":"[343]整数拆分","frequency":0.0,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":184650,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7693452564244686,"acs":374765,"articleLive":2,"columnArticles":1974,"formTitle":"[344]反转字符串","frequency":0.0,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":487122,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5392645853292378,"acs":109200,"articleLive":2,"columnArticles":1038,"formTitle":"[345]反转字符串中的元音字母","frequency":0.0,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":202498,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060059037238874,"acs":12437,"articleLive":2,"columnArticles":135,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"lock","submitted":17616,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6222896055349905,"acs":205429,"articleLive":2,"columnArticles":1514,"formTitle":"[347]前 K 个高频元素","frequency":0.0,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"ac","submitted":330118,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6000971227388613,"acs":4943,"articleLive":2,"columnArticles":80,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"lock","submitted":8237,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7390844111640572,"acs":217143,"articleLive":2,"columnArticles":1536,"formTitle":"[349]两个数组的交集","frequency":0.0,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":293800,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5503721718623332,"acs":253912,"articleLive":2,"columnArticles":1419,"formTitle":"[350]两个数组的交集 II","frequency":0.0,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":461346,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5903059546002851,"acs":5383,"articleLive":2,"columnArticles":100,"formTitle":"[351]安卓系统手势解锁","frequency":0.0,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"lock","submitted":9119,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.6792921859156772,"acs":20768,"articleLive":2,"columnArticles":344,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"ac","submitted":30573,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4276681356581721,"acs":2232,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":0.0,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"lock","submitted":5219,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45409199598899547,"acs":70644,"articleLive":2,"columnArticles":546,"formTitle":"[354]俄罗斯套娃信封问题","frequency":0.0,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":155572,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4079471810630724,"acs":26816,"articleLive":2,"columnArticles":440,"formTitle":"[355]设计推特","frequency":0.0,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":65734,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35260621988611474,"acs":1610,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"lock","submitted":4566,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5205628612111567,"acs":24860,"articleLive":2,"columnArticles":388,"formTitle":"[357]计算各个位数不同的数字个数","frequency":0.0,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":47756,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35167520693732757,"acs":4461,"articleLive":2,"columnArticles":60,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"lock","submitted":12685,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7262436699434018,"acs":4876,"articleLive":2,"columnArticles":57,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"lock","submitted":6714,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6021730045967405,"acs":2882,"articleLive":2,"columnArticles":63,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"lock","submitted":4786,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5667919371370004,"acs":3318,"articleLive":2,"columnArticles":65,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"lock","submitted":5854,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6911612502587456,"acs":3339,"articleLive":2,"columnArticles":63,"formTitle":"[362]敲击计数器","frequency":0.0,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"lock","submitted":4831,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.489374305812662,"acs":33045,"articleLive":2,"columnArticles":214,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":0.0,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":67525,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7217898832684825,"acs":1855,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"lock","submitted":2570,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36579283956190417,"acs":34033,"articleLive":2,"columnArticles":484,"formTitle":"[365]水壶问题","frequency":0.0,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":93039,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7652282010300124,"acs":4309,"articleLive":2,"columnArticles":122,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"lock","submitted":5631,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4387590742832854,"acs":78451,"articleLive":2,"columnArticles":629,"formTitle":"[367]有效的完全平方数","frequency":0.0,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":178802,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45903146374829,"acs":41944,"articleLive":2,"columnArticles":455,"formTitle":"[368]最大整除子集","frequency":0.0,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":91375,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6180897646414888,"acs":4517,"articleLive":2,"columnArticles":130,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"lock","submitted":7308,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7228489272284893,"acs":3268,"articleLive":2,"columnArticles":48,"formTitle":"[370]区间加法","frequency":0.0,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"lock","submitted":4521,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.6127696302970193,"acs":80934,"articleLive":2,"columnArticles":507,"formTitle":"[371]两整数之和","frequency":0.0,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":132079,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5108637672913481,"acs":14366,"articleLive":2,"columnArticles":136,"formTitle":"[372]超级次方","frequency":0.0,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":28121,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.41639019258779736,"acs":20583,"articleLive":2,"columnArticles":208,"formTitle":"[373]查找和最小的K对数字","frequency":0.0,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":49432,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5155042334581542,"acs":83838,"articleLive":2,"columnArticles":571,"formTitle":"[374]猜数字大小","frequency":0.0,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":162633,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46956493983210446,"acs":14711,"articleLive":2,"columnArticles":124,"formTitle":"[375]猜数字大小 II","frequency":0.0,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":31329,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4646851177970053,"acs":76746,"articleLive":2,"columnArticles":824,"formTitle":"[376]摆动序列","frequency":0.0,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"ac","submitted":165157,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5094465626625873,"acs":65605,"articleLive":2,"columnArticles":556,"formTitle":"[377]组合总和 Ⅳ","frequency":0.0,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":128777,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6391819845627437,"acs":80326,"articleLive":2,"columnArticles":566,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":0.0,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":125670,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6387392778775185,"acs":3202,"articleLive":2,"columnArticles":69,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"lock","submitted":5013,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5034951039954256,"acs":35222,"articleLive":2,"columnArticles":221,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":0.0,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":69955,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4412426553319165,"acs":21177,"articleLive":2,"columnArticles":176,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":47994,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6324428836365071,"acs":16028,"articleLive":2,"columnArticles":126,"formTitle":"[382]链表随机节点","frequency":0.0,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":25343,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.6024740945758936,"acs":71398,"articleLive":2,"columnArticles":784,"formTitle":"[383]赎金信","frequency":0.0,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":118508,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5794819314230379,"acs":52661,"articleLive":2,"columnArticles":200,"formTitle":"[384]打乱数组","frequency":0.0,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":90876,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4180679381559643,"acs":7409,"articleLive":2,"columnArticles":85,"formTitle":"[385]迷你语法分析器","frequency":0.0,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17722,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7499169048726982,"acs":22562,"articleLive":2,"columnArticles":240,"formTitle":"[386]字典序排数","frequency":0.0,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":30086,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5343975385901021,"acs":225100,"articleLive":2,"columnArticles":1223,"formTitle":"[387]字符串中的第一个唯一字符","frequency":0.0,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":421222,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5284384694932782,"acs":6132,"articleLive":2,"columnArticles":111,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":11604,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.691513644261234,"acs":101490,"articleLive":2,"columnArticles":996,"formTitle":"[389]找不同","frequency":0.0,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":146765,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46675409836065573,"acs":7118,"articleLive":2,"columnArticles":97,"formTitle":"[390]消除游戏","frequency":0.0,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":15250,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3585889570552147,"acs":4676,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":13040,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5152818568740584,"acs":148429,"articleLive":2,"columnArticles":1588,"formTitle":"[392]判断子序列","frequency":0.0,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"ac","submitted":288054,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39124323564551267,"acs":11134,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":0.0,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":28458,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5528505987446328,"acs":123221,"articleLive":2,"columnArticles":1313,"formTitle":"[394]字符串解码","frequency":0.0,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":222883,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205721472490618,"acs":52153,"articleLive":2,"columnArticles":431,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":0.0,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":100184,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4292299096750163,"acs":9219,"articleLive":2,"columnArticles":147,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":21478,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37704681526365147,"acs":15681,"articleLive":2,"columnArticles":195,"formTitle":"[397]整数替换","frequency":0.0,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":41589,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6581227436823105,"acs":14584,"articleLive":2,"columnArticles":123,"formTitle":"[398]随机数索引","frequency":0.0,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":22160,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5919978794938686,"acs":42435,"articleLive":2,"columnArticles":531,"formTitle":"[399]除法求值","frequency":0.0,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":71681,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.416991142869368,"acs":19491,"articleLive":2,"columnArticles":201,"formTitle":"[400]第 N 位数字","frequency":0.0,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":46742,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6140115816963779,"acs":54076,"articleLive":2,"columnArticles":658,"formTitle":"[401]二进制手表","frequency":0.0,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":88070,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3272163173802518,"acs":81737,"articleLive":2,"columnArticles":591,"formTitle":"[402]移掉 K 位数字","frequency":0.0,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":249795,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45570546083518654,"acs":46106,"articleLive":2,"columnArticles":463,"formTitle":"[403]青蛙过河","frequency":0.0,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":101175,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5843751972321516,"acs":101849,"articleLive":2,"columnArticles":1134,"formTitle":"[404]左叶子之和","frequency":0.0,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":174287,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5618062779171511,"acs":45908,"articleLive":2,"columnArticles":463,"formTitle":"[405]数字转换为十六进制数","frequency":0.0,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"ac","submitted":81715,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7376858112231199,"acs":120889,"articleLive":2,"columnArticles":800,"formTitle":"[406]根据身高重建队列","frequency":0.0,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":163876,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4834421749803159,"acs":10438,"articleLive":2,"columnArticles":130,"formTitle":"[407]接雨水 II","frequency":0.0,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":21591,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3245165997811018,"acs":3558,"articleLive":2,"columnArticles":83,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"lock","submitted":10964,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5560607030799769,"acs":95524,"articleLive":2,"columnArticles":1339,"formTitle":"[409]最长回文串","frequency":0.0,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":171787,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5649384056935434,"acs":39531,"articleLive":2,"columnArticles":320,"formTitle":"[410]分割数组的最大值","frequency":0.0,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":69974,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.5030572540300167,"acs":905,"articleLive":2,"columnArticles":22,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"lock","submitted":1799,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.7081031563167977,"acs":102032,"articleLive":2,"columnArticles":590,"formTitle":"[412]Fizz Buzz","frequency":0.0,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"ac","submitted":144092,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6881904996728276,"acs":72569,"articleLive":2,"columnArticles":940,"formTitle":"[413]等差数列划分","frequency":0.0,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":105449,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.39351982542691094,"acs":87823,"articleLive":2,"columnArticles":1143,"formTitle":"[414]第三大的数","frequency":0.0,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":223173,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5385595170560973,"acs":150948,"articleLive":2,"columnArticles":1094,"formTitle":"[415]字符串相加","frequency":0.0,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":280281,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5078461679901628,"acs":176765,"articleLive":2,"columnArticles":1002,"formTitle":"[416]分割等和子集","frequency":0.0,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":348068,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4811496312633538,"acs":27924,"articleLive":2,"columnArticles":330,"formTitle":"[417]太平洋大西洋水流问题","frequency":0.0,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":58036,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3608960632515236,"acs":2191,"articleLive":2,"columnArticles":33,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"lock","submitted":6071,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7553425326657711,"acs":12371,"articleLive":2,"columnArticles":158,"formTitle":"[419]甲板上的战舰","frequency":0.0,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":16378,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20870544090056284,"acs":2781,"articleLive":2,"columnArticles":53,"formTitle":"[420]强密码检验器","frequency":0.0,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":13325,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6221176646315278,"acs":33320,"articleLive":2,"columnArticles":307,"formTitle":"[421]数组中两个数的最大异或值","frequency":0.0,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":53559,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42717622080679407,"acs":2012,"articleLive":2,"columnArticles":49,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"lock","submitted":4710,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5690024070607114,"acs":8510,"articleLive":2,"columnArticles":138,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14956,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.531596458002764,"acs":51929,"articleLive":2,"columnArticles":451,"formTitle":"[424]替换后的最长重复字符","frequency":0.0,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"ac","submitted":97685,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6162464985994398,"acs":1540,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"lock","submitted":2499,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6693333333333333,"acs":7028,"articleLive":2,"columnArticles":115,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":0.0,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"lock","submitted":10500,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6136296296296296,"acs":4142,"articleLive":2,"columnArticles":67,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6750,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6534605037906579,"acs":2672,"articleLive":2,"columnArticles":54,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"lock","submitted":4089,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.7001425256487273,"acs":59440,"articleLive":2,"columnArticles":478,"formTitle":"[429]N 叉树的层序遍历","frequency":0.0,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":84897,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5877895129390142,"acs":44133,"articleLive":2,"columnArticles":674,"formTitle":"[430]扁平化多级双向链表","frequency":0.0,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":75083,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.733500417710944,"acs":878,"articleLive":2,"columnArticles":29,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"lock","submitted":1197,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3791830009658542,"acs":6674,"articleLive":2,"columnArticles":86,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.0,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":17601,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5321744944008022,"acs":15920,"articleLive":2,"columnArticles":215,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":29915,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.39903703376068644,"acs":63152,"articleLive":2,"columnArticles":876,"formTitle":"[434]字符串中的单词数","frequency":0.0,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"ac","submitted":158261,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5075772445068851,"acs":98270,"articleLive":2,"columnArticles":863,"formTitle":"[435]无重叠区间","frequency":0.0,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"ac","submitted":193606,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4881669771009094,"acs":8911,"articleLive":2,"columnArticles":146,"formTitle":"[436]寻找右区间","frequency":0.0,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":18254,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5743012358346236,"acs":125378,"articleLive":2,"columnArticles":1031,"formTitle":"[437]路径总和 III","frequency":0.0,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"ac","submitted":218314,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5187966297916131,"acs":96795,"articleLive":2,"columnArticles":851,"formTitle":"[438]找到字符串中所有字母异位词","frequency":0.0,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":186576,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5909737751575523,"acs":2907,"articleLive":2,"columnArticles":68,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"lock","submitted":4919,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3802524364914523,"acs":16660,"articleLive":2,"columnArticles":124,"formTitle":"[440]字典序的第K小数字","frequency":0.0,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":43813,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.45910363813275745,"acs":77381,"articleLive":2,"columnArticles":746,"formTitle":"[441]排列硬币","frequency":0.0,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":168548,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6975205041324931,"acs":44054,"articleLive":2,"columnArticles":445,"formTitle":"[442]数组中重复的数据","frequency":0.0,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":63158,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4772823134416494,"acs":56578,"articleLive":2,"columnArticles":693,"formTitle":"[443]压缩字符串","frequency":0.0,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"ac","submitted":118542,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2518827228193317,"acs":3445,"articleLive":2,"columnArticles":54,"formTitle":"[444]序列重建","frequency":0.0,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"lock","submitted":13677,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5885243124188174,"acs":83368,"articleLive":2,"columnArticles":940,"formTitle":"[445]两数相加 II","frequency":0.0,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":141656,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515596435100548,"acs":19309,"articleLive":2,"columnArticles":173,"formTitle":"[446]等差数列划分 II - 子序列","frequency":0.0,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":35008,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6629254605343419,"acs":48906,"articleLive":2,"columnArticles":378,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"ac","submitted":73773,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6489199651556582,"acs":139303,"articleLive":2,"columnArticles":1099,"formTitle":"[448]找到所有数组中消失的数字","frequency":0.0,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":214669,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5582998276852383,"acs":15552,"articleLive":2,"columnArticles":137,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":27856,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48691964531585613,"acs":61887,"articleLive":2,"columnArticles":627,"formTitle":"[450]删除二叉搜索树中的节点","frequency":0.0,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":127099,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7117407224660451,"acs":82221,"articleLive":2,"columnArticles":955,"formTitle":"[451]根据字符出现频率排序","frequency":0.0,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":115521,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5089775070193433,"acs":98252,"articleLive":2,"columnArticles":855,"formTitle":"[452]用最少数量的箭引爆气球","frequency":0.0,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":193038,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5563870553538109,"acs":27732,"articleLive":2,"columnArticles":314,"formTitle":"[453]最小操作次数使数组元素相等","frequency":0.0,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":49843,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6035411738923441,"acs":79866,"articleLive":2,"columnArticles":502,"formTitle":"[454]四数相加 II","frequency":0.0,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"ac","submitted":132329,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5768786429727779,"acs":154296,"articleLive":2,"columnArticles":1269,"formTitle":"[455]分发饼干","frequency":0.0,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"ac","submitted":267467,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36255247478361075,"acs":57259,"articleLive":2,"columnArticles":463,"formTitle":"[456]132 模式","frequency":0.0,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":157933,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4361525454435654,"acs":28889,"articleLive":2,"columnArticles":332,"formTitle":"[457]环形数组是否存在循环","frequency":0.0,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":66236,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6120743868475429,"acs":6813,"articleLive":2,"columnArticles":65,"formTitle":"[458]可怜的小猪","frequency":0.0,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":11131,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5113117568512748,"acs":80414,"articleLive":2,"columnArticles":647,"formTitle":"[459]重复的子字符串","frequency":0.0,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":157270,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4375822294889318,"acs":34257,"articleLive":2,"columnArticles":405,"formTitle":"[460]LFU 缓存","frequency":0.0,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":78287,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8123009951430934,"acs":170926,"articleLive":2,"columnArticles":1363,"formTitle":"[461]汉明距离","frequency":0.0,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":210422,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6053750637863582,"acs":14236,"articleLive":2,"columnArticles":132,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":0.0,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":23516,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7086516528476773,"acs":78289,"articleLive":2,"columnArticles":944,"formTitle":"[463]岛屿的周长","frequency":0.0,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":110476,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35623498166181866,"acs":11267,"articleLive":2,"columnArticles":112,"formTitle":"[464]我能赢吗","frequency":0.0,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":31628,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5300887865833608,"acs":1612,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"lock","submitted":3041,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.373956326268465,"acs":11645,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":31140,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44148244473342,"acs":8827,"articleLive":2,"columnArticles":114,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.0,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":19994,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.25163623322674156,"acs":25260,"articleLive":2,"columnArticles":298,"formTitle":"[468]验证IP地址","frequency":0.0,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":100383,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43475750577367206,"acs":1506,"articleLive":2,"columnArticles":21,"formTitle":"[469]凸多边形","frequency":0.0,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"lock","submitted":3464,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5470541075327511,"acs":64141,"articleLive":2,"columnArticles":337,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":0.0,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"ac","submitted":117248,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6199347927340475,"acs":1331,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.0,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"lock","submitted":2147,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.3987288643722269,"acs":6650,"articleLive":2,"columnArticles":81,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":16678,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42025507269373424,"acs":21188,"articleLive":2,"columnArticles":182,"formTitle":"[473]火柴拼正方形","frequency":0.0,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":50417,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6123089300080451,"acs":76110,"articleLive":2,"columnArticles":607,"formTitle":"[474]一和零","frequency":0.0,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":124300,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3346537085655505,"acs":21797,"articleLive":2,"columnArticles":243,"formTitle":"[475]供暖器","frequency":0.0,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":65133,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011574627826951,"acs":38103,"articleLive":2,"columnArticles":489,"formTitle":"[476]数字的补数","frequency":0.0,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":54343,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038501448063313,"acs":38990,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":0.0,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":64569,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4378106199319906,"acs":6695,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":0.0,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":15292,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41971792785462436,"acs":3095,"articleLive":2,"columnArticles":25,"formTitle":"[479]最大回文数乘积","frequency":0.0,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"ac","submitted":7374,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.447961203184723,"acs":29651,"articleLive":2,"columnArticles":405,"formTitle":"[480]滑动窗口中位数","frequency":0.0,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":66191,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5413211323991993,"acs":5679,"articleLive":2,"columnArticles":97,"formTitle":"[481]神奇字符串","frequency":0.0,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":10491,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4722022830944497,"acs":40786,"articleLive":2,"columnArticles":434,"formTitle":"[482]密钥格式化","frequency":0.0,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"ac","submitted":86374,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5908073874625507,"acs":15579,"articleLive":2,"columnArticles":117,"formTitle":"[483]最小好进制","frequency":0.0,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":26369,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6365600691443388,"acs":1473,"articleLive":2,"columnArticles":34,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"lock","submitted":2314,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6071561812755263,"acs":123685,"articleLive":2,"columnArticles":998,"formTitle":"[485]最大连续 1 的个数","frequency":0.0,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":203712,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5865510636152838,"acs":46544,"articleLive":2,"columnArticles":403,"formTitle":"[486]预测赢家","frequency":0.0,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":79352,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.578395181659219,"acs":5954,"articleLive":2,"columnArticles":115,"formTitle":"[487]最大连续1的个数 II","frequency":0.0,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"lock","submitted":10294,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3879925364943475,"acs":3535,"articleLive":2,"columnArticles":73,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":9111,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7204585537918872,"acs":1634,"articleLive":2,"columnArticles":24,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"lock","submitted":2268,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4841523080195703,"acs":6828,"articleLive":2,"columnArticles":82,"formTitle":"[490]迷宫","frequency":0.0,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"lock","submitted":14103,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.54575608869502,"acs":48044,"articleLive":2,"columnArticles":407,"formTitle":"[491]递增子序列","frequency":0.0,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":88032,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5523149835946044,"acs":19695,"articleLive":2,"columnArticles":185,"formTitle":"[492]构造矩形","frequency":0.0,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":35659,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3459284572705656,"acs":26623,"articleLive":2,"columnArticles":267,"formTitle":"[493]翻转对","frequency":0.0,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":76961,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4931959778796346,"acs":152148,"articleLive":2,"columnArticles":1050,"formTitle":"[494]目标和","frequency":0.0,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":308494,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5429978650885801,"acs":28995,"articleLive":2,"columnArticles":441,"formTitle":"[495]提莫攻击","frequency":0.0,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":53398,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873893162054291,"acs":104024,"articleLive":2,"columnArticles":1073,"formTitle":"[496]下一个更大元素 I","frequency":0.0,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":151332,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40399675938428303,"acs":2992,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":7406,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4691587989228198,"acs":44077,"articleLive":2,"columnArticles":456,"formTitle":"[498]对角线遍历","frequency":0.0,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":93949,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.37250491987630024,"acs":2650,"articleLive":2,"columnArticles":49,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"lock","submitted":7114,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7095242464559343,"acs":30931,"articleLive":2,"columnArticles":482,"formTitle":"[500]键盘行","frequency":0.0,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":43594,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5132352031665532,"acs":66388,"articleLive":2,"columnArticles":549,"formTitle":"[501]二叉搜索树中的众数","frequency":0.0,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":129352,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.44127557160048136,"acs":29336,"articleLive":2,"columnArticles":357,"formTitle":"[502]IPO","frequency":0.0,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"ac","submitted":66480,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6359812941284347,"acs":104037,"articleLive":2,"columnArticles":987,"formTitle":"[503]下一个更大元素 II","frequency":0.0,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":163585,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5038251011093605,"acs":31019,"articleLive":2,"columnArticles":327,"formTitle":"[504]七进制数","frequency":0.0,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":61567,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4840666381888082,"acs":5666,"articleLive":2,"columnArticles":69,"formTitle":"[505]迷宫 II","frequency":0.0,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"lock","submitted":11705,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5638006713142267,"acs":21836,"articleLive":2,"columnArticles":295,"formTitle":"[506]相对名次","frequency":0.0,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":38730,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4124490418480823,"acs":29745,"articleLive":2,"columnArticles":234,"formTitle":"[507]完美数","frequency":0.0,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":72118,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6776144015390958,"acs":14793,"articleLive":2,"columnArticles":212,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.0,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":21831,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6743839943077353,"acs":248321,"articleLive":2,"columnArticles":1506,"formTitle":"[509]斐波那契数","frequency":0.0,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":368219,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6075785582255083,"acs":3287,"articleLive":2,"columnArticles":55,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.0,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"lock","submitted":5410,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7323183079576989,"acs":19528,"articleLive":2,"columnArticles":108,"formTitle":"[511]游戏玩法分析 I","frequency":0.0,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"lock","submitted":26666,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5376938835235586,"acs":18373,"articleLive":2,"columnArticles":150,"formTitle":"[512]游戏玩法分析 II","frequency":0.0,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"lock","submitted":34170,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310458855616636,"acs":51731,"articleLive":2,"columnArticles":577,"formTitle":"[513]找树左下角的值","frequency":0.0,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":70763,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5005197373424942,"acs":19742,"articleLive":2,"columnArticles":244,"formTitle":"[514]自由之路","frequency":0.0,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":39443,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6449042751082358,"acs":39176,"articleLive":2,"columnArticles":427,"formTitle":"[515]在每个树行中找最大值","frequency":0.0,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":60747,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6543744938664108,"acs":87270,"articleLive":2,"columnArticles":629,"formTitle":"[516]最长回文子序列","frequency":0.0,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":133364,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.5099223697109397,"acs":19246,"articleLive":2,"columnArticles":167,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"ac","submitted":37743,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.657648564373389,"acs":109461,"articleLive":2,"columnArticles":690,"formTitle":"[518]零钱兑换 II","frequency":0.0,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":166443,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39796215429403203,"acs":2734,"articleLive":2,"columnArticles":39,"formTitle":"[519]随机翻转矩阵","frequency":0.0,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6870,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5638978081809298,"acs":40392,"articleLive":2,"columnArticles":651,"formTitle":"[520]检测大写字母","frequency":0.0,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":71630,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7133811263912522,"acs":25574,"articleLive":2,"columnArticles":254,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.0,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":35849,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.361964483321916,"acs":6869,"articleLive":2,"columnArticles":106,"formTitle":"[522]最长特殊序列 II","frequency":0.0,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":18977,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27469057341235165,"acs":69155,"articleLive":2,"columnArticles":607,"formTitle":"[523]连续的子数组和","frequency":0.0,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":251756,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.49572603038057383,"acs":72840,"articleLive":2,"columnArticles":758,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":0.0,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"ac","submitted":146936,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5360739640085851,"acs":45458,"articleLive":2,"columnArticles":518,"formTitle":"[525]连续数组","frequency":0.0,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":84798,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7349541122484998,"acs":33314,"articleLive":2,"columnArticles":381,"formTitle":"[526]优美的排列","frequency":0.0,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":45328,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5789168838690993,"acs":1999,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"lock","submitted":3453,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47701953001668845,"acs":31728,"articleLive":2,"columnArticles":258,"formTitle":"[528]按权重随机选择","frequency":0.0,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":66513,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6451064518740387,"acs":39845,"articleLive":2,"columnArticles":463,"formTitle":"[529]扫雷游戏","frequency":0.0,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":61765,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6211166035728811,"acs":79411,"articleLive":2,"columnArticles":641,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.0,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":127852,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6586795380106878,"acs":3821,"articleLive":2,"columnArticles":78,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"lock","submitted":5801,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3751430499721236,"acs":25569,"articleLive":2,"columnArticles":278,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.0,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":68158,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5261813537675607,"acs":1648,"articleLive":2,"columnArticles":34,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"lock","submitted":3132,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.675198587819947,"acs":14535,"articleLive":2,"columnArticles":139,"formTitle":"[534]游戏玩法分析 III","frequency":0.0,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"lock","submitted":21527,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8424900662251655,"acs":15902,"articleLive":2,"columnArticles":103,"formTitle":"[535]TinyURL 的加密与解密","frequency":0.0,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18875,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5383544964341624,"acs":3095,"articleLive":2,"columnArticles":50,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"lock","submitted":5749,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7127369632366302,"acs":11768,"articleLive":2,"columnArticles":174,"formTitle":"[537]复数乘法","frequency":0.0,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":16511,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.7014378885541019,"acs":110346,"articleLive":2,"columnArticles":841,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":157314,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5980445867925324,"acs":14191,"articleLive":2,"columnArticles":190,"formTitle":"[539]最小时间差","frequency":0.0,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":23729,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5822799922398484,"acs":39018,"articleLive":2,"columnArticles":410,"formTitle":"[540]有序数组中的单一元素","frequency":0.0,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":67009,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6070574063990232,"acs":73579,"articleLive":2,"columnArticles":810,"formTitle":"[541]反转字符串 II","frequency":0.0,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":121206,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45789518289860554,"acs":70237,"articleLive":2,"columnArticles":650,"formTitle":"[542]01 矩阵","frequency":0.0,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":153391,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5528611546737664,"acs":151589,"articleLive":2,"columnArticles":1245,"formTitle":"[543]二叉树的直径","frequency":0.0,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":274190,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7111523015137473,"acs":2302,"articleLive":2,"columnArticles":53,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"lock","submitted":3237,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4187909686817189,"acs":3450,"articleLive":2,"columnArticles":79,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"lock","submitted":8238,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6285013714570692,"acs":15123,"articleLive":2,"columnArticles":121,"formTitle":"[546]移除盒子","frequency":0.0,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":24062,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6188284786477872,"acs":164458,"articleLive":2,"columnArticles":1152,"formTitle":"[547]省份数量","frequency":0.0,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":265757,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35471863367637396,"acs":1620,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"lock","submitted":4567,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48148969186433166,"acs":2172,"articleLive":2,"columnArticles":52,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"lock","submitted":4511,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4382026311293354,"acs":12824,"articleLive":2,"columnArticles":180,"formTitle":"[550]游戏玩法分析 IV","frequency":0.0,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"lock","submitted":29265,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5677026754213091,"acs":59053,"articleLive":2,"columnArticles":759,"formTitle":"[551]学生出勤记录 I","frequency":0.0,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":104021,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5776913473542687,"acs":24062,"articleLive":2,"columnArticles":287,"formTitle":"[552]学生出勤记录 II","frequency":0.0,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":41652,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6055493444455737,"acs":5958,"articleLive":2,"columnArticles":87,"formTitle":"[553]最优除法","frequency":0.0,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9839,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5032119914346895,"acs":46060,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":0.0,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":91532,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3429368029739777,"acs":1107,"articleLive":2,"columnArticles":23,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"lock","submitted":3228,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32584369056570395,"acs":14734,"articleLive":2,"columnArticles":215,"formTitle":"[556]下一个更大元素 III","frequency":0.0,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":45218,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7451169749727965,"acs":164343,"articleLive":2,"columnArticles":1352,"formTitle":"[557]反转字符串中的单词 III","frequency":0.0,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":220560,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5047454702329595,"acs":2925,"articleLive":2,"columnArticles":37,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5795,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.728513041013041,"acs":61673,"articleLive":2,"columnArticles":550,"formTitle":"[559]N 叉树的最大深度","frequency":0.0,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":84656,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4466572416693929,"acs":152914,"articleLive":2,"columnArticles":939,"formTitle":"[560]和为 K 的子数组","frequency":0.0,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":342352,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7748996310531677,"acs":90523,"articleLive":2,"columnArticles":754,"formTitle":"[561]数组拆分 I","frequency":0.0,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"ac","submitted":116819,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4667540514775977,"acs":3917,"articleLive":2,"columnArticles":64,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"lock","submitted":8392,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6063550566817446,"acs":32574,"articleLive":2,"columnArticles":326,"formTitle":"[563]二叉树的坡度","frequency":0.0,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":53721,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17961573944085676,"acs":4478,"articleLive":2,"columnArticles":77,"formTitle":"[564]寻找最近的回文数","frequency":0.0,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":24931,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6108543565825737,"acs":14407,"articleLive":2,"columnArticles":139,"formTitle":"[565]数组嵌套","frequency":0.0,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":23585,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.688312323354816,"acs":70382,"articleLive":2,"columnArticles":652,"formTitle":"[566]重塑矩阵","frequency":0.0,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":102253,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.432075836303517,"acs":120741,"articleLive":2,"columnArticles":1096,"formTitle":"[567]字符串的排列","frequency":0.0,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":279444,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5080782312925171,"acs":1195,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"lock","submitted":2352,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5652519291874716,"acs":9962,"articleLive":2,"columnArticles":157,"formTitle":"[569]员工薪水中位数","frequency":0.0,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"lock","submitted":17624,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6609627297654108,"acs":13017,"articleLive":2,"columnArticles":114,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.0,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"lock","submitted":19694,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4877063700134628,"acs":6883,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.0,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"lock","submitted":14113,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4732633544307314,"acs":85168,"articleLive":2,"columnArticles":743,"formTitle":"[572]另一棵树的子树","frequency":0.0,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":179959,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6642949547218628,"acs":1027,"articleLive":2,"columnArticles":31,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"lock","submitted":1546,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.647965131012113,"acs":12785,"articleLive":2,"columnArticles":114,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"lock","submitted":19731,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6836194346233222,"acs":42731,"articleLive":2,"columnArticles":441,"formTitle":"[575]分糖果","frequency":0.0,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":62507,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46854385425891454,"acs":25925,"articleLive":2,"columnArticles":282,"formTitle":"[576]出界的路径数","frequency":0.0,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":55331,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7014067671938212,"acs":15257,"articleLive":2,"columnArticles":86,"formTitle":"[577]员工奖金","frequency":0.0,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"lock","submitted":21752,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4960602606670301,"acs":10010,"articleLive":2,"columnArticles":113,"formTitle":"[578]查询回答率最高的问题","frequency":0.0,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"lock","submitted":20179,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4104704893929847,"acs":7817,"articleLive":2,"columnArticles":132,"formTitle":"[579]查询员工的累计薪水","frequency":0.0,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"lock","submitted":19044,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5234906243560684,"acs":10162,"articleLive":2,"columnArticles":81,"formTitle":"[580]统计各专业学生人数","frequency":0.0,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"lock","submitted":19412,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40507814562006894,"acs":99759,"articleLive":2,"columnArticles":864,"formTitle":"[581]最短无序连续子数组","frequency":0.0,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":246271,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4085374387683695,"acs":8757,"articleLive":2,"columnArticles":134,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"lock","submitted":21435,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.6194937601011021,"acs":50980,"articleLive":2,"columnArticles":493,"formTitle":"[583]两个字符串的删除操作","frequency":0.0,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":82293,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744017807456872,"acs":13916,"articleLive":2,"columnArticles":62,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"lock","submitted":17970,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5949659959335343,"acs":8486,"articleLive":2,"columnArticles":102,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"lock","submitted":14263,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7459257009818807,"acs":14738,"articleLive":2,"columnArticles":88,"formTitle":"[586]订单最多的客户","frequency":0.0,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"lock","submitted":19758,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38497150997151,"acs":2162,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":0.0,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5616,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42583595312946554,"acs":1490,"articleLive":2,"columnArticles":29,"formTitle":"[588]设计内存文件系统","frequency":0.0,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"lock","submitted":3499,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.745300775466158,"acs":89094,"articleLive":2,"columnArticles":567,"formTitle":"[589]N 叉树的前序遍历","frequency":0.0,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":119541,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7613384155167423,"acs":63118,"articleLive":2,"columnArticles":466,"formTitle":"[590]N 叉树的后序遍历","frequency":0.0,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":82904,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34002271866717154,"acs":1796,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5282,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5225776648573738,"acs":4525,"articleLive":2,"columnArticles":111,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8659,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4427416815366852,"acs":8436,"articleLive":2,"columnArticles":136,"formTitle":"[593]有效的正方形","frequency":0.0,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":19054,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5184333818807139,"acs":29545,"articleLive":2,"columnArticles":272,"formTitle":"[594]最长和谐子序列","frequency":0.0,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":56989,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7968715272189395,"acs":103975,"articleLive":2,"columnArticles":239,"formTitle":"[595]大的国家","frequency":0.0,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":130479,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4211390203993701,"acs":82104,"articleLive":2,"columnArticles":290,"formTitle":"[596]超过5名学生的课","frequency":0.0,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":194957,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4417514672972174,"acs":10462,"articleLive":2,"columnArticles":84,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.0,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"lock","submitted":23683,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5180871993399759,"acs":16327,"articleLive":2,"columnArticles":211,"formTitle":"[598]范围求和 II","frequency":0.0,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":31514,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222136735314642,"acs":29186,"articleLive":2,"columnArticles":276,"formTitle":"[599]两个列表的最小索引总和","frequency":0.0,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":55889,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48147778581585055,"acs":19301,"articleLive":2,"columnArticles":230,"formTitle":"[600]不含连续1的非负整数","frequency":0.0,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"ac","submitted":40087,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.5011566242308843,"acs":31847,"articleLive":2,"columnArticles":377,"formTitle":"[601]体育馆的人流量","frequency":0.0,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":63547,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.629478702137475,"acs":8187,"articleLive":2,"columnArticles":88,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.0,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"lock","submitted":13006,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6710402509147935,"acs":12837,"articleLive":2,"columnArticles":113,"formTitle":"[603]连续空余座位","frequency":0.0,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"lock","submitted":19130,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3740295326533719,"acs":2457,"articleLive":2,"columnArticles":56,"formTitle":"[604]迭代压缩字符串","frequency":0.0,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"lock","submitted":6569,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3338185788372305,"acs":110070,"articleLive":2,"columnArticles":1268,"formTitle":"[605]种花问题","frequency":0.0,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":329730,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.568921114148738,"acs":28718,"articleLive":2,"columnArticles":315,"formTitle":"[606]根据二叉树创建字符串","frequency":0.0,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":50478,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6597454427785568,"acs":12233,"articleLive":2,"columnArticles":86,"formTitle":"[607]销售员","frequency":0.0,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"lock","submitted":18542,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6560259474223284,"acs":7686,"articleLive":2,"columnArticles":102,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"lock","submitted":11716,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4866999478429327,"acs":6532,"articleLive":2,"columnArticles":101,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":13421,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6647228492600953,"acs":10601,"articleLive":2,"columnArticles":73,"formTitle":"[610]判断三角形","frequency":0.0,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"lock","submitted":15948,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.532007673036405,"acs":50753,"articleLive":2,"columnArticles":396,"formTitle":"[611]有效三角形的个数","frequency":0.0,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":95399,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6683498647430117,"acs":7412,"articleLive":2,"columnArticles":65,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"lock","submitted":11090,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171257651641625,"acs":11747,"articleLive":2,"columnArticles":81,"formTitle":"[613]直线上的最近距离","frequency":0.0,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"lock","submitted":14376,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3465717654986523,"acs":8229,"articleLive":2,"columnArticles":68,"formTitle":"[614]二级关注者","frequency":0.0,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"lock","submitted":23744,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42489883361104497,"acs":5355,"articleLive":2,"columnArticles":92,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"lock","submitted":12603,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4619437127408845,"acs":3332,"articleLive":2,"columnArticles":56,"formTitle":"[616]给字符串添加加粗标签","frequency":0.0,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"lock","submitted":7213,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7879426887746259,"acs":190939,"articleLive":2,"columnArticles":1261,"formTitle":"[617]合并二叉树","frequency":0.0,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":242326,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6197799284104468,"acs":4675,"articleLive":2,"columnArticles":46,"formTitle":"[618]学生地理信息报告","frequency":0.0,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"lock","submitted":7543,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4662516782619309,"acs":11460,"articleLive":2,"columnArticles":80,"formTitle":"[619]只出现一次的最大数字","frequency":0.0,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"lock","submitted":24579,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7735635973951035,"acs":93841,"articleLive":2,"columnArticles":310,"formTitle":"[620]有趣的电影","frequency":0.0,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":121310,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5712267620094809,"acs":78446,"articleLive":2,"columnArticles":501,"formTitle":"[621]任务调度器","frequency":0.0,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":137329,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4375278108002205,"acs":65879,"articleLive":2,"columnArticles":424,"formTitle":"[622]设计循环队列","frequency":0.0,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":150571,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5459065623000049,"acs":11089,"articleLive":2,"columnArticles":191,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":20313,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4202676864244742,"acs":2198,"articleLive":2,"columnArticles":49,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"lock","submitted":5230,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34295439074200135,"acs":2519,"articleLive":2,"columnArticles":54,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"lock","submitted":7345,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6841134943117946,"acs":45642,"articleLive":2,"columnArticles":356,"formTitle":"[626]换座位","frequency":0.0,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":66717,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8080606619376447,"acs":85892,"articleLive":2,"columnArticles":343,"formTitle":"[627]变更性别","frequency":0.0,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":106294,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5247976434092361,"acs":80526,"articleLive":2,"columnArticles":766,"formTitle":"[628]三个数的最大乘积","frequency":0.0,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":153442,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4065310911224091,"acs":4158,"articleLive":2,"columnArticles":58,"formTitle":"[629]K个逆序对数组","frequency":0.0,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":10228,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3681914710440223,"acs":6415,"articleLive":2,"columnArticles":76,"formTitle":"[630]课程表 III","frequency":0.0,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":17423,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28874734607218683,"acs":1088,"articleLive":2,"columnArticles":35,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"lock","submitted":3768,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5981651376146789,"acs":18908,"articleLive":2,"columnArticles":239,"formTitle":"[632]最小区间","frequency":0.0,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":31610,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39772119824396734,"acs":94491,"articleLive":2,"columnArticles":770,"formTitle":"[633]平方数之和","frequency":0.0,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":237581,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44125242091672046,"acs":1367,"articleLive":2,"columnArticles":21,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"lock","submitted":3098,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5522751895991332,"acs":4078,"articleLive":2,"columnArticles":68,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"lock","submitted":7384,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5527169051878354,"acs":9887,"articleLive":2,"columnArticles":113,"formTitle":"[636]函数的独占时间","frequency":0.0,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":17888,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6900096957722774,"acs":75436,"articleLive":2,"columnArticles":654,"formTitle":"[637]二叉树的层平均值","frequency":0.0,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":109326,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.592348488749292,"acs":11504,"articleLive":2,"columnArticles":119,"formTitle":"[638]大礼包","frequency":0.0,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":19421,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.37678504672897195,"acs":20158,"articleLive":2,"columnArticles":273,"formTitle":"[639]解码方法 II","frequency":0.0,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"ac","submitted":53500,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42513170731707317,"acs":10894,"articleLive":2,"columnArticles":213,"formTitle":"[640]求解方程","frequency":0.0,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":25625,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5330486721295291,"acs":21597,"articleLive":2,"columnArticles":242,"formTitle":"[641]设计循环双端队列","frequency":0.0,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":40516,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4899741909866984,"acs":2468,"articleLive":2,"columnArticles":56,"formTitle":"[642]设计搜索自动补全系统","frequency":0.0,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"lock","submitted":5037,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4505678304379603,"acs":64114,"articleLive":2,"columnArticles":574,"formTitle":"[643]子数组最大平均数 I","frequency":0.0,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":142296,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.40223854494578526,"acs":1150,"articleLive":2,"columnArticles":24,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"lock","submitted":2859,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4337197168755736,"acs":68997,"articleLive":2,"columnArticles":697,"formTitle":"[645]错误的集合","frequency":0.0,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":159082,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.577874967841523,"acs":22462,"articleLive":2,"columnArticles":202,"formTitle":"[646]最长数对链","frequency":0.0,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":38870,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6567167304460719,"acs":125448,"articleLive":2,"columnArticles":923,"formTitle":"[647]回文子串","frequency":0.0,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":191023,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5847111932992495,"acs":21501,"articleLive":2,"columnArticles":281,"formTitle":"[648]单词替换","frequency":0.0,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":36772,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4817956758541013,"acs":29192,"articleLive":2,"columnArticles":309,"formTitle":"[649]Dota2 参议院","frequency":0.0,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":60590,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5670817156378506,"acs":49369,"articleLive":2,"columnArticles":656,"formTitle":"[650]只有两个键的键盘","frequency":0.0,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"ac","submitted":87058,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5839618285362475,"acs":3794,"articleLive":2,"columnArticles":63,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"lock","submitted":6497,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5713195901312481,"acs":32952,"articleLive":2,"columnArticles":238,"formTitle":"[652]寻找重复的子树","frequency":0.0,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"ac","submitted":57677,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5982892512250336,"acs":41757,"articleLive":2,"columnArticles":396,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":69794,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8108989785550029,"acs":60652,"articleLive":2,"columnArticles":614,"formTitle":"[654]最大二叉树","frequency":0.0,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":74796,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5982125999118887,"acs":9505,"articleLive":2,"columnArticles":141,"formTitle":"[655]输出二叉树","frequency":0.0,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15889,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3081669691470054,"acs":849,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"lock","submitted":2755,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7833887990871922,"acs":82389,"articleLive":2,"columnArticles":628,"formTitle":"[657]机器人能否返回原点","frequency":0.0,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":105170,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45473347906507483,"acs":27043,"articleLive":2,"columnArticles":241,"formTitle":"[658]找到 K 个最接近的元素","frequency":0.0,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":59470,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5420443293472466,"acs":28466,"articleLive":2,"columnArticles":261,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":52516,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6560150375939849,"acs":698,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":0.0,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"lock","submitted":1064,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5609411289508229,"acs":16665,"articleLive":2,"columnArticles":214,"formTitle":"[661]图片平滑器","frequency":0.0,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":29709,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40943741209563994,"acs":29111,"articleLive":2,"columnArticles":276,"formTitle":"[662]二叉树最大宽度","frequency":0.0,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":71100,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46457305995328313,"acs":1790,"articleLive":2,"columnArticles":36,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"lock","submitted":3853,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.653687978934288,"acs":22094,"articleLive":2,"columnArticles":190,"formTitle":"[664]奇怪的打印机","frequency":0.0,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33799,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27080416245226174,"acs":75234,"articleLive":2,"columnArticles":943,"formTitle":"[665]非递减数列","frequency":0.0,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":277817,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6187154896832316,"acs":2129,"articleLive":2,"columnArticles":76,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"lock","submitted":3441,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6240484697840609,"acs":8034,"articleLive":2,"columnArticles":121,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12874,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5081421169504071,"acs":6865,"articleLive":2,"columnArticles":68,"formTitle":"[668]乘法表中第k小的数","frequency":0.0,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":13510,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6658309715863673,"acs":36650,"articleLive":2,"columnArticles":309,"formTitle":"[669]修剪二叉搜索树","frequency":0.0,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":55044,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4521790341578327,"acs":19195,"articleLive":2,"columnArticles":286,"formTitle":"[670]最大交换","frequency":0.0,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":42450,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4858971105391002,"acs":53610,"articleLive":2,"columnArticles":670,"formTitle":"[671]二叉树中第二小的节点","frequency":0.0,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":110332,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5472481827622014,"acs":3689,"articleLive":2,"columnArticles":42,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.0,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6741,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.4354603596873235,"acs":47797,"articleLive":2,"columnArticles":418,"formTitle":"[673]最长递增子序列的个数","frequency":0.0,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":109762,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4971168130001651,"acs":93365,"articleLive":2,"columnArticles":774,"formTitle":"[674]最长连续递增序列","frequency":0.0,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":187813,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40107245978275813,"acs":2917,"articleLive":2,"columnArticles":48,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":7273,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5885947046843177,"acs":7225,"articleLive":2,"columnArticles":131,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":12275,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.617875807579935,"acs":15015,"articleLive":2,"columnArticles":252,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":24301,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.385570866489052,"acs":43706,"articleLive":2,"columnArticles":479,"formTitle":"[678]有效的括号字符串","frequency":0.0,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"ac","submitted":113354,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.541444044822353,"acs":26044,"articleLive":2,"columnArticles":261,"formTitle":"[679]24 点游戏","frequency":0.0,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":48101,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016527328526666,"acs":87294,"articleLive":2,"columnArticles":828,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":0.0,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":217337,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5030935808197989,"acs":2602,"articleLive":2,"columnArticles":63,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"lock","submitted":5172,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6950692887558116,"acs":46195,"articleLive":2,"columnArticles":511,"formTitle":"[682]棒球比赛","frequency":0.0,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":66461,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4343768228660315,"acs":2234,"articleLive":2,"columnArticles":51,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"lock","submitted":5143,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6658056539832875,"acs":60316,"articleLive":2,"columnArticles":609,"formTitle":"[684]冗余连接","frequency":0.0,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":90591,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43110768043226555,"acs":20106,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":0.0,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":46638,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35622783824222676,"acs":17380,"articleLive":2,"columnArticles":196,"formTitle":"[686]重复叠加字符串匹配","frequency":0.0,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":48789,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4414499316178414,"acs":38411,"articleLive":2,"columnArticles":273,"formTitle":"[687]最长同值路径","frequency":0.0,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":87011,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5108068707612347,"acs":8059,"articleLive":2,"columnArticles":106,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.0,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15777,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4875959834613113,"acs":3302,"articleLive":2,"columnArticles":70,"formTitle":"[689]三个无重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6772,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.647875948958165,"acs":56154,"articleLive":2,"columnArticles":569,"formTitle":"[690]员工的重要性","frequency":0.0,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":86674,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49216300940438873,"acs":3611,"articleLive":2,"columnArticles":48,"formTitle":"[691]贴纸拼词","frequency":0.0,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":7337,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5777713952643627,"acs":68396,"articleLive":2,"columnArticles":742,"formTitle":"[692]前K个高频单词","frequency":0.0,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":118379,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097759768990731,"acs":26185,"articleLive":2,"columnArticles":285,"formTitle":"[693]交替位二进制数","frequency":0.0,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":42942,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5357469611815449,"acs":4099,"articleLive":2,"columnArticles":79,"formTitle":"[694]不同岛屿的数量","frequency":0.0,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"lock","submitted":7651,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6651952307272231,"acs":131553,"articleLive":2,"columnArticles":1305,"formTitle":"[695]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":197766,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6319463702238995,"acs":52413,"articleLive":2,"columnArticles":476,"formTitle":"[696]计数二进制子串","frequency":0.0,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":82939,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6047770325920696,"acs":66820,"articleLive":2,"columnArticles":850,"formTitle":"[697]数组的度","frequency":0.0,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":110487,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4467810777165214,"acs":30147,"articleLive":2,"columnArticles":217,"formTitle":"[698]划分为k个相等的子集","frequency":0.0,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":67476,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47750686813186816,"acs":2781,"articleLive":2,"columnArticles":41,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5824,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7608030907825832,"acs":83101,"articleLive":2,"columnArticles":527,"formTitle":"[700]二叉搜索树中的搜索","frequency":0.0,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":109228,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7232430705027586,"acs":76948,"articleLive":2,"columnArticles":570,"formTitle":"[701]二叉搜索树中的插入操作","frequency":0.0,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":106393,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7423011844331642,"acs":4387,"articleLive":2,"columnArticles":77,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"lock","submitted":5910,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5130750789926217,"acs":60568,"articleLive":2,"columnArticles":554,"formTitle":"[703]数据流中的第 K 大元素","frequency":0.0,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":118049,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5551717312798528,"acs":297320,"articleLive":2,"columnArticles":1470,"formTitle":"[704]二分查找","frequency":0.0,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":535546,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6450806613178657,"acs":67618,"articleLive":2,"columnArticles":434,"formTitle":"[705]设计哈希集合","frequency":0.0,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":104821,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6442931614719662,"acs":58583,"articleLive":2,"columnArticles":391,"formTitle":"[706]设计哈希映射","frequency":0.0,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":90926,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3223052770985134,"acs":64979,"articleLive":2,"columnArticles":447,"formTitle":"[707]设计链表","frequency":0.0,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":201607,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.340435041716329,"acs":2285,"articleLive":2,"columnArticles":51,"formTitle":"[708]循环有序列表的插入","frequency":0.0,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"lock","submitted":6712,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7587208371149431,"acs":71058,"articleLive":2,"columnArticles":511,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":93655,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35296877094223295,"acs":5267,"articleLive":2,"columnArticles":65,"formTitle":"[710]黑名单中的随机数","frequency":0.0,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":14922,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5600624024960998,"acs":718,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"lock","submitted":1282,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6724229074889868,"acs":15264,"articleLive":2,"columnArticles":173,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":0.0,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":22700,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.41491359556175805,"acs":24082,"articleLive":2,"columnArticles":223,"formTitle":"[713]乘积小于K的子数组","frequency":0.0,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":58041,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7218663638895435,"acs":101088,"articleLive":2,"columnArticles":674,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":0.0,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":140037,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.41007525725694977,"acs":2670,"articleLive":2,"columnArticles":46,"formTitle":"[715]Range 模块","frequency":0.0,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":6511,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.46088939566704673,"acs":4042,"articleLive":2,"columnArticles":75,"formTitle":"[716]最大栈","frequency":0.0,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"lock","submitted":8770,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5115604140466287,"acs":31728,"articleLive":2,"columnArticles":381,"formTitle":"[717]1比特与2比特字符","frequency":0.0,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":62022,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5644950989152089,"acs":85289,"articleLive":2,"columnArticles":592,"formTitle":"[718]最长重复子数组","frequency":0.0,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":151089,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3696570576540755,"acs":8925,"articleLive":2,"columnArticles":87,"formTitle":"[719]找出第 k 小的距离对","frequency":0.0,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":24144,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48471361327305773,"acs":20801,"articleLive":2,"columnArticles":277,"formTitle":"[720]词典中最长的单词","frequency":0.0,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":42914,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.469287111743496,"acs":29024,"articleLive":2,"columnArticles":336,"formTitle":"[721]账户合并","frequency":0.0,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":61847,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32197767145135564,"acs":5047,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":0.0,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":15675,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7207403375068046,"acs":1324,"articleLive":2,"columnArticles":41,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"lock","submitted":1837,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4630994955830153,"acs":138815,"articleLive":2,"columnArticles":868,"formTitle":"[724]寻找数组的中心下标","frequency":0.0,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":299752,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.6086632000597119,"acs":48928,"articleLive":2,"columnArticles":625,"formTitle":"[725]分隔链表","frequency":0.0,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":80386,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5524905183312263,"acs":21851,"articleLive":2,"columnArticles":398,"formTitle":"[726]原子的数量","frequency":0.0,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":39550,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4099734599804442,"acs":2935,"articleLive":2,"columnArticles":50,"formTitle":"[727]最小窗口子序列","frequency":0.0,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"lock","submitted":7159,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7601957585644372,"acs":34018,"articleLive":2,"columnArticles":311,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":44749,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5140775500123488,"acs":8326,"articleLive":2,"columnArticles":93,"formTitle":"[729]我的日程安排表 I","frequency":0.0,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":16196,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.49055900621118015,"acs":3949,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":0.0,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":8050,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5049258012220975,"acs":4049,"articleLive":2,"columnArticles":43,"formTitle":"[731]我的日程安排表 II","frequency":0.0,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":8019,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6096037129596573,"acs":3415,"articleLive":2,"columnArticles":54,"formTitle":"[732]我的日程安排表 III","frequency":0.0,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5602,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805627263119597,"acs":67019,"articleLive":2,"columnArticles":573,"formTitle":"[733]图像渲染","frequency":0.0,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":115438,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.48067576949780144,"acs":2077,"articleLive":2,"columnArticles":37,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"lock","submitted":4321,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4071109063333909,"acs":21206,"articleLive":2,"columnArticles":265,"formTitle":"[735]行星碰撞","frequency":0.0,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":52089,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.46354475400118555,"acs":1564,"articleLive":2,"columnArticles":46,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3374,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46230559183188885,"acs":3894,"articleLive":2,"columnArticles":66,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"lock","submitted":8423,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5015824696189993,"acs":41522,"articleLive":2,"columnArticles":590,"formTitle":"[738]单调递增的数字","frequency":0.0,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"ac","submitted":82782,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6802104267268612,"acs":214252,"articleLive":2,"columnArticles":1527,"formTitle":"[739]每日温度","frequency":0.0,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":314979,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6294337425396671,"acs":51888,"articleLive":2,"columnArticles":600,"formTitle":"[740]删除并获得点数","frequency":0.0,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":82436,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3673675511890552,"acs":4001,"articleLive":2,"columnArticles":46,"formTitle":"[741]摘樱桃","frequency":0.0,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10891,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4950176792028287,"acs":1540,"articleLive":2,"columnArticles":45,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"lock","submitted":3111,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5204440149209245,"acs":57622,"articleLive":2,"columnArticles":527,"formTitle":"[743]网络延迟时间","frequency":0.0,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":110717,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45904116437975667,"acs":41316,"articleLive":2,"columnArticles":366,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":0.0,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":90005,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39290586630286495,"acs":2880,"articleLive":2,"columnArticles":55,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":7330,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5886318726025805,"acs":136728,"articleLive":2,"columnArticles":1309,"formTitle":"[746]使用最小花费爬楼梯","frequency":0.0,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":232281,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4168389847567113,"acs":45558,"articleLive":2,"columnArticles":405,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.0,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":109294,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.6017444646793827,"acs":12556,"articleLive":2,"columnArticles":176,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":20866,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.49890988372093026,"acs":1373,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2752,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7214234363767074,"acs":2007,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":0.0,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"lock","submitted":2782,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5027007562117393,"acs":1396,"articleLive":2,"columnArticles":28,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"lock","submitted":2777,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5303038329108176,"acs":70077,"articleLive":2,"columnArticles":592,"formTitle":"[752]打开转盘锁","frequency":0.0,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":132145,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5912980156562898,"acs":3248,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.0,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5493,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.43087384878989077,"acs":8047,"articleLive":2,"columnArticles":95,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18676,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.4992337164750958,"acs":1303,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"lock","submitted":2610,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5648499693815064,"acs":4612,"articleLive":2,"columnArticles":68,"formTitle":"[756]金字塔转换矩阵","frequency":0.0,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":8165,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4194871794871795,"acs":2454,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":0.0,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5850,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.46235851539878914,"acs":3513,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":0.0,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"lock","submitted":7598,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6617647058823529,"acs":1890,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":0.0,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"lock","submitted":2856,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8388877096157928,"acs":3952,"articleLive":2,"columnArticles":90,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"lock","submitted":4711,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5906662918189486,"acs":2101,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":0.0,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3557,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.7004463936095231,"acs":17888,"articleLive":2,"columnArticles":143,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":25538,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7632595584624934,"acs":82387,"articleLive":2,"columnArticles":991,"formTitle":"[763]划分字母区间","frequency":0.0,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":107941,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49340711090181305,"acs":4191,"articleLive":2,"columnArticles":54,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8494,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6653153255745098,"acs":29212,"articleLive":2,"columnArticles":442,"formTitle":"[765]情侣牵手","frequency":0.0,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":43907,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080917051343045,"acs":55069,"articleLive":2,"columnArticles":636,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":77771,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47793469718259546,"acs":40136,"articleLive":2,"columnArticles":498,"formTitle":"[767]重构字符串","frequency":0.0,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":83978,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5063945834116983,"acs":5385,"articleLive":2,"columnArticles":80,"formTitle":"[768]最多能完成排序的块 II","frequency":0.0,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":10634,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5876264627721572,"acs":12604,"articleLive":2,"columnArticles":150,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":21449,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.554368029739777,"acs":1193,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2152,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8512571964713002,"acs":153331,"articleLive":2,"columnArticles":1120,"formTitle":"[771]宝石与石头","frequency":0.0,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"ac","submitted":180123,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.49383207321925987,"acs":6205,"articleLive":2,"columnArticles":125,"formTitle":"[772]基本计算器 III","frequency":0.0,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"lock","submitted":12565,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7131494743257657,"acs":23402,"articleLive":2,"columnArticles":334,"formTitle":"[773]滑动谜题","frequency":0.0,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":32815,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5907660020986358,"acs":1126,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"lock","submitted":1906,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.45873545593938847,"acs":5086,"articleLive":2,"columnArticles":81,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":11087,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5687898089171974,"acs":1786,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"lock","submitted":3140,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3236823855755895,"acs":5601,"articleLive":2,"columnArticles":61,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.0,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":17304,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.594160914907552,"acs":23587,"articleLive":2,"columnArticles":347,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.0,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":39698,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43641631789541463,"acs":18978,"articleLive":2,"columnArticles":236,"formTitle":"[779]第K个语法符号","frequency":0.0,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":43486,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28567706071397553,"acs":3289,"articleLive":2,"columnArticles":50,"formTitle":"[780]到达终点","frequency":0.0,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":11513,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6169776385130323,"acs":43318,"articleLive":2,"columnArticles":663,"formTitle":"[781]森林中的兔子","frequency":0.0,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":70210,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4280045351473923,"acs":1510,"articleLive":2,"columnArticles":31,"formTitle":"[782]变为棋盘","frequency":0.0,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3528,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5959949467358645,"acs":69822,"articleLive":2,"columnArticles":673,"formTitle":"[783]二叉搜索树节点最小距离","frequency":0.0,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":117152,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6870783039306716,"acs":44399,"articleLive":2,"columnArticles":490,"formTitle":"[784]字母大小写全排列","frequency":0.0,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"ac","submitted":64620,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5125577403639852,"acs":40612,"articleLive":2,"columnArticles":406,"formTitle":"[785]判断二分图","frequency":0.0,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":79234,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.47341014846000445,"acs":4273,"articleLive":2,"columnArticles":58,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":9026,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3911240531524724,"acs":42444,"articleLive":2,"columnArticles":402,"formTitle":"[787]K 站中转内最便宜的航班","frequency":0.0,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"ac","submitted":108518,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6081454210768523,"acs":18501,"articleLive":2,"columnArticles":191,"formTitle":"[788]旋转数字","frequency":0.0,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":30422,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6922390132601435,"acs":20934,"articleLive":2,"columnArticles":295,"formTitle":"[789]逃脱阻碍者","frequency":0.0,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":30241,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4495909667012329,"acs":3902,"articleLive":2,"columnArticles":67,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8679,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6947700905059832,"acs":11438,"articleLive":2,"columnArticles":201,"formTitle":"[791]自定义字符串排序","frequency":0.0,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":16463,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.46482884899038707,"acs":9139,"articleLive":2,"columnArticles":99,"formTitle":"[792]匹配子序列的单词数","frequency":0.0,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":19661,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3932208660499106,"acs":5058,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.0,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":12863,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34083764792899407,"acs":7373,"articleLive":2,"columnArticles":105,"formTitle":"[794]有效的井字游戏","frequency":0.0,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":21632,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5329634033557934,"acs":8068,"articleLive":2,"columnArticles":89,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":15138,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5307198891446707,"acs":23746,"articleLive":2,"columnArticles":282,"formTitle":"[796]旋转字符串","frequency":0.0,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":44743,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7929595354745055,"acs":43700,"articleLive":2,"columnArticles":542,"formTitle":"[797]所有可能的路径","frequency":0.0,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":55110,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.46461949265687585,"acs":1392,"articleLive":2,"columnArticles":35,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2996,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40875297003142486,"acs":5333,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":0.0,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":13047,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7059686888454012,"acs":1443,"articleLive":2,"columnArticles":36,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"lock","submitted":2044,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4194217256076489,"acs":7282,"articleLive":2,"columnArticles":88,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":17362,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5764425827166872,"acs":31238,"articleLive":2,"columnArticles":333,"formTitle":"[802]找到最终的安全状态","frequency":0.0,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":54191,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48203980685431636,"acs":12279,"articleLive":2,"columnArticles":125,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":25473,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7713948265179678,"acs":39841,"articleLive":2,"columnArticles":401,"formTitle":"[804]唯一摩尔斯密码词","frequency":0.0,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":51648,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2908296943231441,"acs":2664,"articleLive":2,"columnArticles":41,"formTitle":"[805]数组的均值分割","frequency":0.0,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":9160,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.656658407423602,"acs":13516,"articleLive":2,"columnArticles":152,"formTitle":"[806]写字符串需要的行数","frequency":0.0,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":20583,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8455863647926736,"acs":16620,"articleLive":2,"columnArticles":220,"formTitle":"[807]保持城市天际线","frequency":0.0,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":19655,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4808111644134322,"acs":4410,"articleLive":2,"columnArticles":42,"formTitle":"[808]分汤","frequency":0.0,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":9172,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4194976585781183,"acs":4927,"articleLive":2,"columnArticles":91,"formTitle":"[809]情感丰富的文字","frequency":0.0,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11745,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.733480370533745,"acs":16628,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":0.0,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22670,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7052030913012222,"acs":15695,"articleLive":2,"columnArticles":200,"formTitle":"[811]子域名访问计数","frequency":0.0,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":22256,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.630613425925926,"acs":10897,"articleLive":2,"columnArticles":100,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":17280,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5504010064475546,"acs":7000,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":0.0,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":12718,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6991734030268036,"acs":23007,"articleLive":2,"columnArticles":358,"formTitle":"[814]二叉树剪枝","frequency":0.0,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":32906,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43349259049315736,"acs":26766,"articleLive":2,"columnArticles":317,"formTitle":"[815]公交路线","frequency":0.0,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":61745,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5114090131203651,"acs":3586,"articleLive":2,"columnArticles":65,"formTitle":"[816]模糊坐标","frequency":0.0,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":7012,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912001742539752,"acs":13571,"articleLive":2,"columnArticles":166,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22955,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4333845608227923,"acs":3666,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8459,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42147859028814144,"acs":22029,"articleLive":2,"columnArticles":250,"formTitle":"[819]最常见的单词","frequency":0.0,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":52266,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5077474060229983,"acs":55150,"articleLive":2,"columnArticles":603,"formTitle":"[820]单词的压缩编码","frequency":0.0,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":108617,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6926934097421203,"acs":25142,"articleLive":2,"columnArticles":339,"formTitle":"[821]字符的最短距离","frequency":0.0,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":36296,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5024398745207389,"acs":2883,"articleLive":2,"columnArticles":41,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5738,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42834325540874113,"acs":2950,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":0.0,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6887,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6156536947966769,"acs":16896,"articleLive":2,"columnArticles":239,"formTitle":"[824]山羊拉丁文","frequency":0.0,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":27444,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3927628878071667,"acs":6697,"articleLive":2,"columnArticles":91,"formTitle":"[825]适龄的朋友","frequency":0.0,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":17051,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3747947851279575,"acs":7762,"articleLive":2,"columnArticles":115,"formTitle":"[826]安排工作以达到最大收益","frequency":0.0,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":20710,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.389607076033339,"acs":9162,"articleLive":2,"columnArticles":183,"formTitle":"[827]最大人工岛","frequency":0.0,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":23516,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49200791596894505,"acs":3232,"articleLive":2,"columnArticles":53,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6569,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3660680647996986,"acs":8745,"articleLive":2,"columnArticles":101,"formTitle":"[829]连续整数求和","frequency":0.0,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":23889,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431760983301831,"acs":52014,"articleLive":2,"columnArticles":582,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":95759,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40557626843896905,"acs":7506,"articleLive":2,"columnArticles":73,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":18507,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7958493224329385,"acs":85861,"articleLive":2,"columnArticles":919,"formTitle":"[832]翻转图像","frequency":0.0,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":107886,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4306052784947132,"acs":5172,"articleLive":2,"columnArticles":78,"formTitle":"[833]字符串中的查找与替换","frequency":0.0,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":12011,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5283493999606531,"acs":13428,"articleLive":2,"columnArticles":132,"formTitle":"[834]树中距离之和","frequency":0.0,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":25415,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5744284954811271,"acs":4322,"articleLive":2,"columnArticles":49,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7524,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47952155659001255,"acs":37805,"articleLive":2,"columnArticles":657,"formTitle":"[836]矩形重叠","frequency":0.0,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":78839,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3959438504855954,"acs":19406,"articleLive":2,"columnArticles":245,"formTitle":"[837]新21点","frequency":0.0,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":49012,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5005917159763313,"acs":7191,"articleLive":2,"columnArticles":124,"formTitle":"[838]推多米诺","frequency":0.0,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":14365,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747578057046879,"acs":19163,"articleLive":2,"columnArticles":269,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":33341,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3600286875448243,"acs":9036,"articleLive":2,"columnArticles":114,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":25098,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.657946949476817,"acs":55711,"articleLive":2,"columnArticles":546,"formTitle":"[841]钥匙和房间","frequency":0.0,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":84674,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48807519158733975,"acs":28405,"articleLive":2,"columnArticles":321,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":0.0,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":58198,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3798207495926127,"acs":2797,"articleLive":2,"columnArticles":35,"formTitle":"[843]猜猜这个单词","frequency":0.0,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":7364,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5123636774594564,"acs":90673,"articleLive":2,"columnArticles":991,"formTitle":"[844]比较含退格的字符串","frequency":0.0,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":176970,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42128427691176307,"acs":37809,"articleLive":2,"columnArticles":556,"formTitle":"[845]数组中的最长山脉","frequency":0.0,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":89747,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5116823798090999,"acs":8738,"articleLive":2,"columnArticles":123,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":17077,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6809438970294149,"acs":18728,"articleLive":2,"columnArticles":158,"formTitle":"[847]访问所有节点的最短路径","frequency":0.0,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":27503,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44921875,"acs":9085,"articleLive":2,"columnArticles":97,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":20224,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42688484396236975,"acs":16018,"articleLive":2,"columnArticles":187,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":37523,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44880294659300185,"acs":2437,"articleLive":2,"columnArticles":42,"formTitle":"[850]矩形面积 II","frequency":0.0,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5430,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4819664854067251,"acs":4343,"articleLive":2,"columnArticles":72,"formTitle":"[851]喧闹和富有","frequency":0.0,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":9011,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7156570589070026,"acs":85735,"articleLive":2,"columnArticles":742,"formTitle":"[852]山脉数组的峰顶索引","frequency":0.0,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":119799,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38422410891274267,"acs":10273,"articleLive":2,"columnArticles":123,"formTitle":"[853]车队","frequency":0.0,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":26737,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35972701858246997,"acs":4375,"articleLive":2,"columnArticles":67,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":12162,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4086345381526104,"acs":4884,"articleLive":2,"columnArticles":58,"formTitle":"[855]考场就座","frequency":0.0,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":11952,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6270336485089768,"acs":16380,"articleLive":2,"columnArticles":218,"formTitle":"[856]括号的分数","frequency":0.0,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":26123,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.466728280961183,"acs":3030,"articleLive":2,"columnArticles":47,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":0.0,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6492,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5557046979865772,"acs":2898,"articleLive":2,"columnArticles":49,"formTitle":"[858]镜面反射","frequency":0.0,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":5215,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30226461100262175,"acs":28016,"articleLive":2,"columnArticles":364,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":92687,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5870481144343302,"acs":90288,"articleLive":2,"columnArticles":776,"formTitle":"[860]柠檬水找零","frequency":0.0,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"ac","submitted":153800,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8085673977170706,"acs":31522,"articleLive":2,"columnArticles":441,"formTitle":"[861]翻转矩阵后的得分","frequency":0.0,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"ac","submitted":38985,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.19243621078483464,"acs":16298,"articleLive":2,"columnArticles":129,"formTitle":"[862]和至少为 K 的最短子数组","frequency":0.0,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":84693,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6044718844336807,"acs":35442,"articleLive":2,"columnArticles":564,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":0.0,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":58633,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4564924367230792,"acs":3048,"articleLive":2,"columnArticles":44,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6677,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6582710314291936,"acs":9069,"articleLive":2,"columnArticles":131,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13777,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22473924867756492,"acs":7520,"articleLive":2,"columnArticles":85,"formTitle":"[866]回文素数","frequency":0.0,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":33461,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6701758029345751,"acs":83904,"articleLive":2,"columnArticles":753,"formTitle":"[867]转置矩阵","frequency":0.0,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":125197,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6245907879710697,"acs":16408,"articleLive":2,"columnArticles":237,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":26270,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5507739411464535,"acs":6476,"articleLive":2,"columnArticles":96,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.0,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11758,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42973552537526805,"acs":15030,"articleLive":2,"columnArticles":192,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":34975,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34267187332067495,"acs":9565,"articleLive":2,"columnArticles":128,"formTitle":"[871]最低加油次数","frequency":0.0,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":27913,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.652099538456573,"acs":60612,"articleLive":2,"columnArticles":723,"formTitle":"[872]叶子相似的树","frequency":0.0,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":92949,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.511721231983413,"acs":15302,"articleLive":2,"columnArticles":113,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":0.0,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":29903,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.415950870996227,"acs":20726,"articleLive":2,"columnArticles":229,"formTitle":"[874]模拟行走机器人","frequency":0.0,"frontendQuestionId":"874","leaf":true,"level":2,"nodeType":"def","questionId":"906","status":"","submitted":49828,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.479611733242411,"acs":45013,"articleLive":2,"columnArticles":355,"formTitle":"[875]爱吃香蕉的珂珂","frequency":0.0,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":93853,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7063783159265339,"acs":154071,"articleLive":2,"columnArticles":1657,"formTitle":"[876]链表的中间结点","frequency":0.0,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":218114,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7573396579813585,"acs":68334,"articleLive":2,"columnArticles":485,"formTitle":"[877]石子游戏","frequency":0.0,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":90229,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2813317175840296,"acs":4411,"articleLive":2,"columnArticles":62,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15679,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5544279017052187,"acs":21524,"articleLive":2,"columnArticles":181,"formTitle":"[879]盈利计划","frequency":0.0,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":38822,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2528963221974133,"acs":6003,"articleLive":2,"columnArticles":78,"formTitle":"[880]索引处的解码字符串","frequency":0.0,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23737,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5378184804178737,"acs":47157,"articleLive":2,"columnArticles":574,"formTitle":"[881]救生艇","frequency":0.0,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"ac","submitted":87682,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4837662337662338,"acs":1788,"articleLive":2,"columnArticles":32,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3696,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6893590148405431,"acs":10916,"articleLive":2,"columnArticles":111,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15835,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6617095345928955,"acs":19578,"articleLive":2,"columnArticles":255,"formTitle":"[884]两句话中的不常见单词","frequency":0.0,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":29587,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6923874407582938,"acs":4675,"articleLive":2,"columnArticles":71,"formTitle":"[885]螺旋矩阵 III","frequency":0.0,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6752,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42679035978991803,"acs":8695,"articleLive":2,"columnArticles":116,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":20373,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29142963775573677,"acs":51537,"articleLive":2,"columnArticles":338,"formTitle":"[887]鸡蛋掉落","frequency":0.0,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":176842,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6405968191506805,"acs":54698,"articleLive":2,"columnArticles":457,"formTitle":"[888]公平的糖果棒交换","frequency":0.0,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":85386,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6763709046667246,"acs":15566,"articleLive":2,"columnArticles":148,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":0.0,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":23014,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7268096294470463,"acs":8846,"articleLive":2,"columnArticles":121,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":12171,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.33021374927787406,"acs":2858,"articleLive":2,"columnArticles":39,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8655,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6385782135743834,"acs":33344,"articleLive":2,"columnArticles":682,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":52216,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.72504036598493,"acs":10777,"articleLive":2,"columnArticles":105,"formTitle":"[893]特殊等价字符串组","frequency":0.0,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14864,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.774862040624633,"acs":13199,"articleLive":2,"columnArticles":122,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":17034,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5464895635673624,"acs":7200,"articleLive":2,"columnArticles":83,"formTitle":"[895]最大频率栈","frequency":0.0,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":13175,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867659775174907,"acs":59714,"articleLive":2,"columnArticles":718,"formTitle":"[896]单调数列","frequency":0.0,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":101768,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7439050598151818,"acs":62308,"articleLive":2,"columnArticles":711,"formTitle":"[897]递增顺序搜索树","frequency":0.0,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":83758,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3379620942015388,"acs":5403,"articleLive":2,"columnArticles":37,"formTitle":"[898]子数组按位或操作","frequency":0.0,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15987,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5366351799846821,"acs":4204,"articleLive":2,"columnArticles":47,"formTitle":"[899]有序队列","frequency":0.0,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7834,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4939636363636364,"acs":3396,"articleLive":2,"columnArticles":50,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6875,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5462088698140201,"acs":19090,"articleLive":2,"columnArticles":233,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":34950,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3291014663911032,"acs":3344,"articleLive":2,"columnArticles":78,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":10161,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5311428055605705,"acs":2942,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":0.0,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5539,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4533055338371992,"acs":20872,"articleLive":2,"columnArticles":290,"formTitle":"[904]水果成篮","frequency":0.0,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":46044,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7004927884615385,"acs":58281,"articleLive":2,"columnArticles":605,"formTitle":"[905]按奇偶排序数组","frequency":0.0,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":83200,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27744209466263847,"acs":2204,"articleLive":2,"columnArticles":39,"formTitle":"[906]超级回文数","frequency":0.0,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7944,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31776376114924004,"acs":11436,"articleLive":2,"columnArticles":128,"formTitle":"[907]子数组的最小值之和","frequency":0.0,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":35989,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986040609137056,"acs":20919,"articleLive":2,"columnArticles":192,"formTitle":"[908]最小差值 I","frequency":0.0,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":29944,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4595923905362241,"acs":16259,"articleLive":2,"columnArticles":193,"formTitle":"[909]蛇梯棋","frequency":0.0,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":35377,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31931605919823747,"acs":6667,"articleLive":2,"columnArticles":69,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20879,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42671439336850037,"acs":4530,"articleLive":2,"columnArticles":69,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":10616,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5601230054393275,"acs":232418,"articleLive":2,"columnArticles":1068,"formTitle":"[912]排序数组","frequency":0.0,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":414941,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40008361204013376,"acs":1914,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.0,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4784,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.388759597878572,"acs":49112,"articleLive":2,"columnArticles":619,"formTitle":"[914]卡牌分组","frequency":0.0,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":126330,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4693755898862451,"acs":9449,"articleLive":2,"columnArticles":115,"formTitle":"[915]分割数组","frequency":0.0,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":20131,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44212707182320443,"acs":6402,"articleLive":2,"columnArticles":76,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14480,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5702477742801414,"acs":29528,"articleLive":2,"columnArticles":436,"formTitle":"[917]仅仅反转字母","frequency":0.0,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":51781,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35772220913404906,"acs":21258,"articleLive":2,"columnArticles":228,"formTitle":"[918]环形子数组的最大和","frequency":0.0,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":59426,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6340893149403788,"acs":5424,"articleLive":2,"columnArticles":102,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":8554,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.4840961986035687,"acs":1872,"articleLive":2,"columnArticles":20,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3867,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7380894124226642,"acs":21116,"articleLive":2,"columnArticles":313,"formTitle":"[921]使括号有效的最少添加","frequency":0.0,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":28609,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7139449177729345,"acs":90082,"articleLive":2,"columnArticles":829,"formTitle":"[922]按奇偶排序数组 II","frequency":0.0,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":126175,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33878365981328584,"acs":6278,"articleLive":2,"columnArticles":83,"formTitle":"[923]三数之和的多种可能","frequency":0.0,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":18531,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35888819274363504,"acs":6301,"articleLive":2,"columnArticles":94,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":17557,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3876357112187941,"acs":50557,"articleLive":2,"columnArticles":679,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":130424,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.523058066493029,"acs":6828,"articleLive":2,"columnArticles":124,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.0,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":13054,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33733294312749973,"acs":3458,"articleLive":2,"columnArticles":69,"formTitle":"[927]三等分","frequency":0.0,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":10251,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.41980685476235563,"acs":2217,"articleLive":2,"columnArticles":42,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5281,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6442478318462422,"acs":25777,"articleLive":2,"columnArticles":233,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":40011,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.544986070180524,"acs":33842,"articleLive":2,"columnArticles":343,"formTitle":"[930]和相同的二元子数组","frequency":0.0,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":62097,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6655470098885575,"acs":21201,"articleLive":2,"columnArticles":272,"formTitle":"[931]下降路径最小和","frequency":0.0,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":31855,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6328779197884531,"acs":8616,"articleLive":2,"columnArticles":83,"formTitle":"[932]漂亮数组","frequency":0.0,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":13614,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7255230793802907,"acs":36340,"articleLive":2,"columnArticles":314,"formTitle":"[933]最近的请求次数","frequency":0.0,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":50088,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47337219050660706,"acs":23715,"articleLive":2,"columnArticles":268,"formTitle":"[934]最短的桥","frequency":0.0,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":50098,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4749013844844922,"acs":6140,"articleLive":2,"columnArticles":80,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12929,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37878420925163475,"acs":1564,"articleLive":2,"columnArticles":25,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":4129,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5871425792647345,"acs":12074,"articleLive":2,"columnArticles":128,"formTitle":"[937]重新排列日志文件","frequency":0.0,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":20564,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8186997206233801,"acs":97291,"articleLive":2,"columnArticles":803,"formTitle":"[938]二叉搜索树的范围和","frequency":0.0,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":118836,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4539500953328359,"acs":5476,"articleLive":2,"columnArticles":63,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":12063,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4214507859124149,"acs":5014,"articleLive":2,"columnArticles":66,"formTitle":"[940]不同的子序列 II","frequency":0.0,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"notac","submitted":11897,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3926659309475012,"acs":62267,"articleLive":2,"columnArticles":616,"formTitle":"[941]有效的山脉数组","frequency":0.0,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":158575,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7304485012395763,"acs":22687,"articleLive":2,"columnArticles":214,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":31059,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4710453747806468,"acs":1879,"articleLive":2,"columnArticles":42,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3989,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.68959715256431,"acs":21312,"articleLive":2,"columnArticles":181,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30905,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48613108691185536,"acs":35490,"articleLive":2,"columnArticles":537,"formTitle":"[945]使数组唯一的最小增量","frequency":0.0,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":73005,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6245891161431701,"acs":27362,"articleLive":2,"columnArticles":301,"formTitle":"[946]验证栈序列","frequency":0.0,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":43808,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6124997066347485,"acs":26098,"articleLive":2,"columnArticles":338,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":42609,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3915991495719129,"acs":6815,"articleLive":2,"columnArticles":97,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":17403,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.37104172179588957,"acs":8413,"articleLive":2,"columnArticles":119,"formTitle":"[949]给定数字能组成的最大时间","frequency":0.0,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":22674,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7748328745576091,"acs":9852,"articleLive":2,"columnArticles":147,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.0,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12715,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.664029975020816,"acs":11165,"articleLive":2,"columnArticles":168,"formTitle":"[951]翻转等价二叉树","frequency":0.0,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":16814,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3524842946887493,"acs":3086,"articleLive":2,"columnArticles":59,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8755,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5535124941065536,"acs":14088,"articleLive":2,"columnArticles":170,"formTitle":"[953]验证外星语词典","frequency":0.0,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":25452,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.30104556273376404,"acs":7083,"articleLive":2,"columnArticles":106,"formTitle":"[954]二倍数对数组","frequency":0.0,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":23528,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3294703669818034,"acs":3241,"articleLive":2,"columnArticles":51,"formTitle":"[955]删列造序 II","frequency":0.0,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9837,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43796646836127634,"acs":4049,"articleLive":2,"columnArticles":52,"formTitle":"[956]最高的广告牌","frequency":0.0,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":9245,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36098859315589354,"acs":14241,"articleLive":2,"columnArticles":140,"formTitle":"[957]N 天后的牢房","frequency":0.0,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":39450,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5362685415416274,"acs":25018,"articleLive":2,"columnArticles":232,"formTitle":"[958]二叉树的完全性检验","frequency":0.0,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":46652,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7427470534904805,"acs":19662,"articleLive":2,"columnArticles":305,"formTitle":"[959]由斜杠划分区域","frequency":0.0,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26472,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5548797345866741,"acs":2007,"articleLive":2,"columnArticles":33,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3617,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768656853556793,"acs":36833,"articleLive":2,"columnArticles":305,"formTitle":"[961]重复 N 次的元素","frequency":0.0,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":54417,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4432709023518221,"acs":13514,"articleLive":2,"columnArticles":134,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":30487,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.503966679888933,"acs":2541,"articleLive":2,"columnArticles":33,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":5042,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.43215339233038347,"acs":1465,"articleLive":2,"columnArticles":27,"formTitle":"[964]表示数字的最少运算符","frequency":0.0,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3390,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.683807799901267,"acs":33244,"articleLive":2,"columnArticles":394,"formTitle":"[965]单值二叉树","frequency":0.0,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":48616,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4040800313848568,"acs":3090,"articleLive":2,"columnArticles":50,"formTitle":"[966]元音拼写检查器","frequency":0.0,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7647,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4639274343725596,"acs":7723,"articleLive":2,"columnArticles":153,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":16647,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49886032545141024,"acs":25169,"articleLive":2,"columnArticles":331,"formTitle":"[968]监控二叉树","frequency":0.0,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":50453,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6511804384485667,"acs":15446,"articleLive":2,"columnArticles":196,"formTitle":"[969]煎饼排序","frequency":0.0,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":23720,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.413754396467859,"acs":11058,"articleLive":2,"columnArticles":127,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26726,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4404830731675981,"acs":6857,"articleLive":2,"columnArticles":108,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.0,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":15567,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4110898661567878,"acs":1290,"articleLive":2,"columnArticles":28,"formTitle":"[972]相等的有理数","frequency":0.0,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3138,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6414044567034752,"acs":67901,"articleLive":2,"columnArticles":638,"formTitle":"[973]最接近原点的 K 个点","frequency":0.0,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":105863,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4663548619209488,"acs":37591,"articleLive":2,"columnArticles":386,"formTitle":"[974]和可被 K 整除的子数组","frequency":0.0,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":80606,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44748531308210343,"acs":3123,"articleLive":2,"columnArticles":47,"formTitle":"[975]奇偶跳","frequency":0.0,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6979,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971552394710523,"acs":53738,"articleLive":2,"columnArticles":502,"formTitle":"[976]三角形的最大周长","frequency":0.0,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"ac","submitted":89990,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7098666903733397,"acs":175670,"articleLive":2,"columnArticles":1377,"formTitle":"[977]有序数组的平方","frequency":0.0,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":247469,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735173891184121,"acs":43324,"articleLive":2,"columnArticles":600,"formTitle":"[978]最长湍流子数组","frequency":0.0,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":91494,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7130259511211892,"acs":8490,"articleLive":2,"columnArticles":133,"formTitle":"[979]在二叉树中分配硬币","frequency":0.0,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11907,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7346165659875089,"acs":14350,"articleLive":2,"columnArticles":213,"formTitle":"[980]不同路径 III","frequency":0.0,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":19534,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.532166508987701,"acs":21375,"articleLive":2,"columnArticles":314,"formTitle":"[981]基于时间的键值存储","frequency":0.0,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":40166,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.544892301130305,"acs":2555,"articleLive":2,"columnArticles":29,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4689,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6341363503364869,"acs":32509,"articleLive":2,"columnArticles":455,"formTitle":"[983]最低票价","frequency":0.0,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":51265,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41749850499103,"acs":9076,"articleLive":2,"columnArticles":145,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":21739,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.6005383679339209,"acs":16286,"articleLive":2,"columnArticles":187,"formTitle":"[985]查询后的偶数和","frequency":0.0,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":27119,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6788433458489779,"acs":26035,"articleLive":2,"columnArticles":253,"formTitle":"[986]区间列表的交集","frequency":0.0,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":38352,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5328077372630807,"acs":23248,"articleLive":2,"columnArticles":412,"formTitle":"[987]二叉树的垂序遍历","frequency":0.0,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":43633,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4985150615188799,"acs":9400,"articleLive":2,"columnArticles":112,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":18856,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47137268212512057,"acs":52773,"articleLive":2,"columnArticles":596,"formTitle":"[989]数组形式的整数加法","frequency":0.0,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":111956,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5029797198913191,"acs":33507,"articleLive":2,"columnArticles":503,"formTitle":"[990]等式方程的可满足性","frequency":0.0,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":66617,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5202466354419873,"acs":8775,"articleLive":2,"columnArticles":110,"formTitle":"[991]坏了的计算器","frequency":0.0,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16867,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4528705756440639,"acs":23696,"articleLive":2,"columnArticles":273,"formTitle":"[992]K 个不同整数的子数组","frequency":0.0,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":52324,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570125676383313,"acs":51058,"articleLive":2,"columnArticles":807,"formTitle":"[993]二叉树的堂兄弟节点","frequency":0.0,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":91664,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5093387966595313,"acs":55440,"articleLive":2,"columnArticles":1410,"formTitle":"[994]腐烂的橘子","frequency":0.0,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":108847,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5397518959369193,"acs":21494,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":0.0,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39822,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4936780954550632,"acs":4334,"articleLive":2,"columnArticles":88,"formTitle":"[996]正方形数组的数目","frequency":0.0,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8779,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5102100148131741,"acs":36854,"articleLive":2,"columnArticles":401,"formTitle":"[997]找到小镇的法官","frequency":0.0,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":72233,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148118494795837,"acs":7679,"articleLive":2,"columnArticles":111,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12490,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6905861054537226,"acs":30517,"articleLive":2,"columnArticles":572,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.0,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":44190,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4101858224363386,"acs":3576,"articleLive":2,"columnArticles":41,"formTitle":"[1000]合并石头的最低成本","frequency":0.0,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8718,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2920928946640863,"acs":2113,"articleLive":2,"columnArticles":54,"formTitle":"[1001]网格照明","frequency":0.0,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":7234,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7354977965644393,"acs":57246,"articleLive":2,"columnArticles":603,"formTitle":"[1002]查找共用字符","frequency":0.0,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":77833,"title":"查找共用字符","titleSlug":"find-common-characters"},{"acceptance":0.5769448908214387,"acs":12207,"articleLive":2,"columnArticles":187,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":21158,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5970443349753695,"acs":67872,"articleLive":2,"columnArticles":717,"formTitle":"[1004]最大连续1的个数 III","frequency":0.0,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"ac","submitted":113680,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5304052680785334,"acs":26097,"articleLive":2,"columnArticles":420,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":0.0,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":49202,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6274132094446254,"acs":44296,"articleLive":2,"columnArticles":605,"formTitle":"[1006]笨阶乘","frequency":0.0,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70601,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4653727393030437,"acs":6330,"articleLive":2,"columnArticles":86,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13602,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7224315706654519,"acs":17446,"articleLive":2,"columnArticles":222,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":0.0,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":24149,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5926139864448552,"acs":15389,"articleLive":2,"columnArticles":213,"formTitle":"[1009]十进制整数的反码","frequency":0.0,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25968,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45257346654615627,"acs":18527,"articleLive":2,"columnArticles":247,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40937,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6264138458675379,"acs":60588,"articleLive":2,"columnArticles":581,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":0.0,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":96722,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3346003475238923,"acs":3081,"articleLive":2,"columnArticles":65,"formTitle":"[1012]至少有 1 位重复的数字","frequency":0.0,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":9208,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.397000902428122,"acs":47072,"articleLive":2,"columnArticles":920,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":0.0,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":118569,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5511941256148856,"acs":38658,"articleLive":2,"columnArticles":454,"formTitle":"[1014]最佳观光组合","frequency":0.0,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":70135,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3548152458539424,"acs":4878,"articleLive":2,"columnArticles":42,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.0,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13748,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5817694369973191,"acs":5208,"articleLive":2,"columnArticles":81,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8952,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5602019883225501,"acs":3550,"articleLive":2,"columnArticles":57,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6337,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5163453085623865,"acs":44052,"articleLive":2,"columnArticles":377,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":85315,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5984433044401203,"acs":20298,"articleLive":2,"columnArticles":264,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.0,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":33918,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5367727142447692,"acs":9364,"articleLive":2,"columnArticles":139,"formTitle":"[1020]飞地的数量","frequency":0.0,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":17445,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7830943580161663,"acs":57837,"articleLive":2,"columnArticles":657,"formTitle":"[1021]删除最外层的括号","frequency":0.0,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":73857,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7042398074745186,"acs":19899,"articleLive":2,"columnArticles":267,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.0,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":28256,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5642223630028508,"acs":7125,"articleLive":2,"columnArticles":156,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":12628,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5569708660369829,"acs":33494,"articleLive":2,"columnArticles":384,"formTitle":"[1024]视频拼接","frequency":0.0,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":60136,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.709528640402788,"acs":75535,"articleLive":2,"columnArticles":650,"formTitle":"[1025]除数博弈","frequency":0.0,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":106458,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6714141753443064,"acs":9994,"articleLive":2,"columnArticles":170,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14885,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4342687849980466,"acs":13339,"articleLive":2,"columnArticles":120,"formTitle":"[1027]最长等差数列","frequency":0.0,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":30716,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.731888745148771,"acs":20367,"articleLive":2,"columnArticles":426,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.0,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27828,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6561418516934323,"acs":16874,"articleLive":2,"columnArticles":182,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"ac","submitted":25717,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7105124789680314,"acs":40539,"articleLive":2,"columnArticles":444,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":57056,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5671520093185789,"acs":4869,"articleLive":2,"columnArticles":74,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.0,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8585,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39815538533687667,"acs":2547,"articleLive":2,"columnArticles":42,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6397,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3907477865092629,"acs":10989,"articleLive":2,"columnArticles":168,"formTitle":"[1033]移动石子直到连续","frequency":0.0,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":28123,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43258859784283515,"acs":4492,"articleLive":2,"columnArticles":98,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":10384,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6335001419647928,"acs":35699,"articleLive":2,"columnArticles":388,"formTitle":"[1035]不相交的线","frequency":0.0,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":56352,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.3000919963201472,"acs":3262,"articleLive":2,"columnArticles":55,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10870,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4381716773228132,"acs":9663,"articleLive":2,"columnArticles":113,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":22053,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7935824203264975,"acs":25424,"articleLive":2,"columnArticles":318,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.0,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":32037,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5548497434644515,"acs":4542,"articleLive":2,"columnArticles":61,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":8186,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5210133542812254,"acs":2653,"articleLive":2,"columnArticles":31,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":5092,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.482869304305352,"acs":6920,"articleLive":2,"columnArticles":115,"formTitle":"[1041]困于环中的机器人","frequency":0.0,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":14331,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5301604869950194,"acs":11496,"articleLive":2,"columnArticles":152,"formTitle":"[1042]不邻接植花","frequency":0.0,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":21684,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6913569189431258,"acs":7719,"articleLive":2,"columnArticles":101,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":11165,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20885386403253922,"acs":5751,"articleLive":2,"columnArticles":73,"formTitle":"[1044]最长重复子串","frequency":0.0,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":27536,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6400451637184795,"acs":8503,"articleLive":2,"columnArticles":106,"formTitle":"[1045]买下所有产品的客户","frequency":0.0,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"lock","submitted":13285,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6599925954832447,"acs":65959,"articleLive":2,"columnArticles":914,"formTitle":"[1046]最后一块石头的重量","frequency":0.0,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":99939,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7247340787290187,"acs":106562,"articleLive":2,"columnArticles":985,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":0.0,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":147036,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4554670863808907,"acs":9839,"articleLive":2,"columnArticles":136,"formTitle":"[1048]最长字符串链","frequency":0.0,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":21602,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6452946179441651,"acs":43247,"articleLive":2,"columnArticles":404,"formTitle":"[1049]最后一块石头的重量 II","frequency":0.0,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":67019,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.757945723575078,"acs":11423,"articleLive":2,"columnArticles":53,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.0,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"lock","submitted":15071,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7535007242877837,"acs":31210,"articleLive":2,"columnArticles":371,"formTitle":"[1051]高度检查器","frequency":0.0,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":41420,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5814001231779922,"acs":48144,"articleLive":2,"columnArticles":750,"formTitle":"[1052]爱生气的书店老板","frequency":0.0,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":82807,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45851293103448276,"acs":5957,"articleLive":2,"columnArticles":96,"formTitle":"[1053]交换一次的先前排列","frequency":0.0,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12992,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37629671735114395,"acs":7944,"articleLive":2,"columnArticles":108,"formTitle":"[1054]距离相等的条形码","frequency":0.0,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":21111,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5884192096048024,"acs":4705,"articleLive":2,"columnArticles":87,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"lock","submitted":7996,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4102781136638452,"acs":3393,"articleLive":2,"columnArticles":66,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"lock","submitted":8270,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4657826550830666,"acs":3056,"articleLive":2,"columnArticles":39,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"lock","submitted":6561,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.34186284544524054,"acs":1336,"articleLive":2,"columnArticles":31,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"lock","submitted":3908,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.36302788844621514,"acs":2278,"articleLive":2,"columnArticles":37,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"lock","submitted":6275,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5301336573511544,"acs":4363,"articleLive":2,"columnArticles":64,"formTitle":"[1060]有序数组中的缺失元素","frequency":0.0,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"lock","submitted":8230,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6058568329718005,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"lock","submitted":4610,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.542817033224146,"acs":3480,"articleLive":2,"columnArticles":48,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"lock","submitted":6411,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.7065548780487805,"acs":1854,"articleLive":2,"columnArticles":40,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"lock","submitted":2624,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6508755259942989,"acs":4795,"articleLive":2,"columnArticles":68,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"lock","submitted":7367,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5420457066785002,"acs":2443,"articleLive":2,"columnArticles":69,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"lock","submitted":4507,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47465437788018433,"acs":2060,"articleLive":2,"columnArticles":42,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"lock","submitted":4340,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4232534421213667,"acs":830,"articleLive":2,"columnArticles":26,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"lock","submitted":1961,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8643646589497089,"acs":13217,"articleLive":2,"columnArticles":64,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"lock","submitted":15291,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8189074399531342,"acs":11183,"articleLive":2,"columnArticles":55,"formTitle":"[1069]产品销售分析 II","frequency":0.0,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"lock","submitted":13656,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.480736301369863,"acs":7861,"articleLive":2,"columnArticles":71,"formTitle":"[1070]产品销售分析 III","frequency":0.0,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"lock","submitted":16352,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866844793181588,"acs":34693,"articleLive":2,"columnArticles":673,"formTitle":"[1071]字符串的最大公因子","frequency":0.0,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":59134,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5801500087214373,"acs":3326,"articleLive":2,"columnArticles":55,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.0,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5733,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33467183605649403,"acs":2417,"articleLive":2,"columnArticles":54,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":7222,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6693446241812326,"acs":18496,"articleLive":2,"columnArticles":186,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":0.0,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27633,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.694249039089129,"acs":9573,"articleLive":2,"columnArticles":72,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"lock","submitted":13789,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49604743083003955,"acs":10291,"articleLive":2,"columnArticles":87,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"lock","submitted":20746,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7202743902439024,"acs":7560,"articleLive":2,"columnArticles":87,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"lock","submitted":10496,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6221438348952301,"acs":11817,"articleLive":2,"columnArticles":185,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18994,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7344995140913508,"acs":11337,"articleLive":2,"columnArticles":188,"formTitle":"[1079]活字印刷","frequency":0.0,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":15435,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.49137631670332216,"acs":4245,"articleLive":2,"columnArticles":93,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8639,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.570636479149821,"acs":14820,"articleLive":2,"columnArticles":149,"formTitle":"[1081]不同字符的最小子序列","frequency":0.0,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":25971,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7606175048035513,"acs":11480,"articleLive":2,"columnArticles":92,"formTitle":"[1082]销售分析 I ","frequency":0.0,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"lock","submitted":15093,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5279804137104027,"acs":10567,"articleLive":2,"columnArticles":96,"formTitle":"[1083]销售分析 II","frequency":0.0,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"lock","submitted":20014,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5368585569158635,"acs":10305,"articleLive":2,"columnArticles":94,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"lock","submitted":19195,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7731540759709774,"acs":3623,"articleLive":2,"columnArticles":73,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"lock","submitted":4686,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6909311087190527,"acs":5135,"articleLive":2,"columnArticles":80,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"lock","submitted":7432,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5341905318527177,"acs":1828,"articleLive":2,"columnArticles":54,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"lock","submitted":3422,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4511986301369863,"acs":1054,"articleLive":2,"columnArticles":34,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"lock","submitted":2336,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5849709591019893,"acs":19438,"articleLive":2,"columnArticles":292,"formTitle":"[1089]复写零","frequency":0.0,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":33229,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5450256694879978,"acs":3928,"articleLive":2,"columnArticles":79,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":7207,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37885150315609284,"acs":28329,"articleLive":2,"columnArticles":289,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":0.0,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":74776,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48998144712430425,"acs":2641,"articleLive":2,"columnArticles":52,"formTitle":"[1092]最短公共超序列","frequency":0.0,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5390,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3788717948717949,"acs":3694,"articleLive":2,"columnArticles":59,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9750,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6082039961255152,"acs":27000,"articleLive":2,"columnArticles":379,"formTitle":"[1094]拼车","frequency":0.0,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":44393,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3727792776634508,"acs":19745,"articleLive":2,"columnArticles":386,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":52967,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5481239804241436,"acs":1680,"articleLive":2,"columnArticles":47,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":3065,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5202877938592821,"acs":6219,"articleLive":2,"columnArticles":111,"formTitle":"[1097]游戏玩法分析 V","frequency":0.0,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"lock","submitted":11953,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4723882995821279,"acs":7348,"articleLive":2,"columnArticles":103,"formTitle":"[1098]小众书籍","frequency":0.0,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"lock","submitted":15555,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5811537083482623,"acs":4866,"articleLive":2,"columnArticles":91,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"lock","submitted":8373,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.700040922111581,"acs":5132,"articleLive":2,"columnArticles":101,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"lock","submitted":7331,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6672208367968967,"acs":2408,"articleLive":2,"columnArticles":54,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"lock","submitted":3609,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3702050495187613,"acs":5308,"articleLive":2,"columnArticles":68,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"lock","submitted":14338,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6366381929304121,"acs":35625,"articleLive":2,"columnArticles":1103,"formTitle":"[1103]分糖果 II","frequency":0.0,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":55958,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610462028677643,"acs":28661,"articleLive":2,"columnArticles":672,"formTitle":"[1104]二叉树寻路","frequency":0.0,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37660,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.559300064808814,"acs":5178,"articleLive":2,"columnArticles":68,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9258,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5771793825649395,"acs":4244,"articleLive":2,"columnArticles":125,"formTitle":"[1106]解析布尔表达式","frequency":0.0,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7353,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41209027735071646,"acs":6701,"articleLive":2,"columnArticles":94,"formTitle":"[1107]每日新用户统计","frequency":0.0,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"lock","submitted":16261,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8395495337849661,"acs":67169,"articleLive":2,"columnArticles":684,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":80006,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5769654196237246,"acs":58697,"articleLive":2,"columnArticles":587,"formTitle":"[1109]航班预订统计","frequency":0.0,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"ac","submitted":101734,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6297701405936175,"acs":11288,"articleLive":2,"columnArticles":203,"formTitle":"[1110]删点成林","frequency":0.0,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":17924,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7713127573329929,"acs":24166,"articleLive":2,"columnArticles":399,"formTitle":"[1111]有效括号的嵌套深度","frequency":0.0,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":31331,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6452376924378278,"acs":7628,"articleLive":2,"columnArticles":87,"formTitle":"[1112]每位学生的最高成绩","frequency":0.0,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"lock","submitted":11822,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5406672396280959,"acs":6920,"articleLive":2,"columnArticles":48,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"lock","submitted":12799,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6537258200168209,"acs":77728,"articleLive":2,"columnArticles":581,"formTitle":"[1114]按序打印","frequency":0.0,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":118900,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619831492035468,"acs":43289,"articleLive":2,"columnArticles":479,"formTitle":"[1115]交替打印FooBar","frequency":0.0,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":77029,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5198319366108739,"acs":22765,"articleLive":2,"columnArticles":369,"formTitle":"[1116]打印零与奇偶数","frequency":0.0,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":43793,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5215008684194765,"acs":17415,"articleLive":2,"columnArticles":252,"formTitle":"[1117]H2O 生成","frequency":0.0,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":33394,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6432092004381161,"acs":2349,"articleLive":2,"columnArticles":37,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"lock","submitted":3652,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8667983778725175,"acs":8336,"articleLive":2,"columnArticles":146,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"lock","submitted":9617,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6103567318757193,"acs":2652,"articleLive":2,"columnArticles":49,"formTitle":"[1120]子树的最大平均值","frequency":0.0,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"lock","submitted":4345,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5752351097178683,"acs":1101,"articleLive":2,"columnArticles":18,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"lock","submitted":1914,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.706862553901493,"acs":65242,"articleLive":2,"columnArticles":873,"formTitle":"[1122]数组的相对排序","frequency":0.0,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":92298,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7025672054628749,"acs":8128,"articleLive":2,"columnArticles":104,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":11569,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3186321984653207,"acs":12831,"articleLive":2,"columnArticles":132,"formTitle":"[1124]表现良好的最长时间段","frequency":0.0,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":40269,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49137792103142625,"acs":3049,"articleLive":2,"columnArticles":50,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":6205,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6929963735267453,"acs":6115,"articleLive":2,"columnArticles":94,"formTitle":"[1126]查询活跃业务","frequency":0.0,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"lock","submitted":8824,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.413411322331314,"acs":3958,"articleLive":2,"columnArticles":74,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"lock","submitted":9574,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5449764900613748,"acs":37205,"articleLive":2,"columnArticles":480,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.0,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":68269,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37995722578674,"acs":6218,"articleLive":2,"columnArticles":111,"formTitle":"[1129]颜色交替的最短路径","frequency":0.0,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":16365,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6295548709231913,"acs":5926,"articleLive":2,"columnArticles":104,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":9413,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4556588460970931,"acs":3088,"articleLive":2,"columnArticles":46,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6777,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3900990099009901,"acs":4728,"articleLive":2,"columnArticles":54,"formTitle":"[1132]报告的记录 II","frequency":0.0,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"lock","submitted":12120,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6481726111845002,"acs":2944,"articleLive":2,"columnArticles":63,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"lock","submitted":4542,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7764157881833783,"acs":3167,"articleLive":2,"columnArticles":53,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"lock","submitted":4079,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5366039654295882,"acs":6333,"articleLive":2,"columnArticles":72,"formTitle":"[1135]最低成本联通所有城市","frequency":0.0,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"lock","submitted":11802,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5707865168539326,"acs":2794,"articleLive":2,"columnArticles":49,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"lock","submitted":4895,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.608347373257773,"acs":79438,"articleLive":2,"columnArticles":875,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.0,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":130580,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4329911404865701,"acs":6158,"articleLive":2,"columnArticles":139,"formTitle":"[1138]字母板上的路径","frequency":0.0,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":14222,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47836441021483583,"acs":9441,"articleLive":2,"columnArticles":154,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.0,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":19736,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6517642534371695,"acs":6779,"articleLive":2,"columnArticles":96,"formTitle":"[1140]石子游戏 II","frequency":0.0,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":10401,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5098677517802644,"acs":10024,"articleLive":2,"columnArticles":65,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.0,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"lock","submitted":19660,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3706136837045345,"acs":6939,"articleLive":2,"columnArticles":50,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"lock","submitted":18723,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6370825943946766,"acs":168121,"articleLive":2,"columnArticles":1135,"formTitle":"[1143]最长公共子序列","frequency":0.0,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":263892,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44193313642395443,"acs":10324,"articleLive":2,"columnArticles":146,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":0.0,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":23361,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46878980891719746,"acs":6624,"articleLive":2,"columnArticles":107,"formTitle":"[1145]二叉树着色游戏","frequency":0.0,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":14130,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2872246696035242,"acs":4238,"articleLive":2,"columnArticles":62,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":14755,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5612300933552993,"acs":4088,"articleLive":2,"columnArticles":82,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":7284,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7147958249404871,"acs":7807,"articleLive":2,"columnArticles":35,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"lock","submitted":10922,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4420764574176963,"acs":5331,"articleLive":2,"columnArticles":47,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"lock","submitted":12059,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6046631456910988,"acs":4694,"articleLive":2,"columnArticles":83,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.0,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"lock","submitted":7763,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48667051356030006,"acs":4217,"articleLive":2,"columnArticles":61,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.0,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"lock","submitted":8665,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38701517706576727,"acs":1377,"articleLive":2,"columnArticles":32,"formTitle":"[1152]用户网站访问行为分析","frequency":0.0,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"lock","submitted":3558,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3710869565217391,"acs":1707,"articleLive":2,"columnArticles":24,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"lock","submitted":4600,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5701137620477169,"acs":14433,"articleLive":2,"columnArticles":223,"formTitle":"[1154]一年中的第几天","frequency":0.0,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":25316,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47832044631496523,"acs":9774,"articleLive":2,"columnArticles":125,"formTitle":"[1155]掷骰子的N种方法","frequency":0.0,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":20434,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43160725127938243,"acs":4976,"articleLive":2,"columnArticles":83,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":11529,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3202170963364993,"acs":3068,"articleLive":2,"columnArticles":46,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9581,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5499699579411176,"acs":5492,"articleLive":2,"columnArticles":61,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"lock","submitted":9986,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4881104576834569,"acs":3818,"articleLive":2,"columnArticles":84,"formTitle":"[1159]市场分析 II","frequency":0.0,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"lock","submitted":7822,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6869889161851378,"acs":59564,"articleLive":2,"columnArticles":911,"formTitle":"[1160]拼写单词","frequency":0.0,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":86703,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6337554768621331,"acs":10559,"articleLive":2,"columnArticles":175,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16661,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46950377153196327,"acs":38404,"articleLive":2,"columnArticles":494,"formTitle":"[1162]地图分析","frequency":0.0,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":81797,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26744868035190617,"acs":5928,"articleLive":2,"columnArticles":102,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":22165,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.60761378136963,"acs":5714,"articleLive":2,"columnArticles":85,"formTitle":"[1164]指定日期的产品价格","frequency":0.0,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"lock","submitted":9404,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8372937293729373,"acs":7611,"articleLive":2,"columnArticles":113,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"lock","submitted":9090,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4839921302092649,"acs":2706,"articleLive":2,"columnArticles":48,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"lock","submitted":5591,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4342814649563116,"acs":2336,"articleLive":2,"columnArticles":35,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"lock","submitted":5379,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5689285714285715,"acs":1593,"articleLive":2,"columnArticles":27,"formTitle":"[1168]水资源分配优化","frequency":0.0,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"lock","submitted":2800,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32256522985759345,"acs":6750,"articleLive":2,"columnArticles":81,"formTitle":"[1169]查询无效交易","frequency":0.0,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20926,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6166471805018436,"acs":13713,"articleLive":2,"columnArticles":216,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.0,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":22238,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4747323418715972,"acs":12992,"articleLive":2,"columnArticles":154,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.0,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":27367,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26760715054921386,"acs":2485,"articleLive":2,"columnArticles":54,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":9286,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7576296573675342,"acs":8093,"articleLive":2,"columnArticles":74,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"lock","submitted":10682,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6189086294416244,"acs":4877,"articleLive":2,"columnArticles":61,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"lock","submitted":7880,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4915231431646932,"acs":7306,"articleLive":2,"columnArticles":114,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14864,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4506661115736886,"acs":4330,"articleLive":2,"columnArticles":61,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"lock","submitted":9608,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26551189245087903,"acs":6162,"articleLive":2,"columnArticles":95,"formTitle":"[1177]构建回文串检测","frequency":0.0,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":23208,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46195517121415436,"acs":18590,"articleLive":2,"columnArticles":184,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":40242,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6367103299618637,"acs":30720,"articleLive":2,"columnArticles":184,"formTitle":"[1179]重新格式化部门表","frequency":0.0,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":48248,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7762081784386617,"acs":3132,"articleLive":2,"columnArticles":69,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.0,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"lock","submitted":4035,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3726955655206776,"acs":1496,"articleLive":2,"columnArticles":28,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"lock","submitted":4014,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3980959782397513,"acs":2049,"articleLive":2,"columnArticles":42,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"lock","submitted":5147,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.599444958371878,"acs":648,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"lock","submitted":1081,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5851091703056769,"acs":13399,"articleLive":2,"columnArticles":261,"formTitle":"[1184]公交站间的距离","frequency":0.0,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22900,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6076889941847943,"acs":11286,"articleLive":2,"columnArticles":205,"formTitle":"[1185]一周中的第几天","frequency":0.0,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":18572,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3941176470588235,"acs":7504,"articleLive":2,"columnArticles":107,"formTitle":"[1186]删除一次得到子数组最大和","frequency":0.0,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":19040,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4414691943127962,"acs":1863,"articleLive":2,"columnArticles":32,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4220,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6937261551504875,"acs":3273,"articleLive":2,"columnArticles":66,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"lock","submitted":4718,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6455754664696102,"acs":20967,"articleLive":2,"columnArticles":328,"formTitle":"[1189]“气球” 的最大数量","frequency":0.0,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":32478,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509143268538516,"acs":45206,"articleLive":2,"columnArticles":615,"formTitle":"[1190]反转每对括号间的子串","frequency":0.0,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":69450,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2672774170595037,"acs":6010,"articleLive":2,"columnArticles":95,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":22486,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49854363276243735,"acs":4279,"articleLive":2,"columnArticles":49,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":8583,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6010816657652785,"acs":5557,"articleLive":2,"columnArticles":73,"formTitle":"[1193]每月交易 I","frequency":0.0,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"lock","submitted":9245,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5059362036904591,"acs":3537,"articleLive":2,"columnArticles":63,"formTitle":"[1194]锦标赛优胜者","frequency":0.0,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"lock","submitted":6991,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6367920212279257,"acs":13919,"articleLive":2,"columnArticles":265,"formTitle":"[1195]交替打印字符串","frequency":0.0,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":21858,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6937099358974359,"acs":3463,"articleLive":2,"columnArticles":59,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"lock","submitted":4992,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3702857142857143,"acs":4860,"articleLive":2,"columnArticles":61,"formTitle":"[1197]进击的骑士","frequency":0.0,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"lock","submitted":13125,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7463573619631901,"acs":3893,"articleLive":2,"columnArticles":57,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"lock","submitted":5216,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43812907045589106,"acs":740,"articleLive":2,"columnArticles":17,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"lock","submitted":1689,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6853580171358629,"acs":17918,"articleLive":2,"columnArticles":252,"formTitle":"[1200]最小绝对差","frequency":0.0,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":26144,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24720756106542285,"acs":6042,"articleLive":2,"columnArticles":87,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":24441,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5032276171765366,"acs":26895,"articleLive":2,"columnArticles":295,"formTitle":"[1202]交换字符串中的元素","frequency":0.0,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":53445,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6219274887341254,"acs":12145,"articleLive":2,"columnArticles":144,"formTitle":"[1203]项目管理","frequency":0.0,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19528,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7263931888544891,"acs":5631,"articleLive":2,"columnArticles":82,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.0,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"lock","submitted":7752,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46776429809358755,"acs":5398,"articleLive":2,"columnArticles":83,"formTitle":"[1205]每月交易II","frequency":0.0,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"lock","submitted":11540,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6130258041710852,"acs":6937,"articleLive":2,"columnArticles":89,"formTitle":"[1206]设计跳表","frequency":0.0,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":11316,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.730489973929781,"acs":59963,"articleLive":2,"columnArticles":833,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":82086,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4968996057846141,"acs":47520,"articleLive":2,"columnArticles":613,"formTitle":"[1208]尽可能使字符串相等","frequency":0.0,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":95633,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5289568579745405,"acs":12175,"articleLive":2,"columnArticles":159,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":0.0,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":23017,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4491139240506329,"acs":2661,"articleLive":2,"columnArticles":54,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5925,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6557202449631667,"acs":7388,"articleLive":2,"columnArticles":62,"formTitle":"[1211]查询结果的质量和占比","frequency":0.0,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"lock","submitted":11267,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5095354027186042,"acs":5023,"articleLive":2,"columnArticles":99,"formTitle":"[1212]查询球队积分","frequency":0.0,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"lock","submitted":9858,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7754436325678496,"acs":5943,"articleLive":2,"columnArticles":126,"formTitle":"[1213]三个有序数组的交集","frequency":0.0,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"lock","submitted":7664,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6348610067618332,"acs":3380,"articleLive":2,"columnArticles":71,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.0,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"lock","submitted":5324,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4121848739495798,"acs":1962,"articleLive":2,"columnArticles":40,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"lock","submitted":4760,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5401167031363968,"acs":1481,"articleLive":2,"columnArticles":38,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"lock","submitted":2742,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6940064092394581,"acs":21873,"articleLive":2,"columnArticles":356,"formTitle":"[1217]玩筹码","frequency":0.0,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"ac","submitted":31517,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42256020278833967,"acs":8335,"articleLive":2,"columnArticles":114,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":19725,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6302862804401106,"acs":12087,"articleLive":2,"columnArticles":172,"formTitle":"[1219]黄金矿工","frequency":0.0,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":19177,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5267845095128862,"acs":3904,"articleLive":2,"columnArticles":74,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7411,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.843956237673942,"acs":76600,"articleLive":2,"columnArticles":1110,"formTitle":"[1221]分割平衡字符串","frequency":0.0,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"ac","submitted":90763,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6722602739726027,"acs":5889,"articleLive":2,"columnArticles":131,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8760,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4745383324006715,"acs":3392,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":7148,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3274176776429809,"acs":4723,"articleLive":2,"columnArticles":69,"formTitle":"[1224]最大相等频率","frequency":0.0,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":14425,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5379685998077539,"acs":3358,"articleLive":2,"columnArticles":79,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.0,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"lock","submitted":6242,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5971447242748705,"acs":11879,"articleLive":2,"columnArticles":137,"formTitle":"[1226]哲学家进餐","frequency":0.0,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":19893,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6629146919431279,"acs":10071,"articleLive":2,"columnArticles":157,"formTitle":"[1227]飞机座位分配概率","frequency":0.0,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":15192,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5399266119168269,"acs":3090,"articleLive":2,"columnArticles":52,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"lock","submitted":5723,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41881222107792654,"acs":2440,"articleLive":2,"columnArticles":44,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"lock","submitted":5826,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.49525015832805575,"acs":3128,"articleLive":2,"columnArticles":63,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"lock","submitted":6316,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5637509266123054,"acs":3042,"articleLive":2,"columnArticles":42,"formTitle":"[1231]分享巧克力","frequency":0.0,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"lock","submitted":5396,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46955846245613064,"acs":33850,"articleLive":2,"columnArticles":422,"formTitle":"[1232]缀点成线","frequency":0.0,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":72089,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4825993039721589,"acs":8043,"articleLive":2,"columnArticles":117,"formTitle":"[1233]删除子文件夹","frequency":0.0,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":16666,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34406099051388,"acs":5912,"articleLive":2,"columnArticles":90,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.0,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":17183,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4633509751323135,"acs":6391,"articleLive":2,"columnArticles":111,"formTitle":"[1235]规划兼职工作","frequency":0.0,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":13793,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.562618595825427,"acs":1186,"articleLive":2,"columnArticles":32,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"lock","submitted":2108,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7108501118568232,"acs":10168,"articleLive":2,"columnArticles":132,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14304,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6598024795125026,"acs":3140,"articleLive":2,"columnArticles":72,"formTitle":"[1238]循环码排列","frequency":0.0,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4759,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49113845459163513,"acs":34806,"articleLive":2,"columnArticles":385,"formTitle":"[1239]串联字符串的最大长度","frequency":0.0,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":70868,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49556498264558424,"acs":2570,"articleLive":2,"columnArticles":39,"formTitle":"[1240]铺瓷砖","frequency":0.0,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":5186,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.59390437133004,"acs":6372,"articleLive":2,"columnArticles":64,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"lock","submitted":10729,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4709236031927024,"acs":1239,"articleLive":2,"columnArticles":20,"formTitle":"[1242]多线程网页爬虫","frequency":0.0,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"lock","submitted":2631,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5409460304230048,"acs":2596,"articleLive":2,"columnArticles":56,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"lock","submitted":4799,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6211509338717819,"acs":2461,"articleLive":2,"columnArticles":42,"formTitle":"[1244]力扣排行榜","frequency":0.0,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"lock","submitted":3962,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5108680005757881,"acs":3549,"articleLive":2,"columnArticles":63,"formTitle":"[1245]树的直径","frequency":0.0,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"lock","submitted":6947,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48137254901960785,"acs":2946,"articleLive":2,"columnArticles":42,"formTitle":"[1246]删除回文子数组","frequency":0.0,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"lock","submitted":6120,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6176408076514347,"acs":8718,"articleLive":2,"columnArticles":156,"formTitle":"[1247]交换字符使得字符串相同","frequency":0.0,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"ac","submitted":14115,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5597513423676809,"acs":35027,"articleLive":2,"columnArticles":482,"formTitle":"[1248]统计「优美子数组」","frequency":0.0,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":62576,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5752942359923549,"acs":22876,"articleLive":2,"columnArticles":321,"formTitle":"[1249]移除无效的括号","frequency":0.0,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":39764,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5631448617416426,"acs":2729,"articleLive":2,"columnArticles":38,"formTitle":"[1250]检查「好数组」","frequency":0.0,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4846,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7718539865513929,"acs":8035,"articleLive":2,"columnArticles":96,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"lock","submitted":10410,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7486646515672228,"acs":18081,"articleLive":2,"columnArticles":317,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":24151,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3939575680335857,"acs":5255,"articleLive":2,"columnArticles":79,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.0,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":13339,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5987487733071639,"acs":14643,"articleLive":2,"columnArticles":229,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.0,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":24456,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6821793416572077,"acs":3005,"articleLive":2,"columnArticles":65,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4405,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.667390360399479,"acs":1537,"articleLive":2,"columnArticles":37,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"lock","submitted":2303,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5632502308402585,"acs":1830,"articleLive":2,"columnArticles":40,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"lock","submitted":3249,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5567103479439675,"acs":1232,"articleLive":2,"columnArticles":44,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"lock","submitted":2213,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4800193751513684,"acs":1982,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":0.0,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"lock","submitted":4129,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6046793257120713,"acs":12483,"articleLive":2,"columnArticles":253,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":20644,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7290466456049062,"acs":7846,"articleLive":2,"columnArticles":100,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10762,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5254468221527611,"acs":13112,"articleLive":2,"columnArticles":202,"formTitle":"[1262]可被三整除的最大和","frequency":0.0,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":24954,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41970655539103513,"acs":3118,"articleLive":2,"columnArticles":58,"formTitle":"[1263]推箱子","frequency":0.0,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7429,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5679775936515346,"acs":4867,"articleLive":2,"columnArticles":86,"formTitle":"[1264]页面推荐","frequency":0.0,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"lock","submitted":8569,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9224858002004678,"acs":2761,"articleLive":2,"columnArticles":68,"formTitle":"[1265]逆序打印不可变链表","frequency":0.0,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"lock","submitted":2993,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8241658407664354,"acs":29937,"articleLive":2,"columnArticles":456,"formTitle":"[1266]访问所有点的最小时间","frequency":0.0,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":36324,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6074198552223371,"acs":9398,"articleLive":2,"columnArticles":147,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":15472,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5853249781404838,"acs":8033,"articleLive":2,"columnArticles":145,"formTitle":"[1268]搜索推荐系统","frequency":0.0,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"ac","submitted":13724,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4914802289281998,"acs":30228,"articleLive":2,"columnArticles":321,"formTitle":"[1269]停在原地的方案数","frequency":0.0,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61504,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8015522547838887,"acs":5990,"articleLive":2,"columnArticles":85,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"lock","submitted":7473,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5071295722256665,"acs":2454,"articleLive":2,"columnArticles":40,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"lock","submitted":4839,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5194721596395236,"acs":1614,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"lock","submitted":3107,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5428176795580111,"acs":1572,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"lock","submitted":2896,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.6012307692307692,"acs":977,"articleLive":2,"columnArticles":25,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"lock","submitted":1625,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5423033670701859,"acs":8198,"articleLive":2,"columnArticles":169,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.0,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":15117,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5016473833422727,"acs":6547,"articleLive":2,"columnArticles":97,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":13051,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7251651878421748,"acs":19206,"articleLive":2,"columnArticles":237,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":0.0,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":26485,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.597506970641299,"acs":3643,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":0.0,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":6097,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6203667577058135,"acs":1590,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"lock","submitted":2563,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.505925592559256,"acs":6745,"articleLive":2,"columnArticles":70,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.0,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"lock","submitted":13332,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8318580827239906,"acs":45392,"articleLive":2,"columnArticles":617,"formTitle":"[1281]整数的各位积和之差","frequency":0.0,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":54567,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8104825615379619,"acs":12479,"articleLive":2,"columnArticles":229,"formTitle":"[1282]用户分组","frequency":0.0,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":15397,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41703447453179054,"acs":6992,"articleLive":2,"columnArticles":100,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.0,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16766,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6614292954891029,"acs":2610,"articleLive":2,"columnArticles":59,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":0.0,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3946,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8115808823529411,"acs":4415,"articleLive":2,"columnArticles":61,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"lock","submitted":5440,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6457459759231705,"acs":4774,"articleLive":2,"columnArticles":94,"formTitle":"[1286]字母组合迭代器","frequency":0.0,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7393,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6032448377581121,"acs":15542,"articleLive":2,"columnArticles":217,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.0,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":25764,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5629030270669898,"acs":13705,"articleLive":2,"columnArticles":170,"formTitle":"[1288]删除被覆盖区间","frequency":0.0,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":24347,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6267425320056899,"acs":6609,"articleLive":2,"columnArticles":99,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":10545,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8091093269302919,"acs":53915,"articleLive":2,"columnArticles":703,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":66635,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.519076082945908,"acs":7034,"articleLive":2,"columnArticles":157,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":13551,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4706019417475728,"acs":6059,"articleLive":2,"columnArticles":96,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.0,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12875,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3602400882835841,"acs":13384,"articleLive":2,"columnArticles":128,"formTitle":"[1293]网格中的最短路径","frequency":0.0,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":37153,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6558143886238189,"acs":7010,"articleLive":2,"columnArticles":73,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"lock","submitted":10689,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8082003255962271,"acs":48155,"articleLive":2,"columnArticles":639,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.0,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":59583,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4544281524926686,"acs":7748,"articleLive":2,"columnArticles":124,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":17050,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45848963125486586,"acs":6478,"articleLive":2,"columnArticles":93,"formTitle":"[1297]子串的最大出现次数","frequency":0.0,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":14129,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5971715328467153,"acs":2618,"articleLive":2,"columnArticles":89,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4384,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7866284770604325,"acs":30485,"articleLive":2,"columnArticles":434,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":38754,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46637333796483915,"acs":24167,"articleLive":2,"columnArticles":364,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.0,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":51819,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.36168787675820496,"acs":3240,"articleLive":2,"columnArticles":79,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8958,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8191910854312835,"acs":19849,"articleLive":2,"columnArticles":294,"formTitle":"[1302]层数最深叶子节点的和","frequency":0.0,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":24230,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8219837157660992,"acs":8884,"articleLive":2,"columnArticles":84,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"lock","submitted":10808,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7238266535446432,"acs":21329,"articleLive":2,"columnArticles":384,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.0,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":29467,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7473521953159962,"acs":15030,"articleLive":2,"columnArticles":226,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.0,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":20111,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5756679483387558,"acs":17517,"articleLive":2,"columnArticles":272,"formTitle":"[1306]跳跃游戏 III","frequency":0.0,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":30429,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33093525179856115,"acs":1840,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5560,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7506683551428169,"acs":5335,"articleLive":2,"columnArticles":61,"formTitle":"[1308]不同性别每日分数总计","frequency":0.0,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"lock","submitted":7107,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7558540569976402,"acs":16656,"articleLive":2,"columnArticles":289,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":22036,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7129234436882378,"acs":37082,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":0.0,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":52014,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37813010342950465,"acs":5557,"articleLive":2,"columnArticles":87,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.0,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14696,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6664587751029063,"acs":10686,"articleLive":2,"columnArticles":153,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":0.0,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":16034,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8319531120233491,"acs":35061,"articleLive":2,"columnArticles":543,"formTitle":"[1313]解压缩编码列表","frequency":0.0,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":42143,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7401412411724267,"acs":11843,"articleLive":2,"columnArticles":194,"formTitle":"[1314]矩阵区域和","frequency":0.0,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":16001,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096197431377486,"acs":12860,"articleLive":2,"columnArticles":264,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15884,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.44025851197982346,"acs":2793,"articleLive":2,"columnArticles":60,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6344,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.614839291078402,"acs":10234,"articleLive":2,"columnArticles":193,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16645,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6551581130119233,"acs":6319,"articleLive":2,"columnArticles":114,"formTitle":"[1318]或运算的最小翻转次数","frequency":0.0,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9645,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6167314012548551,"acs":30963,"articleLive":2,"columnArticles":513,"formTitle":"[1319]连通网络的操作次数","frequency":0.0,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":50205,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5890313390313391,"acs":2481,"articleLive":2,"columnArticles":57,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4212,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6130464954892436,"acs":4417,"articleLive":2,"columnArticles":77,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"lock","submitted":7205,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5930090170321719,"acs":5327,"articleLive":2,"columnArticles":64,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"lock","submitted":8983,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7552173376142257,"acs":24463,"articleLive":2,"columnArticles":479,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":0.0,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":32392,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5893743793445879,"acs":5935,"articleLive":2,"columnArticles":115,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":10070,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7276662172709856,"acs":10255,"articleLive":2,"columnArticles":182,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.0,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":14093,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47249774571686204,"acs":5764,"articleLive":2,"columnArticles":92,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.0,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":12199,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6879760269696591,"acs":5510,"articleLive":2,"columnArticles":52,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"lock","submitted":8009,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.46291123525760397,"acs":5966,"articleLive":2,"columnArticles":122,"formTitle":"[1328]破坏回文串","frequency":0.0,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12888,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7716769366197183,"acs":7013,"articleLive":2,"columnArticles":157,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.0,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":9088,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3783958602846054,"acs":1170,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.0,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3092,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5356320801552557,"acs":11868,"articleLive":2,"columnArticles":202,"formTitle":"[1331]数组序号转换","frequency":0.0,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":22157,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6871787446608267,"acs":9492,"articleLive":2,"columnArticles":135,"formTitle":"[1332]删除回文子序列","frequency":0.0,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13813,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5440679602278212,"acs":5636,"articleLive":2,"columnArticles":117,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":10359,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4905774550484094,"acs":5675,"articleLive":2,"columnArticles":93,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":0.0,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":11568,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5852926463231616,"acs":3510,"articleLive":2,"columnArticles":58,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5997,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4214235377026075,"acs":1794,"articleLive":2,"columnArticles":49,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"lock","submitted":4257,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7058589223638471,"acs":38986,"articleLive":2,"columnArticles":623,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.0,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":55232,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401381643874242,"acs":9081,"articleLive":2,"columnArticles":130,"formTitle":"[1338]数组大小减半","frequency":0.0,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":14186,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39877827622410994,"acs":8356,"articleLive":2,"columnArticles":131,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.0,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":20954,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5737468917680932,"acs":4384,"articleLive":2,"columnArticles":95,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7641,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4804114994363021,"acs":3409,"articleLive":2,"columnArticles":49,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"lock","submitted":7096,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204091991722307,"acs":42023,"articleLive":2,"columnArticles":639,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":51222,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.544743109901327,"acs":12808,"articleLive":2,"columnArticles":213,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":23512,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5927890755476962,"acs":6034,"articleLive":2,"columnArticles":121,"formTitle":"[1344]时钟指针的夹角","frequency":0.0,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":10179,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3668114026807627,"acs":5829,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":0.0,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15891,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43497325023440514,"acs":15773,"articleLive":2,"columnArticles":268,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":36262,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7403492213308164,"acs":7844,"articleLive":2,"columnArticles":117,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10595,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30631136044880786,"acs":3276,"articleLive":2,"columnArticles":51,"formTitle":"[1348]推文计数","frequency":0.0,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":10695,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5066001287830006,"acs":3147,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":0.0,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":6212,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8480668546113572,"acs":8423,"articleLive":2,"columnArticles":85,"formTitle":"[1350]院系无效的学生","frequency":0.0,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"lock","submitted":9932,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546152092987921,"acs":29799,"articleLive":2,"columnArticles":546,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.0,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":39489,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44479263901853583,"acs":6671,"articleLive":2,"columnArticles":73,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.0,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14998,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28493055898779224,"acs":11530,"articleLive":2,"columnArticles":156,"formTitle":"[1353]最多可以参加的会议数目","frequency":0.0,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":40466,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2814649743241934,"acs":2905,"articleLive":2,"columnArticles":72,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":10321,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6607417535464023,"acs":3866,"articleLive":2,"columnArticles":57,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"lock","submitted":5851,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.731655983928059,"acs":45888,"articleLive":2,"columnArticles":508,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.0,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":62718,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5305750715586781,"acs":4078,"articleLive":2,"columnArticles":42,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7686,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4953647017666608,"acs":5664,"articleLive":2,"columnArticles":112,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.0,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":11434,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5510799766491535,"acs":2832,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":5139,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5053244690239455,"acs":8589,"articleLive":2,"columnArticles":141,"formTitle":"[1360]日期之间隔几天","frequency":0.0,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16997,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40213656860639896,"acs":7491,"articleLive":2,"columnArticles":202,"formTitle":"[1361]验证二叉树","frequency":0.0,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":18628,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5252067743205987,"acs":5334,"articleLive":2,"columnArticles":68,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":10156,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3645142267433289,"acs":4945,"articleLive":2,"columnArticles":97,"formTitle":"[1363]形成三的最大倍数","frequency":0.0,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":13566,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6744744744744745,"acs":3369,"articleLive":2,"columnArticles":65,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.0,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"lock","submitted":4995,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250133101011567,"acs":85228,"articleLive":2,"columnArticles":1090,"formTitle":"[1365]有多少小于当前数字的数字","frequency":0.0,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":103305,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5382521923193226,"acs":7120,"articleLive":2,"columnArticles":140,"formTitle":"[1366]通过投票对团队排名","frequency":0.0,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":13228,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4179390882425505,"acs":15246,"articleLive":2,"columnArticles":222,"formTitle":"[1367]二叉树中的列表","frequency":0.0,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":36479,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5252731245447925,"acs":3606,"articleLive":2,"columnArticles":88,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6865,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6063027075011096,"acs":2732,"articleLive":2,"columnArticles":42,"formTitle":"[1369]获取最近第二次的活动","frequency":0.0,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"lock","submitted":4506,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7900707589762112,"acs":48124,"articleLive":2,"columnArticles":579,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60911,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5800687472719337,"acs":21263,"articleLive":2,"columnArticles":266,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":0.0,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":36656,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5131332082551595,"acs":8205,"articleLive":2,"columnArticles":162,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.0,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15990,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.404443240314278,"acs":7464,"articleLive":2,"columnArticles":168,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":0.0,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":18455,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7396550222144787,"acs":16981,"articleLive":2,"columnArticles":227,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22958,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5750231757383129,"acs":8684,"articleLive":2,"columnArticles":172,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":15102,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5033046264770679,"acs":7539,"articleLive":2,"columnArticles":154,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14979,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32431384710807876,"acs":4183,"articleLive":2,"columnArticles":130,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12898,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.861452247525933,"acs":7225,"articleLive":2,"columnArticles":61,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"lock","submitted":8387,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8374376307741832,"acs":10406,"articleLive":2,"columnArticles":161,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12426,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7280648253027795,"acs":16712,"articleLive":2,"columnArticles":252,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22954,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7316803051744294,"acs":11892,"articleLive":2,"columnArticles":157,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":16253,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6927398444252377,"acs":11221,"articleLive":2,"columnArticles":175,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":16198,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32308776876982725,"acs":4583,"articleLive":2,"columnArticles":87,"formTitle":"[1383]最大的团队表现值","frequency":0.0,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":14185,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5431793179317932,"acs":1975,"articleLive":2,"columnArticles":45,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"lock","submitted":3636,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7008894144259935,"acs":13633,"articleLive":2,"columnArticles":204,"formTitle":"[1385]两个数组间的距离值","frequency":0.0,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":19451,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31241946674596094,"acs":6304,"articleLive":2,"columnArticles":130,"formTitle":"[1386]安排电影院座位","frequency":0.0,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":20178,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6954433062522077,"acs":9844,"articleLive":2,"columnArticles":171,"formTitle":"[1387]将整数按权重排序","frequency":0.0,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":14155,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5421066185938708,"acs":4210,"articleLive":2,"columnArticles":53,"formTitle":"[1388]3n 块披萨","frequency":0.0,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7766,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8312879815918344,"acs":28179,"articleLive":2,"columnArticles":480,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.0,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33898,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3541631857421331,"acs":6359,"articleLive":2,"columnArticles":116,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17955,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3997724823374446,"acs":6677,"articleLive":2,"columnArticles":203,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.0,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16702,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.40440573770491806,"acs":7894,"articleLive":2,"columnArticles":144,"formTitle":"[1392]最长快乐前缀","frequency":0.0,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":19520,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8559765543227967,"acs":4089,"articleLive":2,"columnArticles":61,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"lock","submitted":4777,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6654007130677414,"acs":17170,"articleLive":2,"columnArticles":276,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":25804,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7482422079966419,"acs":14260,"articleLive":2,"columnArticles":212,"formTitle":"[1395]统计作战单位数","frequency":0.0,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":19058,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41291064910331693,"acs":10407,"articleLive":2,"columnArticles":144,"formTitle":"[1396]设计地铁系统","frequency":0.0,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":25204,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3743159430864648,"acs":1026,"articleLive":2,"columnArticles":37,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2741,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7622365441560703,"acs":4376,"articleLive":2,"columnArticles":66,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"lock","submitted":5741,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6714082503556188,"acs":9440,"articleLive":2,"columnArticles":153,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":14060,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6056621779238681,"acs":5712,"articleLive":2,"columnArticles":98,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.0,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"ac","submitted":9431,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41716227697536107,"acs":3928,"articleLive":2,"columnArticles":89,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9416,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7531162355874104,"acs":9667,"articleLive":2,"columnArticles":178,"formTitle":"[1402]做菜顺序","frequency":0.0,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12836,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912177645805765,"acs":21416,"articleLive":2,"columnArticles":362,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.0,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":30983,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4932404752150758,"acs":7224,"articleLive":2,"columnArticles":154,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.0,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14646,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5075517771547436,"acs":5612,"articleLive":2,"columnArticles":140,"formTitle":"[1405]最长快乐字符串","frequency":0.0,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":11057,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5685931115002919,"acs":4870,"articleLive":2,"columnArticles":81,"formTitle":"[1406]石子游戏 III","frequency":0.0,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8565,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.666742415634587,"acs":5868,"articleLive":2,"columnArticles":67,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"lock","submitted":8801,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6144798865040502,"acs":13427,"articleLive":2,"columnArticles":204,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":21851,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8069040986868284,"acs":8111,"articleLive":2,"columnArticles":129,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":10052,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4752039775624681,"acs":7455,"articleLive":2,"columnArticles":119,"formTitle":"[1410]HTML 实体解析器","frequency":0.0,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15688,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5506047103755569,"acs":7785,"articleLive":2,"columnArticles":141,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":0.0,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":14139,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5524786986831913,"acs":2853,"articleLive":2,"columnArticles":67,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"lock","submitted":5164,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6935913705583756,"acs":10931,"articleLive":2,"columnArticles":224,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.0,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":15760,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6039241227713099,"acs":7418,"articleLive":2,"columnArticles":149,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":12283,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6845644527208773,"acs":6617,"articleLive":2,"columnArticles":181,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.0,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9666,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4086629001883239,"acs":2821,"articleLive":2,"columnArticles":51,"formTitle":"[1416]恢复数组","frequency":0.0,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6903,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5191311679447544,"acs":12930,"articleLive":2,"columnArticles":183,"formTitle":"[1417]重新格式化字符串","frequency":0.0,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24907,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327001356852103,"acs":25920,"articleLive":2,"columnArticles":415,"formTitle":"[1418]点菜展示表","frequency":0.0,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":35376,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4188789000528821,"acs":7921,"articleLive":2,"columnArticles":154,"formTitle":"[1419]数青蛙","frequency":0.0,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18910,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5992179863147605,"acs":2452,"articleLive":2,"columnArticles":43,"formTitle":"[1420]生成数组","frequency":0.0,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":4092,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7487844408427877,"acs":2772,"articleLive":2,"columnArticles":35,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"lock","submitted":3702,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404120443740095,"acs":10571,"articleLive":2,"columnArticles":195,"formTitle":"[1422]分割字符串的最大得分","frequency":0.0,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":19561,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541581636688656,"acs":35030,"articleLive":2,"columnArticles":510,"formTitle":"[1423]可获得的最大点数","frequency":0.0,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":63213,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.398088044376254,"acs":6746,"articleLive":2,"columnArticles":146,"formTitle":"[1424]对角线遍历 II","frequency":0.0,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16946,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4398798962740549,"acs":3223,"articleLive":2,"columnArticles":69,"formTitle":"[1425]带限制的子序列和","frequency":0.0,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":7327,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7092743873137914,"acs":1476,"articleLive":2,"columnArticles":48,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"lock","submitted":2081,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6557949912638322,"acs":1126,"articleLive":2,"columnArticles":45,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"lock","submitted":1717,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5956727518593644,"acs":881,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"lock","submitted":1479,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5051063829787235,"acs":1187,"articleLive":2,"columnArticles":38,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"lock","submitted":2350,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5837479270315091,"acs":704,"articleLive":2,"columnArticles":27,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"lock","submitted":1206,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462656517479356,"acs":78602,"articleLive":2,"columnArticles":1032,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.0,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":92881,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3940633704735376,"acs":4527,"articleLive":2,"columnArticles":99,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11488,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6410365335598981,"acs":6036,"articleLive":2,"columnArticles":102,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9416,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4662174467310144,"acs":2560,"articleLive":2,"columnArticles":46,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5491,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6186428038777032,"acs":4148,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"lock","submitted":6705,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.8214548681254366,"acs":43510,"articleLive":2,"columnArticles":642,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"ac","submitted":52967,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5865400726054175,"acs":10502,"articleLive":2,"columnArticles":176,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.0,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":17905,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4830890312765148,"acs":33023,"articleLive":2,"columnArticles":465,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":0.0,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":68358,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5626506024096386,"acs":3736,"articleLive":2,"columnArticles":57,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6640,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6991891184933299,"acs":2673,"articleLive":2,"columnArticles":36,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"lock","submitted":3823,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6478781988986071,"acs":18000,"articleLive":2,"columnArticles":378,"formTitle":"[1441]用栈操作构建数组","frequency":0.0,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":27783,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7915487816008031,"acs":34692,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":0.0,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43828,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41071558564460947,"acs":5642,"articleLive":2,"columnArticles":140,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13737,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5267678785457451,"acs":2637,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":5006,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8572961373390557,"acs":3995,"articleLive":2,"columnArticles":53,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"lock","submitted":4660,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729166666666666,"acs":12760,"articleLive":2,"columnArticles":217,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":22272,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6176716044231171,"acs":5921,"articleLive":2,"columnArticles":74,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9586,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7110191637630662,"acs":9795,"articleLive":2,"columnArticles":158,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.0,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":13776,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275972296217368,"acs":16492,"articleLive":2,"columnArticles":208,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":0.0,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":26278,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8026149444407479,"acs":24125,"articleLive":2,"columnArticles":342,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.0,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":30058,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5231825987406984,"acs":10054,"articleLive":2,"columnArticles":153,"formTitle":"[1451]重新排列句子中的单词","frequency":0.0,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":19217,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49903741525069056,"acs":5962,"articleLive":2,"columnArticles":90,"formTitle":"[1452]收藏清单","frequency":0.0,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11947,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36465074760098193,"acs":1634,"articleLive":2,"columnArticles":31,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4481,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.39631118467722865,"acs":5028,"articleLive":2,"columnArticles":81,"formTitle":"[1454]活跃用户","frequency":0.0,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"lock","submitted":12687,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6330280058959781,"acs":12025,"articleLive":2,"columnArticles":205,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18996,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5230655915645837,"acs":13493,"articleLive":2,"columnArticles":210,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":25796,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6322596001269438,"acs":7969,"articleLive":2,"columnArticles":140,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12604,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4426345609065156,"acs":5625,"articleLive":2,"columnArticles":90,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12708,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.596870925684485,"acs":2289,"articleLive":2,"columnArticles":48,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"lock","submitted":3835,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.744900431222443,"acs":15374,"articleLive":2,"columnArticles":311,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":20639,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5011455239711498,"acs":5906,"articleLive":2,"columnArticles":84,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11785,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42742982036746124,"acs":6258,"articleLive":2,"columnArticles":125,"formTitle":"[1462]课程表 IV","frequency":0.0,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":14641,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5914781462771799,"acs":2693,"articleLive":2,"columnArticles":65,"formTitle":"[1463]摘樱桃 II","frequency":0.0,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4553,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7676569749013054,"acs":26640,"articleLive":2,"columnArticles":371,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.0,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":34703,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3097083615928689,"acs":6393,"articleLive":2,"columnArticles":81,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":20642,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4835023459966702,"acs":6389,"articleLive":2,"columnArticles":124,"formTitle":"[1466]重新规划路线","frequency":0.0,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":13214,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6179649645918748,"acs":1658,"articleLive":2,"columnArticles":49,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2683,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7008466603951082,"acs":2980,"articleLive":2,"columnArticles":51,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"lock","submitted":4252,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.7953321364452424,"acs":2215,"articleLive":2,"columnArticles":83,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"lock","submitted":2785,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8427942794279428,"acs":53627,"articleLive":2,"columnArticles":725,"formTitle":"[1470]重新排列数组","frequency":0.0,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":63630,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5445923093890155,"acs":7407,"articleLive":2,"columnArticles":106,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13601,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6178078032488235,"acs":8139,"articleLive":2,"columnArticles":131,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":13174,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6743529616119507,"acs":15529,"articleLive":2,"columnArticles":166,"formTitle":"[1473]粉刷房子 III","frequency":0.0,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":23028,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7179203539823009,"acs":1947,"articleLive":2,"columnArticles":62,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"lock","submitted":2712,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7219189887963229,"acs":15078,"articleLive":2,"columnArticles":233,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":20886,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8651954085815796,"acs":12663,"articleLive":2,"columnArticles":118,"formTitle":"[1476]子矩形查询","frequency":0.0,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14636,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2904652396957368,"acs":4926,"articleLive":2,"columnArticles":97,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.0,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16959,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5806872553284037,"acs":2670,"articleLive":2,"columnArticles":57,"formTitle":"[1478]安排邮筒","frequency":0.0,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4598,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5652299681805033,"acs":1954,"articleLive":2,"columnArticles":39,"formTitle":"[1479]周内每天的销售情况","frequency":0.0,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"lock","submitted":3457,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8692197068414905,"acs":128741,"articleLive":2,"columnArticles":1290,"formTitle":"[1480]一维数组的动态和","frequency":0.0,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":148111,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5142452305045291,"acs":10162,"articleLive":2,"columnArticles":146,"formTitle":"[1481]不同整数的最少数目","frequency":0.0,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":19761,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5865527558758774,"acs":31170,"articleLive":2,"columnArticles":405,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":0.0,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":53141,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.300223114680946,"acs":3364,"articleLive":2,"columnArticles":70,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":11205,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8087487283825026,"acs":795,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"lock","submitted":983,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6594378903539209,"acs":3801,"articleLive":2,"columnArticles":44,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"lock","submitted":5764,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8583559823639548,"acs":71059,"articleLive":2,"columnArticles":683,"formTitle":"[1486]数组异或操作","frequency":0.0,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":82785,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.31089936879347085,"acs":7733,"articleLive":2,"columnArticles":106,"formTitle":"[1487]保证文件名唯一","frequency":0.0,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24873,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23718801726656064,"acs":7308,"articleLive":2,"columnArticles":113,"formTitle":"[1488]避免洪水泛滥","frequency":0.0,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":30811,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6910330800981037,"acs":11552,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16717,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.856325947105075,"acs":1198,"articleLive":2,"columnArticles":29,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"lock","submitted":1399,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6716116661620749,"acs":19965,"articleLive":2,"columnArticles":297,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":29727,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6618972951783614,"acs":6754,"articleLive":2,"columnArticles":80,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":10204,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.56769163509181,"acs":7791,"articleLive":2,"columnArticles":148,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":0.0,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":13724,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3710815690136222,"acs":2261,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":0.0,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":6093,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5420815714090848,"acs":3974,"articleLive":2,"columnArticles":38,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"lock","submitted":7331,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5373324200019571,"acs":10982,"articleLive":2,"columnArticles":166,"formTitle":"[1496]判断路径是否相交","frequency":0.0,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":20438,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3909532256558678,"acs":8375,"articleLive":2,"columnArticles":114,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":21422,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3345047923322684,"acs":5235,"articleLive":2,"columnArticles":67,"formTitle":"[1498]满足条件的子序列数目","frequency":0.0,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15650,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3743109151047409,"acs":2716,"articleLive":2,"columnArticles":59,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":7256,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.30213592233009706,"acs":778,"articleLive":2,"columnArticles":27,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"lock","submitted":2575,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.590518476081352,"acs":4123,"articleLive":2,"columnArticles":61,"formTitle":"[1501]可以放心投资的国家","frequency":0.0,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"lock","submitted":6982,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.71679522549406,"acs":25462,"articleLive":2,"columnArticles":304,"formTitle":"[1502]判断能否形成等差数列","frequency":0.0,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":35522,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5132446362219825,"acs":8564,"articleLive":2,"columnArticles":87,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.0,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16686,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5950003993291271,"acs":7450,"articleLive":2,"columnArticles":134,"formTitle":"[1504]统计全 1 子矩形","frequency":0.0,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":12521,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3631364786099197,"acs":3302,"articleLive":2,"columnArticles":74,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":0.0,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":9093,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8412698412698413,"acs":583,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":0.0,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"lock","submitted":693,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5902276176024279,"acs":9724,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":0.0,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":16475,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.552956111715633,"acs":6098,"articleLive":2,"columnArticles":53,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.0,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":11028,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5477995367445778,"acs":5203,"articleLive":2,"columnArticles":77,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":9498,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5767879406097699,"acs":5089,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.0,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8823,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6780977030087351,"acs":4192,"articleLive":2,"columnArticles":60,"formTitle":"[1511]消费者下单频率","frequency":0.0,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"lock","submitted":6182,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488917767670204,"acs":58790,"articleLive":2,"columnArticles":749,"formTitle":"[1512]好数对的数目","frequency":0.0,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":69255,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.38029279665375254,"acs":11092,"articleLive":2,"columnArticles":150,"formTitle":"[1513]仅含 1 的子串数","frequency":0.0,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":29167,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.32394596807204257,"acs":7914,"articleLive":2,"columnArticles":137,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":24430,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34284780477176163,"acs":3147,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9179,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5849514563106796,"acs":241,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"lock","submitted":412,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7328941776455589,"acs":3449,"articleLive":2,"columnArticles":36,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"lock","submitted":4706,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6743124223266872,"acs":24959,"articleLive":2,"columnArticles":400,"formTitle":"[1518]换酒问题","frequency":0.0,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":37014,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29784824462061155,"acs":5523,"articleLive":2,"columnArticles":124,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18543,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33298027273930886,"acs":2515,"articleLive":2,"columnArticles":71,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7553,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3962546816479401,"acs":2645,"articleLive":2,"columnArticles":51,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.0,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6675,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7109004739336493,"acs":750,"articleLive":2,"columnArticles":28,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"lock","submitted":1055,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5777982602684486,"acs":10030,"articleLive":2,"columnArticles":171,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":17359,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4291903831450174,"acs":5052,"articleLive":2,"columnArticles":101,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.0,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":11771,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6614259597806216,"acs":5427,"articleLive":2,"columnArticles":110,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":8205,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6164623467600701,"acs":3168,"articleLive":2,"columnArticles":50,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":5139,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5018095768374164,"acs":3605,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"lock","submitted":7184,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7851326228692624,"acs":29985,"articleLive":2,"columnArticles":360,"formTitle":"[1528]重新排列字符串","frequency":0.0,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":38191,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6909781429235777,"acs":8915,"articleLive":2,"columnArticles":134,"formTitle":"[1529]灯泡开关 IV","frequency":0.0,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12902,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5676045330207112,"acs":8715,"articleLive":2,"columnArticles":147,"formTitle":"[1530]好叶子节点对的数量","frequency":0.0,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":15354,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3297625424031423,"acs":1847,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":0.0,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5601,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6143865240154792,"acs":2699,"articleLive":2,"columnArticles":49,"formTitle":"[1532]最近的三笔订单","frequency":0.0,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"lock","submitted":4393,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6197478991596639,"acs":295,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"lock","submitted":476,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7890607075666498,"acs":17196,"articleLive":2,"columnArticles":160,"formTitle":"[1534]统计好三元组","frequency":0.0,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21793,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45328222328701484,"acs":13244,"articleLive":2,"columnArticles":182,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.0,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":29218,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.44050171526586623,"acs":4109,"articleLive":2,"columnArticles":79,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9328,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3669348218683303,"acs":4470,"articleLive":2,"columnArticles":89,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":12182,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.6009389671361502,"acs":128,"articleLive":2,"columnArticles":7,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"lock","submitted":213,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5393464052287582,"acs":16504,"articleLive":2,"columnArticles":248,"formTitle":"[1539]第 k 个缺失的正整数","frequency":0.0,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":30600,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3175971269996735,"acs":4864,"articleLive":2,"columnArticles":86,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":15315,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4614494095855522,"acs":5979,"articleLive":2,"columnArticles":92,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12957,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38558282208588956,"acs":2514,"articleLive":2,"columnArticles":47,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6520,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5510166013803395,"acs":2954,"articleLive":2,"columnArticles":43,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"lock","submitted":5361,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5464596889820227,"acs":19819,"articleLive":2,"columnArticles":320,"formTitle":"[1544]整理字符串","frequency":0.0,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":36268,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5539393044377169,"acs":7502,"articleLive":2,"columnArticles":101,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.0,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13543,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4142571085302363,"acs":5172,"articleLive":2,"columnArticles":79,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12485,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5366657873911896,"acs":4069,"articleLive":2,"columnArticles":70,"formTitle":"[1547]切棍子的最小成本","frequency":0.0,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7582,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7125506072874493,"acs":352,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"lock","submitted":494,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6636217087587318,"acs":2470,"articleLive":2,"columnArticles":48,"formTitle":"[1549]每件商品的最新订单","frequency":0.0,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"lock","submitted":3722,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6593083377194341,"acs":21295,"articleLive":2,"columnArticles":290,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.0,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":32299,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8167977855477856,"acs":11213,"articleLive":2,"columnArticles":152,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.0,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13728,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5104079468720353,"acs":9146,"articleLive":2,"columnArticles":124,"formTitle":"[1552]两球之间的磁力","frequency":0.0,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17919,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2958564063395073,"acs":7747,"articleLive":2,"columnArticles":122,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":0.0,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":26185,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7107001321003963,"acs":538,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"lock","submitted":757,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4375898763301697,"acs":3043,"articleLive":2,"columnArticles":58,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"lock","submitted":6954,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.578894312393888,"acs":10911,"articleLive":2,"columnArticles":167,"formTitle":"[1556]千位分隔数","frequency":0.0,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":18848,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.768663236578973,"acs":7918,"articleLive":2,"columnArticles":107,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":10301,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6220865704772475,"acs":4484,"articleLive":2,"columnArticles":69,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.0,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":7208,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3666876442206839,"acs":3496,"articleLive":2,"columnArticles":64,"formTitle":"[1559]二维网格图中探测环","frequency":0.0,"frontendQuestionId":"1559","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"","submitted":9534,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5724005813185361,"acs":8665,"articleLive":2,"columnArticles":91,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.0,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":15138,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.779559118236473,"acs":11670,"articleLive":2,"columnArticles":168,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.0,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14970,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3093315877518365,"acs":4253,"articleLive":2,"columnArticles":87,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.0,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13749,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37870273359367557,"acs":3976,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":0.0,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10499,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5453047775947282,"acs":662,"articleLive":2,"columnArticles":24,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"lock","submitted":1214,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7230565371024735,"acs":3274,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.0,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"lock","submitted":4528,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4458570062440232,"acs":7926,"articleLive":2,"columnArticles":120,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.0,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17777,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3996975961983522,"acs":12953,"articleLive":2,"columnArticles":206,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.0,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":32407,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45612172682236374,"acs":2578,"articleLive":2,"columnArticles":47,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5652,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47474747474747475,"acs":2068,"articleLive":2,"columnArticles":45,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4356,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8963121325494388,"acs":1677,"articleLive":2,"columnArticles":37,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"lock","submitted":1871,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.758750553832521,"acs":3425,"articleLive":2,"columnArticles":43,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"lock","submitted":4514,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049530387903803,"acs":19112,"articleLive":2,"columnArticles":322,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.0,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":23743,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29508196721311475,"acs":4464,"articleLive":2,"columnArticles":65,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":15128,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32660024566671214,"acs":4786,"articleLive":2,"columnArticles":84,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":0.0,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":14654,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.5969079409697822,"acs":4247,"articleLive":2,"columnArticles":68,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":7115,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47641234711706465,"acs":17996,"articleLive":2,"columnArticles":255,"formTitle":"[1576]替换所有的问号","frequency":0.0,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":37774,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3252048009144599,"acs":5121,"articleLive":2,"columnArticles":79,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.0,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15747,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5824252136752137,"acs":10903,"articleLive":2,"columnArticles":203,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18720,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6191116575731961,"acs":16113,"articleLive":2,"columnArticles":294,"formTitle":"[1579]保证图可完全遍历","frequency":0.0,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":26026,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.634090909090909,"acs":279,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"lock","submitted":440,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.806815565277458,"acs":3504,"articleLive":2,"columnArticles":48,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"lock","submitted":4343,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6707711792851112,"acs":9533,"articleLive":2,"columnArticles":109,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.0,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":14212,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.685330593674323,"acs":18678,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":0.0,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":27254,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6638704593406035,"acs":26116,"articleLive":2,"columnArticles":328,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":39339,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4299891735835438,"acs":2383,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5542,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6266233766233766,"acs":386,"articleLive":2,"columnArticles":24,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"lock","submitted":616,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.82531405546338,"acs":3482,"articleLive":2,"columnArticles":41,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"lock","submitted":4219,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8389453803155464,"acs":43975,"articleLive":2,"columnArticles":700,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.0,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"ac","submitted":52417,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2937904761904762,"acs":3856,"articleLive":2,"columnArticles":56,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":13125,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26862485276796233,"acs":3649,"articleLive":2,"columnArticles":57,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.0,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":13584,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.578263130525221,"acs":1112,"articleLive":2,"columnArticles":32,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1923,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44505084161544206,"acs":7747,"articleLive":2,"columnArticles":126,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":17407,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5315831030398737,"acs":5386,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.0,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":10132,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31354221191953935,"acs":4193,"articleLive":2,"columnArticles":100,"formTitle":"[1594]矩阵的最大非负积","frequency":0.0,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":13373,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46505905511811024,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":4064,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7493880048959608,"acs":2449,"articleLive":2,"columnArticles":43,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"lock","submitted":3268,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6628959276018099,"acs":293,"articleLive":2,"columnArticles":20,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"lock","submitted":442,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6726874657909141,"acs":11061,"articleLive":2,"columnArticles":150,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.0,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":16443,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41934084995663484,"acs":3868,"articleLive":2,"columnArticles":69,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":9224,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6788799164356595,"acs":16898,"articleLive":2,"columnArticles":207,"formTitle":"[1600]皇位继承顺序","frequency":0.0,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24891,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48988309352517984,"acs":2179,"articleLive":2,"columnArticles":40,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4448,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7833894500561167,"acs":698,"articleLive":2,"columnArticles":29,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"lock","submitted":891,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8444832123479058,"acs":57120,"articleLive":2,"columnArticles":456,"formTitle":"[1603]设计停车系统","frequency":0.0,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":67639,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41564012318521776,"acs":3779,"articleLive":2,"columnArticles":63,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":9092,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7360634648370498,"acs":3433,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":4664,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3404477924251936,"acs":1627,"articleLive":2,"columnArticles":34,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4779,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5445769449176604,"acs":2877,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"lock","submitted":5283,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6399430125631395,"acs":9882,"articleLive":2,"columnArticles":162,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":15442,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.511809348180722,"acs":7216,"articleLive":2,"columnArticles":125,"formTitle":"[1609]奇偶树","frequency":0.0,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":14099,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27037545787545786,"acs":2362,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8736,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6101251091067792,"acs":2097,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3437,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.735973597359736,"acs":446,"articleLive":2,"columnArticles":20,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"lock","submitted":606,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7233404710920771,"acs":1689,"articleLive":2,"columnArticles":36,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"lock","submitted":2335,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8215289216161225,"acs":16958,"articleLive":2,"columnArticles":286,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.0,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":20642,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49647233568510957,"acs":5348,"articleLive":2,"columnArticles":64,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10772,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.275663837941418,"acs":5035,"articleLive":2,"columnArticles":93,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.0,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":18265,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6214788732394366,"acs":1765,"articleLive":2,"columnArticles":33,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2840,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5933456561922366,"acs":321,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"lock","submitted":541,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6741091770709924,"acs":7397,"articleLive":2,"columnArticles":128,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10973,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37140287769784175,"acs":2478,"articleLive":2,"columnArticles":43,"formTitle":"[1620]网络信号最好的坐标","frequency":0.0,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6672,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.44122741895570405,"acs":1783,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":4041,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14993684970229146,"acs":2493,"articleLive":2,"columnArticles":55,"formTitle":"[1622]奇妙序列","frequency":0.0,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":16627,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7820658342792282,"acs":3445,"articleLive":2,"columnArticles":45,"formTitle":"[1623]三人国家代表队","frequency":0.0,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"lock","submitted":4405,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6255302947895137,"acs":11501,"articleLive":2,"columnArticles":198,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.0,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":18386,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.543205317577548,"acs":2942,"articleLive":2,"columnArticles":66,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5416,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38670724523856276,"acs":3939,"articleLive":2,"columnArticles":85,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.0,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":10186,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3810264385692068,"acs":2450,"articleLive":2,"columnArticles":38,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6430,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.83991683991684,"acs":404,"articleLive":2,"columnArticles":18,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"lock","submitted":481,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5244475051649659,"acs":8377,"articleLive":2,"columnArticles":99,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":15973,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7682611840066123,"acs":7436,"articleLive":2,"columnArticles":116,"formTitle":"[1630]等差子数组","frequency":0.0,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9679,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4931957645328016,"acs":25478,"articleLive":2,"columnArticles":300,"formTitle":"[1631]最小体力消耗路径","frequency":0.0,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"ac","submitted":51659,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3187527067994803,"acs":1472,"articleLive":2,"columnArticles":27,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4618,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6569641568438778,"acs":2731,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"lock","submitted":4157,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5262529832935561,"acs":441,"articleLive":2,"columnArticles":24,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"lock","submitted":838,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5462145843009754,"acs":1176,"articleLive":2,"columnArticles":31,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.0,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"lock","submitted":2153,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7053819981441386,"acs":9122,"articleLive":2,"columnArticles":178,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.0,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12932,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8066165413533835,"acs":5364,"articleLive":2,"columnArticles":70,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6650,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7118729518527854,"acs":2824,"articleLive":2,"columnArticles":47,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3967,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4020715630885122,"acs":1281,"articleLive":2,"columnArticles":28,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3186,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.659243915069912,"acs":12730,"articleLive":2,"columnArticles":217,"formTitle":"[1640]能否连接形成数组","frequency":0.0,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":19310,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7711249681852889,"acs":12119,"articleLive":2,"columnArticles":279,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":0.0,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15716,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4511518179295032,"acs":6502,"articleLive":2,"columnArticles":107,"formTitle":"[1642]可以到达的最远建筑","frequency":0.0,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":14412,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4514776357827476,"acs":2261,"articleLive":2,"columnArticles":48,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":5008,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5463671128107075,"acs":1143,"articleLive":2,"columnArticles":24,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.0,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"lock","submitted":2092,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4076884167931209,"acs":806,"articleLive":2,"columnArticles":24,"formTitle":"[1645]Hopper Company Queries II","frequency":0.0,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"lock","submitted":1977,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5365438833047316,"acs":35017,"articleLive":2,"columnArticles":357,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.0,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":65264,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5149595212953185,"acs":7315,"articleLive":2,"columnArticles":107,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":0.0,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":14205,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27791503945166174,"acs":3487,"articleLive":2,"columnArticles":90,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.0,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":12547,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474056165147852,"acs":2549,"articleLive":2,"columnArticles":65,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5377,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.793040293040293,"acs":1299,"articleLive":2,"columnArticles":30,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.0,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"lock","submitted":1638,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6836917562724014,"acs":763,"articleLive":2,"columnArticles":23,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"lock","submitted":1116,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6563612516394979,"acs":7006,"articleLive":2,"columnArticles":177,"formTitle":"[1652]拆炸弹","frequency":0.0,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":10674,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.505188421627526,"acs":3700,"articleLive":2,"columnArticles":86,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.0,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":7324,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2732347853436075,"acs":3475,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":0.0,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":12718,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3837275307473983,"acs":2028,"articleLive":2,"columnArticles":33,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":5285,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7815134384607756,"acs":7880,"articleLive":2,"columnArticles":93,"formTitle":"[1656]设计有序流","frequency":0.0,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":10083,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4648744610702511,"acs":5499,"articleLive":2,"columnArticles":76,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.0,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11829,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.3000335345405768,"acs":8947,"articleLive":2,"columnArticles":151,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":29820,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4128834355828221,"acs":1346,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":0.0,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3260,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7381818181818182,"acs":406,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"lock","submitted":550,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.725188705619234,"acs":2594,"articleLive":2,"columnArticles":54,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.0,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"lock","submitted":3577,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.812375249500998,"acs":20757,"articleLive":2,"columnArticles":286,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.0,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":25551,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5723092921339968,"acs":7705,"articleLive":2,"columnArticles":132,"formTitle":"[1663]具有给定数值的最小字符串","frequency":0.0,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":13463,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5455552199738246,"acs":5419,"articleLive":2,"columnArticles":107,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9933,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6635179984682155,"acs":5198,"articleLive":2,"columnArticles":82,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.0,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7834,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6985915492957746,"acs":248,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"lock","submitted":355,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6025781678551838,"acs":2197,"articleLive":2,"columnArticles":32,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"lock","submitted":3646,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4440712994058383,"acs":6876,"articleLive":2,"columnArticles":129,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":15484,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7578207381370826,"acs":12936,"articleLive":2,"columnArticles":237,"formTitle":"[1669]合并两个链表","frequency":0.0,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":17070,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5270833333333333,"acs":4301,"articleLive":2,"columnArticles":77,"formTitle":"[1670]设计前中后队列","frequency":0.0,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":8160,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.468259385665529,"acs":2058,"articleLive":2,"columnArticles":41,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.0,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4395,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8509397420661121,"acs":38665,"articleLive":2,"columnArticles":442,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":45438,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35441912693585365,"acs":7575,"articleLive":2,"columnArticles":169,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.0,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":21373,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36439942112879886,"acs":2518,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.0,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6910,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4346675487925901,"acs":2628,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":6046,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.765296803652968,"acs":838,"articleLive":2,"columnArticles":22,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.0,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"lock","submitted":1095,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.38921925954344905,"acs":2029,"articleLive":2,"columnArticles":32,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"lock","submitted":5213,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8302961275626424,"acs":17496,"articleLive":2,"columnArticles":282,"formTitle":"[1678]设计 Goal 解析器","frequency":0.0,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":21072,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4974259974259974,"acs":6957,"articleLive":2,"columnArticles":113,"formTitle":"[1679]K 和数对的最大数目","frequency":0.0,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13986,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4645858343337335,"acs":5418,"articleLive":2,"columnArticles":71,"formTitle":"[1680]连接连续二进制数字","frequency":0.0,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11662,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3840064620355412,"acs":2377,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":6190,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5229067930489731,"acs":331,"articleLive":2,"columnArticles":17,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"lock","submitted":633,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8958974358974359,"acs":3494,"articleLive":2,"columnArticles":37,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"lock","submitted":3900,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8284323271665044,"acs":17016,"articleLive":2,"columnArticles":356,"formTitle":"[1684]统计一致字符串的数目","frequency":0.0,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":20540,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5997736093143596,"acs":3709,"articleLive":2,"columnArticles":86,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":6184,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.47172830725462306,"acs":2653,"articleLive":2,"columnArticles":48,"formTitle":"[1686]石子游戏 VI","frequency":0.0,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5624,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40301003344481606,"acs":964,"articleLive":2,"columnArticles":21,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2392,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.804983268153046,"acs":19966,"articleLive":2,"columnArticles":267,"formTitle":"[1688]比赛中的配对次数","frequency":0.0,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":24803,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.867063258334315,"acs":14721,"articleLive":2,"columnArticles":195,"formTitle":"[1689]十-二进制数的最少数目","frequency":0.0,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16978,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.517874053030303,"acs":4375,"articleLive":2,"columnArticles":106,"formTitle":"[1690]石子游戏 VII","frequency":0.0,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8448,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4885480979884485,"acs":2453,"articleLive":2,"columnArticles":63,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":5021,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6523297491039427,"acs":182,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"lock","submitted":279,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.7995802728226653,"acs":2286,"articleLive":2,"columnArticles":33,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"lock","submitted":2859,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.63536227154047,"acs":7787,"articleLive":2,"columnArticles":137,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":12256,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4627679163290859,"acs":6283,"articleLive":2,"columnArticles":132,"formTitle":"[1695]删除子数组的最大得分","frequency":0.0,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":13577,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3976682296286909,"acs":6276,"articleLive":2,"columnArticles":115,"formTitle":"[1696]跳跃游戏 VI","frequency":0.0,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":15782,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5263285024154589,"acs":2179,"articleLive":2,"columnArticles":41,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4140,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5215469613259669,"acs":472,"articleLive":2,"columnArticles":17,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"lock","submitted":905,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7964601769911505,"acs":1800,"articleLive":2,"columnArticles":41,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"lock","submitted":2260,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7096291075676152,"acs":8055,"articleLive":2,"columnArticles":182,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.0,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":11351,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6093530787217459,"acs":3909,"articleLive":2,"columnArticles":80,"formTitle":"[1701]平均等待时间","frequency":0.0,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":6415,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4783309167069438,"acs":2969,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.0,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":6207,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3829596412556054,"acs":1281,"articleLive":2,"columnArticles":23,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3345,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814603500224373,"acs":12190,"articleLive":2,"columnArticles":185,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":15599,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3472348141432457,"acs":5745,"articleLive":2,"columnArticles":121,"formTitle":"[1705]吃苹果的最大数目","frequency":0.0,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":16545,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5856465809072444,"acs":4325,"articleLive":2,"columnArticles":111,"formTitle":"[1706]球会落何处","frequency":0.0,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7385,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5030677022378267,"acs":14185,"articleLive":2,"columnArticles":151,"formTitle":"[1707]与数组中元素的最大异或值","frequency":0.0,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":28197,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6991084695393759,"acs":941,"articleLive":2,"columnArticles":25,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"lock","submitted":1346,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7024673439767779,"acs":1452,"articleLive":2,"columnArticles":37,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"lock","submitted":2067,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.694505756726123,"acs":11642,"articleLive":2,"columnArticles":185,"formTitle":"[1710]卡车上的最大单元数","frequency":0.0,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"ac","submitted":16763,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3591477083035246,"acs":30121,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":0.0,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":83868,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2626492090372145,"acs":6359,"articleLive":2,"columnArticles":104,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":24211,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4960874386187233,"acs":15659,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":0.0,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31565,"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":"lock","submitted":389,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7317073170731707,"acs":1740,"articleLive":2,"columnArticles":36,"formTitle":"[1715]苹果和橘子的个数","frequency":0.0,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"lock","submitted":2378,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6734330772341286,"acs":8327,"articleLive":2,"columnArticles":194,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":12365,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43261296660117876,"acs":2202,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":5090,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4904205026125902,"acs":1971,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":4019,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3700234192037471,"acs":632,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1708,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8691559108653828,"acs":46532,"articleLive":2,"columnArticles":487,"formTitle":"[1720]解码异或后的数组","frequency":0.0,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":53537,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.645402264777376,"acs":10886,"articleLive":2,"columnArticles":168,"formTitle":"[1721]交换链表中的节点","frequency":0.0,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":16867,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5154046430896073,"acs":4751,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9218,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5065155437596537,"acs":23283,"articleLive":2,"columnArticles":176,"formTitle":"[1723]完成所有工作的最短时间","frequency":0.0,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":45967,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5629139072847682,"acs":340,"articleLive":2,"columnArticles":11,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"lock","submitted":604,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7879496928926587,"acs":10776,"articleLive":2,"columnArticles":147,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.0,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13676,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.48061746596132165,"acs":5542,"articleLive":2,"columnArticles":108,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11531,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5755143000501756,"acs":3441,"articleLive":2,"columnArticles":84,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.0,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5979,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3580167417900837,"acs":1112,"articleLive":2,"columnArticles":26,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":3106,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6214203894616266,"acs":2170,"articleLive":2,"columnArticles":22,"formTitle":"[1729]求关注者的数量","frequency":0.0,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"lock","submitted":3492,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5384615384615384,"acs":637,"articleLive":2,"columnArticles":23,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"lock","submitted":1183,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.46956964604023427,"acs":1844,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"lock","submitted":3927,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7913388429752066,"acs":11969,"articleLive":2,"columnArticles":205,"formTitle":"[1732]找到最高海拔","frequency":0.0,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":15125,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45940124919233255,"acs":2133,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":0.0,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4643,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232876712328767,"acs":27984,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":0.0,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38690,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4893717524799244,"acs":1036,"articleLive":2,"columnArticles":26,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2117,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44916678446339664,"acs":28598,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":0.0,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":63669,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.31618516641324546,"acs":3743,"articleLive":2,"columnArticles":105,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.0,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11838,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538726571113561,"acs":28467,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":0.0,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":43536,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4710700592540955,"acs":2703,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5738,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7014563106796117,"acs":578,"articleLive":2,"columnArticles":19,"formTitle":"[1740]找到二叉树中的距离","frequency":0.0,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"lock","submitted":824,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8417644678267908,"acs":2080,"articleLive":2,"columnArticles":31,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"lock","submitted":2471,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7086778585149921,"acs":8485,"articleLive":2,"columnArticles":129,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.0,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11973,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6968273716951788,"acs":22403,"articleLive":2,"columnArticles":327,"formTitle":"[1743]从相邻元素对还原数组","frequency":0.0,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":32150,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36282120257218253,"acs":28324,"articleLive":2,"columnArticles":368,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":0.0,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":78066,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4848268984185781,"acs":3403,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":7019,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5932659932659933,"acs":881,"articleLive":2,"columnArticles":38,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"lock","submitted":1485,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7031167459059694,"acs":1331,"articleLive":2,"columnArticles":34,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"lock","submitted":1893,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7479539556856744,"acs":11241,"articleLive":2,"columnArticles":224,"formTitle":"[1748]唯一元素的和","frequency":0.0,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":15029,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5313441400086071,"acs":3704,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":0.0,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6971,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4562674094707521,"acs":3276,"articleLive":2,"columnArticles":80,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":7180,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46984602224123184,"acs":2197,"articleLive":2,"columnArticles":33,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":0.0,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4676,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6799342575389452,"acs":9515,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13994,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6297458424850957,"acs":6021,"articleLive":2,"columnArticles":128,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9561,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42245775422457754,"acs":4225,"articleLive":2,"columnArticles":91,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.0,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":10001,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4106806564433683,"acs":3053,"articleLive":2,"columnArticles":51,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.0,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":7434,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.7954070981210856,"acs":381,"articleLive":2,"columnArticles":13,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"lock","submitted":479,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9210684273709484,"acs":3069,"articleLive":2,"columnArticles":32,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"lock","submitted":3332,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.638687422607465,"acs":7221,"articleLive":2,"columnArticles":114,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":11306,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.4295539033457249,"acs":4622,"articleLive":2,"columnArticles":97,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.0,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10760,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5396988804529661,"acs":4194,"articleLive":2,"columnArticles":77,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7771,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.43140495867768597,"acs":2610,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":6050,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.692079207920792,"acs":699,"articleLive":2,"columnArticles":21,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"lock","submitted":1010,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6098892988929889,"acs":4132,"articleLive":2,"columnArticles":82,"formTitle":"[1763]最长的美好子字符串","frequency":0.0,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":6775,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4745728234336859,"acs":2333,"articleLive":2,"columnArticles":55,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4916,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5518860778669898,"acs":3643,"articleLive":2,"columnArticles":83,"formTitle":"[1765]地图中的最高点","frequency":0.0,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6601,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3760660980810235,"acs":1411,"articleLive":2,"columnArticles":26,"formTitle":"[1766]互质树","frequency":0.0,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3752,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7904583723105706,"acs":845,"articleLive":2,"columnArticles":21,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"lock","submitted":1069,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7651172083111348,"acs":11489,"articleLive":2,"columnArticles":202,"formTitle":"[1768]交替合并字符串","frequency":0.0,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":15016,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8560682893847193,"acs":10129,"articleLive":2,"columnArticles":172,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.0,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11832,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3705329153605016,"acs":4137,"articleLive":2,"columnArticles":102,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.0,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":11165,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36552911709455227,"acs":2335,"articleLive":2,"columnArticles":47,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6388,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5201192250372578,"acs":349,"articleLive":2,"columnArticles":11,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"lock","submitted":671,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8427248469628001,"acs":16107,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":0.0,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":19113,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5512172714745062,"acs":6000,"articleLive":2,"columnArticles":90,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.0,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10885,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4743021710234825,"acs":4282,"articleLive":2,"columnArticles":92,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.0,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":9028,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4628334628334628,"acs":1787,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":0.0,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3861,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7821397756686799,"acs":5439,"articleLive":2,"columnArticles":61,"formTitle":"[1777]每家商店的产品价格","frequency":0.0,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"lock","submitted":6954,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5186246418338109,"acs":181,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"lock","submitted":349,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6481828839390387,"acs":5529,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.0,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":8530,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6657408525540394,"acs":5513,"articleLive":2,"columnArticles":112,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":8281,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5200353937555303,"acs":4114,"articleLive":2,"columnArticles":61,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.0,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7911,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2923749392909179,"acs":1204,"articleLive":2,"columnArticles":33,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4118,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7985516787360105,"acs":1213,"articleLive":2,"columnArticles":29,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"lock","submitted":1519,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42156675879157535,"acs":8847,"articleLive":2,"columnArticles":101,"formTitle":"[1784]检查二进制字符串字段","frequency":0.0,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20986,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.35024853881029117,"acs":6412,"articleLive":2,"columnArticles":62,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":18307,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.34207891047466454,"acs":3416,"articleLive":2,"columnArticles":88,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9986,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541428492147178,"acs":11787,"articleLive":2,"columnArticles":60,"formTitle":"[1787]使所有区间的异或结果为零","frequency":0.0,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":18019,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.7169230769230769,"acs":233,"articleLive":2,"columnArticles":16,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"lock","submitted":325,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7103228740336517,"acs":1562,"articleLive":2,"columnArticles":30,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"lock","submitted":2199,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6441101528812231,"acs":13145,"articleLive":2,"columnArticles":144,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":20408,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8088767387633674,"acs":10060,"articleLive":2,"columnArticles":137,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":12437,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5138293728087261,"acs":6595,"articleLive":2,"columnArticles":105,"formTitle":"[1792]最大平均通过率","frequency":0.0,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12835,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41439626841937877,"acs":3909,"articleLive":2,"columnArticles":94,"formTitle":"[1793]好子数组的最大分数","frequency":0.0,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9433,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.5791245791245792,"acs":172,"articleLive":2,"columnArticles":9,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"lock","submitted":297,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7834448160535117,"acs":1874,"articleLive":2,"columnArticles":28,"formTitle":"[1795]每个产品在不同商店的价格","frequency":0.0,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"lock","submitted":2392,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4885490597790298,"acs":6677,"articleLive":2,"columnArticles":122,"formTitle":"[1796]字符串中第二大的数字","frequency":0.0,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":13667,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5736149759676196,"acs":4535,"articleLive":2,"columnArticles":72,"formTitle":"[1797]设计一个验证系统","frequency":0.0,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":7906,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5213646343523054,"acs":3087,"articleLive":2,"columnArticles":51,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5921,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5182017543859649,"acs":2363,"articleLive":2,"columnArticles":34,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.0,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4560,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6826688930633827,"acs":9812,"articleLive":2,"columnArticles":154,"formTitle":"[1800]最大升序子数组和","frequency":0.0,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":14373,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37943327239488117,"acs":4151,"articleLive":2,"columnArticles":110,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10940,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2624875124875125,"acs":4204,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":16016,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4090734332948866,"acs":2128,"articleLive":2,"columnArticles":54,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":0.0,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":5202,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.573019801980198,"acs":463,"articleLive":2,"columnArticles":29,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.0,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"lock","submitted":808,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.48753974392025434,"acs":11347,"articleLive":2,"columnArticles":149,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.0,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":23274,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.662621359223301,"acs":5187,"articleLive":2,"columnArticles":81,"formTitle":"[1806]还原排列的最少操作步数","frequency":0.0,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7828,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5861963190184049,"acs":5733,"articleLive":2,"columnArticles":87,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9780,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2678943330044941,"acs":2444,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.0,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":9123,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6249094858797972,"acs":1726,"articleLive":2,"columnArticles":31,"formTitle":"[1809]没有广告的剧集","frequency":0.0,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"lock","submitted":2762,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6216216216216216,"acs":184,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":0.0,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"lock","submitted":296,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.663594470046083,"acs":864,"articleLive":2,"columnArticles":27,"formTitle":"[1811]寻找面试候选人","frequency":0.0,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"lock","submitted":1302,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7943081452404318,"acs":8094,"articleLive":2,"columnArticles":190,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":10190,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5134026519126205,"acs":5382,"articleLive":2,"columnArticles":74,"formTitle":"[1813]句子相似性 III","frequency":0.0,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":10483,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34565637065637067,"acs":3581,"articleLive":2,"columnArticles":79,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.0,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":10360,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.2993777777777778,"acs":1684,"articleLive":2,"columnArticles":39,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5625,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7522519276500684,"acs":10439,"articleLive":2,"columnArticles":156,"formTitle":"[1816]截断句子","frequency":0.0,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":13877,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6988120195667366,"acs":6000,"articleLive":2,"columnArticles":98,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.0,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8586,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37335440468595954,"acs":25751,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":0.0,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":68972,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3683206106870229,"acs":2316,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6288,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.5048543689320388,"acs":104,"articleLive":2,"columnArticles":8,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"lock","submitted":206,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9012390670553936,"acs":2473,"articleLive":2,"columnArticles":22,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":0.0,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"lock","submitted":2744,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8094853030364291,"acs":20021,"articleLive":2,"columnArticles":200,"formTitle":"[1822]数组元素积的符号","frequency":0.0,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":24733,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7158231040860938,"acs":8514,"articleLive":2,"columnArticles":105,"formTitle":"[1823]找出游戏的获胜者","frequency":0.0,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":11894,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6553148444744162,"acs":7774,"articleLive":2,"columnArticles":154,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11863,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2857451403887689,"acs":2646,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.0,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":9260,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4292527821939587,"acs":270,"articleLive":2,"columnArticles":22,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"lock","submitted":629,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7937458416500333,"acs":9544,"articleLive":2,"columnArticles":139,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":12024,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.867031372111198,"acs":7766,"articleLive":2,"columnArticles":102,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.0,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8957,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6825260996063666,"acs":3988,"articleLive":2,"columnArticles":83,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5843,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48645598194130923,"acs":862,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1772,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7392739273927392,"acs":896,"articleLive":2,"columnArticles":23,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"lock","submitted":1212,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.824164366758663,"acs":13438,"articleLive":2,"columnArticles":213,"formTitle":"[1832]判断句子是否为全字母句","frequency":0.0,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":16305,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.684355703225402,"acs":43666,"articleLive":2,"columnArticles":389,"formTitle":"[1833]雪糕的最大数量","frequency":0.0,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":63806,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3542473833342971,"acs":6126,"articleLive":2,"columnArticles":131,"formTitle":"[1834]单线程 CPU","frequency":0.0,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":17293,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.509914217409647,"acs":3626,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.0,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":7111,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7089678510998308,"acs":419,"articleLive":2,"columnArticles":27,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.0,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"lock","submitted":591,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7951622780159217,"acs":7791,"articleLive":2,"columnArticles":86,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9798,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42905360394368697,"acs":28983,"articleLive":2,"columnArticles":307,"formTitle":"[1838]最高频元素的频数","frequency":0.0,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":67551,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5745243128964059,"acs":6522,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":11352,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38865836791147995,"acs":1967,"articleLive":2,"columnArticles":47,"formTitle":"[1840]最高建筑高度","frequency":0.0,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":5061,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5146166574738004,"acs":933,"articleLive":2,"columnArticles":29,"formTitle":"[1841]联赛信息统计","frequency":0.0,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"lock","submitted":1813,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6555555555555556,"acs":118,"articleLive":2,"columnArticles":11,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"lock","submitted":180,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5099127676447264,"acs":643,"articleLive":2,"columnArticles":22,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.0,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"lock","submitted":1261,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8000693802035153,"acs":6919,"articleLive":2,"columnArticles":115,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":8648,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5341538963156178,"acs":6553,"articleLive":2,"columnArticles":62,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":12268,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336160334643407,"acs":27568,"articleLive":2,"columnArticles":376,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":0.0,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":43509,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35963161933998467,"acs":2343,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.0,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6515,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6831752722163681,"acs":7780,"articleLive":2,"columnArticles":100,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":11388,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32818352059925093,"acs":5608,"articleLive":2,"columnArticles":108,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.0,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":17088,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6102734474827498,"acs":2388,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.0,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3913,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4005209376878381,"acs":1999,"articleLive":2,"columnArticles":48,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4991,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.6892857142857143,"acs":193,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"lock","submitted":280,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6428134556574924,"acs":1051,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.0,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"lock","submitted":1635,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7883270575578268,"acs":11724,"articleLive":2,"columnArticles":122,"formTitle":"[1854]人口最多的年份","frequency":0.0,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":14872,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.679945676776822,"acs":10514,"articleLive":2,"columnArticles":100,"formTitle":"[1855]下标对中的最大距离","frequency":0.0,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":15463,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35642538265306123,"acs":4471,"articleLive":2,"columnArticles":84,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.0,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":12544,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4517734909769757,"acs":2178,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4821,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6358595194085028,"acs":344,"articleLive":2,"columnArticles":19,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.0,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"lock","submitted":541,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.767413487133984,"acs":6919,"articleLive":2,"columnArticles":146,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":9016,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7714612743227776,"acs":4044,"articleLive":2,"columnArticles":67,"formTitle":"[1860]增长的内存泄露","frequency":0.0,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":5242,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6187824795842614,"acs":3334,"articleLive":2,"columnArticles":68,"formTitle":"[1861]旋转盒子","frequency":0.0,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5388,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3132696831326968,"acs":2264,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":7227,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9041017985355797,"acs":12718,"articleLive":2,"columnArticles":144,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":0.0,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":14067,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3877533039647577,"acs":4401,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.0,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":11350,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5126001737955006,"acs":5309,"articleLive":2,"columnArticles":62,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":10357,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5975282106394412,"acs":2224,"articleLive":2,"columnArticles":49,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.0,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3722,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7408491947291361,"acs":506,"articleLive":2,"columnArticles":14,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"lock","submitted":683,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5475409836065573,"acs":167,"articleLive":2,"columnArticles":11,"formTitle":"[1868]两个行程编码数组的积","frequency":0.0,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"lock","submitted":305,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7879443585780526,"acs":12745,"articleLive":2,"columnArticles":140,"formTitle":"[1869]哪种连续子字符串更长","frequency":0.0,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":16175,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.45566249016403365,"acs":7528,"articleLive":2,"columnArticles":72,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.0,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":16521,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2763807502422369,"acs":5990,"articleLive":2,"columnArticles":128,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":21673,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6215638362858888,"acs":2035,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3274,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.81199538638985,"acs":2112,"articleLive":2,"columnArticles":32,"formTitle":"[1873]计算特殊奖金","frequency":0.0,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"lock","submitted":2601,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8918128654970761,"acs":305,"articleLive":2,"columnArticles":18,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"lock","submitted":342,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7468354430379747,"acs":413,"articleLive":2,"columnArticles":18,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"lock","submitted":553,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7284230631490988,"acs":6102,"articleLive":2,"columnArticles":95,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":8377,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8203534462324528,"acs":31148,"articleLive":2,"columnArticles":401,"formTitle":"[1877]数组中最大数对和的最小值","frequency":0.0,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":37969,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4292858571714343,"acs":2146,"articleLive":2,"columnArticles":56,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4999,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.41066725197541704,"acs":1871,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.0,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4556,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7703833832799422,"acs":7455,"articleLive":2,"columnArticles":101,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.0,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":9677,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3536250511187708,"acs":6053,"articleLive":2,"columnArticles":63,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":17117,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2786175465248766,"acs":3668,"articleLive":2,"columnArticles":111,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":13165,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.3758911211924822,"acs":1740,"articleLive":2,"columnArticles":28,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4629,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6880084895649098,"acs":1945,"articleLive":2,"columnArticles":38,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":0.0,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":2827,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5210970464135021,"acs":247,"articleLive":2,"columnArticles":11,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"lock","submitted":474,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5716705483802668,"acs":5400,"articleLive":2,"columnArticles":77,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.0,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":9446,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6461789844142786,"acs":5141,"articleLive":2,"columnArticles":64,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7956,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3172934049605669,"acs":2776,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.0,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8749,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27132974634896234,"acs":2118,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.0,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7806,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7062271062271063,"acs":964,"articleLive":2,"columnArticles":20,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"lock","submitted":1365,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.47106109324758844,"acs":293,"articleLive":2,"columnArticles":11,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"lock","submitted":622,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.33768913342503437,"acs":491,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.0,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"lock","submitted":1454,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5912285316998008,"acs":31464,"articleLive":2,"columnArticles":410,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":0.0,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":53218,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.45804368190109945,"acs":37162,"articleLive":2,"columnArticles":513,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":81132,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5332480818414322,"acs":2085,"articleLive":2,"columnArticles":40,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3910,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5065398335315101,"acs":852,"articleLive":2,"columnArticles":31,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1682,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5308662741799832,"acs":6312,"articleLive":2,"columnArticles":79,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.0,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11890,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3102924420812761,"acs":4085,"articleLive":2,"columnArticles":63,"formTitle":"[1898]可移除字符的最大数目","frequency":0.0,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":13165,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.629742033383915,"acs":3735,"articleLive":2,"columnArticles":42,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5931,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.43648321218414676,"acs":1261,"articleLive":2,"columnArticles":36,"formTitle":"[1900]最佳运动员的比拼回合","frequency":0.0,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2889,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6540722082283795,"acs":779,"articleLive":2,"columnArticles":30,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":1191,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4519774011299435,"acs":80,"articleLive":2,"columnArticles":4,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"lock","submitted":177,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6435122282608695,"acs":7578,"articleLive":2,"columnArticles":102,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":11776,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2844426939740055,"acs":3611,"articleLive":2,"columnArticles":73,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":12695,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5713087248322147,"acs":4767,"articleLive":2,"columnArticles":94,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":8344,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4245715255387748,"acs":2502,"articleLive":2,"columnArticles":56,"formTitle":"[1906]查询差绝对值的最小值","frequency":0.0,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5893,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5913461538461539,"acs":492,"articleLive":2,"columnArticles":17,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"lock","submitted":832,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6706349206349206,"acs":169,"articleLive":2,"columnArticles":7,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"lock","submitted":252,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3252313216406574,"acs":4710,"articleLive":2,"columnArticles":72,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.0,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":14482,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6750777107332236,"acs":3692,"articleLive":2,"columnArticles":57,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":5469,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5685181960647745,"acs":3265,"articleLive":2,"columnArticles":70,"formTitle":"[1911]最大子序列交替和","frequency":0.0,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5743,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.26913620717915093,"acs":1642,"articleLive":2,"columnArticles":38,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":6101,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8366829070239545,"acs":8243,"articleLive":2,"columnArticles":86,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.0,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":9852,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4414279896837247,"acs":3252,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.0,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7367,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39190672153635114,"acs":2857,"articleLive":2,"columnArticles":56,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":7290,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5530018761726079,"acs":1179,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.0,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":2132,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.282025819265144,"acs":284,"articleLive":2,"columnArticles":10,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"lock","submitted":1007,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.49818181818181817,"acs":137,"articleLive":2,"columnArticles":3,"formTitle":"[1918]第 K 小的子数组和·","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"lock","submitted":275,"title":"第 K 小的子数组和·","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3919694072657744,"acs":410,"articleLive":2,"columnArticles":13,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"lock","submitted":1046,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9137154989384288,"acs":10759,"articleLive":2,"columnArticles":94,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":11775,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34420199501246884,"acs":5521,"articleLive":2,"columnArticles":90,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.0,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":16040,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36154145581938496,"acs":4644,"articleLive":2,"columnArticles":79,"formTitle":"[1922]统计好数字的数目","frequency":0.0,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12845,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.237989182309895,"acs":1496,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":0.0,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":6286,"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":"lock","submitted":170,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6905880677773032,"acs":4850,"articleLive":2,"columnArticles":61,"formTitle":"[1925]统计平方和三元组的数目","frequency":0.0,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":7023,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34407069555302167,"acs":3621,"articleLive":2,"columnArticles":62,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":10524,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4142038946162658,"acs":1808,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":0.0,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4365,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39693446088794926,"acs":2253,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":0.0,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":5676,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9133990507484483,"acs":12509,"articleLive":2,"columnArticles":108,"formTitle":"[1929]数组串联","frequency":0.0,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":13695,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.48067110611433017,"acs":5558,"articleLive":2,"columnArticles":99,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.0,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":11563,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5603495357728018,"acs":2052,"articleLive":2,"columnArticles":63,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.0,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3662,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.327736131934033,"acs":1093,"articleLive":2,"columnArticles":36,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.0,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3335,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.542997542997543,"acs":442,"articleLive":2,"columnArticles":24,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"lock","submitted":814,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7396907216494846,"acs":287,"articleLive":2,"columnArticles":11,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"lock","submitted":388,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7394481404733341,"acs":6780,"articleLive":2,"columnArticles":95,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":9169,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.45008798592225246,"acs":5627,"articleLive":2,"columnArticles":65,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":12502,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.24259401381427476,"acs":3161,"articleLive":2,"columnArticles":64,"formTitle":"[1937]扣分后的最大得分","frequency":0.0,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":13030,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3455703883495146,"acs":1139,"articleLive":2,"columnArticles":41,"formTitle":"[1938]查询最大基因差","frequency":0.0,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3296,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6164574616457462,"acs":442,"articleLive":2,"columnArticles":13,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"lock","submitted":717,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.7966804979253111,"acs":384,"articleLive":2,"columnArticles":25,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"lock","submitted":482,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7729807232754501,"acs":4852,"articleLive":2,"columnArticles":85,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":6277,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3923503176104879,"acs":2903,"articleLive":2,"columnArticles":68,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":7399,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4075431034482759,"acs":1891,"articleLive":2,"columnArticles":52,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4640,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5778748180494906,"acs":1985,"articleLive":2,"columnArticles":54,"formTitle":"[1944]队列中可以看到的人数","frequency":0.0,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":3435,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6640088817117481,"acs":6579,"articleLive":2,"columnArticles":77,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.0,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":9908,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.304196799726667,"acs":5342,"articleLive":2,"columnArticles":81,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.0,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":17561,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5419641654317662,"acs":4023,"articleLive":2,"columnArticles":89,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":7423,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5143923240938166,"acs":965,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.0,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1876,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5328947368421053,"acs":243,"articleLive":2,"columnArticles":12,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"lock","submitted":456,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5564516129032258,"acs":138,"articleLive":2,"columnArticles":7,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"lock","submitted":248,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.6702819956616052,"acs":309,"articleLive":2,"columnArticles":12,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"lock","submitted":461,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5462803445575568,"acs":6976,"articleLive":2,"columnArticles":80,"formTitle":"[1952]三除数","frequency":0.0,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":12770,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3257877026613643,"acs":4260,"articleLive":2,"columnArticles":83,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":13076,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48060046189376443,"acs":4162,"articleLive":2,"columnArticles":69,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.0,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":8660,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4964701392863957,"acs":2602,"articleLive":2,"columnArticles":41,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":5241,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.46060606060606063,"acs":152,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.0,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"lock","submitted":330,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6052525793916655,"acs":4517,"articleLive":2,"columnArticles":58,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":7463,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.42383209207853756,"acs":2504,"articleLive":2,"columnArticles":43,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5908,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.41382204812534973,"acs":1479,"articleLive":2,"columnArticles":32,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3574,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27955555555555556,"acs":629,"articleLive":2,"columnArticles":19,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":2250,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5344946137978455,"acs":6996,"articleLive":2,"columnArticles":65,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.0,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":13089,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4314466378778532,"acs":5595,"articleLive":2,"columnArticles":75,"formTitle":"[1962]移除石子使总数最小","frequency":0.0,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":12968,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6148723640399556,"acs":4432,"articleLive":2,"columnArticles":54,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.0,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":7208,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3852639296187683,"acs":3153,"articleLive":2,"columnArticles":47,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":8184,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7358870967741935,"acs":365,"articleLive":2,"columnArticles":13,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"lock","submitted":496,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.7288135593220338,"acs":43,"articleLive":2,"columnArticles":6,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"lock","submitted":59,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7788559754851889,"acs":6100,"articleLive":2,"columnArticles":58,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":7832,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3585776956822905,"acs":4659,"articleLive":2,"columnArticles":68,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12993,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2790742157612854,"acs":2918,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":0.0,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":10456,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47909898202295864,"acs":2212,"articleLive":2,"columnArticles":50,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":0.0,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4617,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5454545454545454,"acs":510,"articleLive":2,"columnArticles":20,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":935,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.45792079207920794,"acs":185,"articleLive":2,"columnArticles":8,"formTitle":"[1972]First and Last Call On the Same Day","frequency":0.0,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"lock","submitted":404,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.5619834710743802,"acs":68,"articleLive":2,"columnArticles":9,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"lock","submitted":121,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7380640329526306,"acs":3942,"articleLive":2,"columnArticles":55,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.0,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":5341,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3816272965879265,"acs":2908,"articleLive":2,"columnArticles":46,"formTitle":"[1975]最大方阵和","frequency":0.0,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":7620,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28948905109489054,"acs":1983,"articleLive":2,"columnArticles":37,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":6850,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.24792565549286424,"acs":747,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":3013,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5317460317460317,"acs":268,"articleLive":2,"columnArticles":10,"formTitle":"[1978]Employees Whose Manager Left the Company","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","questionId":"2127","status":"lock","submitted":504,"title":"Employees Whose Manager Left the Company","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8115770184326829,"acs":7529,"articleLive":2,"columnArticles":88,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":9277,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5818055001992826,"acs":5839,"articleLive":2,"columnArticles":94,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":10036,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29858633901440085,"acs":4520,"articleLive":2,"columnArticles":84,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":0.0,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":15138,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4582180409518539,"acs":828,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1807,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6538461538461539,"acs":51,"articleLive":2,"columnArticles":3,"formTitle":"[1983]Widest Pair of Indices With Equal Range Sum","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"lock","submitted":78,"title":"Widest Pair of Indices With Equal Range Sum","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5805934242181235,"acs":5792,"articleLive":2,"columnArticles":64,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","questionId":"2112","status":"ac","submitted":9976,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.41245559341695065,"acs":5689,"articleLive":2,"columnArticles":80,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","questionId":"2113","status":"ac","submitted":13793,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.27535675924505143,"acs":3589,"articleLive":2,"columnArticles":74,"formTitle":"[1986]完成任务的最少工作时间段","frequency":0.0,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","questionId":"2114","status":"notac","submitted":13034,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.4612630208333333,"acs":1417,"articleLive":2,"columnArticles":25,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","questionId":"2115","status":"","submitted":3072,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6761565836298933,"acs":190,"articleLive":2,"columnArticles":5,"formTitle":"[1988]Find Cutoff Score for Each School","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","questionId":"2136","status":"lock","submitted":281,"title":"Find Cutoff Score for Each School","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.45555555555555555,"acs":41,"articleLive":2,"columnArticles":2,"formTitle":"[1989]Maximum Number of People That Can Be Caught in Tag","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","questionId":"1979","status":"lock","submitted":90,"title":"Maximum Number of People That Can Be Caught in Tag","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6018518518518519,"acs":195,"articleLive":2,"columnArticles":8,"formTitle":"[1990]Count the Number of Experiments","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","questionId":"2143","status":"lock","submitted":324,"title":"Count the Number of Experiments","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6592117610259618,"acs":4215,"articleLive":2,"columnArticles":58,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","questionId":"2102","status":"ac","submitted":6394,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.594839750050393,"acs":2951,"articleLive":2,"columnArticles":56,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","questionId":"2103","status":"ac","submitted":4961,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.38509052183173587,"acs":1808,"articleLive":2,"columnArticles":42,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","questionId":"2104","status":"","submitted":4695,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.36382786638579595,"acs":1209,"articleLive":2,"columnArticles":36,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","questionId":"2105","status":"notac","submitted":3323,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5530594147206621,"acs":5613,"articleLive":2,"columnArticles":47,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","questionId":"2122","status":"ac","submitted":10149,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.24750180282270526,"acs":4805,"articleLive":2,"columnArticles":96,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","questionId":"2123","status":"ac","submitted":19414,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.34107519896053273,"acs":2100,"articleLive":2,"columnArticles":36,"formTitle":"[1997]访问完所有房间的第一天","frequency":0.0,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","questionId":"2124","status":"notac","submitted":6157,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.41988092156355167,"acs":1622,"articleLive":2,"columnArticles":32,"formTitle":"[1998]数组的最大公因数排序","frequency":0.0,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","questionId":"2125","status":"","submitted":3863,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.6483516483516484,"acs":59,"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":"lock","submitted":91,"title":"Smallest Greater Multiple Made of Two Digits","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7750833237558902,"acs":6744,"articleLive":2,"columnArticles":85,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","questionId":"2128","status":"ac","submitted":8701,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3589259888071433,"acs":5708,"articleLive":2,"columnArticles":124,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","questionId":"2129","status":"ac","submitted":15903,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5722852512155592,"acs":3531,"articleLive":2,"columnArticles":87,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","questionId":"2130","status":"","submitted":6170,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3911055694098088,"acs":1882,"articleLive":2,"columnArticles":40,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","questionId":"2131","status":"","submitted":4812,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.3941908713692946,"acs":95,"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":"lock","submitted":241,"title":"The Number of Seniors and Juniors to Join the Company","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.6818181818181818,"acs":30,"articleLive":2,"columnArticles":3,"formTitle":"[2005]Subtree Removal Game with Fibonacci Tree","frequency":0.0,"frontendQuestionId":"2005","leaf":true,"level":3,"nodeType":"def","questionId":"2153","status":"lock","submitted":44,"title":"Subtree Removal Game with Fibonacci Tree","titleSlug":"subtree-removal-game-with-fibonacci-tree"},{"acceptance":0.8806005160684963,"acs":3754,"articleLive":2,"columnArticles":52,"formTitle":"[2006]差的绝对值为 K 的数对数目","frequency":0.0,"frontendQuestionId":"2006","leaf":true,"level":1,"nodeType":"def","questionId":"2116","status":"","submitted":4263,"title":"差的绝对值为 K 的数对数目","titleSlug":"count-number-of-pairs-with-absolute-difference-k"},{"acceptance":0.2978053020425902,"acs":2741,"articleLive":2,"columnArticles":51,"formTitle":"[2007]从双倍数组中还原原数组","frequency":0.0,"frontendQuestionId":"2007","leaf":true,"level":2,"nodeType":"def","questionId":"2117","status":"","submitted":9204,"title":"从双倍数组中还原原数组","titleSlug":"find-original-array-from-doubled-array"},{"acceptance":0.418758786905001,"acs":2085,"articleLive":2,"columnArticles":39,"formTitle":"[2008]出租车的最大盈利","frequency":0.0,"frontendQuestionId":"2008","leaf":true,"level":2,"nodeType":"def","questionId":"2118","status":"","submitted":4979,"title":"出租车的最大盈利","titleSlug":"maximum-earnings-from-taxi"},{"acceptance":0.4166138237159163,"acs":1314,"articleLive":2,"columnArticles":39,"formTitle":"[2009]使数组连续的最少操作数","frequency":0.0,"frontendQuestionId":"2009","leaf":true,"level":3,"nodeType":"def","questionId":"2119","status":"","submitted":3154,"title":"使数组连续的最少操作数","titleSlug":"minimum-number-of-operations-to-make-array-continuous"},{"acceptance":0.6213592233009708,"acs":64,"articleLive":2,"columnArticles":4,"formTitle":"[2010]The Number of Seniors and Juniors to Join the Company II","frequency":0.0,"frontendQuestionId":"2010","leaf":true,"level":3,"nodeType":"def","questionId":"2158","status":"lock","submitted":103,"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.9035759009322387,"acs":6494,"articleLive":2,"columnArticles":57,"formTitle":"[2011]执行操作后的变量值","frequency":0.0,"frontendQuestionId":"2011","leaf":true,"level":1,"nodeType":"def","questionId":"2137","status":"ac","submitted":7187,"title":"执行操作后的变量值","titleSlug":"final-value-of-variable-after-performing-operations"},{"acceptance":0.3562354161265232,"acs":4122,"articleLive":2,"columnArticles":73,"formTitle":"[2012]数组美丽值求和","frequency":0.0,"frontendQuestionId":"2012","leaf":true,"level":2,"nodeType":"def","questionId":"2138","status":"ac","submitted":11571,"title":"数组美丽值求和","titleSlug":"sum-of-beauty-in-the-array"},{"acceptance":0.32820943917377204,"acs":2733,"articleLive":2,"columnArticles":50,"formTitle":"[2013]检测正方形","frequency":0.0,"frontendQuestionId":"2013","leaf":true,"level":2,"nodeType":"def","questionId":"2139","status":"ac","submitted":8327,"title":"检测正方形","titleSlug":"detect-squares"},{"acceptance":0.5194029850746269,"acs":1392,"articleLive":2,"columnArticles":24,"formTitle":"[2014]重复 K 次的最长子序列","frequency":0.0,"frontendQuestionId":"2014","leaf":true,"level":3,"nodeType":"def","questionId":"2140","status":"","submitted":2680,"title":"重复 K 次的最长子序列","titleSlug":"longest-subsequence-repeated-k-times"},{"acceptance":0.7916666666666666,"acs":38,"articleLive":2,"columnArticles":2,"formTitle":"[2015]Average Height of Buildings in Each Segment","frequency":0.0,"frontendQuestionId":"2015","leaf":true,"level":2,"nodeType":"def","questionId":"2142","status":"lock","submitted":48,"title":"Average Height of Buildings in Each Segment","titleSlug":"average-height-of-buildings-in-each-segment"},{"acceptance":0.5523111844820471,"acs":5353,"articleLive":2,"columnArticles":67,"formTitle":"[2016]增量元素之间的最大差值","frequency":0.0,"frontendQuestionId":"2016","leaf":true,"level":1,"nodeType":"def","questionId":"2144","status":"ac","submitted":9692,"title":"增量元素之间的最大差值","titleSlug":"maximum-difference-between-increasing-elements"},{"acceptance":0.3461422996097268,"acs":3459,"articleLive":2,"columnArticles":94,"formTitle":"[2017]网格游戏","frequency":0.0,"frontendQuestionId":"2017","leaf":true,"level":2,"nodeType":"def","questionId":"2145","status":"ac","submitted":9993,"title":"网格游戏","titleSlug":"grid-game"},{"acceptance":0.410528596187175,"acs":1895,"articleLive":2,"columnArticles":49,"formTitle":"[2018]判断单词是否能放入填字游戏内","frequency":0.0,"frontendQuestionId":"2018","leaf":true,"level":2,"nodeType":"def","questionId":"2146","status":"","submitted":4616,"title":"判断单词是否能放入填字游戏内","titleSlug":"check-if-word-can-be-placed-in-crossword"},{"acceptance":0.3450822423632091,"acs":1028,"articleLive":2,"columnArticles":31,"formTitle":"[2019]解出数学表达式的学生分数","frequency":0.0,"frontendQuestionId":"2019","leaf":true,"level":3,"nodeType":"def","questionId":"2147","status":"","submitted":2979,"title":"解出数学表达式的学生分数","titleSlug":"the-score-of-students-solving-math-expression"},{"acceptance":0.8053691275167785,"acs":120,"articleLive":2,"columnArticles":6,"formTitle":"[2020]Number of Accounts That Did Not Stream","frequency":0.0,"frontendQuestionId":"2020","leaf":true,"level":2,"nodeType":"def","questionId":"2167","status":"lock","submitted":149,"title":"Number of Accounts That Did Not Stream","titleSlug":"number-of-accounts-that-did-not-stream"},{"acceptance":0.7741935483870968,"acs":48,"articleLive":2,"columnArticles":5,"formTitle":"[2021]Brightest Position on Street","frequency":0.0,"frontendQuestionId":"2021","leaf":true,"level":2,"nodeType":"def","questionId":"2075","status":"","submitted":62,"title":"Brightest Position on Street","titleSlug":"brightest-position-on-street"},{"acceptance":0.6566921827882162,"acs":2831,"articleLive":2,"columnArticles":35,"formTitle":"[2022]将一维数组转变成二维数组","frequency":0.0,"frontendQuestionId":"2022","leaf":true,"level":1,"nodeType":"def","questionId":"2132","status":"ac","submitted":4311,"title":"将一维数组转变成二维数组","titleSlug":"convert-1d-array-into-2d-array"},{"acceptance":0.7550670853554097,"acs":2645,"articleLive":2,"columnArticles":36,"formTitle":"[2023]连接后等于目标字符串的字符串对","frequency":0.0,"frontendQuestionId":"2023","leaf":true,"level":2,"nodeType":"def","questionId":"2133","status":"ac","submitted":3503,"title":"连接后等于目标字符串的字符串对","titleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target"},{"acceptance":0.4782803403493059,"acs":2136,"articleLive":2,"columnArticles":54,"formTitle":"[2024]考试的最大困扰度","frequency":0.0,"frontendQuestionId":"2024","leaf":true,"level":2,"nodeType":"def","questionId":"2134","status":"","submitted":4466,"title":"考试的最大困扰度","titleSlug":"maximize-the-confusion-of-an-exam"},{"acceptance":0.2587255122720108,"acs":1149,"articleLive":2,"columnArticles":39,"formTitle":"[2025]分割数组的最多方案数","frequency":0.0,"frontendQuestionId":"2025","leaf":true,"level":3,"nodeType":"def","questionId":"2135","status":"","submitted":4441,"title":"分割数组的最多方案数","titleSlug":"maximum-number-of-ways-to-partition-an-array"},{"acceptance":0.9030612244897959,"acs":177,"articleLive":2,"columnArticles":9,"formTitle":"[2026]Low-Quality Problems","frequency":0.0,"frontendQuestionId":"2026","leaf":true,"level":1,"nodeType":"def","questionId":"2172","status":"","submitted":196,"title":"Low-Quality Problems","titleSlug":"low-quality-problems"},{"acceptance":0.5515320334261838,"acs":4158,"articleLive":2,"columnArticles":42,"formTitle":"[2027]转换字符串的最少操作次数","frequency":0.0,"frontendQuestionId":"2027","leaf":true,"level":1,"nodeType":"def","questionId":"2154","status":"ac","submitted":7539,"title":"转换字符串的最少操作次数","titleSlug":"minimum-moves-to-convert-string"},{"acceptance":0.4231026785714286,"acs":3791,"articleLive":2,"columnArticles":54,"formTitle":"[2028]找出缺失的观测数据","frequency":0.0,"frontendQuestionId":"2028","leaf":true,"level":2,"nodeType":"def","questionId":"2155","status":"ac","submitted":8960,"title":"找出缺失的观测数据","titleSlug":"find-missing-observations"},{"acceptance":0.2201144909641935,"acs":1961,"articleLive":2,"columnArticles":67,"formTitle":"[2029]石子游戏 IX","frequency":0.0,"frontendQuestionId":"2029","leaf":true,"level":2,"nodeType":"def","questionId":"2156","status":"notac","submitted":8909,"title":"石子游戏 IX","titleSlug":"stone-game-ix"},{"acceptance":0.34425717852684146,"acs":1103,"articleLive":2,"columnArticles":38,"formTitle":"[2030]含特定字母的最小子序列","frequency":0.0,"frontendQuestionId":"2030","leaf":true,"level":3,"nodeType":"def","questionId":"2157","status":"","submitted":3204,"title":"含特定字母的最小子序列","titleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter"},{"acceptance":0.6153846153846154,"acs":16,"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":26,"title":"Count Subarrays With More Ones Than Zeros","titleSlug":"count-subarrays-with-more-ones-than-zeros"},{"acceptance":0.6645211122554068,"acs":5162,"articleLive":2,"columnArticles":84,"formTitle":"[2032]至少在两个数组中出现的值","frequency":0.0,"frontendQuestionId":"2032","leaf":true,"level":1,"nodeType":"def","questionId":"2159","status":"ac","submitted":7768,"title":"至少在两个数组中出现的值","titleSlug":"two-out-of-three"},{"acceptance":0.3811415429646665,"acs":3646,"articleLive":2,"columnArticles":73,"formTitle":"[2033]获取单值网格的最小操作数","frequency":0.0,"frontendQuestionId":"2033","leaf":true,"level":2,"nodeType":"def","questionId":"2160","status":"ac","submitted":9566,"title":"获取单值网格的最小操作数","titleSlug":"minimum-operations-to-make-a-uni-value-grid"},{"acceptance":0.2999441652707984,"acs":2686,"articleLive":2,"columnArticles":59,"formTitle":"[2034]股票价格波动","frequency":0.0,"frontendQuestionId":"2034","leaf":true,"level":2,"nodeType":"def","questionId":"2161","status":"ac","submitted":8955,"title":"股票价格波动","titleSlug":"stock-price-fluctuation"},{"acceptance":0.3014227642276423,"acs":1483,"articleLive":2,"columnArticles":39,"formTitle":"[2035]将数组分成两个数组并最小化数组和的差","frequency":0.0,"frontendQuestionId":"2035","leaf":true,"level":3,"nodeType":"def","questionId":"2162","status":"","submitted":4920,"title":"将数组分成两个数组并最小化数组和的差","titleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference"},{"acceptance":0.3684210526315789,"acs":7,"articleLive":2,"columnArticles":2,"formTitle":"[2036]Maximum Alternating Subarray Sum","frequency":0.0,"frontendQuestionId":"2036","leaf":true,"level":2,"nodeType":"def","questionId":"512","status":"lock","submitted":19,"title":"Maximum Alternating Subarray Sum","titleSlug":"maximum-alternating-subarray-sum"},{"acceptance":0.8451510961880309,"acs":81301,"articleLive":2,"columnArticles":627,"formTitle":"[LCP 01]猜数字","frequency":0.0,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":96197,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6911193012571313,"acs":13689,"articleLive":2,"columnArticles":237,"formTitle":"[LCP 02]分式化简","frequency":0.0,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":19807,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.2198620473428437,"acs":11220,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 03]机器人大冒险","frequency":0.0,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":51032,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3769800901031827,"acs":2594,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 04]覆盖","frequency":0.0,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6881,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.1991304347826087,"acs":2061,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":10350,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8398965219890773,"acs":43830,"articleLive":2,"columnArticles":660,"formTitle":"[LCP 06]拿硬币","frequency":0.0,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":52185,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.769335062485263,"acs":39153,"articleLive":2,"columnArticles":472,"formTitle":"[LCP 07]传递信息","frequency":0.0,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":50892,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28891910265125764,"acs":5100,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17652,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2755405009827291,"acs":6589,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 09]最小跳跃次数","frequency":0.0,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":23913,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5897852960312296,"acs":1813,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 10]二叉树任务调度","frequency":0.0,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":3074,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6896930920723783,"acs":6899,"articleLive":2,"columnArticles":67,"formTitle":"[LCP 11]期望个数统计","frequency":0.0,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":10003,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4112934239200103,"acs":6417,"articleLive":2,"columnArticles":102,"formTitle":"[LCP 12]小张刷题计划","frequency":0.0,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":15602,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6121353257002393,"acs":9463,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":0.0,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15459,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.21097796675686123,"acs":2729,"articleLive":2,"columnArticles":41,"formTitle":"[LCP 14]切分数组","frequency":0.0,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12935,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5747820254862508,"acs":857,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.0,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1491,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.3117015840572305,"acs":610,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1957,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7991307570499646,"acs":23719,"articleLive":2,"columnArticles":251,"formTitle":"[LCP 17]速算机器人","frequency":0.0,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":29681,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28672632973936946,"acs":17525,"articleLive":2,"columnArticles":230,"formTitle":"[LCP 18]早餐组合","frequency":0.0,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":61121,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5162449193654124,"acs":19687,"articleLive":2,"columnArticles":205,"formTitle":"[LCP 19]秋叶收藏集","frequency":0.0,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":38135,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.312270260808682,"acs":1784,"articleLive":2,"columnArticles":32,"formTitle":"[LCP 20]快速公交","frequency":0.0,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5713,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.33553992552751344,"acs":811,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 21]追逐游戏","frequency":0.0,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2417,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3334821262507905,"acs":8965,"articleLive":2,"columnArticles":186,"formTitle":"[LCP 22]黑白方格画","frequency":0.0,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26883,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3386080020584073,"acs":2632,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":0.0,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7773,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.28201970443349755,"acs":916,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3248,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3322875071306332,"acs":1165,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3506,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.33614966807483404,"acs":557,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1657,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3283542976939203,"acs":1253,"articleLive":2,"columnArticles":25,"formTitle":"[LCP 27]黑盒光线反射","frequency":0.0,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3816,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.28263558646471865,"acs":10282,"articleLive":2,"columnArticles":175,"formTitle":"[LCP 28]采购方案","frequency":0.0,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":36379,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18685184506577743,"acs":5099,"articleLive":2,"columnArticles":124,"formTitle":"[LCP 29]乐团站位","frequency":0.0,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":27289,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3495929907413161,"acs":5626,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 30]魔塔游戏","frequency":0.0,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"ac","submitted":16093,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2526685187892967,"acs":1728,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":0.0,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6839,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.4059482425646968,"acs":1051,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":0.0,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2589,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.21781136407116894,"acs":4554,"articleLive":2,"columnArticles":86,"formTitle":"[LCP 33]蓄水","frequency":0.0,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":20908,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4850287120590648,"acs":2365,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":0.0,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4876,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.39841870058439327,"acs":1159,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 35]电动车游城市","frequency":0.0,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2909,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2632996632996633,"acs":782,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":0.0,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2970,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19336327345309381,"acs":775,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 37]最小矩形面积","frequency":0.0,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":4008,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5612366230677764,"acs":472,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 38]守卫城堡","frequency":0.0,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":841,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5046841541755889,"acs":3771,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","questionId":"1000369","status":"ac","submitted":7472,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.23159281831658704,"acs":2812,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","questionId":"1000368","status":"ac","submitted":12142,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.4169370538611291,"acs":1285,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","questionId":"1000370","status":"","submitted":3082,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.19957039640695176,"acs":1022,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","questionId":"1000371","status":"notac","submitted":5121,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3977619532044761,"acs":391,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","questionId":"1000367","status":"","submitted":983,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.8521341463414634,"acs":2236,"articleLive":2,"columnArticles":26,"formTitle":"[LCP 44]开幕式焰火","frequency":0.0,"frontendQuestionId":"LCP 44","leaf":true,"level":1,"nodeType":"def","questionId":"1000362","status":"ac","submitted":2624,"title":"开幕式焰火","titleSlug":"sZ59z6"},{"acceptance":0.1862156755773777,"acs":1024,"articleLive":2,"columnArticles":27,"formTitle":"[LCP 45]自行车炫技赛场","frequency":0.0,"frontendQuestionId":"LCP 45","leaf":true,"level":2,"nodeType":"def","questionId":"1000375","status":"notac","submitted":5499,"title":"自行车炫技赛场","titleSlug":"kplEvH"},{"acceptance":0.36889848812095033,"acs":854,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 46]志愿者调配","frequency":0.0,"frontendQuestionId":"LCP 46","leaf":true,"level":2,"nodeType":"def","questionId":"1000373","status":"notac","submitted":2315,"title":"志愿者调配","titleSlug":"05ZEDJ"},{"acceptance":0.3536918869644485,"acs":776,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 47]入场安检","frequency":0.0,"frontendQuestionId":"LCP 47","leaf":true,"level":3,"nodeType":"def","questionId":"1000361","status":"","submitted":2194,"title":"入场安检","titleSlug":"oPs9Bm"},{"acceptance":0.15177065767284992,"acs":270,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 48]无限棋局","frequency":0.0,"frontendQuestionId":"LCP 48","leaf":true,"level":3,"nodeType":"def","questionId":"1000374","status":"","submitted":1779,"title":"无限棋局","titleSlug":"fsa7oZ"},{"acceptance":0.22483766233766234,"acs":277,"articleLive":2,"columnArticles":9,"formTitle":"[LCP 49]环形闯关游戏","frequency":0.0,"frontendQuestionId":"LCP 49","leaf":true,"level":3,"nodeType":"def","questionId":"1000359","status":"","submitted":1232,"title":"环形闯关游戏","titleSlug":"K8GULz"},{"acceptance":0.5440434613892122,"acs":4206,"articleLive":2,"columnArticles":96,"formTitle":"[LCS 01]下载插件","frequency":0.0,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":7731,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6977120874670986,"acs":3446,"articleLive":2,"columnArticles":69,"formTitle":"[LCS 02]完成一半题目","frequency":0.0,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":4939,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4129485935984481,"acs":1703,"articleLive":2,"columnArticles":54,"formTitle":"[LCS 03]主题空间","frequency":0.0,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":4124,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6783464276369199,"acs":404422,"articleLive":2,"columnArticles":2804,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":596188,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4033514686554391,"acs":263929,"articleLive":2,"columnArticles":2103,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":0.0,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":654340,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7607684482107647,"acs":290151,"articleLive":2,"columnArticles":1953,"formTitle":"[剑指 Offer 05]替换空格","frequency":0.0,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":381392,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7513433934486566,"acs":306210,"articleLive":2,"columnArticles":2102,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":407550,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.697995157314031,"acs":190545,"articleLive":2,"columnArticles":1454,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":272989,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7153082565024007,"acs":267124,"articleLive":2,"columnArticles":1694,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":0.0,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":373439,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3600805576651839,"acs":265509,"articleLive":2,"columnArticles":1863,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"ac","submitted":737360,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.44392053242465235,"acs":197237,"articleLive":2,"columnArticles":1323,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":0.0,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":444307,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4930459930963709,"acs":264248,"articleLive":2,"columnArticles":1640,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":535950,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45226138576395186,"acs":172104,"articleLive":2,"columnArticles":1149,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":380541,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5267197875166003,"acs":178479,"articleLive":2,"columnArticles":1718,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":0.0,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":338850,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5692574824573965,"acs":159005,"articleLive":2,"columnArticles":1320,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":279320,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3120550996614008,"acs":83774,"articleLive":2,"columnArticles":494,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":268459,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7472925533104265,"acs":200524,"articleLive":2,"columnArticles":1257,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":268334,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3399537792278412,"acs":125035,"articleLive":2,"columnArticles":763,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":0.0,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":367800,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7772883795035206,"acs":151237,"articleLive":2,"columnArticles":1134,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":194570,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5967636789880464,"acs":190407,"articleLive":2,"columnArticles":1467,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":319066,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3766585994485841,"acs":67078,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":0.0,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":178087,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.24205662732388813,"acs":77378,"articleLive":2,"columnArticles":861,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":319669,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6432322168849115,"acs":195504,"articleLive":2,"columnArticles":1637,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":0.0,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":303940,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.79813396040355,"acs":263045,"articleLive":2,"columnArticles":2458,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":329575,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7427232170907948,"acs":295511,"articleLive":2,"columnArticles":1840,"formTitle":"[剑指 Offer 24]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":397875,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7283620955135677,"acs":186846,"articleLive":2,"columnArticles":1193,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":256529,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46563115541867156,"acs":146800,"articleLive":2,"columnArticles":1189,"formTitle":"[剑指 Offer 26]树的子结构","frequency":0.0,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":315271,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.792033202508233,"acs":193127,"articleLive":2,"columnArticles":1414,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":0.0,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":243837,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.579991721029352,"acs":151321,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":260902,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.44012796113060393,"acs":146387,"articleLive":2,"columnArticles":1487,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":0.0,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":332601,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5678439799800116,"acs":143748,"articleLive":2,"columnArticles":952,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":0.0,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":253147,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6158787937880191,"acs":113698,"articleLive":2,"columnArticles":954,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":184611,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.644383709364048,"acs":138634,"articleLive":2,"columnArticles":962,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":215142,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.686591380456679,"acs":138377,"articleLive":2,"columnArticles":1101,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":201542,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887921812700574,"acs":121091,"articleLive":2,"columnArticles":1144,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":0.0,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":205660,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5512880018565792,"acs":114024,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":206832,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5769909457688387,"acs":134717,"articleLive":2,"columnArticles":873,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":233482,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.720231035627876,"acs":121454,"articleLive":2,"columnArticles":833,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":0.0,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":168632,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6545019722334379,"acs":105365,"articleLive":2,"columnArticles":910,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":160985,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5612803624375077,"acs":77803,"articleLive":2,"columnArticles":561,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":138617,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792974986695051,"acs":158921,"articleLive":2,"columnArticles":1119,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":0.0,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":274334,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6912182457684799,"acs":169598,"articleLive":2,"columnArticles":1027,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":245361,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5703515806375615,"acs":249356,"articleLive":2,"columnArticles":1819,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":0.0,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":437197,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5815840086045813,"acs":63805,"articleLive":2,"columnArticles":464,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":0.0,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":109709,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053481266387848,"acs":223480,"articleLive":2,"columnArticles":1528,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":0.0,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":369176,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4861710898241206,"acs":49535,"articleLive":2,"columnArticles":513,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":101888,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41523662490350927,"acs":55944,"articleLive":2,"columnArticles":466,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":134728,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5611573244276953,"acs":109892,"articleLive":2,"columnArticles":811,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":0.0,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":195831,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5357112752600874,"acs":120752,"articleLive":2,"columnArticles":1448,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":225405,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.688828366055884,"acs":119883,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":0.0,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":174039,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646762741266246,"acs":152418,"articleLive":2,"columnArticles":1043,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":328009,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6515001066513677,"acs":88576,"articleLive":2,"columnArticles":520,"formTitle":"[剑指 Offer 49]丑数","frequency":0.0,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":135957,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6147088273625989,"acs":154705,"articleLive":2,"columnArticles":1060,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":0.0,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":251672,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4831359750190461,"acs":102735,"articleLive":2,"columnArticles":851,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":0.0,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":212642,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6500446451631947,"acs":176179,"articleLive":2,"columnArticles":1051,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":271026,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5379727659860969,"acs":191769,"articleLive":2,"columnArticles":1600,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":356466,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44724764599568984,"acs":169760,"articleLive":2,"columnArticles":1481,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":379566,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.756847905033748,"acs":163601,"articleLive":2,"columnArticles":1148,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":0.0,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":216161,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7899482709750567,"acs":178364,"articleLive":2,"columnArticles":1276,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":225792,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5883078419992489,"acs":137857,"articleLive":2,"columnArticles":942,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":234328,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.697683934363097,"acs":115946,"articleLive":2,"columnArticles":1040,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":166187,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.8003785877795386,"acs":90907,"articleLive":2,"columnArticles":702,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":0.0,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":113580,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6661393574712814,"acs":135171,"articleLive":2,"columnArticles":847,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":202917,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7073184275754838,"acs":140112,"articleLive":2,"columnArticles":1863,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":0.0,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":198089,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4420309465978363,"acs":130667,"articleLive":2,"columnArticles":980,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":295606,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8577424543789206,"acs":207427,"articleLive":2,"columnArticles":1803,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":241829,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44424075052054074,"acs":132067,"articleLive":2,"columnArticles":1192,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":297287,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4751047929651157,"acs":94982,"articleLive":2,"columnArticles":1071,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":199918,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5614583867493975,"acs":65694,"articleLive":2,"columnArticles":594,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":0.0,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":117006,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4598139514329275,"acs":104049,"articleLive":2,"columnArticles":988,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":0.0,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":226285,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6553234301947091,"acs":110730,"articleLive":2,"columnArticles":769,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":168970,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6341425848558941,"acs":131752,"articleLive":2,"columnArticles":956,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":0.0,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":207764,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568194470217109,"acs":138522,"articleLive":2,"columnArticles":1301,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":0.0,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":161670,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5842473148832187,"acs":71967,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":0.0,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":123179,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5979301696902583,"acs":73433,"articleLive":2,"columnArticles":531,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":0.0,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":122812,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2866993640633443,"acs":68977,"articleLive":2,"columnArticles":557,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":0.0,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":240590,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6941634968769538,"acs":118804,"articleLive":2,"columnArticles":693,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":171147,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.7008317649922523,"acs":118046,"articleLive":2,"columnArticles":692,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":0.0,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":168437,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2044531084858022,"acs":8705,"articleLive":2,"columnArticles":111,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":42577,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5722752240531945,"acs":7918,"articleLive":2,"columnArticles":124,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":13836,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7836187757691088,"acs":9883,"articleLive":2,"columnArticles":150,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":12612,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6872980785580683,"acs":8084,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":11762,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7154461832517023,"acs":5989,"articleLive":2,"columnArticles":85,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":8371,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6653667595171774,"acs":7166,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":10770,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.45334016993847054,"acs":6189,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":13652,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5067717311007142,"acs":6174,"articleLive":2,"columnArticles":91,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":12183,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5488417832167832,"acs":5023,"articleLive":2,"columnArticles":80,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":9152,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4358161648177496,"acs":5500,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":12620,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5638073845289906,"acs":4016,"articleLive":2,"columnArticles":70,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":7123,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6621712744436952,"acs":4910,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.0,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":7415,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6537792383529867,"acs":3382,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":5173,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5040723981900452,"acs":3899,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":7735,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6435357290375878,"acs":3116,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":4842,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5015621745469694,"acs":4816,"articleLive":2,"columnArticles":77,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":9602,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5170309115967711,"acs":2626,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":5079,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5301554163767107,"acs":4571,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":8622,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.47389656437217265,"acs":3876,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":8179,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7073170731707317,"acs":3828,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":5412,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.537557582025007,"acs":5718,"articleLive":2,"columnArticles":76,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":10637,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5220253958300675,"acs":6660,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":12758,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7021999114129632,"acs":4756,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":6773,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7707317073170732,"acs":12482,"articleLive":2,"columnArticles":126,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":16195,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6061288868859847,"acs":4035,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":0.0,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":6657,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6522899066251667,"acs":4401,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":6747,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6113080629033725,"acs":6725,"articleLive":2,"columnArticles":88,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":11001,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6267173341128325,"acs":2144,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":3421,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.29588347055098163,"acs":2336,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":7895,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5475384214639228,"acs":2102,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":3839,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5593627237014405,"acs":2563,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":4582,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.6039128829826504,"acs":3272,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":5418,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7951145038167939,"acs":2604,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":3275,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5763582966226138,"acs":2355,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":4086,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6836189940994661,"acs":2433,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":3559,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5866254689913927,"acs":2658,"articleLive":2,"columnArticles":59,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":4531,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4414127633772927,"acs":2912,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":6597,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7818263607737292,"acs":3476,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":4446,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5199722927730316,"acs":2252,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":4331,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5749811605124341,"acs":1526,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.0,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":2654,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7818273854720323,"acs":3089,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":3951,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8478045559590623,"acs":2568,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":3029,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6584590945194599,"acs":1658,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":2518,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6474525043177893,"acs":2999,"articleLive":2,"columnArticles":65,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":4632,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.8109495295124037,"acs":2844,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":3507,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7267114093959731,"acs":2707,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":3725,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6844891476971943,"acs":2586,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":3778,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6828175895765473,"acs":1677,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":2456,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7560240963855421,"acs":2761,"articleLive":2,"columnArticles":61,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":3652,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6205808080808081,"acs":1966,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":3168,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.41392031480570585,"acs":1683,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":4066,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7425030978934325,"acs":2996,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":4035,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6375029009050824,"acs":2747,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":4309,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8508411214953271,"acs":2276,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":2675,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8940580377706127,"acs":1941,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":2171,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7311954727658571,"acs":3101,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":4241,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3495389773679799,"acs":1251,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":3579,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5976447497546614,"acs":1218,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":2038,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6250779787897692,"acs":2004,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":3206,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.674732872407291,"acs":2147,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":3182,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5386049981350243,"acs":1444,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":2681,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7669104204753199,"acs":1678,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":2188,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7240241891148983,"acs":1317,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":1819,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6348665530948325,"acs":1118,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":1761,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.6307506053268765,"acs":1042,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":1652,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.645219482862297,"acs":1073,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":1663,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6622837370242215,"acs":957,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":1445,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5105215004574566,"acs":2790,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":5465,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7239589925325908,"acs":34320,"articleLive":2,"columnArticles":370,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"ac","submitted":47406,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6600452602464169,"acs":2625,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":3977,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.49810066476733145,"acs":1049,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":2106,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.419277397671348,"acs":3493,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":8331,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5404352062357909,"acs":1664,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":3079,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5508870214752568,"acs":2360,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.0,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":4284,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7099554234769688,"acs":2389,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":3365,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6765486035262912,"acs":4336,"articleLive":2,"columnArticles":54,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":6409,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5888618381010347,"acs":3870,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":6572,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6360201511335013,"acs":3030,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":4764,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8563619799574855,"acs":2820,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":3293,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8092529389457717,"acs":2134,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":2637,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7809040590405905,"acs":3386,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":4336,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.642713567839196,"acs":2558,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":3980,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8570638650815593,"acs":3100,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":3617,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6766712141882674,"acs":2480,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":3665,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.857698721511951,"acs":3086,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.0,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":3598,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7689335394126738,"acs":1990,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":2588,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6379635449402892,"acs":2030,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":3182,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7389312977099237,"acs":3872,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":5240,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6242471851269966,"acs":2384,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":3819,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5159441060551774,"acs":1440,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":2791,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7659912594358363,"acs":1928,"articleLive":2,"columnArticles":51,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.0,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":2517,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.68,"acs":1530,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":2250,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5754799301919721,"acs":1319,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":2292,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.5939361126150514,"acs":1097,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":1847,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6638105438533857,"acs":5578,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":8403,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4970838941229251,"acs":1108,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":2229,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5426682692307693,"acs":903,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":1664,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7782678428227746,"acs":1941,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":2494,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6958154506437768,"acs":2594,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":3728,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7365079365079366,"acs":1624,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":2205,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4848413074372335,"acs":2047,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 101]分割等和子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":4222,"title":"分割等和子集","titleSlug":"NUPfPr"},{"acceptance":0.5928730512249443,"acs":1331,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":2245,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.4953970080552359,"acs":2583,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":5214,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5868766404199475,"acs":1118,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":1905,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6987041036717062,"acs":3235,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":4630,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.554916618746406,"acs":965,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":1739,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5442139737991266,"acs":997,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":1832,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.572265625,"acs":586,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":1024,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.6101792943898207,"acs":1055,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":1729,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8417381974248928,"acs":1569,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":1864,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7003792667509482,"acs":554,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":791,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5591120289106867,"acs":1083,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":1937,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.583156779661017,"acs":1101,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":1888,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.425,"acs":510,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":1200,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2900976290097629,"acs":624,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":2151,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.635923170098633,"acs":3675,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 116]省份数量","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":5779,"title":"省份数量","titleSlug":"bLyHh0"},{"acceptance":0.634575569358178,"acs":613,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":966,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.7007738607050731,"acs":815,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":1163,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4616135328562134,"acs":2838,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":6148,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7198375452706646,"acs":90038,"articleLive":2,"columnArticles":1544,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":0.0,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":125081,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6477559112445256,"acs":57831,"articleLive":2,"columnArticles":1109,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":0.0,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":89279,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5795335840384415,"acs":44383,"articleLive":2,"columnArticles":492,"formTitle":"[面试题 01.03]URL化","frequency":0.0,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":76584,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5511619982280379,"acs":40436,"articleLive":2,"columnArticles":778,"formTitle":"[面试题 01.04]回文排列","frequency":0.0,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":73365,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3320402857669239,"acs":32441,"articleLive":2,"columnArticles":556,"formTitle":"[面试题 01.05]一次编辑","frequency":0.0,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":97702,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4718484533035175,"acs":73430,"articleLive":2,"columnArticles":1175,"formTitle":"[面试题 01.06]字符串压缩","frequency":0.0,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":155622,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7531272234845877,"acs":65626,"articleLive":2,"columnArticles":961,"formTitle":"[面试题 01.07]旋转矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":87138,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6216735448982497,"acs":43685,"articleLive":2,"columnArticles":490,"formTitle":"[面试题 01.08]零矩阵","frequency":0.0,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":70270,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5499632745726496,"acs":32945,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 01.09]字符串轮转","frequency":0.0,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":59904,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6826619060933904,"acs":63478,"articleLive":2,"columnArticles":693,"formTitle":"[面试题 02.01]移除重复节点","frequency":0.0,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":92986,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7799837246595342,"acs":65177,"articleLive":2,"columnArticles":946,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":0.0,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":83562,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8548619977805091,"acs":71640,"articleLive":2,"columnArticles":684,"formTitle":"[面试题 02.03]删除中间节点","frequency":0.0,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":83803,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6549022649705244,"acs":25329,"articleLive":2,"columnArticles":362,"formTitle":"[面试题 02.04]分割链表","frequency":0.0,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":38676,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4667155369623741,"acs":36927,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 02.05]链表求和","frequency":0.0,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":79121,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48350606828980086,"acs":39281,"articleLive":2,"columnArticles":507,"formTitle":"[面试题 02.06]回文链表","frequency":0.0,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":81242,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6848880068046499,"acs":48312,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 02.07]链表相交","frequency":0.0,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":70540,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5322483306402943,"acs":27340,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 02.08]环路检测","frequency":0.0,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":51367,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5369892368382604,"acs":11026,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":20533,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6137036247839572,"acs":25921,"articleLive":2,"columnArticles":299,"formTitle":"[面试题 03.02]栈的最小值","frequency":0.0,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":42237,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38684746390225844,"acs":8359,"articleLive":2,"columnArticles":127,"formTitle":"[面试题 03.03]堆盘子","frequency":0.0,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":21608,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7125635483576365,"acs":23407,"articleLive":2,"columnArticles":343,"formTitle":"[面试题 03.04]化栈为队","frequency":0.0,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":32849,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.543335325762104,"acs":14544,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 03.05]栈排序","frequency":0.0,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":26768,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5878771405273172,"acs":10814,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 03.06]动物收容所","frequency":0.0,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":18395,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5316295850871918,"acs":17682,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 04.01]节点间通路","frequency":0.0,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":33260,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7902600364963503,"acs":34645,"articleLive":2,"columnArticles":422,"formTitle":"[面试题 04.02]最小高度树","frequency":0.0,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":43840,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8062837769796247,"acs":24020,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":0.0,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":29791,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5845018189524247,"acs":33098,"articleLive":2,"columnArticles":384,"formTitle":"[面试题 04.04]检查平衡性","frequency":0.0,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":56626,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.351587356242683,"acs":25527,"articleLive":2,"columnArticles":323,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":0.0,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":72605,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5904932262037417,"acs":20137,"articleLive":2,"columnArticles":241,"formTitle":"[面试题 04.06]后继者","frequency":0.0,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":34102,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168517168945857,"acs":16722,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 04.08]首个共同祖先","frequency":0.0,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":23327,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47612249268327506,"acs":6670,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":0.0,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":14009,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7164744210619002,"acs":16274,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 04.10]检查子树","frequency":0.0,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":22714,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.486296459688982,"acs":17637,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 04.12]求和路径","frequency":0.0,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":36268,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5047157244098683,"acs":9472,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":18767,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6896551724137931,"acs":7720,"articleLive":2,"columnArticles":126,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":0.0,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":11194,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38673306064378443,"acs":10873,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 05.03]翻转数位","frequency":0.0,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":28115,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.38605566078974207,"acs":5299,"articleLive":2,"columnArticles":137,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":13726,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5271510602703803,"acs":11659,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 05.06]整数转换","frequency":0.0,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":22117,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040784846054174,"acs":11411,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 05.07]配对交换","frequency":0.0,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":16207,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5533935242839353,"acs":3555,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 05.08]绘制直线","frequency":0.0,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":6424,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36319032986435323,"acs":42786,"articleLive":2,"columnArticles":474,"formTitle":"[面试题 08.01]三步问题","frequency":0.0,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":117806,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36092851273623666,"acs":12299,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 08.02]迷路的机器人","frequency":0.0,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":34076,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6757881052973675,"acs":51985,"articleLive":2,"columnArticles":434,"formTitle":"[面试题 08.03]魔术索引","frequency":0.0,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":76925,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8200773105306314,"acs":21003,"articleLive":2,"columnArticles":330,"formTitle":"[面试题 08.04]幂集","frequency":0.0,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":25611,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.679147716653168,"acs":21802,"articleLive":2,"columnArticles":486,"formTitle":"[面试题 08.05]递归乘法","frequency":0.0,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":32102,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6567086527929902,"acs":23983,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":0.0,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":36520,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.813153622531808,"acs":21538,"articleLive":2,"columnArticles":316,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":26487,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7187663128588829,"acs":16523,"articleLive":2,"columnArticles":238,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":0.0,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":22988,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8134761267291388,"acs":21876,"articleLive":2,"columnArticles":348,"formTitle":"[面试题 08.09]括号","frequency":0.0,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":26892,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5584146341463415,"acs":13737,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 08.10]颜色填充","frequency":0.0,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":24600,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49466372785012036,"acs":34113,"articleLive":2,"columnArticles":327,"formTitle":"[面试题 08.11]硬币","frequency":0.0,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":68962,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7609001406469761,"acs":16771,"articleLive":2,"columnArticles":297,"formTitle":"[面试题 08.12]八皇后","frequency":0.0,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":22041,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013140604467805,"acs":6867,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 08.13]堆箱子","frequency":0.0,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":13698,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5338278552244533,"acs":4174,"articleLive":2,"columnArticles":75,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7819,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5548320868162487,"acs":56751,"articleLive":2,"columnArticles":2374,"formTitle":"[面试题 10.01]合并排序的数组","frequency":0.0,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":102285,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396743531818764,"acs":34707,"articleLive":2,"columnArticles":427,"formTitle":"[面试题 10.02]变位词组","frequency":0.0,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46922,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39495322647917536,"acs":13257,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":0.0,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":33566,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534646700449809,"acs":19441,"articleLive":2,"columnArticles":256,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":0.0,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":35126,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4547516839423446,"acs":13030,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":0.0,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":28653,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6235547190104866,"acs":4638,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":7438,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670695907442583,"acs":7726,"articleLive":2,"columnArticles":96,"formTitle":"[面试题 10.11]峰与谷","frequency":0.0,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":11582,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8318254564457654,"acs":25468,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 16.01]交换数字","frequency":0.0,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":30617,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7659102630221764,"acs":14851,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.02]单词频率","frequency":0.0,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":19390,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44208538663473496,"acs":9599,"articleLive":2,"columnArticles":233,"formTitle":"[面试题 16.03]交点","frequency":0.0,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21713,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.45972620184654567,"acs":7220,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":15705,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4641816623821765,"acs":10834,"articleLive":2,"columnArticles":128,"formTitle":"[面试题 16.05]阶乘尾数","frequency":0.0,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":23340,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42434416246996476,"acs":12892,"articleLive":2,"columnArticles":189,"formTitle":"[面试题 16.06]最小差","frequency":0.0,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":30381,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7328861561393702,"acs":19667,"articleLive":2,"columnArticles":290,"formTitle":"[面试题 16.07]最大数值","frequency":0.0,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":26835,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.373134328358209,"acs":2300,"articleLive":2,"columnArticles":64,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":6164,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5476729559748428,"acs":2177,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3975,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6802747791952894,"acs":10398,"articleLive":2,"columnArticles":195,"formTitle":"[面试题 16.10]生存人数","frequency":0.0,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":15285,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4410461264127689,"acs":50457,"articleLive":2,"columnArticles":581,"formTitle":"[面试题 16.11]跳水板","frequency":0.0,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":114403,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.42937608318890813,"acs":1982,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4616,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5495426829268293,"acs":3605,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6560,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5034340275838963,"acs":9016,"articleLive":2,"columnArticles":226,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.0,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":17909,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45350871900078443,"acs":15032,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.16]部分排序","frequency":0.0,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":33146,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6004643748267258,"acs":34654,"articleLive":2,"columnArticles":375,"formTitle":"[面试题 16.17]连续数列","frequency":0.0,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":57712,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.34404780768273086,"acs":15199,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 16.18]模式匹配","frequency":0.0,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":44177,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6111243947635842,"acs":20447,"articleLive":2,"columnArticles":361,"formTitle":"[面试题 16.19]水域大小","frequency":0.0,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":33458,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7218833861917541,"acs":8877,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 16.20]T9键盘","frequency":0.0,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":12297,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46485436893203885,"acs":9576,"articleLive":2,"columnArticles":178,"formTitle":"[面试题 16.21]交换和","frequency":0.0,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":20600,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.584061367994886,"acs":2741,"articleLive":2,"columnArticles":60,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.0,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4693,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.4719916561644431,"acs":10861,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.24]数对和","frequency":0.0,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":23011,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5456228241487645,"acs":32129,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 16.25]LRU 缓存","frequency":0.0,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":58885,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3879716357093719,"acs":14663,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.26]计算器","frequency":0.0,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":37794,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5970381160475844,"acs":12296,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.01]不用加号的加法","frequency":0.0,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":20595,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6423812447415694,"acs":28250,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 17.04]消失的数字","frequency":0.0,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":43977,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38751497216937925,"acs":5500,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.0,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":14193,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44926703075596436,"acs":4689,"articleLive":2,"columnArticles":110,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":10437,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.411886402106451,"acs":8760,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 17.07]婴儿名字","frequency":0.0,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":21268,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27139881533554644,"acs":8339,"articleLive":2,"columnArticles":122,"formTitle":"[面试题 17.08]马戏团人塔","frequency":0.0,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":30726,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5487909182800715,"acs":14116,"articleLive":2,"columnArticles":147,"formTitle":"[面试题 17.09]第 k 个数","frequency":0.0,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":25722,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5705467597684392,"acs":66920,"articleLive":2,"columnArticles":928,"formTitle":"[面试题 17.10]主要元素","frequency":0.0,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":117291,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6870493358633776,"acs":14483,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.11]单词距离","frequency":0.0,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":21080,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6319673370633601,"acs":20896,"articleLive":2,"columnArticles":292,"formTitle":"[面试题 17.12]BiNode","frequency":0.0,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":33065,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5524692050528394,"acs":24623,"articleLive":2,"columnArticles":271,"formTitle":"[面试题 17.13]恢复空格","frequency":0.0,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":44569,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5970489397041214,"acs":77285,"articleLive":2,"columnArticles":760,"formTitle":"[面试题 17.14]最小K个数","frequency":0.0,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"ac","submitted":129445,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4025849688846338,"acs":5887,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 17.15]最长单词","frequency":0.0,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":14623,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5184387480815053,"acs":61140,"articleLive":2,"columnArticles":1138,"formTitle":"[面试题 17.16]按摩师","frequency":0.0,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":117931,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4452632166582929,"acs":7976,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.17]多次搜索","frequency":0.0,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":17913,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4460409472126295,"acs":7233,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.18]最短超串","frequency":0.0,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":16216,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5786981459250367,"acs":8677,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 17.19]消失的两个数字","frequency":0.0,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14994,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5712414495706593,"acs":3925,"articleLive":2,"columnArticles":69,"formTitle":"[面试题 17.20]连续中值","frequency":0.0,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6871,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358873795857607,"acs":44425,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 17.21]直方图的水量","frequency":0.0,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":69863,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37516378545162515,"acs":8876,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 17.22]单词转换","frequency":0.0,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":23659,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3783940878518642,"acs":4557,"articleLive":2,"columnArticles":101,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.0,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":12043,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.524563501554652,"acs":10966,"articleLive":2,"columnArticles":120,"formTitle":"[面试题 17.24]最大子矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":20905,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5015923566878981,"acs":1575,"articleLive":2,"columnArticles":39,"formTitle":"[面试题 17.25]单词矩阵","frequency":0.0,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":3140,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34262713528372274,"acs":3490,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.0,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":10186,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] |