From 80172bcf46f00ac859856d760002fb802c123a8d Mon Sep 17 00:00:00 2001 From: "huangge1199@hotmail.com" Date: Sun, 29 Aug 2021 15:16:26 +0800 Subject: [PATCH] =?UTF-8?q?meituan-010.=20=E5=B0=8F=E5=9B=A2=E7=9A=84?= =?UTF-8?q?=E9=BB=98=E5=A5=91=E6=B8=B8=E6=88=8F?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/main/java/leetcode/editor/cn/doc/all.json | 2 +- .../plan/meituan/meituan010/Solution.java | 91 +++++++++++++++++++ 2 files changed, 92 insertions(+), 1 deletion(-) create mode 100644 src/main/java/study/plan/meituan/meituan010/Solution.java diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json index 3399c8b..663c99d 100644 --- a/src/main/java/leetcode/editor/cn/doc/all.json +++ b/src/main/java/leetcode/editor/cn/doc/all.json @@ -1 +1 @@ -[{"acceptance":0.8564186829889496,"acs":0,"articleLive":2,"columnArticles":1098,"formTitle":"[1480]一维数组的动态和","frequency":55.44851002078682,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5189768361813203,"acs":0,"articleLive":2,"columnArticles":13811,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.407564868281885,"acs":0,"articleLive":2,"columnArticles":6884,"formTitle":"[2]两数相加","frequency":99.24647740207054,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37867271481226705,"acs":0,"articleLive":2,"columnArticles":7087,"formTitle":"[3]无重复字符的最长子串","frequency":97.73943220621163,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4069987273518872,"acs":0,"articleLive":2,"columnArticles":3623,"formTitle":"[4]寻找两个正序数组的中位数","frequency":96.14295197496666,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35228018232187286,"acs":0,"articleLive":2,"columnArticles":3811,"formTitle":"[5]最长回文子串","frequency":96.08300372634763,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5060131762757449,"acs":0,"articleLive":2,"columnArticles":2345,"formTitle":"[6]Z 字形变换","frequency":76.7511050303588,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3537838181762942,"acs":0,"articleLive":2,"columnArticles":5082,"formTitle":"[7]整数反转","frequency":98.49295480414109,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21682061380887632,"acs":0,"articleLive":2,"columnArticles":2603,"formTitle":"[8]字符串转换整数 (atoi)","frequency":74.96535727876476,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.585494312975681,"acs":0,"articleLive":2,"columnArticles":4752,"formTitle":"[9]回文数","frequency":80.23375832999868,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3164285967233592,"acs":0,"articleLive":2,"columnArticles":1194,"formTitle":"[10]正则表达式匹配","frequency":86.35251380933673,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6318902420225065,"acs":0,"articleLive":2,"columnArticles":2894,"formTitle":"[11]盛最多水的容器","frequency":86.6414112781206,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6656223593617014,"acs":0,"articleLive":2,"columnArticles":1712,"formTitle":"[12]整数转罗马数字","frequency":76.27721855389804,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331579703733343,"acs":0,"articleLive":2,"columnArticles":3746,"formTitle":"[13]罗马数字转整数","frequency":82.24940552091581,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.406692474942992,"acs":0,"articleLive":2,"columnArticles":3734,"formTitle":"[14]最长公共前缀","frequency":91.84655055620865,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3326686145304778,"acs":0,"articleLive":2,"columnArticles":2917,"formTitle":"[15]三数之和","frequency":94.25579956776853,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45977212971078,"acs":0,"articleLive":2,"columnArticles":1372,"formTitle":"[16]最接近的三数之和","frequency":83.15139247096457,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.571645103760774,"acs":0,"articleLive":2,"columnArticles":2919,"formTitle":"[17]电话号码的字母组合","frequency":78.72093899647335,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40192349768362173,"acs":0,"articleLive":2,"columnArticles":1451,"formTitle":"[18]四数之和","frequency":69.59874750507475,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4276030083432447,"acs":0,"articleLive":2,"columnArticles":3626,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":76.93168015089925,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44476134967824604,"acs":0,"articleLive":2,"columnArticles":5332,"formTitle":"[20]有效的括号","frequency":92.60007315413812,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6664869627608828,"acs":0,"articleLive":2,"columnArticles":3290,"formTitle":"[21]合并两个有序链表","frequency":87.43832588450192,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724749244066006,"acs":0,"articleLive":2,"columnArticles":2524,"formTitle":"[22]括号生成","frequency":90.10482502663605,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5585199868095392,"acs":0,"articleLive":2,"columnArticles":2013,"formTitle":"[23]合并K个升序链表","frequency":82.35814077476344,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7024511071808889,"acs":0,"articleLive":2,"columnArticles":2412,"formTitle":"[24]两两交换链表中的节点","frequency":62.78744669390226,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6561254390914221,"acs":0,"articleLive":2,"columnArticles":2068,"formTitle":"[25]K 个一组翻转链表","frequency":90.91293391799657,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403544752870478,"acs":0,"articleLive":2,"columnArticles":4345,"formTitle":"[26]删除有序数组中的重复项","frequency":80.28025816841942,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982983681156921,"acs":0,"articleLive":2,"columnArticles":3898,"formTitle":"[27]移除元素","frequency":72.71669956513723,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4071843354480636,"acs":0,"articleLive":2,"columnArticles":3123,"formTitle":"[28]实现 strStr()","frequency":74.24252745088327,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20733763854358336,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[29]两数相除","frequency":68.82396268189353,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35535451589629224,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[30]串联所有单词的子串","frequency":59.05450862840219,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3732721520267227,"acs":0,"articleLive":2,"columnArticles":1658,"formTitle":"[31]下一个排列","frequency":82.08325672793096,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35532088532295014,"acs":0,"articleLive":2,"columnArticles":1252,"formTitle":"[32]最长有效括号","frequency":76.35510362864031,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42554944545134016,"acs":0,"articleLive":2,"columnArticles":2285,"formTitle":"[33]搜索旋转排序数组","frequency":76.58003136402796,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42461000823832684,"acs":0,"articleLive":2,"columnArticles":3087,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.78753584228693,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4665172106687069,"acs":0,"articleLive":2,"columnArticles":3726,"formTitle":"[35]搜索插入位置","frequency":74.4676284836336,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6284755209322946,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[36]有效的数独","frequency":54.96246047055512,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707363121460038,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[37]解数独","frequency":67.4512184180127,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5794628053498397,"acs":0,"articleLive":2,"columnArticles":2209,"formTitle":"[38]外观数列","frequency":65.29934195276688,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7266398226360101,"acs":0,"articleLive":2,"columnArticles":1853,"formTitle":"[39]组合总和","frequency":72.57078421224054,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6282976481580883,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[40]组合总和 II","frequency":69.66065581066675,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41848144394136727,"acs":0,"articleLive":2,"columnArticles":1369,"formTitle":"[41]缺失的第一个正数","frequency":87.86596083597036,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5742549654849148,"acs":0,"articleLive":2,"columnArticles":2331,"formTitle":"[42]接雨水","frequency":94.5790485928057,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44871497584541065,"acs":0,"articleLive":2,"columnArticles":1093,"formTitle":"[43]字符串相乘","frequency":81.25561611513744,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32786337180029407,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[44]通配符匹配","frequency":63.41751177870444,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4245930939271462,"acs":0,"articleLive":2,"columnArticles":1494,"formTitle":"[45]跳跃游戏 II","frequency":96.63408973415429,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7821730800723715,"acs":0,"articleLive":2,"columnArticles":2549,"formTitle":"[46]全排列","frequency":93.48515474817289,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.636007220623907,"acs":0,"articleLive":2,"columnArticles":1415,"formTitle":"[47]全排列 II","frequency":67.77456354032667,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7348716477642433,"acs":0,"articleLive":2,"columnArticles":1787,"formTitle":"[48]旋转图像","frequency":72.024094635362,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.663758497029385,"acs":0,"articleLive":2,"columnArticles":1250,"formTitle":"[49]字母异位词分组","frequency":69.631397858385,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767714787855604,"acs":0,"articleLive":2,"columnArticles":1237,"formTitle":"[50]Pow(x, n)","frequency":67.21204502779715,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7390781967792418,"acs":0,"articleLive":2,"columnArticles":1482,"formTitle":"[51]N 皇后","frequency":68.36676100298367,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.823635652494018,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[52]N皇后 II","frequency":29.01802307674582,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.55087739739785,"acs":0,"articleLive":2,"columnArticles":3581,"formTitle":"[53]最大子序和","frequency":78.97605915415255,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47896198319078354,"acs":0,"articleLive":2,"columnArticles":1918,"formTitle":"[54]螺旋矩阵","frequency":88.06561778204085,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43192916623830574,"acs":0,"articleLive":2,"columnArticles":2346,"formTitle":"[55]跳跃游戏","frequency":75.12752094237271,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46602532459332563,"acs":0,"articleLive":2,"columnArticles":2195,"formTitle":"[56]合并区间","frequency":86.56247119830621,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41049902085239964,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":37.581460544876904,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35241497953295137,"acs":0,"articleLive":2,"columnArticles":2304,"formTitle":"[58]最后一个单词的长度","frequency":54.460423955328984,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7932143069768672,"acs":0,"articleLive":2,"columnArticles":1491,"formTitle":"[59]螺旋矩阵 II","frequency":77.03313256574447,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233744207156849,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[60]排列序列","frequency":36.93352017077563,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4182251691820864,"acs":0,"articleLive":2,"columnArticles":1926,"formTitle":"[61]旋转链表","frequency":71.93376336211684,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6598586972380527,"acs":0,"articleLive":2,"columnArticles":2322,"formTitle":"[62]不同路径","frequency":69.1667060051111,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3897254107075798,"acs":0,"articleLive":2,"columnArticles":1635,"formTitle":"[63]不同路径 II","frequency":70.1946220847584,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.68778651739613,"acs":0,"articleLive":2,"columnArticles":2000,"formTitle":"[64]最小路径和","frequency":71.71876926715363,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2690437794899361,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":46.350239479460214,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4584533848716583,"acs":0,"articleLive":2,"columnArticles":3050,"formTitle":"[66]加一","frequency":62.95515494614974,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5440033435691439,"acs":0,"articleLive":2,"columnArticles":1720,"formTitle":"[67]二进制求和","frequency":57.68162706757322,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47005157648890616,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":44.37309794928711,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39282629794475155,"acs":0,"articleLive":2,"columnArticles":1853,"formTitle":"[69]x 的平方根","frequency":79.42339307416637,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5276971032333707,"acs":0,"articleLive":2,"columnArticles":3413,"formTitle":"[70]爬楼梯","frequency":91.82361018985816,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42140598846940674,"acs":0,"articleLive":2,"columnArticles":799,"formTitle":"[71]简化路径","frequency":54.0677158454706,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6125557481738306,"acs":0,"articleLive":2,"columnArticles":1183,"formTitle":"[72]编辑距离","frequency":93.15086094556455,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6010935496833203,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[73]矩阵置零","frequency":53.611227816505455,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4582106803468636,"acs":0,"articleLive":2,"columnArticles":1620,"formTitle":"[74]搜索二维矩阵","frequency":74.89236827009795,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.593967381773543,"acs":0,"articleLive":2,"columnArticles":1774,"formTitle":"[75]颜色分类","frequency":46.0747244470168,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4234450348770333,"acs":0,"articleLive":2,"columnArticles":1189,"formTitle":"[76]最小覆盖子串","frequency":82.64140897632424,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699913191508552,"acs":0,"articleLive":2,"columnArticles":1208,"formTitle":"[77]组合","frequency":71.10871351710027,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8005653088276186,"acs":0,"articleLive":2,"columnArticles":1951,"formTitle":"[78]子集","frequency":75.36737950005546,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4571100295912505,"acs":0,"articleLive":2,"columnArticles":1336,"formTitle":"[79]单词搜索","frequency":72.06574796802227,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6158993163242577,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[80]删除有序数组中的重复项 II","frequency":68.10314042141704,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4161402850452028,"acs":0,"articleLive":2,"columnArticles":958,"formTitle":"[81]搜索旋转排序数组 II","frequency":71.886042786108,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5288938325454381,"acs":0,"articleLive":2,"columnArticles":1617,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":80.52651383714152,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5385795123068609,"acs":0,"articleLive":2,"columnArticles":1854,"formTitle":"[83]删除排序链表中的重复元素","frequency":71.44138330729626,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4325476914227342,"acs":0,"articleLive":2,"columnArticles":1109,"formTitle":"[84]柱状图中最大的矩形","frequency":80.34069304378232,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5163226996045674,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[85]最大矩形","frequency":60.316231434082624,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6321096796809956,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[86]分隔链表","frequency":58.27281365525428,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48885048366577855,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":70.1946220847584,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.515005005997752,"acs":0,"articleLive":2,"columnArticles":3068,"formTitle":"[88]合并两个有序数组","frequency":94.61598482256021,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7092172732756887,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[89]格雷编码","frequency":45.01006165833033,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337714413009579,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[90]子集 II","frequency":74.66176969260164,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3045336879853706,"acs":0,"articleLive":2,"columnArticles":1461,"formTitle":"[91]解码方法","frequency":66.76312351137894,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5470005657755245,"acs":0,"articleLive":2,"columnArticles":1945,"formTitle":"[92]反转链表 II","frequency":89.46470631604467,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5372634393344188,"acs":0,"articleLive":2,"columnArticles":1267,"formTitle":"[93]复原 IP 地址","frequency":82.01951533693418,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755876758028951,"acs":0,"articleLive":2,"columnArticles":2183,"formTitle":"[94]二叉树的中序遍历","frequency":63.858020538057204,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6990071808587959,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[95]不同的二叉搜索树 II","frequency":60.15869240936529,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992223666507035,"acs":0,"articleLive":2,"columnArticles":1222,"formTitle":"[96]不同的二叉搜索树","frequency":67.77456354032667,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45761533417083444,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[97]交错字符串","frequency":44.37309794928711,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34845030213434747,"acs":0,"articleLive":2,"columnArticles":1839,"formTitle":"[98]验证二叉搜索树","frequency":72.65904554088971,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6154408672919066,"acs":0,"articleLive":2,"columnArticles":555,"formTitle":"[99]恢复二叉搜索树","frequency":56.65266569831488,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039118317709653,"acs":0,"articleLive":2,"columnArticles":1808,"formTitle":"[100]相同的树","frequency":56.00613762691624,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5608988298046986,"acs":0,"articleLive":2,"columnArticles":2158,"formTitle":"[101]对称二叉树","frequency":75.0189027907254,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421929985133431,"acs":0,"articleLive":2,"columnArticles":2389,"formTitle":"[102]二叉树的层序遍历","frequency":87.94770305238006,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718450215018194,"acs":0,"articleLive":2,"columnArticles":1525,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":79.98876434971048,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7657881044899949,"acs":0,"articleLive":2,"columnArticles":2437,"formTitle":"[104]二叉树的最大深度","frequency":76.82593323446396,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7035116233988936,"acs":0,"articleLive":2,"columnArticles":1369,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":83.07330376296406,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212602895259722,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":70.1946220847584,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6953109862429762,"acs":0,"articleLive":2,"columnArticles":1273,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.41751177870444,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7591468457441529,"acs":0,"articleLive":2,"columnArticles":1145,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.48633436882079,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7635279473852417,"acs":0,"articleLive":2,"columnArticles":695,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.88829514996755,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5624666874965539,"acs":0,"articleLive":2,"columnArticles":1404,"formTitle":"[110]平衡二叉树","frequency":64.80826572902646,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4842453490209059,"acs":0,"articleLive":2,"columnArticles":1715,"formTitle":"[111]二叉树的最小深度","frequency":43.306439180282574,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257598082061784,"acs":0,"articleLive":2,"columnArticles":1586,"formTitle":"[112]路径总和","frequency":59.72403908962251,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6261279867227822,"acs":0,"articleLive":2,"columnArticles":1177,"formTitle":"[113]路径总和 II","frequency":64.45531152748879,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7255526787492531,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[114]二叉树展开为链表","frequency":46.85212015957397,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5248924842205442,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[115]不同的子序列","frequency":66.7047396114522,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7024914462413567,"acs":0,"articleLive":2,"columnArticles":1106,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":51.474145069492515,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6098326661098471,"acs":0,"articleLive":2,"columnArticles":713,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":29.394935727273353,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7253808088114182,"acs":0,"articleLive":2,"columnArticles":1657,"formTitle":"[118]杨辉三角","frequency":71.61353488335317,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.663012548625313,"acs":0,"articleLive":2,"columnArticles":1160,"formTitle":"[119]杨辉三角 II","frequency":56.57978748305376,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6790952592255016,"acs":0,"articleLive":2,"columnArticles":1502,"formTitle":"[120]三角形最小路径和","frequency":51.98719906652599,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5731017605580799,"acs":0,"articleLive":2,"columnArticles":3252,"formTitle":"[121]买卖股票的最佳时机","frequency":86.1387590994691,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.687027022784532,"acs":0,"articleLive":2,"columnArticles":2542,"formTitle":"[122]买卖股票的最佳时机 II","frequency":68.07435657947914,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5332956559059367,"acs":0,"articleLive":2,"columnArticles":795,"formTitle":"[123]买卖股票的最佳时机 III","frequency":60.46704515905945,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4429799732660737,"acs":0,"articleLive":2,"columnArticles":1044,"formTitle":"[124]二叉树中的最大路径和","frequency":83.24723904619805,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.473940241219294,"acs":0,"articleLive":2,"columnArticles":1784,"formTitle":"[125]验证回文串","frequency":65.96708388239337,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39377799297905824,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[126]单词接龙 II","frequency":38.25243343335573,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4670624304321506,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[127]单词接龙","frequency":50.39893660451029,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431175859618433,"acs":0,"articleLive":2,"columnArticles":1041,"formTitle":"[128]最长连续序列","frequency":76.70747597668117,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.679679613912067,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[129]求根节点到叶节点数字之和","frequency":65.77715998998629,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44198748657201753,"acs":0,"articleLive":2,"columnArticles":1121,"formTitle":"[130]被围绕的区域","frequency":57.594434816141195,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7236698499317872,"acs":0,"articleLive":2,"columnArticles":832,"formTitle":"[131]分割回文串","frequency":83.3366415689375,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4924910802825685,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[132]分割回文串 II","frequency":65.80869061461895,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6754812328819967,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[133]克隆图","frequency":4.751211694844501,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5761746856034536,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[134]加油站","frequency":74.32409570664625,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48587819718134523,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[135]分发糖果","frequency":86.45433970502945,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190509535025418,"acs":0,"articleLive":2,"columnArticles":2156,"formTitle":"[136]只出现一次的数字","frequency":77.40567480531641,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7195653299601281,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[137]只出现一次的数字 II","frequency":73.83518753537282,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6590187361067006,"acs":0,"articleLive":2,"columnArticles":836,"formTitle":"[138]复制带随机指针的链表","frequency":68.90965888874032,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5128117041482949,"acs":0,"articleLive":2,"columnArticles":1144,"formTitle":"[139]单词拆分","frequency":76.84015570362837,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48209066045095256,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[140]单词拆分 II","frequency":42.0162849129722,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.512433537999783,"acs":0,"articleLive":2,"columnArticles":2605,"formTitle":"[141]环形链表","frequency":76.99412259894892,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5514055035729796,"acs":0,"articleLive":2,"columnArticles":1636,"formTitle":"[142]环形链表 II","frequency":70.5789529556754,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6169345179198217,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[143]重排链表","frequency":91.55880866550353,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7026291521255628,"acs":0,"articleLive":2,"columnArticles":1753,"formTitle":"[144]二叉树的前序遍历","frequency":56.95360143368112,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7492983329449893,"acs":0,"articleLive":2,"columnArticles":1482,"formTitle":"[145]二叉树的后序遍历","frequency":66.95655938658587,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.526905997255007,"acs":0,"articleLive":2,"columnArticles":1321,"formTitle":"[146]LRU 缓存机制","frequency":93.76036198406749,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6807669861270295,"acs":0,"articleLive":2,"columnArticles":760,"formTitle":"[147]对链表进行插入排序","frequency":48.40995121920762,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6674899701608112,"acs":0,"articleLive":2,"columnArticles":1200,"formTitle":"[148]排序链表","frequency":78.70467054672629,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.336049093746249,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[149]直线上最多的点数","frequency":66.58178619468133,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5367403663929248,"acs":0,"articleLive":2,"columnArticles":1011,"formTitle":"[150]逆波兰表达式求值","frequency":70.1946220847584,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4798816479624621,"acs":0,"articleLive":2,"columnArticles":1366,"formTitle":"[151]翻转字符串里的单词","frequency":61.3173490261121,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42027778386632475,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[152]乘积最大子数组","frequency":75.46255247887741,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5654799441454021,"acs":0,"articleLive":2,"columnArticles":1423,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":55.503576693652654,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5318430261704168,"acs":0,"articleLive":2,"columnArticles":864,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":65.43487054599369,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5723816599138891,"acs":0,"articleLive":2,"columnArticles":1536,"formTitle":"[155]最小栈","frequency":70.72872571099693,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7257988721804511,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[156]上下翻转二叉树","frequency":16.65964708448798,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5304922092663296,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5887913571910871,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":8.244428887054285,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5409219541257074,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":43.98536534237808,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6120141451473645,"acs":0,"articleLive":2,"columnArticles":1879,"formTitle":"[160]相交链表","frequency":72.23282072608013,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.336598106431603,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.383649960770506,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4943481506054072,"acs":0,"articleLive":2,"columnArticles":696,"formTitle":"[162]寻找峰值","frequency":60.316231434082624,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32306308332396266,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[163]缺失的区间","frequency":17.273127573345107,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6110137353006788,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[164]最大间距","frequency":58.72793424485767,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.4858635949618644,"acs":0,"articleLive":2,"columnArticles":522,"formTitle":"[165]比较版本号","frequency":81.45674907251718,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29848400167668016,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":52.16121533012388,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863119559615936,"acs":0,"articleLive":2,"columnArticles":1780,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":62.13192331192878,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.432781642280323,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[168]Excel表列名称","frequency":62.507427290943006,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6643166538418465,"acs":0,"articleLive":2,"columnArticles":2093,"formTitle":"[169]多数元素","frequency":69.752518857942,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.416487013653629,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.272967892547079,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7173238017692276,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[171]Excel 表列序号","frequency":22.939711819021888,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.43763880185486903,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[172]阶乘后的零","frequency":47.18774738174674,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8030598420513498,"acs":0,"articleLive":2,"columnArticles":610,"formTitle":"[173]二叉搜索树迭代器","frequency":48.94257517154734,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4794684419941227,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[174]地下城游戏","frequency":65.03478487475431,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399074201104658,"acs":0,"articleLive":2,"columnArticles":1426,"formTitle":"[175]组合两个表","frequency":94.95695427372318,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35614718627506003,"acs":0,"articleLive":2,"columnArticles":975,"formTitle":"[176]第二高的薪水","frequency":95.91580863784928,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4620070133891976,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[177]第N高的薪水","frequency":77.66761761327304,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6018381688478753,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[178]分数排名","frequency":70.1946220847584,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40980179211342743,"acs":0,"articleLive":2,"columnArticles":934,"formTitle":"[179]最大数","frequency":81.88129780307541,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48724524306678824,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[180]连续出现的数字","frequency":73.18149676610591,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7029716398949324,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[181]超过经理收入的员工","frequency":71.886042786108,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971639240826967,"acs":0,"articleLive":2,"columnArticles":553,"formTitle":"[182]查找重复的电子邮箱","frequency":61.26716701525052,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6775018675946327,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[183]从不订购的客户","frequency":45.87061400840026,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4743379743379743,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[184]部门工资最高的员工","frequency":75.29571240272432,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4926778472797671,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[185]部门工资前三高的所有员工","frequency":75.20888692302742,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.753359025101552,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[186]翻转字符串里的单词 II","frequency":5.816580199173658,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48239852178577813,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[187]重复的DNA序列","frequency":33.992413384380356,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.3886743886743887,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":51.78829333312404,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4530558034795762,"acs":0,"articleLive":2,"columnArticles":1585,"formTitle":"[189]旋转数组","frequency":63.11856039899665,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6954217423302101,"acs":0,"articleLive":2,"columnArticles":799,"formTitle":"[190]颠倒二进制位","frequency":50.90364753328215,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7472398843341259,"acs":0,"articleLive":2,"columnArticles":1158,"formTitle":"[191]位1的个数","frequency":63.65894699420389,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3554645178764897,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[192]统计词频","frequency":58.01202073897047,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3236953455571227,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":36.93352017077563,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3449934260604802,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[194]转置文件","frequency":30.306275749303918,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4360258501852765,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":53.29146781493168,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6648532206389824,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[196]删除重复的电子邮箱","frequency":60.55807908026206,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.533814948266958,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":57.2410320261618,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5110737920488867,"acs":0,"articleLive":2,"columnArticles":2537,"formTitle":"[198]打家劫舍","frequency":81.08477140788733,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524614614712838,"acs":0,"articleLive":2,"columnArticles":1521,"formTitle":"[199]二叉树的右视图","frequency":82.20132721692251,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5514124618526628,"acs":0,"articleLive":2,"columnArticles":2036,"formTitle":"[200]岛屿数量","frequency":90.91293391799657,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5222841681486411,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[201]数字范围按位与","frequency":36.93352017077563,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6177798852047157,"acs":0,"articleLive":2,"columnArticles":1323,"formTitle":"[202]快乐数","frequency":58.15317283010526,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5129863744907993,"acs":0,"articleLive":2,"columnArticles":1566,"formTitle":"[203]移除链表元素","frequency":57.94818790613759,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.379302884950894,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[204]计数质数","frequency":54.0677158454706,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010807902081319,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[205]同构字符串","frequency":49.7133615916018,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7222198766975735,"acs":0,"articleLive":2,"columnArticles":7169,"formTitle":"[206]反转链表","frequency":96.98590960828217,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5449060871475471,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[207]课程表","frequency":70.1946220847584,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.716260842303271,"acs":0,"articleLive":2,"columnArticles":927,"formTitle":"[208]实现 Trie (前缀树)","frequency":69.4977511767484,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4690573878280995,"acs":0,"articleLive":2,"columnArticles":1278,"formTitle":"[209]长度最小的子数组","frequency":56.52167563048044,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5412031022907047,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[210]课程表 II","frequency":49.54563205143791,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4815520196686116,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":34.657156582374384,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45094656659572085,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[212]单词搜索 II","frequency":42.0162849129722,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4322117533929972,"acs":0,"articleLive":2,"columnArticles":1434,"formTitle":"[213]打家劫舍 II","frequency":75.03772018425799,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3706059755070146,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[214]最短回文串","frequency":58.72793424485767,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6471438697730771,"acs":0,"articleLive":2,"columnArticles":2189,"formTitle":"[215]数组中的第K个最大元素","frequency":89.2909755608128,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7397145189541344,"acs":0,"articleLive":2,"columnArticles":981,"formTitle":"[216]组合总和 III","frequency":63.04758895739948,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5615183767838635,"acs":0,"articleLive":2,"columnArticles":1566,"formTitle":"[217]存在重复元素","frequency":68.94860921842233,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5426000931933044,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[218]天际线问题","frequency":63.2899164149007,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4255287602285751,"acs":0,"articleLive":2,"columnArticles":844,"formTitle":"[219]存在重复元素 II","frequency":47.12859509650747,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28706754719229344,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[220]存在重复元素 III","frequency":63.41751177870444,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47246958303866526,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[221]最大正方形","frequency":73.45000409824752,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.780023245166062,"acs":0,"articleLive":2,"columnArticles":851,"formTitle":"[222]完全二叉树的节点个数","frequency":36.30714639136253,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4602505561409671,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[223]矩形面积","frequency":47.0565400440941,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4176186224097053,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[224]基本计算器","frequency":90.24875653022858,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.675646732739795,"acs":0,"articleLive":2,"columnArticles":4720,"formTitle":"[225]用队列实现栈","frequency":53.611227816505455,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.78737868860535,"acs":0,"articleLive":2,"columnArticles":1777,"formTitle":"[226]翻转二叉树","frequency":76.01749743009475,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43681191377850215,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[227]基本计算器 II","frequency":77.86909069492141,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816332982086406,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[228]汇总区间","frequency":16.65964708448798,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46296026971640114,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[229]求众数 II","frequency":39.98818061847047,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7402407508161044,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":39.67013482103618,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5035825559862797,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[231]2 的幂","frequency":47.18774738174674,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909848544082273,"acs":0,"articleLive":2,"columnArticles":1204,"formTitle":"[232]用栈实现队列","frequency":66.2436221247278,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47583856091203347,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":42.455303468066596,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4924838091610832,"acs":0,"articleLive":2,"columnArticles":1898,"formTitle":"[234]回文链表","frequency":78.96213638221347,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660051556937682,"acs":0,"articleLive":2,"columnArticles":929,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":49.66849380368633,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6796453795651651,"acs":0,"articleLive":2,"columnArticles":1319,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.87447012159853,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8480378583834671,"acs":0,"articleLive":2,"columnArticles":995,"formTitle":"[237]删除链表中的节点","frequency":53.36208205753367,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7225057091969973,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[238]除自身以外数组的乘积","frequency":56.00613762691624,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4961565758584921,"acs":0,"articleLive":2,"columnArticles":1265,"formTitle":"[239]滑动窗口最大值","frequency":70.1946220847584,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47395244670159753,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[240]搜索二维矩阵 II","frequency":62.54873385751488,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.736885043263288,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[241]为运算表达式设计优先级","frequency":51.474145069492515,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6437881037074382,"acs":0,"articleLive":2,"columnArticles":1592,"formTitle":"[242]有效的字母异位词","frequency":57.594434816141195,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6569240387621131,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.548654970760234,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.610460809008742,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4743231441048035,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5204629142556549,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46468131469039403,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.638265366082971,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6341789052069426,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[250]统计同值子树","frequency":6.383649960770506,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5416402786573781,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[251]展开二维向量","frequency":16.65964708448798,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5611687465544029,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[252]会议室","frequency":6.383649960770506,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49680744928500165,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[253]会议室 II","frequency":53.09722127056323,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5690894098244788,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":17.273127573345107,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4727428408334126,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6308850125430255,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[256]粉刷房子","frequency":5.272967892547079,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6802305747310965,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[257]二叉树的所有路径","frequency":63.2899164149007,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6914354249577496,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[258]各位相加","frequency":49.05085514871373,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5668435683598686,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.272967892547079,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253535471105163,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[260]只出现一次的数字 III","frequency":50.81014591560455,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4967506343999505,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[261]以图判树","frequency":24.795313995995212,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4381298056258656,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[262]行程和用户","frequency":63.570469276428156,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154712161118482,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[263]丑数","frequency":54.772710711220206,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5783043630777419,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[264]丑数 II","frequency":60.01795488372639,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5803973013493253,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[265]粉刷房子 II","frequency":4.249864208757924,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6698362387744321,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4445352957209049,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.975954926003741,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6227614367894809,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[268]丢失的数字","frequency":32.934913793822666,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33983933016519574,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5491274205115946,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":17.273127573345107,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5503589297367849,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6450471698113207,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":11.147953406635953,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30858966310943714,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":34.657156582374384,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404718800259349,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":57.32080471039905,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4630791393652121,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[275]H 指数 II","frequency":32.73049390930255,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48561589784059117,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[276]栅栏涂色","frequency":25.46076735947459,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.568641975308642,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.975954926003741,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45520631013144225,"acs":0,"articleLive":2,"columnArticles":930,"formTitle":"[278]第一个错误的版本","frequency":68.51608359988303,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.630385346352972,"acs":0,"articleLive":2,"columnArticles":1150,"formTitle":"[279]完全平方数","frequency":71.22304736780555,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864428498206048,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":17.91091739569925,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7561747941735275,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.38851218828803585,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6391532486600745,"acs":0,"articleLive":2,"columnArticles":3170,"formTitle":"[283]移动零","frequency":74.54321665697253,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7333730542935876,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[284]顶端迭代器","frequency":17.273127573345107,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6360661240245028,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5068411111622979,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[286]墙与门","frequency":6.975954926003741,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.662588796996257,"acs":0,"articleLive":2,"columnArticles":1186,"formTitle":"[287]寻找重复数","frequency":62.595840965214165,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4248096037175681,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7531676910081267,"acs":0,"articleLive":2,"columnArticles":809,"formTitle":"[289]生命游戏","frequency":17.91091739569925,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45705753143502853,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[290]单词规律","frequency":27.815933631837726,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5341338670224595,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6967356996283263,"acs":0,"articleLive":2,"columnArticles":553,"formTitle":"[292]Nim 游戏","frequency":43.98536534237808,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7101580135440181,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[293]翻转游戏","frequency":5.816580199173658,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5859000684462696,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5246960519530465,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[295]数据流的中位数","frequency":36.6625139494447,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6189203634420096,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":26.152530337287494,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5576770979991811,"acs":0,"articleLive":2,"columnArticles":721,"formTitle":"[297]二叉树的序列化与反序列化","frequency":57.88829514996755,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5783268531293114,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5037316648568523,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[299]猜数字游戏","frequency":24.15437409534985,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5109411482280554,"acs":0,"articleLive":2,"columnArticles":1892,"formTitle":"[300]最长递增子序列","frequency":82.72553184397204,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5219738249223405,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[301]删除无效的括号","frequency":53.09722127056323,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6696492483894059,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7237544382086817,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[303]区域和检索 - 数组不可变","frequency":62.571488562732334,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5390976027550828,"acs":0,"articleLive":2,"columnArticles":545,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":57.88829514996755,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37670652480933997,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":5.816580199173658,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3370039910566897,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":39.67013482103618,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5430849797667222,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":17.91091739569925,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6047045324153758,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6048108830958709,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":72.36184316285843,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3790912096389083,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[310]最小高度树","frequency":43.497997772821385,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.763062244434348,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.91091739569925,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6822589048581196,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":57.411599801138195,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6539254664533052,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[313]超级丑数","frequency":32.99926292390459,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5475130890052357,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41854780118808493,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":57.2410320261618,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4769130653414973,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[316]去除重复字母","frequency":58.406590719998796,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48611787627861663,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6824141293747968,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[318]最大单词长度乘积","frequency":6.975954926003741,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5159623976172748,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[319]灯泡开关","frequency":17.273127573345107,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6710995013061031,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4258010533051139,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[321]拼接最大数","frequency":33.992413384380356,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44264585785128074,"acs":0,"articleLive":2,"columnArticles":1741,"formTitle":"[322]零钱兑换","frequency":82.30832116312963,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6343403245462126,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[323]无向图中连通分量的数目","frequency":35.34653088042582,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37708216357851393,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[324]摆动排序 II","frequency":38.94805914015503,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5381855770400097,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":33.350681095761885,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4894627579265224,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":29.01802307674582,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42464398035266265,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":37.581460544876904,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6569024568695855,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[328]奇偶链表","frequency":62.1764543265684,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48238635329243207,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[329]矩阵中的最长递增路径","frequency":57.32080471039905,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5344100519234631,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":33.992413384380356,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4801094552312841,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[331]验证二叉树的前序序列化","frequency":57.411599801138195,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44875114860913873,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[332]重新安排行程","frequency":49.05085514871373,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46552453468697125,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[333]最大 BST 子树","frequency":17.91091739569925,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4132611871443949,"acs":0,"articleLive":2,"columnArticles":282,"formTitle":"[334]递增的三元子序列","frequency":5.272967892547079,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3689755069791941,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40116193557876156,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[336]回文对","frequency":35.34653088042582,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6088555811475128,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[337]打家劫舍 III","frequency":70.79066771966596,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7873922246889359,"acs":0,"articleLive":2,"columnArticles":1328,"formTitle":"[338]比特位计数","frequency":71.48038118558131,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8099415204678363,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49497737556561083,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":29.01802307674582,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7271675454012888,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":72.21942770684142,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5153336828884635,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[342]4的幂","frequency":49.05085514871373,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6042879970032017,"acs":0,"articleLive":2,"columnArticles":1001,"formTitle":"[343]整数拆分","frequency":65.29934195276688,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.764798430672889,"acs":0,"articleLive":2,"columnArticles":1831,"formTitle":"[344]反转字符串","frequency":68.28166576653724,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.53861697120992,"acs":0,"articleLive":2,"columnArticles":1012,"formTitle":"[345]反转字符串中的元音字母","frequency":29.650663148664048,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067252694322356,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.622282140266769,"acs":0,"articleLive":2,"columnArticles":1417,"formTitle":"[347]前 K 个高频元素","frequency":79.16122758168099,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6002332512634443,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7381747015743036,"acs":0,"articleLive":2,"columnArticles":1440,"formTitle":"[349]两个数组的交集","frequency":68.29639466782739,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5495487233031855,"acs":0,"articleLive":2,"columnArticles":1300,"formTitle":"[350]两个数组的交集 II","frequency":63.78347019528932,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5891758917589176,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":20.742653411043698,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5930899426493216,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42465183953440033,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":7.595475941432444,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.450817352398151,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[354]俄罗斯套娃信封问题","frequency":77.32471966933223,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40674740763437567,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[355]设计推特","frequency":37.581460544876904,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35210280373831776,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5196441327358919,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.65056770810797,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3517848330317486,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7247486835806606,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.606942889137738,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5662962962962963,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6956128448665763,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":6.383649960770506,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49066415277946723,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":56.696520503879086,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7174537987679671,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3637751039547023,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[365]水壶问题","frequency":49.05085514871373,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7645517499532098,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43933831261304024,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[367]有效的完全平方数","frequency":5.272967892547079,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45893387207819325,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[368]最大整除子集","frequency":70.91619587469846,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6163646659116648,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7183693760874968,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":6.383649960770506,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5795514783041423,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":48.4731084069204,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5073161557269137,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":6.975954926003741,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4262668092561833,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[373]查找和最小的K对数字","frequency":43.306439180282574,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5143902407770474,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[374]猜数字大小","frequency":34.657156582374384,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4671440885882899,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":34.657156582374384,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46164886711334086,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[376]摆动序列","frequency":32.73049390930255,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5069216773014262,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[377]组合总和 Ⅳ","frequency":60.55807908026206,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.638798728182029,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":57.411599801138195,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6456953642384106,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5023725888950514,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":35.34653088042582,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44329742988162524,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":6.975954926003741,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6271994598928224,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.795313995995212,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5947813481517275,"acs":0,"articleLive":2,"columnArticles":676,"formTitle":"[383]赎金信","frequency":14.418681666086815,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5753278474708909,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[384]打乱数组","frequency":56.65266569831488,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41461282992483833,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":5.816580199173658,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7463316084213512,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[386]字典序排数","frequency":56.696520503879086,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5304098905795214,"acs":0,"articleLive":2,"columnArticles":1137,"formTitle":"[387]字符串中的第一个唯一字符","frequency":62.1764543265684,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5239112266691429,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6922798424023001,"acs":0,"articleLive":2,"columnArticles":963,"formTitle":"[389]找不同","frequency":23.536328348019065,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4664186815457739,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":36.06233332023997,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3554158607350097,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5143791570205416,"acs":0,"articleLive":2,"columnArticles":1523,"formTitle":"[392]判断子序列","frequency":59.05450862840219,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3913138526561247,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":34.657156582374384,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5511828815099347,"acs":0,"articleLive":2,"columnArticles":1245,"formTitle":"[394]字符串解码","frequency":89.24520471780664,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202903849166971,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":58.01202073897047,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.422954199597467,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37787088764742394,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[397]整数替换","frequency":24.15437409534985,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6527684804437219,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[398]随机数索引","frequency":41.31612403962692,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5923605112513359,"acs":0,"articleLive":2,"columnArticles":513,"formTitle":"[399]除法求值","frequency":29.650663148664048,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4140040788579198,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[400]第 N 位数字","frequency":47.78931912217114,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6137426424400344,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":48.40995121920762,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3279752586766447,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[402]移掉 K 位数字","frequency":69.47329897871758,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.456110418667375,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[403]青蛙过河","frequency":68.48108918811506,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5816433930166811,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[404]左叶子之和","frequency":56.65266569831488,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5230480150321832,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[405]数字转换为十六进制数","frequency":44.68896659205848,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7355163402075193,"acs":0,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":58.72793424485767,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4827378864558801,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":46.350239479460214,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3246261409982521,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5555011133094753,"acs":0,"articleLive":2,"columnArticles":1277,"formTitle":"[409]最长回文串","frequency":64.86674993658875,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5614546547449094,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[410]分割数组的最大值","frequency":73.81377080406276,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49627079747561675,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6726926646337998,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[412]Fizz Buzz","frequency":30.306275749303918,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6861367761518504,"acs":0,"articleLive":2,"columnArticles":876,"formTitle":"[413]等差数列划分","frequency":35.88079942254864,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3646221452002228,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[414]第三大的数","frequency":38.25243343335573,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5359325751359311,"acs":0,"articleLive":2,"columnArticles":1027,"formTitle":"[415]字符串相加","frequency":89.40431362545486,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5061031807772456,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[416]分割等和子集","frequency":72.25324606282595,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4761622192964563,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[417]太平洋大西洋水流问题","frequency":59.965774115028836,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.359108324625566,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7561229807191245,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":16.068858894455616,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20548686244204017,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":28.406889968692177,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.622465018209699,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[421]数组中两个数的最大异或值","frequency":60.708920976830626,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42662116040955633,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5691166077738515,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5304142213511988,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":65.24293421361234,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6111341919401745,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6678459937565037,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.01802307674582,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6130374479889042,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6491547464239272,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6980182486790416,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[429]N 叉树的层序遍历","frequency":27.815933631837726,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5414334856497407,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[430]扁平化多级双向链表","frequency":30.306275749303918,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7235023041474654,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37736406619385343,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":19.266803924827244,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5329415077074682,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37401838011515015,"acs":0,"articleLive":2,"columnArticles":514,"formTitle":"[434]字符串中的单词数","frequency":29.650663148664048,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5099348412438248,"acs":0,"articleLive":2,"columnArticles":801,"formTitle":"[435]无重叠区间","frequency":62.78744669390226,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48636470037453183,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":6.383649960770506,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5669312453073045,"acs":0,"articleLive":2,"columnArticles":790,"formTitle":"[437]路径总和 III","frequency":53.461365704068676,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5162465998589572,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[438]找到字符串中所有字母异位词","frequency":48.851417361648295,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5882475951484735,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37967521493129547,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[440]字典序的第K小数字","frequency":70.1946220847584,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4260865479490673,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[441]排列硬币","frequency":24.15437409534985,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6964627070187607,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[442]数组中重复的数据","frequency":64.06786108215182,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47652132668118896,"acs":0,"articleLive":2,"columnArticles":677,"formTitle":"[443]压缩字符串","frequency":42.86672334936891,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24888680571830327,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[444]序列重建","frequency":18.57481039353011,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.587646980323542,"acs":0,"articleLive":2,"columnArticles":907,"formTitle":"[445]两数相加 II","frequency":69.44706820267665,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5518250739103708,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":29.394935727273353,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6037986375707193,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6472526493899724,"acs":0,"articleLive":2,"columnArticles":1033,"formTitle":"[448]找到所有数组中消失的数字","frequency":62.45419782275757,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5546866102274022,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":6.383649960770506,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4838729340462216,"acs":0,"articleLive":2,"columnArticles":579,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.12405677547555,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7111101050344079,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[451]根据字符出现频率排序","frequency":59.31964842847164,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.509378758636122,"acs":0,"articleLive":2,"columnArticles":800,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.05085514871373,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5541979883536262,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":24.15437409534985,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5997402411136167,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[454]四数相加 II","frequency":56.00613762691624,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774848292944921,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[455]分发饼干","frequency":58.27281365525428,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36228503476033663,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[456]132 模式","frequency":72.76940883107955,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4352096478413577,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":30.35770435734521,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6081778111225734,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":16.65964708448798,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5116513059926752,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[459]重复的子字符串","frequency":54.49859596535854,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43962921006824524,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":64.03484184360696,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8116727162884209,"acs":0,"articleLive":2,"columnArticles":1313,"formTitle":"[461]汉明距离","frequency":58.15317283010526,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6020979961447079,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.25243343335573,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7149365971569436,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[463]岛屿的周长","frequency":38.25243343335573,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3588100377765785,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":38.94805914015503,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5291245204046041,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3734767025089606,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4398191947860822,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.273127573345107,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.2486647648055597,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[468]验证IP地址","frequency":51.474145069492515,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4369905956112853,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":24.795313995995212,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.556066762937838,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":65.77715998998629,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6179604261796042,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":14.418681666086815,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.41000326904217066,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.41994616074862195,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":39.98818061847047,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.609799191328871,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[474]一和零","frequency":65.93042155398757,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32970578401872286,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":30.306275749303918,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012420467101002,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[476]数字的补数","frequency":5.272967892547079,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6037350589787488,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":47.78931912217114,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4363046086526925,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.306275749303918,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41333333333333333,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":11.147953406635953,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4484644183120252,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[480]滑动窗口中位数","frequency":42.74290923160427,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5350446204752832,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.816580199173658,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4253554774538856,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":15.499300309096109,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5893810135951073,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":32.73049390930255,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6406826568265682,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6062289950999256,"acs":0,"articleLive":2,"columnArticles":953,"formTitle":"[485]最大连续 1 的个数","frequency":49.05085514871373,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5877469786442853,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[486]预测赢家","frequency":41.31612403962692,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5795768169273229,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":37.581460544876904,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3879219717322743,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.71939736346516,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48213333333333336,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":7.595475941432444,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5477716426740288,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[491]递增子序列","frequency":50.81014591560455,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.550027736416455,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.383649960770506,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3439531859557867,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":38.94805914015503,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4989000773493993,"acs":0,"articleLive":2,"columnArticles":994,"formTitle":"[494]目标和","frequency":75.23979981530884,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5413814686938437,"acs":0,"articleLive":2,"columnArticles":410,"formTitle":"[495]提莫攻击","frequency":24.795313995995212,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6871487125742055,"acs":0,"articleLive":2,"columnArticles":991,"formTitle":"[496]下一个更大元素 I","frequency":55.238120936848766,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4034197942327199,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4601108999088956,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[498]对角线遍历","frequency":57.32080471039905,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3691704198750545,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7080954789604258,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[500]键盘行","frequency":16.65964708448798,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5106019347610987,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[501]二叉搜索树中的众数","frequency":49.54563205143791,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.41730086250634196,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":30.986480824922612,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6336418178412974,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[503]下一个更大元素 II","frequency":67.35639313600407,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5046287451150673,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":24.15437409534985,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4840372614633264,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":17.91091739569925,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5633133766197262,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[506]相对名次","frequency":15.499300309096109,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4087588060135086,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[507]完美数","frequency":24.15437409534985,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6740164288802422,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.91091739569925,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6774986085956503,"acs":0,"articleLive":2,"columnArticles":1384,"formTitle":"[509]斐波那契数","frequency":66.88186806879541,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6103744149765991,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":8.244428887054285,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.733826324051888,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":38.25243343335573,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5376598465473146,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":5.816580199173658,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7306297190005449,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[513]找树左下角的值","frequency":16.068858894455616,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5014908976773383,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":51.10920062904562,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.642664654521936,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[515]在每个树行中找最大值","frequency":36.06233332023997,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.651469114652358,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[516]最长回文子序列","frequency":38.155110401014426,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.43932097279075366,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":5.272967892547079,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6509567984078456,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[518]零钱兑换 II","frequency":71.886042786108,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39555692687442146,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":19.266803924827244,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5629066930048803,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[520]检测大写字母","frequency":5.272967892547079,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120513854484706,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.65964708448798,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35889214439714745,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[522]最长特殊序列 II","frequency":16.65964708448798,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27425510325647123,"acs":0,"articleLive":2,"columnArticles":587,"formTitle":"[523]连续的子数组和","frequency":59.24912292451731,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4732474126147237,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":34.657156582374384,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.536484071723458,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[525]连续数组","frequency":68.90965888874032,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344137664170441,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[526]优美的排列","frequency":34.43292214373313,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5753056963912914,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.46956862361063506,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":16.65964708448798,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464267612772427,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[529]扫雷游戏","frequency":36.80656450403604,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206047180572316,"acs":0,"articleLive":2,"columnArticles":621,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":17.273127573345107,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6626016260162602,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37215862203483924,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[532]数组中的 k-diff 数对","frequency":17.273127573345107,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5223529411764706,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6762996941896025,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[534]游戏玩法分析 III","frequency":16.65964708448798,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8420015329026607,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[535]TinyURL 的加密与解密","frequency":30.306275749303918,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5346332404828227,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7119367390485754,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[537]复数乘法","frequency":5.816580199173658,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6954456160044903,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":34.544701370244134,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5938001068947087,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[539]最小时间差","frequency":29.650663148664048,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5807083110873821,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[540]有序数组中的单一元素","frequency":47.0565400440941,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6083294836715113,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[541]反转字符串 II","frequency":28.863277662539367,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4594612143599215,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[542]01 矩阵","frequency":45.66862015710981,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5487348124772993,"acs":0,"articleLive":2,"columnArticles":1186,"formTitle":"[543]二叉树的直径","frequency":71.58161456075386,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.709160794362588,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.41632911392405064,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6309129511677283,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.46076735947459,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6182118314248879,"acs":0,"articleLive":2,"columnArticles":1084,"formTitle":"[547]省份数量","frequency":54.90604966659165,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35762047498270694,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48392638036809815,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43826047769265436,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[550]游戏玩法分析 IV","frequency":29.650663148664048,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5670138615420965,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[551]学生出勤记录 I","frequency":20.93689995541215,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5779943258912051,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":31.549552314511153,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6018292034457088,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[553]最优除法","frequency":5.816580199173658,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5008047514338176,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[554]砖墙","frequency":61.87776096903607,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3419129329520178,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32482326138525497,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[556]下一个更大元素 III","frequency":52.61118845161346,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7452623229803064,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[557]反转字符串中的单词 III","frequency":60.362515342707155,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.502127659574468,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7269105711236318,"acs":0,"articleLive":2,"columnArticles":537,"formTitle":"[559]N 叉树的最大深度","frequency":32.73049390930255,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4468954509177973,"acs":0,"articleLive":2,"columnArticles":866,"formTitle":"[560]和为K的子数组","frequency":82.18720793457616,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7733967962416771,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[561]数组拆分 I","frequency":24.15437409534985,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4604876803268224,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6043646195442256,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[563]二叉树的坡度","frequency":29.650663148664048,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17859682884993516,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":17.273127573345107,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6098479752455267,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[565]数组嵌套","frequency":16.65964708448798,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6962203237212571,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[566]重塑矩阵","frequency":30.306275749303918,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43031656377249444,"acs":0,"articleLive":2,"columnArticles":978,"formTitle":"[567]字符串的排列","frequency":54.90604966659165,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.502017032720753,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5632148184982596,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":30.306275749303918,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6645132295938431,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":17.273127573345107,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48947694212318166,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":17.273127573345107,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47424879807692305,"acs":0,"articleLive":2,"columnArticles":692,"formTitle":"[572]另一棵树的子树","frequency":52.872977145580855,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6581598388179987,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":12.654998602494846,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6477460597376833,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6849046395238739,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[575]分糖果","frequency":30.306275749303918,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46953836885307626,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[576]出界的路径数","frequency":26.419125399521302,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7067211857909532,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":17.273127573345107,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4982337916417586,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[578]查询回答率最高的问题","frequency":5.816580199173658,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41355383369954896,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[579]查询员工的累计薪水","frequency":17.91091739569925,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.525650515287821,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[580]统计各专业学生人数","frequency":17.91091739569925,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40398469062300657,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[581]最短无序连续子数组","frequency":32.51649540754487,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40290494223670964,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5822140778268837,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[583]两个字符串的删除操作","frequency":39.357311728361815,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7728321593393247,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5941010162756934,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7496633752244165,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":24.795313995995212,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37940275650842264,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":12.654998602494846,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43121019108280256,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.925303136684683,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7448552858561746,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[589]N 叉树的前序遍历","frequency":39.67013482103618,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7596600466996409,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[590]N 叉树的后序遍历","frequency":16.65964708448798,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33964870732188673,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5212061779848002,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4410387873383861,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.795313995995212,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.515462191128312,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[594]最长和谐子序列","frequency":4.751211694844501,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7962815916327791,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":42.65056770810797,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4203102656324479,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":23.536328348019065,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4413764395726377,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":17.273127573345107,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5169328426241685,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[598]范围求和 II","frequency":17.273127573345107,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5224081408349283,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[599]两个列表的最小索引总和","frequency":17.91091739569925,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.34305090716927955,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[600]不含连续1的非负整数","frequency":16.068858894455616,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4967782440604038,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[601]体育馆的人流量","frequency":54.60257617346307,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6284972357178757,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.273127573345107,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6734823177053335,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":26.152530337287494,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37305950840879687,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.383649960770506,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3349878385883825,"acs":0,"articleLive":2,"columnArticles":1217,"formTitle":"[605]种花问题","frequency":56.00613762691624,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5677135054617676,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[606]根据二叉树创建字符串","frequency":23.536328348019065,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6645454009781392,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.816580199173658,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.658730893932376,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4822432786380094,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[609]在系统中查找重复文件","frequency":6.975954926003741,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6675158358578904,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.816580199173658,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319515454013406,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[611]有效三角形的个数","frequency":51.09198927901573,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6689742589703588,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":5.816580199173658,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8166754142610783,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.816580199173658,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3465647448885614,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":17.273127573345107,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42368942067659465,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[615]平均工资：部门与公司比较","frequency":7.595475941432444,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46045801526717556,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.657156582374384,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7883119848493667,"acs":0,"articleLive":2,"columnArticles":1149,"formTitle":"[617]合并二叉树","frequency":63.65894699420389,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6199913207001302,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":30.986480824922612,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4656744022193844,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.816580199173658,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7725040775291467,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[620]有趣的电影","frequency":36.93352017077563,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5684964309334306,"acs":0,"articleLive":2,"columnArticles":481,"formTitle":"[621]任务调度器","frequency":63.828942247115336,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43632657364777,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[622]设计循环队列","frequency":52.872977145580855,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5452530666941552,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[623]在二叉树中增加一行","frequency":5.272967892547079,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41531780497433873,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.339974743931528,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6828817733990148,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[626]换座位","frequency":43.306439180282574,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.80664189229045,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[627]变更性别","frequency":29.01802307674582,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5251319003090043,"acs":0,"articleLive":2,"columnArticles":738,"formTitle":"[628]三个数的最大乘积","frequency":33.350681095761885,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40120740816535355,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[629]K个逆序对数组","frequency":26.152530337287494,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3650101357577247,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[630]课程表 III","frequency":7.595475941432444,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28311759845772516,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5964521851314304,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[632]最小区间","frequency":17.273127573345107,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39983912357320534,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[633]平方数之和","frequency":61.87776096903607,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43839256061109266,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5550765571577226,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5476609215617305,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":17.273127573345107,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6892635229516882,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[637]二叉树的层平均值","frequency":22.363194938799964,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.594068482070639,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[638]大礼包","frequency":17.91091739569925,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30995834911018555,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[639]解码方法 II","frequency":25.46076735947459,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42383137716768876,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[640]求解方程","frequency":25.46076735947459,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5334025434726187,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[641]设计循环双端队列","frequency":27.815933631837726,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49092872570194385,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[642]设计搜索自动补全系统","frequency":10.394430808706504,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45202439562054525,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[643]子数组最大平均数 I","frequency":38.25243343335573,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3990437660904744,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4357338909946412,"acs":0,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":43.306439180282574,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.574362046896702,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":16.068858894455616,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.655808805258759,"acs":0,"articleLive":2,"columnArticles":872,"formTitle":"[647]回文子串","frequency":61.0756216755754,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5813327934285879,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[648]单词替换","frequency":5.272967892547079,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48125451218078946,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[649]Dota2 参议院","frequency":5.272967892547079,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5347526612398247,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[650]只有两个键的键盘","frequency":17.273127573345107,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5791767554479419,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5706259426847662,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[652]寻找重复的子树","frequency":53.93621769105662,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5945030061685016,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8099762470308789,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[654]最大二叉树","frequency":43.75639837178183,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5955217079997396,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[655]输出二叉树","frequency":17.273127573345107,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30681385610963074,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831753439778459,"acs":0,"articleLive":2,"columnArticles":610,"formTitle":"[657]机器人能否返回原点","frequency":6.383649960770506,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45249320036264734,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[658]找到 K 个最接近的元素","frequency":35.34653088042582,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418020507033484,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.647117296222664,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":15.499300309096109,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5597730933538764,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":5.816580199173658,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40528519099947674,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[662]二叉树最大宽度","frequency":56.65266569831488,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4644246803779878,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6556225504974375,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":56.00613762691624,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.26997759522031367,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[665]非递减数列","frequency":48.4731084069204,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6197183098591549,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6237862129845116,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":16.068858894455616,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076362508721607,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":34.657156582374384,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6665229828755045,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[669]修剪二叉搜索树","frequency":17.273127573345107,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4493118971061093,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[670]最大交换","frequency":63.453098426948785,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48673399042313353,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[671]二叉树中第二小的节点","frequency":50.67998311135917,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.551993620414673,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.272967892547079,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.38994973463255733,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[673]最长递增子序列的个数","frequency":51.10920062904562,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49117279713748835,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[674]最长连续递增序列","frequency":36.30714639136253,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3996269192136605,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5865367262227035,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6153712473389235,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35104735354474,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[678]有效的括号字符串","frequency":73.69039366949194,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5411246964967048,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[679]24 点游戏","frequency":68.77667858046831,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.40149193119518867,"acs":0,"articleLive":2,"columnArticles":788,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":58.406590719998796,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.499489900020404,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6954469695789655,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[682]棒球比赛","frequency":29.650663148664048,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.42751235584843494,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6663052854911287,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[684]冗余连接","frequency":30.306275749303918,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43394090091690163,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":30.986480824922612,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35462792615618854,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":6.383649960770506,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.43952820021554306,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[687]最长同值路径","frequency":50.39893660451029,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5109556494192186,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[688]“马”在棋盘上的概率","frequency":17.273127573345107,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4854889589905363,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.06233332023997,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6464019851116626,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[690]员工的重要性","frequency":66.30783659967881,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.490065264684554,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.975954926003741,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5807414290692375,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[692]前K个高频单词","frequency":64.2893780556392,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6092625682136475,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":5.816580199173658,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5293539325842697,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[694]不同岛屿的数量","frequency":5.816580199173658,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6626784500339905,"acs":0,"articleLive":2,"columnArticles":1173,"formTitle":"[695]岛屿的最大面积","frequency":67.84381886306538,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6304176910309368,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[696]计数二进制子串","frequency":16.65964708448798,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6057473294720304,"acs":0,"articleLive":2,"columnArticles":825,"formTitle":"[697]数组的度","frequency":33.992413384380356,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44093256651297674,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":58.72793424485767,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47463441054341937,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7587267228386757,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[700]二叉搜索树中的搜索","frequency":27.24394307507047,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7239161701253339,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[701]二叉搜索树中的插入操作","frequency":29.394935727273353,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7390590809628009,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5119881216998621,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":32.73049390930255,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5549356949756905,"acs":0,"articleLive":2,"columnArticles":1027,"formTitle":"[704]二分查找","frequency":83.9702476433624,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6470647824545408,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[705]设计哈希集合","frequency":53.785561845039695,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6445281945530825,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[706]设计哈希映射","frequency":44.37309794928711,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3177359942822585,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[707]设计链表","frequency":59.965774115028836,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33550913838120106,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":7.595475941432444,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7597212513107305,"acs":0,"articleLive":2,"columnArticles":496,"formTitle":"[709]转换成小写字母","frequency":5.816580199173658,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35001469723691947,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[710]黑名单中的随机数","frequency":25.46076735947459,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5735912531539108,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6717549968992987,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":37.581460544876904,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4042677638611565,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[713]乘积小于K的子数组","frequency":39.67013482103618,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7173483280897839,"acs":0,"articleLive":2,"columnArticles":633,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.12405677547555,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.403411941796287,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":19.266803924827244,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4589978651262087,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":5.816580199173658,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5103718715502612,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":17.273127573345107,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5642617801804931,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[718]最长重复子数组","frequency":68.90965888874032,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36690082464330903,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":17.273127573345107,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4860421915158918,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[720]词典中最长的单词","frequency":3.767612989647234,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46948692772387624,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[721]账户合并","frequency":46.350239479460214,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.321500469735606,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":33.992413384380356,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7262044653349001,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4567254214829925,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[724]寻找数组的中心下标","frequency":30.986480824922612,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5626994984040128,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":24.15437409534985,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5545600497177482,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[726]原子的数量","frequency":50.39893660451029,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4123422159887798,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":30.986480824922612,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7590839625008554,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5068642852264189,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[729]我的日程安排表 I","frequency":24.795313995995212,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4880174291938998,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":45.10278666803574,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5091674589162026,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":5.816580199173658,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6125145744267392,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[732]我的日程安排表 III","frequency":7.595475941432444,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.580644840579422,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[733]图像渲染","frequency":39.67013482103618,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4780548628428928,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4109826446485603,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":30.306275749303918,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45878026356114004,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4614127702362997,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.502127929069031,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[738]单调递增的数字","frequency":30.986480824922612,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6776246602657781,"acs":0,"articleLive":2,"columnArticles":1432,"formTitle":"[739]每日温度","frequency":87.39493387605005,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6307052784287468,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[740]删除并获得点数","frequency":62.1764543265684,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3653514652365447,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":27.623219448883557,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49224021592442646,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5167235891134611,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[743]网络延迟时间","frequency":28.22296667439876,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45890786815958157,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":25.46076735947459,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39139847019771973,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5802548529236632,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[746]使用最小花费爬楼梯","frequency":50.16775180536778,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41483275878132864,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.816580199173658,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.598481442629502,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5051916932907349,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":19.266803924827244,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7237145049884881,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":25.12486867025721,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083487940630798,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5318413902003062,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[752]打开转盘锁","frequency":40.64062939594354,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5889335630863488,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":19.266803924827244,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4277325355935959,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":17.273127573345107,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5010012014417301,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5739198334200937,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":6.975954926003741,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41623916504510877,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":10.394430808706504,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4587732192970734,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":14.418681666086815,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6575550493545937,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":7.595475941432444,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8384699453551913,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5918486171761281,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":11.147953406635953,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6980486823576745,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7628592702903947,"acs":0,"articleLive":2,"columnArticles":931,"formTitle":"[763]划分字母区间","frequency":66.07337134179214,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49106034268686366,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6656655482296628,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[765]情侣牵手","frequency":57.32080471039905,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081449737385351,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47763090380433454,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[767]重构字符串","frequency":43.497997772821385,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.49989409023511966,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":26.152530337287494,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5897266201700351,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[769]最多能完成排序的块","frequency":5.816580199173658,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5516739446870451,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8513816238665154,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[771]宝石与石头","frequency":45.01006165833033,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4888137356919875,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":28.406889968692177,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7142722027806677,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":51.84595095935196,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.594847775175644,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4608027006751688,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5708622398414271,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3240166865315852,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":17.273127573345107,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5981325521786891,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.975954926003741,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4358269289525018,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.657156582374384,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28430377410722524,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":19.989130813114254,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6215172125768152,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[781]森林中的兔子","frequency":91.11500586647128,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4211800302571861,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":31.934810196119663,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958138076407157,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":34.657156582374384,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6842140932888294,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[784]字母大小写全排列","frequency":23.536328348019065,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5112018176534305,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[785]判断二分图","frequency":42.0162849129722,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4613668388914984,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3927361537855511,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[787]K 站中转内最便宜的航班","frequency":33.30568399455506,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6068147653248706,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[788]旋转数字","frequency":18.57481039353011,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.69254406699534,"acs":0,"articleLive":2,"columnArticles":288,"formTitle":"[789]逃脱阻碍者","frequency":21.649557551711517,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4477234401349072,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948991244765893,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[791]自定义字符串排序","frequency":35.34653088042582,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4503080194079485,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.499300309096109,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3949160990197707,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.272967892547079,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34077837423312884,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.383649960770506,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5346499610674594,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5238151630705099,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[796]旋转字符串","frequency":44.68896659205848,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7955853144132522,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[797]所有可能的路径","frequency":25.961148298947624,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.45739579490962745,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4071156078951733,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":51.84595095935196,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7048593350383632,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4178106936416185,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":7.595475941432444,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5770889948879725,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[802]找到最终的安全状态","frequency":25.46076735947459,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48325339728217426,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7695967152924456,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[804]唯一摩尔斯密码词","frequency":24.795313995995212,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2895043053292995,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":6.975954926003741,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6580891719745223,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[806]写字符串需要的行数","frequency":17.273127573345107,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8441647718259214,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[807]保持城市天际线","frequency":5.816580199173658,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47874140069922183,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":27.623219448883557,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.419601149838304,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[809]情感丰富的文字","frequency":17.91091739569925,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366834622998021,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":41.31612403962692,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7030258438333487,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[811]子域名访问计数","frequency":16.65964708448798,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6290829905637552,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5469787516600265,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.975954926003741,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[814]二叉树剪枝","frequency":5.816580199173658,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43482305974693825,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[815]公交路线","frequency":84.8261702837151,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5112309074573226,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.925303136684683,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914669783752192,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4292886004652871,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.420695915279879,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":26.872602632285826,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5056227758007118,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":39.67013482103618,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.691972693032015,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[821]字符的最短距离","frequency":30.306275749303918,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5023032983231989,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.43027450980392157,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":10.394430808706504,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6146357964368939,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.816580199173658,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3897893030794165,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[825]适龄的朋友","frequency":5.816580199173658,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3721242133498401,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.816580199173658,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3929237389433421,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[827]最大人工岛","frequency":30.986480824922612,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4887412927263891,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3608622372039386,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[829]连续整数求和","frequency":30.306275749303918,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431436714873852,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4033622863547212,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955298557200386,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[832]翻转图像","frequency":47.12859509650747,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42520438337102107,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.816580199173658,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292216971606285,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":19.266803924827244,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5729714760454168,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4774816892628954,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":17.91091739569925,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.396900826446281,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":17.273127573345107,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5011445026951192,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":4.751211694844501,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5743400146663408,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3587485797760104,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6566238478132967,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[841]钥匙和房间","frequency":17.273127573345107,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4895794925818629,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.65056770810797,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3746630727762803,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":8.244428887054285,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5159946777237986,"acs":0,"articleLive":2,"columnArticles":931,"formTitle":"[844]比较含退格的字符串","frequency":28.406889968692177,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4203169749318241,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[845]数组中的最长山脉","frequency":37.581460544876904,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5107878491534747,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6835076367466707,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":34.211361049427026,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44615143439410565,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4257296236749598,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":7.595475941432444,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44342567303940694,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":27.623219448883557,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47687419089090266,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":6.383649960770506,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7154732517467268,"acs":0,"articleLive":2,"columnArticles":705,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.41664818227118,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3815134023879181,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":36.80656450403604,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3611252762196158,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":7.595475941432444,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40880443984573417,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":17.273127573345107,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.62518319008199,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":43.98536534237808,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46455043506284244,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.623219448883557,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5570497147514263,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":26.152530337287494,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30156210100920383,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[859]亲密字符串","frequency":17.273127573345107,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5868629176987588,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[860]柠檬水找零","frequency":33.992413384380356,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.809071072319202,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[861]翻转矩阵后的得分","frequency":5.816580199173658,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.1879513956666016,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":47.78931912217114,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6034654345121735,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":56.00613762691624,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45306830730399117,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6538520097442144,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22345531810816593,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":17.91091739569925,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709278651557798,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[867]转置矩阵","frequency":47.78931912217114,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.624132930987185,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5503711558854719,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.816580199173658,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4237570081941963,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.33927211816659053,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":40.42066119307645,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521026044741849,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":54.69313368362063,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5092107127674649,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":30.306275749303918,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4134497197975042,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[874]模拟行走机器人","frequency":38.25243343335573,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47757560373374564,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.87061400840026,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7064159177100109,"acs":0,"articleLive":2,"columnArticles":1526,"formTitle":"[876]链表的中间结点","frequency":45.36189664564672,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567567567567568,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[877]石子游戏","frequency":61.87776096903607,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.27938850817079597,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5560247004802871,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":73.03674183370089,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2520627240917534,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":7.595475941432444,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.538545613523754,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[881]救生艇","frequency":43.75639837178183,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4833682948756368,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6857720396452791,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6607437002768723,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[884]两句话中的不常见单词","frequency":5.272967892547079,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.689401066164942,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[885]螺旋矩阵 III","frequency":35.34653088042582,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4228580461587101,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2918078896577696,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[887]鸡蛋掉落","frequency":68.67159331485271,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6395960320305963,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[888]公平的糖果棒交换","frequency":5.272967892547079,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6798594847775176,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":47.78931912217114,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7257326782991699,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3264230077890953,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387688252282286,"acs":0,"articleLive":2,"columnArticles":676,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.72372638614199,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":6.975954926003741,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7740220048899755,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5403826616999662,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":24.795313995995212,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867925475819816,"acs":0,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":40.64062939594354,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7454981405363085,"acs":0,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":59.24912292451731,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33433812211390457,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.46076735947459,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5349683331087455,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":6.975954926003741,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49290998766954375,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.54116237635928,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32560287326834275,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.383649960770506,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5304686052972772,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":14.418681666086815,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4526795311460306,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[904]水果成篮","frequency":34.657156582374384,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.701507362983933,"acs":0,"articleLive":2,"columnArticles":582,"formTitle":"[905]按奇偶排序数组","frequency":30.306275749303918,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2722752845741201,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":40.116899132360466,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31518352571140323,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":34.657156582374384,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6981642780303293,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":5.816580199173658,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.46144971011566527,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":42.0162849129722,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31735931596738914,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42641509433962266,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5661407716859391,"acs":0,"articleLive":2,"columnArticles":989,"formTitle":"[912]排序数组","frequency":84.76963661370517,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4025714919086677,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":8.925303136684683,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888509523847779,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[914]卡牌分组","frequency":17.273127573345107,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.46807172066687636,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":16.068858894455616,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4390711546655305,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5695512372431147,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[917]仅仅反转字母","frequency":36.06233332023997,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35846778619251457,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[918]环形子数组的最大和","frequency":30.306275749303918,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6259282567652612,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48002159827213825,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7351736745886654,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[921]使括号有效的最少添加","frequency":6.975954926003741,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.714378842996491,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[922]按奇偶排序数组 II","frequency":17.273127573345107,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3375742629750028,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.91091739569925,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3592763988220446,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38825314633898333,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5157964748919188,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.91091739569925,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3382486617513383,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":38.38953154242657,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42113564668769715,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6424026994307498,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5450714698835,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":54.49859596535854,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.660039318965837,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[931]下降路径最小和","frequency":23.536328348019065,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6264471922501378,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[932]漂亮数组","frequency":17.273127573345107,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.723558706845615,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[933]最近的请求次数","frequency":34.657156582374384,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47508217697279886,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[934]最短的桥","frequency":44.68896659205848,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4744283752120869,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3783510369246333,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.588059854990487,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.65964708448798,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8182036606399684,"acs":0,"articleLive":2,"columnArticles":782,"formTitle":"[938]二叉搜索树的范围和","frequency":49.18158338312115,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45016698892599755,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41130549285176826,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":5.816580199173658,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925432533737953,"acs":0,"articleLive":2,"columnArticles":603,"formTitle":"[941]有效的山脉数组","frequency":5.272967892547079,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7291265999071557,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47406225059856344,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6902085612918201,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4869055392694889,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":30.306275749303918,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6215886239586326,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[946]验证栈序列","frequency":49.7133615916018,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6123956634366305,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39114719127755393,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3690991073893439,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":34.657156582374384,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.77451781627983,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.273127573345107,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.66203296012077,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":29.650663148664048,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34808153477218223,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5525707319123891,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[953]验证外星语词典","frequency":24.795313995995212,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2987740805604203,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":30.306275749303918,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3270732221987761,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":6.975954926003741,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4350605652759085,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":25.46076735947459,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35965372507869886,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[957]N 天后的牢房","frequency":26.152530337287494,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5372740150296511,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[958]二叉树的完全性检验","frequency":33.992413384380356,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7440432797452327,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.46076735947459,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5525707683419988,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":8.925303136684683,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6767693999014367,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[961]重复 N 次的元素","frequency":17.273127573345107,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.440536013400335,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[962]最大宽度坡","frequency":6.383649960770506,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5010154346060114,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.42592029205962884,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":16.65964708448798,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.683879552722512,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[965]单值二叉树","frequency":5.816580199173658,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40224294014322387,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":8.925303136684683,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.45821343675716253,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4966557980101998,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[968]监控二叉树","frequency":36.93352017077563,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6519933925621679,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":5.816580199173658,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41442234123947974,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4423619508262797,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":8.244428887054285,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4111809460800529,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":16.65964708448798,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6385906829134506,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[973]最接近原点的 K 个点","frequency":5.272967892547079,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4656132743018138,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":56.00613762691624,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4438783156001798,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":7.595475941432444,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5970697632223533,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[976]三角形的最大周长","frequency":24.795313995995212,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7174142377119638,"acs":0,"articleLive":2,"columnArticles":1156,"formTitle":"[977]有序数组的平方","frequency":48.24251921894897,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47350455859461865,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[978]最长湍流子数组","frequency":16.65964708448798,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7120751108406502,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":17.91091739569925,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7328697512703931,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[980]不同路径 III","frequency":31.693075170713335,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.535691251967082,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":53.611227816505455,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5418795823150411,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6331430860118153,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":47.12859509650747,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41602853745541024,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5992075358851675,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":5.816580199173658,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6763154704170709,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[986]区间列表的交集","frequency":45.270814807497146,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5321096577335194,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":29.950304771934544,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49591756292584044,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4728439244191437,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":16.65964708448798,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.4989261703187251,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[990]等式方程的可满足性","frequency":5.816580199173658,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5173952919596454,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":17.91091739569925,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45127965226205097,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":18.57481039353011,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5573713762655861,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.10920062904562,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5094356982212227,"acs":0,"articleLive":2,"columnArticles":1343,"formTitle":"[994]腐烂的橘子","frequency":38.25243343335573,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402688844103166,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":26.872602632285826,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49606111243733586,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":21.533487913731122,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5124382618152159,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[997]找到小镇的法官","frequency":15.499300309096109,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147965474722564,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.691424108065887,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.816580199173658,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.407015857760692,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":31.693075170713335,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2913068508923431,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":14.418681666086815,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7378161793138392,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[1002]查找常用字符","frequency":39.98818061847047,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5760753471210797,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.598647864112216,"acs":0,"articleLive":2,"columnArticles":681,"formTitle":"[1004]最大连续1的个数 III","frequency":51.78829333312404,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5373438753294374,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":22.363194938799964,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6277524244152881,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":51.84595095935196,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4643127746628277,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7260188367629336,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.64062939594354,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5927988860155162,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":5.816580199173658,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.44981301421091996,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6272477804681195,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":68.35310847994461,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.32966786355475763,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":21.533487913731122,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39831745510766386,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":35.34653088042582,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5460991802512234,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[1014]最佳观光组合","frequency":14.949643966301696,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35384153661464585,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":18.57481039353011,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5835638543107423,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5616527845827209,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5166591518545766,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5973193295270662,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.816580199173658,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.536829808165273,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.795313995995212,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7835503826618875,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[1021]删除最外层的括号","frequency":30.306275749303918,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7021748779405238,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.816580199173658,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5648101689245694,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.383649960770506,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5599834670891743,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1024]视频拼接","frequency":16.65964708448798,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095777944025627,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[1025]除数博弈","frequency":42.0162849129722,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6683786785119378,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43291008922443375,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1027]最长等差数列","frequency":31.693075170713335,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319379788130934,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[1028]从先序遍历还原二叉树","frequency":25.46076735947459,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6529310275648998,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7115173220807772,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":6.383649960770506,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5665894967710491,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.383649960770506,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39490550534100244,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3894501371049213,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.383649960770506,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4322007958371595,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6280708970571739,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1035]不相交的线","frequency":61.522007806834225,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2997126436781609,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":6.383649960770506,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4385224524633695,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7938103815293925,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":5.816580199173658,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.552917145410443,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5224123879380603,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4812152649129307,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.795313995995212,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5272701038861101,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":15.499300309096109,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6905430711610487,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20894117647058824,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":54.60257617346307,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6441547861507129,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1045]买下所有产品的客户","frequency":5.816580199173658,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6594529174658201,"acs":0,"articleLive":2,"columnArticles":896,"formTitle":"[1046]最后一块石头的重量","frequency":29.650663148664048,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259850482140923,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":76.8610534190191,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4514090607960047,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1048]最长字符串链","frequency":31.693075170713335,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6424258081183195,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.965774115028836,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7571756601607348,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.816580199173658,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7520371376364265,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1051]高度检查器","frequency":5.816580199173658,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5809460112213428,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1052]爱生气的书店老板","frequency":24.15437409534985,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.459245790181042,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":17.273127573345107,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3757377688893225,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":17.273127573345107,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5859054903031958,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.406962183821688,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4614165742354619,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3381731784582893,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3594257391898821,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5295873345445108,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":30.306275749303918,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5991810737033667,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5363651563283732,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6974789915966386,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6509907898409154,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5384791571232249,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4723507917174178,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4197662061636557,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8641183035714286,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8201128703558551,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.816580199173658,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4832415212052831,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1070]产品销售分析 III","frequency":5.816580199173658,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865368099213302,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":6.383649960770506,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5781758957654723,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":9.64090821077706,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33764367816091956,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":11.147953406635953,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.670005155018779,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":47.0565400440941,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6959686888454012,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4970050523464764,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7214541730670763,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6217469583719788,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7351421188630491,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1079]活字印刷","frequency":5.272967892547079,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.489660976196201,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5709938731033348,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":42.0162849129722,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7595705608136742,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1082]销售分析 I ","frequency":6.975954926003741,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5275650016182976,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.91091739569925,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5382176234979973,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.773655323819978,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6894574944071589,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5305997552019583,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44508670520231214,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5854585427135678,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":5.816580199173658,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5418093607305936,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37750943396226416,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":39.98818061847047,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4881921016074618,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":19.989130813114254,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38483115762218145,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":10.394430808706504,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6176866600614791,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1094]拼车","frequency":23.536328348019065,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3734313303882091,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5553639185926181,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5183145139080143,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":32.42805914027332,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4729149348850097,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":17.273127573345107,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5796282341120321,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6990881458966566,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6671490593342981,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3657456074485658,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6366218208960658,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":17.273127573345107,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7609578904883627,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":41.46952335705894,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.555752408371166,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5733990147783251,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1106]解析布尔表达式","frequency":19.266803924827244,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4100080171031534,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":6.383649960770506,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391116751269035,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5089052358286457,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1109]航班预订统计","frequency":39.98818061847047,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6272065839694656,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":18.57481039353011,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7722058871045914,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.795313995995212,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6422941016580592,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":17.273127573345107,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5419808523256799,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6525724266911324,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[1114]按序打印","frequency":82.62241002796286,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5609079479610801,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1115]交替打印FooBar","frequency":57.411599801138195,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5153638684197852,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[1116]打印零与奇偶数","frequency":59.24912292451731,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5213014390305478,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1117]H2O 生成","frequency":43.75639837178183,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6411865373645179,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662723143551283,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6039461020211742,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":8.244428887054285,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5717367853290184,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070651931732097,"acs":0,"articleLive":2,"columnArticles":858,"formTitle":"[1122]数组的相对排序","frequency":51.474145069492515,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7046570856830999,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3150975622379794,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":7.595475941432444,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49065184436584136,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6948791786653311,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":5.816580199173658,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4168277430358158,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448028141837234,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.65964708448798,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3785285759393748,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":6.975954926003741,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6270509977827051,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45260265608304073,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3940090048699807,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":17.273127573345107,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6444901691815272,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7738364779874214,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5351519589893812,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":24.795313995995212,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5668088928812037,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6059070207873022,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[1137]第 N 个泰波那契数","frequency":15.82224311953998,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4312251535959523,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1138]字母板上的路径","frequency":6.383649960770506,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47619047619047616,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.57481039353011,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6545399879735417,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.975954926003741,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5117614879649891,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":5.816580199173658,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3716717465064121,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6324999268452757,"acs":0,"articleLive":2,"columnArticles":1043,"formTitle":"[1143]最长公共子序列","frequency":84.48463620002956,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4419347778507332,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.15437409534985,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46887060365542854,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":36.80656450403604,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2860337613619968,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5556570732450129,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7180369787568843,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.444205238607822,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6071718538565629,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.57481039353011,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4837174348697395,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":16.65964708448798,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3842689882918043,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":14.418681666086815,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3715761113605748,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5653004443337071,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1154]一年中的第几天","frequency":5.272967892547079,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4793518859487611,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":6.383649960770506,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4340639269406393,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31390036980639546,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":8.244428887054285,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5506287944492628,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49305161656267726,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1159]市场分析 II","frequency":19.266803924827244,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6876893872401637,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[1160]拼写单词","frequency":17.273127573345107,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6335692995529061,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1161]最大层内元素和","frequency":6.383649960770506,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4689991309933124,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[1162]地图分析","frequency":32.42805914027332,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2672759488948988,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":7.595475941432444,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6166003277920862,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":18.57481039353011,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8380694632386108,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4824369914665608,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4210219545366233,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5700301204819277,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":11.147953406635953,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.32242460141171825,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1169]查询无效交易","frequency":18.57481039353011,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6172630228615934,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.975954926003741,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4720241463874741,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":5.816580199173658,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2713624562591715,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7568867074025843,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6195503153276666,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48809020436927414,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4452866446033949,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":7.595475941432444,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2629795846532911,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":6.975954926003741,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46209106155039925,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6340787650900456,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":53.29146781493168,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7735414534288638,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":8.244428887054285,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.36959837315709204,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.38417960553923625,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6009523809523809,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5853658536585366,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1184]公交站间的距离","frequency":17.273127573345107,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.610295765180372,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":16.65964708448798,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39196477710511834,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":27.623219448883557,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4373604564624163,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6932707355242567,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6443566627377274,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[1189]“气球” 的最大数量","frequency":5.272967892547079,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6509611874923956,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1190]反转每对括号间的子串","frequency":95.16228603991982,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26801232240562783,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4998098618329319,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6101454416459737,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.816580199173658,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5137242669993761,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.383649960770506,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6356416464891042,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1195]交替打印字符串","frequency":30.986480824922612,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6905699481865285,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3662282493260355,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.57481039353011,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7470553004591735,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43317132442284323,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6860404980705732,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1200]最小绝对差","frequency":24.15437409534985,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.2470573237581269,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5028247512887334,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":6.975954926003741,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6242717436537661,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1203]项目管理","frequency":9.64090821077706,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7276518837758932,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":18.57481039353011,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46756109247724004,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1205]每月交易II","frequency":25.46076735947459,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6187248256213773,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1206]设计跳表","frequency":18.57481039353011,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7302959472662288,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49631342437066445,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1208]尽可能使字符串相等","frequency":24.795313995995212,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.532926941904498,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":36.06233332023997,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44823364812871636,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6584942084942085,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":17.91091739569925,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5148806279297939,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.816580199173658,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7722972972972973,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1213]三个有序数组的交集","frequency":19.266803924827244,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6322492163009404,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":8.925303136684683,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40878597706124215,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":14.418681666086815,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5329479768786127,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6945961956164023,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":35.34653088042582,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.421581522596938,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6304902546283728,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":34.657156582374384,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.526013181881924,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8044111527257595,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[1221]分割平衡字符串","frequency":16.65964708448798,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6721172480620154,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4736611702903838,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3250178699070765,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":26.152530337287494,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5443534022087638,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1225]报告系统状态的连续日期","frequency":20.742653411043698,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5999573287817367,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":54.49859596535854,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6619708678109827,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":4.751211694844501,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.538877863972578,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41315068493150686,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4873723804406233,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5554659136748689,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":21.533487913731122,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4692355325377167,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1232]缀点成线","frequency":16.65964708448798,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4814954682779456,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.975954926003741,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34133349293751497,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.272967892547079,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45083682008368203,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":40.42066119307645,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5596605092361457,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7115889574905968,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6555161719096145,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":7.595475941432444,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4907669943436146,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":41.31612403962692,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4947517157852241,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":33.19366859591099,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5967032967032967,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4631454473787939,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":19.266803924827244,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.539265898420828,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6216361679224973,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1244]力扣排行榜","frequency":8.925303136684683,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5065227170490328,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.975954926003741,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.479525321744944,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":15.499300309096109,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6148003309017072,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1247]交换字符使得字符串相同","frequency":26.152530337287494,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.55871190148665,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":24.795313995995212,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.571955820438515,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1249]移除无效的括号","frequency":36.93352017077563,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5604301075268817,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":19.989130813114254,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7714053284523084,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":5.816580199173658,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7494172988091706,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39373601789709173,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":19.266803924827244,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.599310134043575,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.751211694844501,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6766049531137293,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6628216503992902,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5644699140401146,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5643705463182898,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4753529848897696,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":13.408521200424293,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6032904004829945,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7287069299264421,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5263603283405264,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1262]可被三整除的最大和","frequency":43.306439180282574,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4170339826532063,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":11.9014760045654,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5728535353535353,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":6.975954926003741,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9194869967937299,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1265]逆序打印不可变链表","frequency":6.975954926003741,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236280786111655,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1266]访问所有点的最小时间","frequency":24.15437409534985,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6087512622012791,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5808504034761018,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1268]搜索推荐系统","frequency":6.383649960770506,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.491822602033299,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.0565400440941,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8043787318737561,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":4.751211694844501,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5048625792811839,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5177257525083612,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5405212424134238,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5984800506649778,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5401514634645562,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":17.273127573345107,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5010262077676034,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7241434390224423,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":24.795313995995212,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5954331532159666,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":59.47034254148584,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6214432989690721,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":21.533487913731122,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.505668016194332,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.65964708448798,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314855463372893,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[1281]整数的各位积和之差","frequency":24.795313995995212,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113259102397705,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[1282]用户分组","frequency":5.816580199173658,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4154899179872973,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.273127573345107,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588514225500527,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":19.266803924827244,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8120419885125767,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6444755244755245,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":17.273127573345107,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6055796250556748,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":17.273127573345107,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633990410229089,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1288]删除被覆盖区间","frequency":30.306275749303918,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6294362144303528,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8090516106041121,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5179778733866011,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46882710972199376,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.383649960770506,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35573432463044175,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1293]网格中的最短路径","frequency":56.00613762691624,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6601609657947686,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8095172745050949,"acs":0,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.816580199173658,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45241989218002304,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45944163552429107,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1297]子串的最大出现次数","frequency":26.872602632285826,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5948694245435636,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7854226483681479,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4675462571524077,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":5.816580199173658,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35814065510597304,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8163812489188722,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[1302]层数最深叶子节点的和","frequency":25.46076735947459,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8220388921626399,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7258352282665734,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.272967892547079,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7469104016477858,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.816580199173658,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5770204684532602,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":17.91091739569925,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3314211695040711,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7509030704394943,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":6.383649960770506,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552102716784518,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7123465647966801,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":52.43195378917464,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37646316674844044,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.975954926003741,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6661235573659199,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":33.992413384380356,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8310405473775507,"acs":0,"articleLive":2,"columnArticles":537,"formTitle":"[1313]解压缩编码列表","frequency":5.816580199173658,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7351911396927474,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1314]矩阵区域和","frequency":35.34653088042582,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096625866200375,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4377766847024102,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6141561024111359,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6491017964071857,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.43487054599369,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6176295536172396,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[1319]连通网络的操作次数","frequency":6.383649960770506,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5875276209182421,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6166741505762611,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5919581251487033,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.75550576184379,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.795313995995212,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.592003306126666,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.728262490678598,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.816580199173658,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4758120852252882,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":8.925303136684683,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6926064827216716,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4574030789070686,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1328]破坏回文串","frequency":17.273127573345107,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.771265025758443,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.383649960770506,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37658017298735863,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":17.91091739569925,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5354656632173095,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":5.272967892547079,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6833308122825593,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.816580199173658,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5424051266646641,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4882672310665317,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":51.10920062904562,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5820003515556337,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4229030637870417,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.706619728803457,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":14.074543789835978,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6400847891236021,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1338]数组大小减半","frequency":5.272967892547079,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39620763449957697,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":7.595475941432444,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5713512782361694,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4832009773976787,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202729277158691,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5424302961869192,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5935922530132893,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":6.975954926003741,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3676063759715453,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1345]跳跃游戏 IV","frequency":6.975954926003741,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43610853432282004,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7383250463098372,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30352140856342535,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":8.244428887054285,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5010948290382348,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":6.975954926003741,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8479991508332448,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.816580199173658,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546821350535844,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.272967892547079,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44105351170568563,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.975954926003741,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28266219825103417,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.49859596535854,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28542262147815434,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6623448786812373,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7318102444703143,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.65964708448798,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5275318206972883,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4852670349907919,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.816580199173658,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5447303921568627,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5036316631786286,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":34.657156582374384,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4015805814281682,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1361]验证二叉树","frequency":5.816580199173658,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5230926779313876,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36002487755578017,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":36.06233332023997,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6766544513903858,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.816580199173658,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8251202396909249,"acs":0,"articleLive":2,"columnArticles":1075,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.795313995995212,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.536258044263067,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":17.91091739569925,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41680362708982716,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1367]二叉树中的列表","frequency":16.65964708448798,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5183238209672575,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6068376068376068,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":6.975954926003741,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7906567793095439,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799464793443719,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.31612403962692,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5128422978890269,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":6.383649960770506,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39584609729199854,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":25.46076735947459,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7389307531100905,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.571068067112263,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5037546933667084,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":6.383649960770506,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3252392055962049,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8624325342035898,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8362068965517241,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274154481026285,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7322096150062307,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6892696004708037,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1382]将二叉搜索树变平衡","frequency":6.975954926003741,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32316719791364823,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.64090821077706,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5427553444180523,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7039276570245683,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1385]两个数组间的距离值","frequency":5.816580199173658,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3099590864363768,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":20.742653411043698,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6946234983885144,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.266803924827244,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5365522853655229,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":56.00613762691624,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307826191333574,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1389]按既定顺序创建目标数组","frequency":17.273127573345107,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3507769652650823,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3992310554384224,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":21.533487913731122,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.3992942603517671,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1392]最长快乐前缀","frequency":5.816580199173658,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8570786516853932,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6640851887705711,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7546624495582942,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.816580199173658,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4150331406007615,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1396]设计地铁系统","frequency":19.989130813114254,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.367003367003367,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7729241197514592,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6673333333333333,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6035843101893598,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.272967892547079,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41527472527472525,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":7.595475941432444,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7508114248620578,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":6.383649960770506,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6914547951629652,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.65964708448798,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4915443745632425,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.595475941432444,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5058325493885231,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1405]最长快乐字符串","frequency":17.91091739569925,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5682616596002423,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":5.816580199173658,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6677844311377246,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":16.65964708448798,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6139101338432122,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8050173363246992,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4767388601714323,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":8.925303136684683,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5495900747297395,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":81.41924648115274,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5499786416061512,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6915342851397547,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.65964708448798,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6021623447926345,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6846046859955066,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":5.816580199173658,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40778011414839294,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":25.12486867025721,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5191216076237829,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":5.816580199173658,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7333200045698618,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":50.67998311135917,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41801811574551173,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":26.152530337287494,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5926767676767677,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":24.15437409534985,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7494920174165457,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5405016775842786,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1422]分割字符串的最大得分","frequency":30.306275749303918,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5541816876824951,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1423]可获得的最大点数","frequency":16.65964708448798,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39578686493184634,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1424]对角线遍历 II","frequency":17.91091739569925,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43313373253493015,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.975954926003741,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.704225352112676,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6593333333333333,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5912531539108494,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5059495478343646,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.575812274368231,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462100556222053,"acs":0,"articleLive":2,"columnArticles":1022,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.816580199173658,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3921111609143882,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6412694902134247,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44714341235911387,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6215522771007056,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7831172701534793,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5889990557129368,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":5.816580199173658,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48195853155013013,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":33.992413384380356,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5616736662000311,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6954342984409799,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.646751696874767,"acs":0,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":7.595475941432444,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917395708628787,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":54.49859596535854,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.4104432757325319,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5240763802407638,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.857209086694483,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729274978731449,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6167277430480707,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.712828560219694,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":5.272967892547079,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276731505471983,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.06233332023997,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8020776751765345,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":16.068858894455616,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5214530280333832,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":7.595475941432444,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4972489683631362,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.595475941432444,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36243446546615,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40331871722121915,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":19.266803924827244,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6337110636667214,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5185293994208251,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.63623687664042,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4400449763071239,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5955655346618018,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7440562955516461,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.4998671037476743,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42512718425127183,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1462]课程表 IV","frequency":5.816580199173658,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.590293453724605,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":11.147953406635953,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7680915111378688,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1464]数组中两元素的最大乘积","frequency":5.816580199173658,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3075227887408595,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.48455156064796523,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1466]重新规划路线","frequency":18.57481039353011,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6115830115830115,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7145435791645178,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8031709203402939,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433464345873105,"acs":0,"articleLive":2,"columnArticles":719,"formTitle":"[1470]重新排列数组","frequency":42.0162849129722,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5411782386534415,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6167781257936172,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6752772399225488,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.966843126355094,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7191590638635462,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7240526315789474,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8651403043417563,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":18.57481039353011,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28989279296027765,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":19.989130813114254,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5708751139471285,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":28.406889968692177,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5761631612492033,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":8.244428887054285,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.5139165545087483,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1481]不同整数的最少数目","frequency":17.273127573345107,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5870115913103554,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":50.67998311135917,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30080760095011877,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8032608695652174,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6625732098998678,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586058561861466,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[1486]数组异或操作","frequency":48.4731084069204,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30738448844884486,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1487]保证文件名唯一","frequency":25.46076735947459,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.234710519162816,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":59.72403908962251,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6932280595201944,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8562450903377847,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6712262354122658,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6663076260232659,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5659973013731249,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.15437409534985,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.35848065814808333,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":28.406889968692177,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428150331613855,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5382762861242057,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[1496]判断路径是否相交","frequency":4.751211694844501,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39219868962364773,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.332336920419822,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":19.266803924827244,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37589073634204273,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.29314657328664334,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5916965818635868,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":24.15437409534985,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7177653761190559,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1502]判断能否形成等差数列","frequency":33.992413384380356,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.511252235032986,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.57481039353011,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.593376264949402,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1504]统计全 1 子矩形","frequency":33.992413384380356,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3578852236782648,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":35.701008661964565,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8401976935749588,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":30.986480824922612,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5899220845574148,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1507]转变日期格式","frequency":24.795313995995212,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.551604101985135,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":7.595475941432444,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5436848203939745,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5755550250656482,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1510]石子游戏 IV","frequency":29.650663148664048,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6818993216708319,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.383649960770506,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8485384252710986,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[1512]好数对的数目","frequency":5.272967892547079,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3783916255295312,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":6.383649960770506,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.3149568342170998,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3408235554571618,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":11.9014760045654,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5804020100502513,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.728290676416819,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6754901406859145,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":24.15437409534985,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2954170787998681,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3297341071669591,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3948012232415902,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":15.499300309096109,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.706081081081081,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5774094016576925,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4230057375532112,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.65964708448798,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6592496765847348,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.383649960770506,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6124539123310119,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5087559007156998,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.784175553292964,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1528]重新排列字符串","frequency":16.068858894455616,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.688685208596713,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1529]灯泡开关 IV","frequency":5.816580199173658,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5661372130272291,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":19.266803924827244,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3223983962092218,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.533487913731122,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6213032581453634,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":5.816580199173658,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6129032258064516,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7887024344126684,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1534]统计好三元组","frequency":5.816580199173658,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4524157108098714,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.595475941432444,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4381296539640823,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.365573216097396,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5978260869565217,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5374140207045092,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[1539]第 k 个缺失的正整数","frequency":58.01202073897047,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3152778708855668,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4570705007760804,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3791226384886327,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5483286347160693,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5431248358191529,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1544]整理字符串","frequency":24.15437409534985,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5525457166704606,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":18.57481039353011,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.40924501777888034,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5321276887244828,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":27.623219448883557,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.712742980561555,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6661769027328828,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":6.383649960770506,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6600613653796983,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.816580199173658,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8171897343267855,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.816580199173658,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5064617534055187,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":17.91091739569925,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29345345817924307,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":58.55717009029655,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7001499250374813,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4355650449900869,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5793805006286433,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1556]千位分隔数","frequency":45.66862015710981,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7622310245155764,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6210209349010611,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":9.64090821077706,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3660793933987511,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":11.147953406635953,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.573658269441402,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.975954926003741,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7795237435968434,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":17.273127573345107,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094708759448644,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":10.394430808706504,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3778829095209935,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":44.28378682593473,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5857284440039643,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7248289345063539,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.383649960770506,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44582821727182365,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.816580199173658,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3910812316015594,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":22.939711819021888,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4542794440380395,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47193396226415096,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9007832898172323,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7580529706513959,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.804986294217465,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1572]矩阵对角线元素的和","frequency":14.949643966301696,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.29542806223867296,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1573]分割字符串的方案数","frequency":6.383649960770506,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3258491652274036,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":35.34653088042582,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6016366612111292,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47626859142607175,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1576]替换所有的问号","frequency":6.383649960770506,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3235389505091782,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":10.394430808706504,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5793624531215531,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6198145058015445,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":23.235427499917648,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6302083333333334,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8122807017543859,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6712189452273718,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.383649960770506,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6853008263844744,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":26.58103923259217,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6665777682952848,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[1584]连接所有点的最小费用","frequency":6.383649960770506,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42944218692279273,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6274864376130199,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8248194014447885,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8021092777085927,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1588]所有奇数长度子数组的和","frequency":17.273127573345107,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2952420016406891,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.263758285802374,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":8.244428887054285,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5795763172189028,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44549876884271217,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5272108843537415,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.816580199173658,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31261624302541846,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":6.975954926003741,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46190716448032293,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7607508532423208,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6633663366336634,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6705472951597595,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.816580199173658,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4189084468061552,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.682800345721694,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.91091739569925,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4805813676435549,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7813664596273292,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8448789487214384,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1603]设计停车系统","frequency":61.522007806834225,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4143139305216684,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7346706177342147,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34087481146304677,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5483267511951777,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6392188993581865,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5114104002992892,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":5.816580199173658,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.26972520344380235,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6087735004476276,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7345132743362832,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7264595103578154,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8204802761841905,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.272967892547079,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49463405201585614,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27514542271418085,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":7.595475941432444,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6190825688073395,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5915492957746479,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6786304834160101,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.36782500775674837,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1620]网络信号最好的坐标","frequency":10.394430808706504,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43585780525502316,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14541287324123003,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1622]奇妙序列","frequency":19.266803924827244,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7830350576121599,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.816580199173658,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6278141096128248,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":17.273127573345107,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5395888846593072,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38335046248715315,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":8.244428887054285,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3791049581455248,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8419811320754716,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5225488891845151,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.769566606325205,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":6.383649960770506,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4923182802663806,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":26.152530337287494,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31622222222222224,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6587175410704822,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.975954926003741,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5216216216216216,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5444096133751306,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":7.595475941432444,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7073070269379685,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.816580199173658,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.806269592476489,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.710630440517014,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4007292011932383,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6635599121538379,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":5.816580199173658,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7697274031563845,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.25243343335573,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4534404007661706,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":17.91091739569925,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44976076555023925,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5404939689833429,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.57481039353011,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4111361079865017,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1645]","frequency":6.975954926003741,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5377029791586754,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[1646]获取生成数组中的最大值","frequency":21.089550957087763,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5123948317307693,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":30.306275749303918,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2773502843760455,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.989130813114254,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47441323585994616,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7952086553323029,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.383649960770506,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6835187057633973,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6604057854560065,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1652]拆炸弹","frequency":17.273127573345107,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5020624631703006,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.816580199173658,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2732961851693099,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1654]到家的最少跳跃次数","frequency":25.46076735947459,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3816809893104171,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7801469827140047,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":5.816580199173658,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46479489197935797,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.383649960770506,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.296150261667503,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4060031595576619,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":28.406889968692177,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7419354838709677,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.731852833941001,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.57481039353011,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8133671673556256,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.65964708448798,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5718261945260553,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.46076735947459,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5442578772802653,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.667152704135737,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.975954926003741,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6823899371069182,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6028194912657064,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4411723163841808,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7697642163661581,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1669]合并两个链表","frequency":17.91091739569925,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5286933683519369,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":6.383649960770506,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46410564225690276,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":11.9014760045654,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.850271598259968,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[1672]最富有客户的资产总量","frequency":5.816580199173658,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35093482776945745,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":6.383649960770506,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.35974045571148333,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":20.742653411043698,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4362866219555242,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7663656884875847,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":10.394430808706504,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.4013973405454136,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8299622900239972,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[1678]设计 Goal 解析器","frequency":5.816580199173658,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4945644080416977,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1679]K 和数对的最大数目","frequency":6.383649960770506,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4615180467091295,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.383649960770506,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38047138047138046,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":14.418681666086815,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5266055045871559,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8944273312797536,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8273403595784253,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1684]统计一致字符串的数目","frequency":24.15437409534985,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5943686006825939,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4693761814744801,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.975954926003741,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39893380719680144,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8040835150092236,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1688]比赛中的配对次数","frequency":16.65964708448798,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8692255224158244,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":23.536328348019065,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5107619990103909,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":6.383649960770506,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48436529302132947,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6485355648535565,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8056984566679858,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6358492208583616,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4535748180955394,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":5.816580199173658,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39965753424657535,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":24.15437409534985,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5248880039820807,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5435897435897435,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.799182422074604,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7187467793465938,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.816580199173658,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6108710106382979,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1701]平均等待时间","frequency":17.91091739569925,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747021239854947,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1702]修改后的最大二进制字符串","frequency":19.989130813114254,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889415481832543,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814804881319566,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34615384615384615,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1705]吃苹果的最大数目","frequency":17.91091739569925,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5850687066156679,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1706]球会落何处","frequency":17.91091739569925,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5033017513637669,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1707]与数组中元素的最大异或值","frequency":42.86672334936891,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7017543859649122,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7149972329828445,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6925106163942865,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1710]卡车上的最大单元数","frequency":24.795313995995212,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35930084082203,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1711]大餐计数","frequency":51.84595095935196,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26558118498417005,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4973901275937621,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":45.66862015710981,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.635593220338983,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7375249500998003,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":17.91091739569925,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6755632582322357,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4306930693069307,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4859081419624217,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3621853898096992,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693127917125185,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[1720]解码异或后的数组","frequency":57.32080471039905,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6494134330282325,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1721]交换链表中的节点","frequency":6.383649960770506,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5135553834237025,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5075701500571966,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.57516905930885,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5568760611205433,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7871385083713851,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.816580199173658,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.475355871886121,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5732253618194348,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":9.64090821077706,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3540558510638298,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6247116968698517,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.975954926003741,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5362473347547975,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47788915094339623,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7924595285430276,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1732]找到最高海拔","frequency":31.693075170713335,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45743473325766176,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":11.9014760045654,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233239641890485,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[1734]解码异或后的排列","frequency":55.292009333346314,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4836471754212091,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491744230524034,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.66862015710981,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30830318538780555,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":21.533487913731122,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6538972387277175,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":43.497997772821385,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47146222141692334,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7002724795640327,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":11.9014760045654,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8435597189695551,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7062478123906195,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.816580199173658,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974003466204506,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":40.64062939594354,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3630494292650173,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":56.74675836296726,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4839291078401923,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6032085561497326,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7054500918554807,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7498365182009736,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":24.795313995995212,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5293202675377197,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.795313995995212,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45844424726412303,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46872803935347856,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":22.363194938799964,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6864893062076161,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6277251706672539,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42066805845511485,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":6.975954926003741,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.3976564817561554,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.244428887054285,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8315508021390374,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9229734275142953,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6353699551569507,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.427549540840986,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.816580199173658,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5365293720459149,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4283267682822401,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":9.64090821077706,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6715927750410509,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6090712742980562,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":6.975954926003741,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4768327169893409,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5593663236975339,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":17.91091739569925,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37534549474847984,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.499300309096109,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7958515283842795,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7692141467982424,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":23.536328348019065,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.854920913884007,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.816580199173658,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36847905951506243,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":11.147953406635953,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3639753566796368,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5353728489483748,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8410894857018593,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":29.650663148664048,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5544374161395438,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":17.91091739569925,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47273146546754297,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":19.266803924827244,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4594222833562586,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":29.226444019218345,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.777942631058358,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":70.89172696450187,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5652173913043478,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6474576271186441,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.383649960770506,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6616636988043755,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5166753517457009,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":5.816580199173658,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28550074738415543,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7888293802601377,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42114650943863646,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":5.816580199173658,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.347370191768532,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3397294746775716,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541340782122905,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":58.15317283010526,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6861924686192469,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7123287671232876,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6515729757607014,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.816580199173658,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.809326880774307,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1791]找出星型图的中心节点","frequency":5.272967892547079,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136980798586005,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":35.34653088042582,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41188053823432885,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1793]好子数组的最大分数","frequency":19.266803924827244,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6887755102040817,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.791907514450867,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.46076735947459,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48657149770142755,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1796]字符串中第二大的数字","frequency":5.816580199173658,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5733218092768655,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1797]设计一个验证系统","frequency":17.91091739569925,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5189015691868759,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5111585944919278,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":8.925303136684683,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6831639416703491,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1800]最大升序子数组和","frequency":17.273127573345107,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37642045454545453,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2617700025726782,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4100359856057577,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.363194938799964,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5736677115987461,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":11.147953406635953,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.49484208134514884,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.272967892547079,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.663379355687048,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.152530337287494,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5839593693789017,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2659610027855153,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":13.408521200424293,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.637701804368471,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":26.152530337287494,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6617647058823529,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":33.992413384380356,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6611165523996082,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":5.816580199173658,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.794580970384373,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5204061117812626,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.46076735947459,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3414435508500458,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.975954926003741,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30067632850241544,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.754406218733164,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1816]截断句子","frequency":5.816580199173658,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6959573953038005,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":6.383649960770506,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3741759457267163,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.350239479460214,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36447989581637635,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.49700598802395207,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.898806893504198,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.46076735947459,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8128901636578371,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1822]数组元素积的符号","frequency":16.65964708448798,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7068583003761937,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1823]找出游戏的获胜者","frequency":17.273127573345107,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.662024873007532,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2871726586773191,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":13.408521200424293,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.45085470085470086,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7960352823497318,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8699375994127003,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.068858894455616,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6769094138543517,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48213239601640306,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7355623100303952,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8218258408477588,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.795313995995212,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6851784211278565,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":30.306275749303918,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3496780584447746,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.693075170713335,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5082132564841498,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":13.408521200424293,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.715261958997722,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.394430808706504,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7941790225151016,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43093410351903927,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":58.72793424485767,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5798288396061471,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38848622903292607,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":9.64090821077706,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5121234386480529,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":24.795313995995212,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7109375,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5141129032258065,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":6.383649960770506,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8037688442211055,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5801681029896798,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336624462771518,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.31612403962692,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36001917545541706,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":9.64090821077706,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6868456120312203,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3293975174084166,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.595475941432444,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6046883324453916,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":10.394430808706504,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.3988740617180984,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7064220183486238,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6476725521669342,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":8.244428887054285,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7940841865756542,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1854]人口最多的年份","frequency":24.795313995995212,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.691458375668902,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":24.15437409534985,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35587368421052634,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":19.989130813114254,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4495513241409499,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.656084656084656,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1858]包含所有前缀的最长单词","frequency":12.654998602494846,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.771916971916972,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7728945216680294,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1860]增长的内存泄露","frequency":5.816580199173658,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6169756097560976,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":5.816580199173658,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31046983758700697,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9220122852033279,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.31612403962692,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38609931696510985,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":8.925303136684683,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5169551574045956,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5946398659966499,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.533487913731122,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7642436149312377,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5459459459459459,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":17.91091739569925,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7994000260858224,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1869]哪种连续子字符串更长","frequency":24.15437409534985,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4611589068825911,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.975954926003741,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27596223674655046,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6236559139784946,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7992975413948821,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":34.657156582374384,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.875,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.732739420935412,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7301889357074894,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8194892546617816,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.49859596535854,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4277420692515032,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40494166094715167,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":8.925303136684683,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7730299667036626,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.816580199173658,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3517953102100635,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27657886385274516,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37191358024691357,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6949069539666993,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.657156582374384,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5292397660818714,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.572485704675412,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":17.91091739569925,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6400316455696202,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.975954926003741,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3142018779342723,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":8.244428887054285,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2749830508474576,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":21.533487913731122,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.6995073891625616,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5339805825242718,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.35615079365079366,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.975954926003741,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5917181467181467,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":44.37309794928711,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.42990654205607476,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5307152875175316,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5021645021645021,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.52828155862812,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.65964708448798,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30725340003126467,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.925303136684683,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6272357003718789,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.42492492492492495,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":26.152530337287494,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6568265682656826,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.45588235294117646,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6437428462418924,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2752957195132329,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5734124309019819,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4225252346378608,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":20.742653411043698,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6305506216696269,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6691729323308271,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3272497432250928,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":5.816580199173658,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6778943122226704,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5646785437645236,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":16.068858894455616,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.3001616254906488,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8462455303933254,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.272967892547079,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4394814710441031,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.273127573345107,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.38865876303385233,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5533636823469904,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":20.742653411043698,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2912912912912913,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4772727272727273,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.4011887072808321,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9403392918137311,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3428868525378566,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":17.91091739569925,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3620366598778004,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":6.383649960770506,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23583486545211432,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.46076735947459,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5135135135135135,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6964109318406322,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.306275749303918,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3457663451232583,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4108604016860898,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.816580199173658,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39276536864993083,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":32.42805914027332,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9390057944495273,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1929]数组串联","frequency":3.767612989647234,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4752511084969686,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.65964708448798,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5523423944476576,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":5.816580199173658,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3239573229873909,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":10.394430808706504,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5721003134796239,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7327935222672065,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7435521329910769,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44861758827448367,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2389465283320032,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.91091739569925,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.33532745591939545,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":17.91091739569925,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6601466992665037,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8307692307692308,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7725964306275187,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38886373924852874,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4016973125884017,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5648854961832062,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.975954926003741,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6619158104076898,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.272967892547079,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.302677670248768,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.273127573345107,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5373711340206185,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5194880744618965,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.244428887054285,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5384615384615384,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5482233502538071,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7411167512690355,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5412619235144832,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1952]三除数","frequency":0.7535225979294469,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31862745098039214,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48063074248820464,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":2.2605677937883404,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4943089430894309,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4311594202898551,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":17.91091739569925,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6076491922189251,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41774193548387095,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40769958977595455,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2772020725388601,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5357510288065843,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":1.5070451958588937,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42331490801089017,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1962]移除石子使总数最小","frequency":8.58070836874869,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6111278648974668,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":3.0140903917177875,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3815058762753455,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7349397590361446,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.7096774193548387,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7718439614221966,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3496133496133496,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27367792052584405,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":23.235427499917648,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47237033446437227,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":25.12486867025721,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.559748427672956,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.5032258064516129,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":24.15437409534985,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4835164835164835,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7443979315439547,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":8.244428887054285,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3704107031736154,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1975]最大方阵和","frequency":9.64090821077706,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.26897282033180375,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.23367029548989113,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.6,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8372128873130877,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.575597115817936,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.28613793627861,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":30.986480824922612,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.43696369636963694,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1982]从子集的和还原数组","frequency":26.152530337287494,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.8444446793442069,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[LCP 01]猜数字","frequency":43.98536534237808,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.687568988173456,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":30.306275749303918,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.217724133741064,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":30.986480824922612,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3746943765281174,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":41.20187448500596,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19608040201005025,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8392244031198524,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[LCP 06]拿硬币","frequency":34.657156582374384,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703747647492022,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[LCP 07]传递信息","frequency":67.25476658214926,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2815812591508053,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2657683613315013,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":62.571488562732334,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.581657848324515,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":25.46076735947459,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6834322607518484,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 11]期望个数统计","frequency":7.595475941432444,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4060871949547573,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":38.25243343335573,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6156237597565816,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":11.147953406635953,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20001613684040664,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":38.94805914015503,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5725574712643678,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":13.408521200424293,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2955288985823337,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7975378589165181,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[LCP 17]速算机器人","frequency":33.992413384380356,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2833333333333333,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":33.992413384380356,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5160149916270168,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":32.73049390930255,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.2986721526089396,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 20]快速公交","frequency":22.363194938799964,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3196467991169978,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":24.15437409534985,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3317960054886416,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":52.16121533012388,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3326527834490268,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":21.533487913731122,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.26925566343042073,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3219720024345709,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.32976588628762543,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32556879739978334,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":32.42805914027332,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.26706514481925414,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[LCP 28]采购方案","frequency":29.650663148664048,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.17059996676084427,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 29]乐团站位","frequency":51.10920062904562,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.33376270216115644,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":5.816580199173658,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.22651306182054196,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":10.394430808706504,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3683266038582324,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":21.533487913731122,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.1997376705141658,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 33]蓄水","frequency":24.15437409534985,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4578729281767956,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCP 34]二叉树染色","frequency":30.306275749303918,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3695652173913043,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":19.989130813114254,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.22943396226415094,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":42.0162849129722,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.17536592101629384,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 37]最小矩形面积","frequency":36.617723586590046,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5198821796759941,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":27.24394307507047,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5359019264448336,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCS 01]下载插件","frequency":26.152530337287494,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7046593186372746,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 02]完成一半题目","frequency":17.91091739569925,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41698317959848075,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 03]主题空间","frequency":6.383649960770506,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6787157566279984,"acs":0,"articleLive":2,"columnArticles":2671,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.65354427641985,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031488462274592,"acs":0,"articleLive":2,"columnArticles":1973,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":78.54538160844045,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7621608059259951,"acs":0,"articleLive":2,"columnArticles":1838,"formTitle":"[剑指 Offer 05]替换空格","frequency":65.703778786975,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523680723022442,"acs":0,"articleLive":2,"columnArticles":1968,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":77.07173403313081,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6958311465521968,"acs":0,"articleLive":2,"columnArticles":1388,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":85.95085804199599,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7173738676158565,"acs":0,"articleLive":2,"columnArticles":1545,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":90.79322411931608,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.34812799383192966,"acs":0,"articleLive":2,"columnArticles":1601,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":80.19687196621459,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.441354346111219,"acs":0,"articleLive":2,"columnArticles":1250,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":75.71664017970079,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49363987198412407,"acs":0,"articleLive":2,"columnArticles":1546,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":83.27619633367539,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4533608276005476,"acs":0,"articleLive":2,"columnArticles":1061,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":64.1299178635488,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5247828652802545,"acs":0,"articleLive":2,"columnArticles":1636,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":75.59506603752045,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5680762537026152,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":67.623028136961,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3109296233865926,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":38.94805914015503,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7459945476136933,"acs":0,"articleLive":2,"columnArticles":1209,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":54.18349425619666,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33816992392252865,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":34.544701370244134,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773223522486332,"acs":0,"articleLive":2,"columnArticles":1084,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":63.78347019528932,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5949403580888812,"acs":0,"articleLive":2,"columnArticles":1398,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":58.24782952940808,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3742603284769797,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":57.88829514996755,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23889091572418825,"acs":0,"articleLive":2,"columnArticles":800,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":73.73057170177908,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423891753966685,"acs":0,"articleLive":2,"columnArticles":1533,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":54.23634438441669,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7897138406486621,"acs":0,"articleLive":2,"columnArticles":2076,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":85.55555537996126,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428202592380209,"acs":0,"articleLive":2,"columnArticles":1739,"formTitle":"[剑指 Offer 24]反转链表","frequency":96.29514800219107,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7289785462696126,"acs":0,"articleLive":2,"columnArticles":1125,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":78.9987796249132,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.46567728406058334,"acs":0,"articleLive":2,"columnArticles":1117,"formTitle":"[剑指 Offer 26]树的子结构","frequency":67.67560793859998,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7908099521667737,"acs":0,"articleLive":2,"columnArticles":1331,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":65.96708388239337,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5799841665543727,"acs":0,"articleLive":2,"columnArticles":1032,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":49.18158338312115,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43966272448532634,"acs":0,"articleLive":2,"columnArticles":1413,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":80.37251845565898,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.57380294680747,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":56.83750583791417,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6138087611538394,"acs":0,"articleLive":2,"columnArticles":870,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.155110401014426,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.64607756367457,"acs":0,"articleLive":2,"columnArticles":887,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":64.45531152748879,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6863912428993163,"acs":0,"articleLive":2,"columnArticles":1017,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.4742549305414,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887589976727824,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.49682218322533,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5491139506757112,"acs":0,"articleLive":2,"columnArticles":893,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.60681761337721,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5777158984362116,"acs":0,"articleLive":2,"columnArticles":813,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":65.49557100870797,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7217547013086046,"acs":0,"articleLive":2,"columnArticles":762,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":58.83620293045851,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6541106005343884,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":69.631397858385,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5584804250900873,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":71.33740309919175,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.579299124490847,"acs":0,"articleLive":2,"columnArticles":1064,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":93.13087229894124,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6890044628738096,"acs":0,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":61.13395636999302,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.569179798896794,"acs":0,"articleLive":2,"columnArticles":1732,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":75.26062209069713,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5794419881695032,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":46.037454084553346,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054678078767023,"acs":0,"articleLive":2,"columnArticles":1462,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.0359833514376,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4820349927098521,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.29146781493168,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41293686561588416,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":49.05085514871373,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5619971374970776,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.59242888740711,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.538967829547651,"acs":0,"articleLive":2,"columnArticles":1358,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":68.45693704329476,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6893026582124909,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":54.60257617346307,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46463838817309866,"acs":0,"articleLive":2,"columnArticles":959,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":72.10934358804649,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6511123687755573,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 49]丑数","frequency":66.07337134179214,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140108491088232,"acs":0,"articleLive":2,"columnArticles":980,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":66.44982842873407,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4805699613327515,"acs":0,"articleLive":2,"columnArticles":804,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":93.09981728920724,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6472087161880569,"acs":0,"articleLive":2,"columnArticles":1008,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":69.14034469121356,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.540008510136069,"acs":0,"articleLive":2,"columnArticles":1498,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":58.72793424485767,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.447367882045535,"acs":0,"articleLive":2,"columnArticles":1377,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":57.574037167970296,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7549241282283188,"acs":0,"articleLive":2,"columnArticles":1082,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":48.77361732995287,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888996699104858,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":63.78347019528932,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5866938560350687,"acs":0,"articleLive":2,"columnArticles":880,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":54.37796820560187,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.699880202093859,"acs":0,"articleLive":2,"columnArticles":973,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":64.4731711139994,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7992156937945847,"acs":0,"articleLive":2,"columnArticles":658,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":50.81014591560455,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6627244451871297,"acs":0,"articleLive":2,"columnArticles":779,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":63.65894699420389,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7059323180133633,"acs":0,"articleLive":2,"columnArticles":1795,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":65.46107682460993,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4409501580246362,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":57.77895466159201,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8564664440276316,"acs":0,"articleLive":2,"columnArticles":1693,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":57.12761988479432,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44412930045250826,"acs":0,"articleLive":2,"columnArticles":1134,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":77.29511613414657,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.47413198436422166,"acs":0,"articleLive":2,"columnArticles":1034,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":52.30153755738035,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5590051805829539,"acs":0,"articleLive":2,"columnArticles":545,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":58.881965098528475,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4602973758062134,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":63.089162647720286,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6547957149176513,"acs":0,"articleLive":2,"columnArticles":721,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":73.85064144865943,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6338774041431019,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":64.2893780556392,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568198245392996,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":58.27281365525428,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5816121220754247,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.68896659205848,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597426043435517,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":55.503576693652654,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28444156291654954,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":51.78829333312404,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930759878032478,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":45.48679058747335,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6994700251108686,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.60681761337721,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2125288000498163,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 001]整数除法","frequency":17.273127573345107,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5973042836041359,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7901838091513492,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":4.751211694844501,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7031392174704276,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7303673744523087,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6803631151457239,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":18.57481039353011,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4792091316754994,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5259967358358592,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5615964802011314,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4414707935769141,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5779247622984705,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6651685393258427,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6711764705882353,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5238654147104851,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6504914004914005,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5153393244499536,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5379477838494232,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5570087189805499,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4845474613686534,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":19.266803924827244,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7096418732782369,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5398106904231625,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5245606128886886,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":5.272967892547079,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7182741116751269,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":5.816580199173658,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.77643400138217,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 024]反转链表","frequency":17.273127573345107,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.617195004803074,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":19.266803924827244,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6780253385757973,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 026]重排链表","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6328840970350404,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.5990521327014218,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30173160173160174,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5647171620325983,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.613768115942029,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5996659242761693,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7869700103412617,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5786561264822134,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.7018572825024438,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.6,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.47007299270072994,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7891156462585034,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5208333333333334,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5806451612903226,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7960670065549891,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8733798604187437,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6540362438220758,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.66454802259887,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7915543575920935,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7267343485617598,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7112608277189605,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.7066666666666667,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7635694572217111,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6373873873873874,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4235190097259063,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":19.266803924827244,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7718600953895072,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6561780506523408,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8752834467120182,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.9035532994923858,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7428115015974441,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.35697940503432496,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5877034358047016,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6342913776015857,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6326315789473684,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5249266862170088,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7168458781362007,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7245370370370371,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.5631578947368421,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5803814713896458,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6407506702412868,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6624605678233438,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5358467243510506,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7392086330935251,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6938775510204082,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.49868766404199477,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4370888157894737,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5617367706919946,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.542016806722689,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 074]合并区间","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7200402819738168,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6709296606000984,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5454103933948519,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6412213740458015,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8677998111425873,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7696404793608522,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7974341661039838,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6579365079365079,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8737412858249419,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":8.244428887054285,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.7042869641294838,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8636363636363636,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":6.383649960770506,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.755688622754491,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6227824463118581,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.740916271721959,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6231155778894473,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5226063829787234,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7615062761506276,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.645933014354067,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5384615384615384,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6194895591647331,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.68993993993994,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":36.80656450403604,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5213675213675214,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5288683602771362,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7486631016042781,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6581071166544388,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":25.46076735947459,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.748191027496382,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.45918367346938777,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.5579598145285936,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5143526654950205,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":27.623219448883557,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5548281505728314,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6790044671346522,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5565031982942431,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":6.975954926003741,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5662393162393162,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.543859649122807,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.568359375,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8452579034941764,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7150259067357513,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5898203592814372,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6243739565943238,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":19.266803924827244,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42073170731707316,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2591587516960651,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6385542168674698,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6143344709897611,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6840659340659341,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46488294314381273,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":7.595475941432444,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7211511885019348,"acs":0,"articleLive":2,"columnArticles":1470,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":77.2144175164952,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6506830999611046,"acs":0,"articleLive":2,"columnArticles":1043,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":49.05085514871373,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5798497644612316,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[面试题 01.03]URL化","frequency":40.64062939594354,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5512082351914857,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[面试题 01.04]回文排列","frequency":43.98536534237808,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3338515651704101,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 01.05]一次编辑","frequency":44.37309794928711,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4734840496098294,"acs":0,"articleLive":2,"columnArticles":1129,"formTitle":"[面试题 01.06]字符串压缩","frequency":69.4977511767484,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7551679193110253,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":57.88829514996755,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6217969360997377,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[面试题 01.08]零矩阵","frequency":39.98818061847047,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5518018830489521,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[面试题 01.09]字符串轮转","frequency":30.306275749303918,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846496548127827,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.01]移除重复节点","frequency":52.43195378917464,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7802712884335642,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":58.01202073897047,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540695457508702,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.87626121838655,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6577578574590527,"acs":0,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":50.16775180536778,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.466671148158107,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":75.59506603752045,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4825644442702413,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[面试题 02.06]回文链表","frequency":35.701008661964565,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6878325762491888,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 02.07]链表相交","frequency":22.939711819021888,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5305458913187542,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":48.4731084069204,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5425234147916891,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6123068432671082,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.98536534237808,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3869165523896592,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 03.03]堆盘子","frequency":29.650663148664048,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7116010465190479,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":40.64062939594354,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5461345608483005,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.05]栈排序","frequency":16.65964708448798,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5892888498683055,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.06]动物收容所","frequency":30.986480824922612,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5344238837035351,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.01]节点间通路","frequency":34.657156582374384,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894974349230477,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[面试题 04.02]最小高度树","frequency":52.16121533012388,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8057170882085055,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":39.98818061847047,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5837461385197507,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[面试题 04.04]检查平衡性","frequency":24.15437409534985,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3510941683156792,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":41.31612403962692,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5910527139058345,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":16.65964708448798,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.71681739289303,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.650663148664048,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4781952618077561,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":25.46076735947459,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7175651035579036,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":5.272967892547079,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48864337554726295,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":29.650663148664048,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5066031235645384,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6848886783514921,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":24.795313995995212,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3917335945151812,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 05.03]翻转数位","frequency":38.94805914015503,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3945578231292517,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5277351247600768,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 05.06]整数转换","frequency":5.816580199173658,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7042518662771827,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":17.273127573345107,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5536912751677853,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":24.15437409534985,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3638876997716895,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[面试题 08.01]三步问题","frequency":46.48947028249725,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.361066904322363,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":37.581460544876904,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6767970086320061,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 08.03]魔术索引","frequency":5.816580199173658,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8224986568582883,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":43.98536534237808,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6792599083310865,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":5.272967892547079,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6552382070625532,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":59.965774115028836,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133010594817666,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":43.306439180282574,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7174561730697501,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":43.98536534237808,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.811384278108362,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 08.09]括号","frequency":64.06786108215182,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5589404545847377,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":16.65964708448798,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49470458737430834,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":50.39893660451029,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.758886427126481,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[面试题 08.12]八皇后","frequency":49.7133615916018,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5011407442372748,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":17.91091739569925,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5336423655007726,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5538256454091237,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.03777134746593,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395609872369933,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 10.02]变位词组","frequency":61.522007806834225,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39635000814730326,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":60.41664818227118,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5525288322921672,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.795313995995212,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45622883227801503,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":45.66862015710981,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6309963099630996,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":8.244428887054285,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6669136717302705,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":39.98818061847047,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8328130302002036,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 16.01]交换数字","frequency":30.986480824922612,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.765080410560404,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":6.383649960770506,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44342579166471774,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":7.595475941432444,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4616667778741576,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46404078686157735,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.306275749303918,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42386758969673544,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":30.306275749303918,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7337231968810917,"acs":0,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":41.31612403962692,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37639389260593586,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":8.244428887054285,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5472794506075013,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6846606842400449,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.10]生存人数","frequency":24.795313995995212,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44117987275882015,"acs":0,"articleLive":2,"columnArticles":572,"formTitle":"[面试题 16.11]跳水板","frequency":24.15437409534985,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43241330502477,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5497568881685575,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5028877887788779,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.383649960770506,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4515273517382413,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[面试题 16.16]部分排序","frequency":40.64062939594354,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.601241118805648,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":43.98536534237808,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3441687002164004,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":30.306275749303918,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6090625973217066,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[面试题 16.19]水域大小","frequency":51.474145069492515,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7202731540759709,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.20]T9键盘","frequency":30.306275749303918,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46450346181667873,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.21]交换和","frequency":5.816580199173658,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5814880425155005,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.595475941432444,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47048341405464683,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 16.24]数对和","frequency":24.15437409534985,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5438859298712827,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.95465487951782,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3862691497237884,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.26]计算器","frequency":60.82881047943983,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.598537533237881,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":24.795313995995212,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6451856176713862,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 17.04]消失的数字","frequency":41.31612403962692,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3860332683950247,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.91091739569925,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4476152062115559,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.816580199173658,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4116285939346199,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":36.06233332023997,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27172578444747614,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.08]马戏团人塔","frequency":39.67013482103618,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5501724421087206,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 17.09]第 k 个数","frequency":56.00613762691624,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713963983472936,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[面试题 17.10]主要元素","frequency":59.72403908962251,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6861974046401887,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 17.11]单词距离","frequency":35.34653088042582,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6317003063899681,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.816580199173658,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5531180731701744,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.13]恢复空格","frequency":30.986480824922612,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5478257044834766,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[面试题 17.14]最小K个数","frequency":72.61750761111854,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40284744762466806,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.15]最长单词","frequency":30.986480824922612,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.51954516872773,"acs":0,"articleLive":2,"columnArticles":1120,"formTitle":"[面试题 17.16]按摩师","frequency":55.338830711429566,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44236575691196495,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":17.273127573345107,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4471624266144814,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.18]最短超串","frequency":17.91091739569925,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816887510572315,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":33.350681095761885,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5706188725490197,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":17.273127573345107,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6351873732732338,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.26267033370132,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3712729869666131,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.64062939594354,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3797002602530737,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":6.975954926003741,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5163174977869578,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[面试题 17.24]最大子矩阵","frequency":67.86603053769919,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49433686518085496,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":28.406889968692177,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3404277626336758,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":17.91091739569925,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.8079828575579284,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[1588]所有奇数长度子数组的和","frequency":13.095611794579392,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.5190385985046521,"acs":0,"articleLive":2,"columnArticles":13823,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40765327695560255,"acs":0,"articleLive":2,"columnArticles":6897,"formTitle":"[2]两数相加","frequency":99.2470679441788,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3787343217516643,"acs":0,"articleLive":2,"columnArticles":7098,"formTitle":"[3]无重复字符的最长子串","frequency":97.7412038325364,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4070561323539002,"acs":0,"articleLive":2,"columnArticles":3630,"formTitle":"[4]寻找两个正序数组的中位数","frequency":95.74343322863731,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35241031274536583,"acs":0,"articleLive":2,"columnArticles":3818,"formTitle":"[5]最长回文子串","frequency":96.29185356412971,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5060077020930508,"acs":0,"articleLive":2,"columnArticles":2346,"formTitle":"[6]Z 字形变换","frequency":77.10245345418006,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3537718689750762,"acs":0,"articleLive":2,"columnArticles":5084,"formTitle":"[7]整数反转","frequency":98.4941358883576,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21680246061628577,"acs":0,"articleLive":2,"columnArticles":2604,"formTitle":"[8]字符串转换整数 (atoi)","frequency":74.95161679439842,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5854795295217816,"acs":0,"articleLive":2,"columnArticles":4758,"formTitle":"[9]回文数","frequency":79.39795821609289,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3164280764153416,"acs":0,"articleLive":2,"columnArticles":1195,"formTitle":"[10]正则表达式匹配","frequency":85.41799819714753,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6318054857683327,"acs":0,"articleLive":2,"columnArticles":2896,"formTitle":"[11]盛最多水的容器","frequency":86.17093025296873,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6656489386986489,"acs":0,"articleLive":2,"columnArticles":1712,"formTitle":"[12]整数转罗马数字","frequency":75.62729775654597,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331195883485525,"acs":0,"articleLive":2,"columnArticles":3748,"formTitle":"[13]罗马数字转整数","frequency":83.00361472068693,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4067576591037383,"acs":0,"articleLive":2,"columnArticles":3737,"formTitle":"[14]最长公共前缀","frequency":93.417700562373,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3328090436227598,"acs":0,"articleLive":2,"columnArticles":2922,"formTitle":"[15]三数之和","frequency":95.28756446849228,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4597653701703886,"acs":0,"articleLive":2,"columnArticles":1374,"formTitle":"[16]最接近的三数之和","frequency":82.84026431044904,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5716912838393939,"acs":0,"articleLive":2,"columnArticles":2922,"formTitle":"[17]电话号码的字母组合","frequency":79.19295102145519,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40180179495558205,"acs":0,"articleLive":2,"columnArticles":1451,"formTitle":"[18]四数之和","frequency":69.60088976302212,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4276380250583913,"acs":0,"articleLive":2,"columnArticles":3633,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":76.49718537258845,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44477201796543475,"acs":0,"articleLive":2,"columnArticles":5341,"formTitle":"[20]有效的括号","frequency":92.42666942519874,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6665265698390888,"acs":0,"articleLive":2,"columnArticles":3296,"formTitle":"[21]合并两个有序链表","frequency":87.16777111426964,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724907806098856,"acs":0,"articleLive":2,"columnArticles":2529,"formTitle":"[22]括号生成","frequency":89.48589062590551,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5585766756667312,"acs":0,"articleLive":2,"columnArticles":2017,"formTitle":"[23]合并K个升序链表","frequency":82.737651250269,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7025044323147153,"acs":0,"articleLive":2,"columnArticles":2414,"formTitle":"[24]两两交换链表中的节点","frequency":62.80974732746609,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6560833906043275,"acs":0,"articleLive":2,"columnArticles":2072,"formTitle":"[25]K 个一组翻转链表","frequency":91.86352450939764,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403358884368066,"acs":0,"articleLive":2,"columnArticles":4347,"formTitle":"[26]删除有序数组中的重复项","frequency":79.99091065727852,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982790132765933,"acs":0,"articleLive":2,"columnArticles":3899,"formTitle":"[27]移除元素","frequency":72.70961409250519,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40720073965301573,"acs":0,"articleLive":2,"columnArticles":3124,"formTitle":"[28]实现 strStr()","frequency":74.7737824273143,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20730095024493891,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[29]两数相除","frequency":68.82839795316107,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35531507580260896,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[30]串联所有单词的子串","frequency":59.08785707350209,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.373220366347678,"acs":0,"articleLive":2,"columnArticles":1660,"formTitle":"[31]下一个排列","frequency":82.01102452385886,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3553694503897736,"acs":0,"articleLive":2,"columnArticles":1254,"formTitle":"[32]最长有效括号","frequency":76.33725012244318,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4255757432051928,"acs":0,"articleLive":2,"columnArticles":2287,"formTitle":"[33]搜索旋转排序数组","frequency":77.03404648719776,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4246331136790501,"acs":0,"articleLive":2,"columnArticles":3093,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.79700029788499,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4664383453543978,"acs":0,"articleLive":2,"columnArticles":3731,"formTitle":"[35]搜索插入位置","frequency":74.20214617708723,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6285139367249626,"acs":0,"articleLive":2,"columnArticles":1103,"formTitle":"[36]有效的数独","frequency":54.507368817181145,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707500942329438,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[37]解数独","frequency":66.82994919617188,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5795481845368767,"acs":0,"articleLive":2,"columnArticles":2211,"formTitle":"[38]外观数列","frequency":65.31420851029426,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7267856568727867,"acs":0,"articleLive":2,"columnArticles":1857,"formTitle":"[39]组合总和","frequency":73.0427912722126,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.628213775591176,"acs":0,"articleLive":2,"columnArticles":1327,"formTitle":"[40]组合总和 II","frequency":70.19500082294199,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4184951806263851,"acs":0,"articleLive":2,"columnArticles":1370,"formTitle":"[41]缺失的第一个正数","frequency":88.0009532662803,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5744606885147324,"acs":0,"articleLive":2,"columnArticles":2333,"formTitle":"[42]接雨水","frequency":95.32747689576641,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4487427946045337,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[43]字符串相乘","frequency":82.61323170681202,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32788982116855847,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[44]通配符匹配","frequency":63.43794770404375,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4247424496722087,"acs":0,"articleLive":2,"columnArticles":1499,"formTitle":"[45]跳跃游戏 II","frequency":96.38750062749601,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.782206607533912,"acs":0,"articleLive":2,"columnArticles":2556,"formTitle":"[46]全排列","frequency":93.62054782144406,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6361161609682375,"acs":0,"articleLive":2,"columnArticles":1416,"formTitle":"[47]全排列 II","frequency":67.78210455932928,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7349117303917116,"acs":0,"articleLive":2,"columnArticles":1788,"formTitle":"[48]旋转图像","frequency":72.01905896066361,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6639124920923906,"acs":0,"articleLive":2,"columnArticles":1251,"formTitle":"[49]字母异位词分组","frequency":69.08701308279208,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37674373337370504,"acs":0,"articleLive":2,"columnArticles":1238,"formTitle":"[50]Pow(x, n)","frequency":67.22125084766249,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7391438064363249,"acs":0,"articleLive":2,"columnArticles":1485,"formTitle":"[51]N 皇后","frequency":68.37254938482896,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8237038399209259,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[52]N皇后 II","frequency":29.14026595988839,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.55095091063289,"acs":0,"articleLive":2,"columnArticles":3587,"formTitle":"[53]最大子序和","frequency":78.3988117140029,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47908898198553446,"acs":0,"articleLive":2,"columnArticles":1922,"formTitle":"[54]螺旋矩阵","frequency":88.1414540937355,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43204725957716017,"acs":0,"articleLive":2,"columnArticles":2350,"formTitle":"[55]跳跃游戏","frequency":75.54580885287457,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.466039496954215,"acs":0,"articleLive":2,"columnArticles":2199,"formTitle":"[56]合并区间","frequency":86.31551173767355,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41042655892097013,"acs":0,"articleLive":2,"columnArticles":899,"formTitle":"[57]插入区间","frequency":37.67835951885494,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3525586510627125,"acs":0,"articleLive":2,"columnArticles":2305,"formTitle":"[58]最后一个单词的长度","frequency":54.507368817181145,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.793331924057657,"acs":0,"articleLive":2,"columnArticles":1491,"formTitle":"[59]螺旋矩阵 II","frequency":77.64587965818171,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5234040267815584,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[60]排列序列","frequency":40.07795678748187,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41821359240396,"acs":0,"articleLive":2,"columnArticles":1931,"formTitle":"[61]旋转链表","frequency":71.92899502720954,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6598888861911184,"acs":0,"articleLive":2,"columnArticles":2323,"formTitle":"[62]不同路径","frequency":69.17012691086445,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.38978798738176046,"acs":0,"articleLive":2,"columnArticles":1638,"formTitle":"[63]不同路径 II","frequency":70.19500082294199,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6878292855307119,"acs":0,"articleLive":2,"columnArticles":2004,"formTitle":"[64]最小路径和","frequency":72.88253601420932,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26904919637368474,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[65]有效数字","frequency":45.741584789373526,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4584572856627257,"acs":0,"articleLive":2,"columnArticles":3055,"formTitle":"[66]加一","frequency":62.976959238994446,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5439860589998898,"acs":0,"articleLive":2,"columnArticles":1722,"formTitle":"[67]二进制求和","frequency":57.7190386223415,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47010625106372633,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[68]文本左右对齐","frequency":44.44989674245616,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3928048063304555,"acs":0,"articleLive":2,"columnArticles":1854,"formTitle":"[69]x 的平方根","frequency":78.9166393916054,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5277578229250229,"acs":0,"articleLive":2,"columnArticles":3419,"formTitle":"[70]爬楼梯","frequency":92.03863141501841,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4213735990673609,"acs":0,"articleLive":2,"columnArticles":799,"formTitle":"[71]简化路径","frequency":54.11582294605007,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6126469500924214,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[72]编辑距离","frequency":93.26114411008017,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6011864390588729,"acs":0,"articleLive":2,"columnArticles":917,"formTitle":"[73]矩阵置零","frequency":53.66068591558103,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45830182134550973,"acs":0,"articleLive":2,"columnArticles":1624,"formTitle":"[74]搜索二维矩阵","frequency":74.87884380024829,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5939864368003922,"acs":0,"articleLive":2,"columnArticles":1775,"formTitle":"[75]颜色分类","frequency":46.14648719390761,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4235278822992656,"acs":0,"articleLive":2,"columnArticles":1192,"formTitle":"[76]最小覆盖子串","frequency":81.58695488723711,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700730063857152,"acs":0,"articleLive":2,"columnArticles":1211,"formTitle":"[77]组合","frequency":71.97933876790414,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8005982779297428,"acs":0,"articleLive":2,"columnArticles":1953,"formTitle":"[78]子集","frequency":74.01310356140397,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4571322801950983,"acs":0,"articleLive":2,"columnArticles":1337,"formTitle":"[79]单词搜索","frequency":72.55502856916983,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6159246875896347,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[80]删除有序数组中的重复项 II","frequency":68.10970900117911,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41609361386018323,"acs":0,"articleLive":2,"columnArticles":959,"formTitle":"[81]搜索旋转排序数组 II","frequency":71.33439972145138,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5289401551083794,"acs":0,"articleLive":2,"columnArticles":1619,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":81.03060407211292,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386572882712872,"acs":0,"articleLive":2,"columnArticles":1855,"formTitle":"[83]删除排序链表中的重复元素","frequency":71.03195188134286,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43260992798952397,"acs":0,"articleLive":2,"columnArticles":1110,"formTitle":"[84]柱状图中最大的矩形","frequency":80.52219474399213,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5163317488754416,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[85]最大矩形","frequency":60.95419814832466,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6320963744686439,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[86]分隔链表","frequency":58.30847556459885,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48877590176515734,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":70.19500082294199,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5150213175369756,"acs":0,"articleLive":2,"columnArticles":3073,"formTitle":"[88]合并两个有序数组","frequency":94.9104274891697,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7093052451854269,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[89]格雷编码","frequency":45.084975326461326,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6337632578870529,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[90]子集 II","frequency":75.28099421632129,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3045974057806576,"acs":0,"articleLive":2,"columnArticles":1462,"formTitle":"[91]解码方法","frequency":67.30523612267085,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5469560854988116,"acs":0,"articleLive":2,"columnArticles":1948,"formTitle":"[92]反转链表 II","frequency":88.78254204889376,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5374106540292842,"acs":0,"articleLive":2,"columnArticles":1267,"formTitle":"[93]复原 IP 地址","frequency":81.2310214057419,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7558397276813141,"acs":0,"articleLive":2,"columnArticles":2188,"formTitle":"[94]二叉树的中序遍历","frequency":63.56050949557147,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6990779060480651,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.23409087575218,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992795861491102,"acs":0,"articleLive":2,"columnArticles":1224,"formTitle":"[96]不同的二叉搜索树","frequency":67.33218519150986,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45782211007727486,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[97]交错字符串","frequency":44.44989674245616,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34849599740818815,"acs":0,"articleLive":2,"columnArticles":1843,"formTitle":"[98]验证二叉搜索树","frequency":73.41238826524174,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6155186570568378,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[99]恢复二叉搜索树","frequency":56.69312251423831,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039022316899466,"acs":0,"articleLive":2,"columnArticles":1811,"formTitle":"[100]相同的树","frequency":56.04850787407274,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5610024746958396,"acs":0,"articleLive":2,"columnArticles":2159,"formTitle":"[101]对称二叉树","frequency":75.39629925049772,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421551379584809,"acs":0,"articleLive":2,"columnArticles":2391,"formTitle":"[102]二叉树的层序遍历","frequency":87.35587393466743,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5719053993138594,"acs":0,"articleLive":2,"columnArticles":1529,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":80.37498723716149,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7658303502042676,"acs":0,"articleLive":2,"columnArticles":2441,"formTitle":"[104]二叉树的最大深度","frequency":77.51778031545527,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7035486627385946,"acs":0,"articleLive":2,"columnArticles":1371,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.40418964690612,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211697616942158,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":70.74172785901666,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6953730390970496,"acs":0,"articleLive":2,"columnArticles":1274,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.43794770404375,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7592588003007097,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.545040741849625,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7635025581141364,"acs":0,"articleLive":2,"columnArticles":696,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.925095060506884,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5624926877946389,"acs":0,"articleLive":2,"columnArticles":1407,"formTitle":"[110]平衡二叉树","frequency":64.82458565049252,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48426614474057406,"acs":0,"articleLive":2,"columnArticles":1718,"formTitle":"[111]二叉树的最小深度","frequency":43.83502231730732,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257522901659474,"acs":0,"articleLive":2,"columnArticles":1588,"formTitle":"[112]路径总和","frequency":60.58697763557225,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6261236831547823,"acs":0,"articleLive":2,"columnArticles":1180,"formTitle":"[113]路径总和 II","frequency":64.47267603405942,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7255841096245704,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[114]二叉树展开为链表","frequency":46.0299369397427,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5247424527456777,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[115]不同的子序列","frequency":65.9434204007798,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7024880359991429,"acs":0,"articleLive":2,"columnArticles":1108,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":50.961118847729345,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6099534957269258,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":29.51606311911778,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7254602597978397,"acs":0,"articleLive":2,"columnArticles":1658,"formTitle":"[118]杨辉三角","frequency":71.6097142801842,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6630260496624997,"acs":0,"articleLive":2,"columnArticles":1161,"formTitle":"[119]杨辉三角 II","frequency":57.20931354427605,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6790893161489121,"acs":0,"articleLive":2,"columnArticles":1504,"formTitle":"[120]三角形最小路径和","frequency":52.566607585740954,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5731254576178748,"acs":0,"articleLive":2,"columnArticles":3259,"formTitle":"[121]买卖股票的最佳时机","frequency":85.00506872367552,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.687052941729618,"acs":0,"articleLive":2,"columnArticles":2543,"formTitle":"[122]买卖股票的最佳时机 II","frequency":68.08101034641965,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5334538571877201,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[123]买卖股票的最佳时机 III","frequency":61.42287724510146,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.443017044009158,"acs":0,"articleLive":2,"columnArticles":1044,"formTitle":"[124]二叉树中的最大路径和","frequency":82.69814426010238,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4739263912675796,"acs":0,"articleLive":2,"columnArticles":1786,"formTitle":"[125]验证回文串","frequency":65.9799742252438,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39375954806730634,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[126]单词接龙 II","frequency":38.34734663047714,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46703003015890976,"acs":0,"articleLive":2,"columnArticles":633,"formTitle":"[127]单词接龙","frequency":49.774355615112746,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431834452664235,"acs":0,"articleLive":2,"columnArticles":1045,"formTitle":"[128]最长连续序列","frequency":76.21610293160005,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.679796052239251,"acs":0,"articleLive":2,"columnArticles":1074,"formTitle":"[129]求根节点到叶节点数字之和","frequency":64.30723365038014,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4420876360591683,"acs":0,"articleLive":2,"columnArticles":1122,"formTitle":"[130]被围绕的区域","frequency":57.63210442061304,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7236512026516226,"acs":0,"articleLive":2,"columnArticles":832,"formTitle":"[131]分割回文串","frequency":83.26069991154401,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4925100138968364,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[132]分割回文串 II","frequency":65.0504344018052,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6755710115888138,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[133]克隆图","frequency":5.26556001104653,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5761585266213606,"acs":0,"articleLive":2,"columnArticles":934,"formTitle":"[134]加油站","frequency":74.92536715575416,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4859536743116653,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[135]分发糖果","frequency":86.20770026480373,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190557937315313,"acs":0,"articleLive":2,"columnArticles":2160,"formTitle":"[136]只出现一次的数字","frequency":77.05578748215895,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7195338250291914,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[137]只出现一次的数字 II","frequency":73.8247918432612,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6590527888749962,"acs":0,"articleLive":2,"columnArticles":836,"formTitle":"[138]复制带随机指针的链表","frequency":68.91384053792092,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5128035151237007,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[139]单词拆分","frequency":77.31622251621168,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48224046281861044,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[140]单词拆分 II","frequency":42.10005880880681,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5124908910472153,"acs":0,"articleLive":2,"columnArticles":2611,"formTitle":"[141]环形链表","frequency":76.97437788506818,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5514919916674714,"acs":0,"articleLive":2,"columnArticles":1637,"formTitle":"[142]环形链表 II","frequency":70.96875865200568,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6169327397125061,"acs":0,"articleLive":2,"columnArticles":1031,"formTitle":"[143]重排链表","frequency":91.29536848675261,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7026658120661172,"acs":0,"articleLive":2,"columnArticles":1759,"formTitle":"[144]二叉树的前序遍历","frequency":57.9848105611557,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7493721349526523,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[145]二叉树的后序遍历","frequency":67.3974056559908,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5269144585939738,"acs":0,"articleLive":2,"columnArticles":1321,"formTitle":"[146]LRU 缓存机制","frequency":94.24202191761314,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6808703472114884,"acs":0,"articleLive":2,"columnArticles":762,"formTitle":"[147]对链表进行插入排序","frequency":48.47480274903014,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675607415601551,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[148]排序链表","frequency":78.6424374325757,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.336132248753608,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[149]直线上最多的点数","frequency":66.59285729617875,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5367332427326621,"acs":0,"articleLive":2,"columnArticles":1012,"formTitle":"[150]逆波兰表达式求值","frequency":70.19500082294199,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.47995355182285215,"acs":0,"articleLive":2,"columnArticles":1367,"formTitle":"[151]翻转字符串里的单词","frequency":61.034925653405395,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42025191537354645,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[152]乘积最大子数组","frequency":75.02376553835775,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5655416497998471,"acs":0,"articleLive":2,"columnArticles":1424,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.04850787407274,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319360015561931,"acs":0,"articleLive":2,"columnArticles":864,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":66.1669525843538,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.572429032311709,"acs":0,"articleLive":2,"columnArticles":1536,"formTitle":"[155]最小栈","frequency":70.72752374355403,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7255131964809384,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[156]上下翻转二叉树","frequency":16.816825637076768,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5306669415524172,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5891612322914325,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":7.581194484543051,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.541217171341418,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":44.063311649031796,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6120568492519431,"acs":0,"articleLive":2,"columnArticles":1883,"formTitle":"[160]相交链表","frequency":72.22716731637719,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33637251709540866,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.372954961736547,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49439610768409686,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[162]寻找峰值","frequency":60.34584574924966,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32322097378277154,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[163]缺失的区间","frequency":17.428490500626694,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6109949588750332,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[164]最大间距","frequency":59.996425625655434,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.48606305355421964,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[165]比较版本号","frequency":81.38637104828452,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29853384026881535,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":52.21496481158871,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863438777706047,"acs":0,"articleLive":2,"columnArticles":1784,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":63.415171238324234,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325769466095608,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[168]Excel表列名称","frequency":63.17858328711613,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6643900362240407,"acs":0,"articleLive":2,"columnArticles":2098,"formTitle":"[169]多数元素","frequency":69.75420602210095,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41658126665300266,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.26556001104653,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7173244525346131,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[171]Excel 表列序号","frequency":50.867893952631206,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.437732863266696,"acs":0,"articleLive":2,"columnArticles":572,"formTitle":"[172]阶乘后的零","frequency":47.256216083196,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8031567129680587,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[173]二叉搜索树迭代器","frequency":48.422481898031265,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47942608582743623,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[174]地下城游戏","frequency":65.0504344018052,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399140127711846,"acs":0,"articleLive":2,"columnArticles":1426,"formTitle":"[175]组合两个表","frequency":94.34226881468926,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561624839941228,"acs":0,"articleLive":2,"columnArticles":977,"formTitle":"[176]第二高的薪水","frequency":96.12515329761744,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46208844323975967,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[177]第N高的薪水","frequency":77.64587965818171,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6019550477080491,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[178]分数排名","frequency":69.56432916066126,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4098466647823629,"acs":0,"articleLive":2,"columnArticles":934,"formTitle":"[179]最大数","frequency":82.04910078092065,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48721608429807406,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[180]连续出现的数字","frequency":73.17303570357959,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7029977919562184,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[181]超过经理收入的员工","frequency":71.83637901106955,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.79720945638223,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[182]查找重复的电子邮箱","frequency":60.70309319357274,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6774863867990913,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[183]从不订购的客户","frequency":47.85600744283266,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4744688000701286,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[184]部门工资最高的员工","frequency":75.28099421632129,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49277634509436175,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[185]部门工资前三高的所有员工","frequency":75.35244921139659,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7535372451102789,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.372954961736547,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.482474619440378,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[187]重复的DNA序列","frequency":34.09993431777147,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38880660611667345,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":51.84314649535404,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4530761667559213,"acs":0,"articleLive":2,"columnArticles":1590,"formTitle":"[189]旋转数组","frequency":64.16182393814182,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6955381585371875,"acs":0,"articleLive":2,"columnArticles":799,"formTitle":"[190]颠倒二进制位","frequency":50.961118847729345,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7472882115643209,"acs":0,"articleLive":2,"columnArticles":1158,"formTitle":"[191]位1的个数","frequency":64.51258496417711,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35550668245643713,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[192]统计词频","frequency":58.048454477619046,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3237505925157257,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":37.03233675576518,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3452603194358017,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[194]转置文件","frequency":30.42470598608389,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4361078101691487,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[195]第十行","frequency":53.34187225926457,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6649852303179422,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[196]删除重复的电子邮箱","frequency":59.96008737481002,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338669987251327,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[197]上升的温度","frequency":57.925095060506884,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5112473835550565,"acs":0,"articleLive":2,"columnArticles":2539,"formTitle":"[198]打家劫舍","frequency":81.2310214057419,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6524698703728189,"acs":0,"articleLive":2,"columnArticles":1524,"formTitle":"[199]二叉树的右视图","frequency":82.12874557750285,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.551401115299609,"acs":0,"articleLive":2,"columnArticles":2037,"formTitle":"[200]岛屿数量","frequency":89.90256781645637,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5223615351068469,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[201]数字范围按位与","frequency":37.03233675576518,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6178529821813945,"acs":0,"articleLive":2,"columnArticles":1325,"formTitle":"[202]快乐数","frequency":58.18918882228352,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.513041506540623,"acs":0,"articleLive":2,"columnArticles":1567,"formTitle":"[203]移除链表元素","frequency":57.48283127153751,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37933647262263914,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[204]计数质数","frequency":54.11582294605007,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010433942663435,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[205]同构字符串","frequency":49.774355615112746,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7222670139526841,"acs":0,"articleLive":2,"columnArticles":7171,"formTitle":"[206]反转链表","frequency":96.98827177671521,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5448186833484211,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[207]课程表","frequency":71.36698033990172,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7163002860065552,"acs":0,"articleLive":2,"columnArticles":928,"formTitle":"[208]实现 Trie (前缀树)","frequency":70.19500082294199,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46910758751341464,"acs":0,"articleLive":2,"columnArticles":1279,"formTitle":"[209]长度最小的子数组","frequency":56.04850787407274,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5412775734704225,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[210]课程表 II","frequency":49.607122478670604,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.481401458844678,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":34.76271017598046,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4507970244420829,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[212]单词搜索 II","frequency":42.10005880880681,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4323338644881837,"acs":0,"articleLive":2,"columnArticles":1434,"formTitle":"[213]打家劫舍 II","frequency":73.41238826524174,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37063790326516666,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[214]最短回文串","frequency":59.50246030592042,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6470894327182536,"acs":0,"articleLive":2,"columnArticles":2191,"formTitle":"[215]数组中的第K个最大元素","frequency":89.07237844554223,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7395563010317109,"acs":0,"articleLive":2,"columnArticles":983,"formTitle":"[216]组合总和 III","frequency":63.06911968729783,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614949236390644,"acs":0,"articleLive":2,"columnArticles":1570,"formTitle":"[217]存在重复元素","frequency":68.58710212660759,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5426402392078924,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[218]天际线问题","frequency":64.05345075063177,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42552467566777813,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[219]存在重复元素 II","frequency":46.56000556894126,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28710486795355483,"acs":0,"articleLive":2,"columnArticles":413,"formTitle":"[220]存在重复元素 III","frequency":63.43794770404375,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4725663780559837,"acs":0,"articleLive":2,"columnArticles":947,"formTitle":"[221]最大正方形","frequency":72.93390911680159,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7801032755515533,"acs":0,"articleLive":2,"columnArticles":854,"formTitle":"[222]完全二叉树的节点个数","frequency":37.03233675576518,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.460422564870493,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[223]矩形面积","frequency":47.125397060032675,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4176769820326868,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[224]基本计算器","frequency":90.09994708784104,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6757021640120963,"acs":0,"articleLive":2,"columnArticles":4720,"formTitle":"[225]用队列实现栈","frequency":53.66068591558103,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7874439829489561,"acs":0,"articleLive":2,"columnArticles":1781,"formTitle":"[226]翻转二叉树","frequency":75.22524710492428,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43684498774386,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[227]基本计算器 II","frequency":78.48361991764034,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5817109765727823,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[228]汇总区间","frequency":16.816825637076768,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4630319359695697,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[229]求众数 II","frequency":40.07795678748187,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7403056027164686,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":39.760852262034476,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5034875252696476,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[231]2 的幂","frequency":47.85600744283266,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6909612691415846,"acs":0,"articleLive":2,"columnArticles":1207,"formTitle":"[232]用栈实现队列","frequency":66.25569403921692,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4759233554184972,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":42.53777806716163,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4926042709376043,"acs":0,"articleLive":2,"columnArticles":1900,"formTitle":"[234]回文链表","frequency":80.19892695912047,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660537337828174,"acs":0,"articleLive":2,"columnArticles":929,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":49.72962061559512,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.67969861469881,"acs":0,"articleLive":2,"columnArticles":1321,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.95161679439842,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8480283042200619,"acs":0,"articleLive":2,"columnArticles":995,"formTitle":"[237]删除链表中的节点","frequency":55.00791953095353,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7225348038921421,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[238]除自身以外数组的乘积","frequency":56.04850787407274,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49620117301893013,"acs":0,"articleLive":2,"columnArticles":1267,"formTitle":"[239]滑动窗口最大值","frequency":69.7010997830705,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.474043321192122,"acs":0,"articleLive":2,"columnArticles":713,"formTitle":"[240]搜索二维矩阵 II","frequency":63.03042037938017,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7369148726051747,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[241]为运算表达式设计优先级","frequency":51.52992796876882,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6438476243763697,"acs":0,"articleLive":2,"columnArticles":1596,"formTitle":"[242]有效的字母异位词","frequency":58.18918882228352,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.657062543921293,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5489853044086774,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.610453064850459,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.474339984316459,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.521067563307765,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46497277676951,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6382003993891695,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6342874091650601,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[250]统计同值子树","frequency":6.372954961736547,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5418314091412304,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[251]展开二维向量","frequency":16.816825637076768,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5613183955186556,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[252]会议室","frequency":6.372954961736547,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4967702296541074,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[253]会议室 II","frequency":54.649100328920476,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5689816987329892,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":17.428490500626694,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47255460588793924,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6311494520867335,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[256]粉刷房子","frequency":5.26556001104653,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.680240307047871,"acs":0,"articleLive":2,"columnArticles":1007,"formTitle":"[257]二叉树的所有路径","frequency":63.31072996491728,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6914534260755861,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[258]各位相加","frequency":49.11380989222432,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5665741441668769,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.26556001104653,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253636773190333,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[260]只出现一次的数字 III","frequency":50.867893952631206,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4973443675889328,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[261]以图判树","frequency":24.930054191784617,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43818281570535755,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[262]行程和用户","frequency":63.59045251662289,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154981988044812,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[263]丑数","frequency":54.818731345248665,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5783430873391193,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[264]丑数 II","frequency":60.04845196283329,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5807447604790419,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[265]粉刷房子 II","frequency":4.245484252307841,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6701487812598924,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44459569833923224,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.963506971653366,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6229007046107539,"acs":0,"articleLive":2,"columnArticles":1054,"formTitle":"[268]丢失的数字","frequency":34.09993431777147,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3400192101248658,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5491788593610033,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":17.428490500626694,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.550412863972186,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6451549627304826,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":10.371865708925363,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30857680447394553,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":34.76271017598046,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404270175231974,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":57.35928413646071,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4631160483736137,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[275]H 指数 II","frequency":33.46010126703396,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48576754857675486,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[276]栅栏涂色","frequency":25.59353811370971,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5681090401510798,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.963506971653366,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4551536251136322,"acs":0,"articleLive":2,"columnArticles":933,"formTitle":"[278]第一个错误的版本","frequency":68.52143005424932,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6304884032843731,"acs":0,"articleLive":2,"columnArticles":1150,"formTitle":"[279]完全平方数","frequency":72.24753220334671,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6863875016007172,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":18.064392753020297,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7563291139240507,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3885871086968696,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6391724350963901,"acs":0,"articleLive":2,"columnArticles":3178,"formTitle":"[283]移动零","frequency":74.5307255182823,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.73318952692651,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[284]顶端迭代器","frequency":17.428490500626694,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6358686547160328,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5068133689347205,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[286]墙与门","frequency":6.963506971653366,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.662525217069304,"acs":0,"articleLive":2,"columnArticles":1189,"formTitle":"[287]寻找重复数","frequency":62.618708665239495,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.425035451849942,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7531909939018178,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[289]生命游戏","frequency":18.064392753020297,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4569845721492453,"acs":0,"articleLive":2,"columnArticles":1056,"formTitle":"[290]单词规律","frequency":27.941734157085214,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.533643204957946,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6967097029181213,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[292]Nim 游戏","frequency":44.063311649031796,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.710443275732532,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[293]翻转游戏","frequency":5.807563470645132,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5847544338335607,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5238422781283855,"acs":0,"articleLive":2,"columnArticles":480,"formTitle":"[295]数据流的中位数","frequency":40.02686324167324,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6193272824345969,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":26.283253785386695,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5577530582067483,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[297]二叉树的序列化与反序列化","frequency":57.925095060506884,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.577783331250781,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5036409647265403,"acs":0,"articleLive":2,"columnArticles":344,"formTitle":"[299]猜数字游戏","frequency":23.674794572990148,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5110894757563642,"acs":0,"articleLive":2,"columnArticles":1896,"formTitle":"[300]最长递增子序列","frequency":81.82772968818081,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220271781490393,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[301]删除无效的括号","frequency":53.1482005969799,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6685673556664291,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.723894048375191,"acs":0,"articleLive":2,"columnArticles":776,"formTitle":"[303]区域和检索 - 数组不可变","frequency":62.59442833487575,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5395349253517597,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":57.925095060506884,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37669427710843373,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":5.807563470645132,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3369594721566826,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":39.760852262034476,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5432239657631954,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[307]区域和检索 - 数组可修改","frequency":18.064392753020297,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6048178950387152,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6048379123595259,"acs":0,"articleLive":2,"columnArticles":885,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":72.35580790498645,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3789709090242516,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[310]最小高度树","frequency":45.1774259119963,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7628234226055379,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":18.064392753020297,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6823109734423399,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":57.44981051471834,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6531348297952932,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":33.109723134326764,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5467344544387954,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4185994857206318,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":57.279747543357495,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47704057138214506,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[316]去除重复字母","frequency":58.441856709621895,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48612125639152665,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6824979280025945,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[318]最大单词长度乘积","frequency":6.963506971653366,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5161342818617194,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[319]灯泡开关","frequency":17.428490500626694,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6717231571462432,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42577260431182884,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[321]拼接最大数","frequency":34.76271017598046,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4427355381892241,"acs":0,"articleLive":2,"columnArticles":1742,"formTitle":"[322]零钱兑换","frequency":81.52720112482412,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6346941387253647,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[323]无向图中连通分量的数目","frequency":35.45004423730976,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3773737751398171,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[324]摆动排序 II","frequency":39.760852262034476,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5381908633137171,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":33.46010126703396,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48948958382416846,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":29.771033702782653,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42463673440562155,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":38.484038991034495,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6568868364190993,"acs":0,"articleLive":2,"columnArticles":1032,"formTitle":"[328]奇偶链表","frequency":62.47748472254345,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48246275778700815,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[329]矩阵中的最长递增路径","frequency":57.35928413646071,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5337764281212399,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":34.09993431777147,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.48004440622993283,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[331]验证二叉树的前序序列化","frequency":56.736847529375176,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44882546338209367,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[332]重新安排行程","frequency":49.11380989222432,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4658214474379292,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[333]最大 BST 子树","frequency":18.064392753020297,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41326848734256144,"acs":0,"articleLive":2,"columnArticles":282,"formTitle":"[334]递增的三元子序列","frequency":5.26556001104653,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36903039073806077,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4010290334435869,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[336]回文对","frequency":35.45004423730976,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6088875592806383,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[337]打家劫舍 III","frequency":71.36698033990172,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7873967432219209,"acs":0,"articleLive":2,"columnArticles":1328,"formTitle":"[338]比特位计数","frequency":71.47695465724897,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8099842590510457,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4946076440593836,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":29.14026595988839,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7268818462348451,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":72.2138139344295,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5154531774510939,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[342]4的幂","frequency":49.11380989222432,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6043092314794795,"acs":0,"articleLive":2,"columnArticles":1001,"formTitle":"[343]整数拆分","frequency":65.31420851029426,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7648680451985915,"acs":0,"articleLive":2,"columnArticles":1832,"formTitle":"[344]反转字符串","frequency":67.83766317393368,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5387057362090207,"acs":0,"articleLive":2,"columnArticles":1011,"formTitle":"[345]反转字符串中的元音字母","frequency":29.588543762120594,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067461033880965,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6221976188079754,"acs":0,"articleLive":2,"columnArticles":1418,"formTitle":"[347]前 K 个高频元素","frequency":79.09764326480774,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6003108405646936,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7381935618593632,"acs":0,"articleLive":2,"columnArticles":1441,"formTitle":"[349]两个数组的交集","frequency":68.91384053792092,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.549501533202162,"acs":0,"articleLive":2,"columnArticles":1303,"formTitle":"[350]两个数组的交集 II","frequency":63.31072996491728,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.589221824686941,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":20.889387652696335,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5930899426493216,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42465183953440033,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":8.228226822398781,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.45079286021968556,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[354]俄罗斯套娃信封问题","frequency":77.30399653736258,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4068386535393738,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[355]设计推特","frequency":37.67835951885494,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.35210280373831776,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5197213267271036,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.732464413199445,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3519796287169377,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7248364970489711,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6072068039391226,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5666975023126735,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.69579945799458,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":6.372954961736547,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4907277923025476,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":56.736847529375176,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7174537987679671,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3638232953037941,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[365]水壶问题","frequency":49.11380989222432,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7647278847952123,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4393087516126129,"acs":0,"articleLive":2,"columnArticles":577,"formTitle":"[367]有效的完全平方数","frequency":5.26556001104653,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.45893191402990463,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[368]最大整除子集","frequency":70.91443908019954,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6166572398190046,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7182539682539683,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":6.372954961736547,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5796050284824835,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":48.53777301997796,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5074638089866517,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":6.963506971653366,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.42629789163455,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[373]查找和最小的K对数字","frequency":43.38639480189253,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5143841361514673,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":34.76271017598046,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4672695951765719,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":35.45004423730976,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4616837648591435,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[376]摆动序列","frequency":32.84174955467916,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5068074744144401,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[377]组合总和 Ⅳ","frequency":60.58697763557225,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6387448411615347,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":57.44981051471834,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6459298477829252,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5020970641102457,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":35.45004423730976,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44312104489378473,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":6.963506971653366,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6272964773301871,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.930054191784617,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5951134380453752,"acs":0,"articleLive":2,"columnArticles":679,"formTitle":"[383]赎金信","frequency":14.582492464688517,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.575427259385504,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[384]打乱数组","frequency":56.69312251423831,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4146114471847371,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[385]迷你语法分析器","frequency":5.807563470645132,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7463483642793988,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[386]字典序排数","frequency":57.35928413646071,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5304738809740326,"acs":0,"articleLive":2,"columnArticles":1137,"formTitle":"[387]字符串中的第一个唯一字符","frequency":62.20056322172292,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5242159955464836,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6922793178787277,"acs":0,"articleLive":2,"columnArticles":965,"formTitle":"[389]找不同","frequency":23.674794572990148,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4665106353686239,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":36.163728225032465,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35551974214343274,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5144375839714552,"acs":0,"articleLive":2,"columnArticles":1525,"formTitle":"[392]判断子序列","frequency":59.08785707350209,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3913803145020384,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":34.76271017598046,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5511751690640404,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[394]字符串解码","frequency":89.09936533575652,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5203346163073297,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":55.33649307787714,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4231165138963776,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37795173874851445,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[397]整数替换","frequency":24.291011183909514,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6530524505588994,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[398]随机数索引","frequency":41.401970095577205,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5924198335989705,"acs":0,"articleLive":2,"columnArticles":516,"formTitle":"[399]除法求值","frequency":29.771033702782653,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4140396931363009,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[400]第 N 位数字","frequency":47.125397060032675,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138004814121423,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":48.47480274903014,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32790108390749073,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[402]移掉 K 位数字","frequency":69.4758125076725,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4561140208480096,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[403]青蛙过河","frequency":69.32278465695163,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.581709897151802,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[404]左叶子之和","frequency":56.69312251423831,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229958479718939,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[405]数字转换为十六进制数","frequency":44.764830556635616,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7355859930223543,"acs":0,"articleLive":2,"columnArticles":766,"formTitle":"[406]根据身高重建队列","frequency":58.76224920270936,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4828777410633824,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":46.42118682622909,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.3248012410316075,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5554832955516742,"acs":0,"articleLive":2,"columnArticles":1277,"formTitle":"[409]最长回文串","frequency":64.88289677120159,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5614912241190336,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[410]分割数组的最大值","frequency":73.80343849580777,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49627079747561675,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6727718229378542,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[412]Fizz Buzz","frequency":30.42470598608389,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6863369295964952,"acs":0,"articleLive":2,"columnArticles":877,"formTitle":"[413]等差数列划分","frequency":35.98273158572954,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3646898769402016,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[414]第三大的数","frequency":38.34734663047714,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5359913694165175,"acs":0,"articleLive":2,"columnArticles":1031,"formTitle":"[415]字符串相加","frequency":89.25800335286367,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5060924101256511,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[416]分割等和子集","frequency":72.79476850288171,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47628835435068423,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[417]太平洋大西洋水流问题","frequency":60.737373108220616,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35921991990248997,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7562483728195782,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":16.22778591339094,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2053440420109661,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":28.530941529954447,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6225551234650677,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[421]数组中两个数的最大异或值","frequency":60.737373108220616,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42650056625141564,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5689971751412429,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5305384124281762,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":65.25796771258382,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6111341919401745,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6678441558441558,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.14026595988839,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6131218235022332,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6492459698387936,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6981172282390694,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[429]N 叉树的层序遍历","frequency":27.941734157085214,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5415480130326586,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[430]扁平化多级双向链表","frequency":30.42470598608389,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7235023041474654,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37748892171344167,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":19.41626647010178,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5329490739113626,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3739694755415549,"acs":0,"articleLive":2,"columnArticles":516,"formTitle":"[434]字符串中的单词数","frequency":29.771033702782653,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5098796092894138,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[435]无重叠区间","frequency":62.80974732746609,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4866097532452345,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":6.372954961736547,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668716692044157,"acs":0,"articleLive":2,"columnArticles":790,"formTitle":"[437]路径总和 III","frequency":52.354871748397315,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5162669157596647,"acs":0,"articleLive":2,"columnArticles":745,"formTitle":"[438]找到字符串中所有字母异位词","frequency":48.914962350977596,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5883336817896717,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.3797750061139643,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[440]字典序的第K小数字","frequency":70.19500082294199,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42606556299475085,"acs":0,"articleLive":2,"columnArticles":453,"formTitle":"[441]排列硬币","frequency":24.291011183909514,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6965655951052969,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[442]数组中重复的数据","frequency":63.43794770404375,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47664878510571157,"acs":0,"articleLive":2,"columnArticles":679,"formTitle":"[443]压缩字符串","frequency":43.16593910808561,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24945397815912637,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[444]序列重建","frequency":18.726320927274806,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5875739688793761,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[445]两数相加 II","frequency":69.44965936288745,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5520236284945608,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":29.51606311911778,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6038841115022797,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6472052880672667,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[448]找到所有数组中消失的数字","frequency":60.70309319357274,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5547423110470628,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":6.372954961736547,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4842204018520288,"acs":0,"articleLive":2,"columnArticles":581,"formTitle":"[450]删除二叉搜索树中的节点","frequency":43.65431636321726,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7111881026902828,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[451]根据字符出现频率排序","frequency":58.76224920270936,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5094044500058655,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.11380989222432,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5541738045386291,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":24.291011183909514,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.599743665268236,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[454]四数相加 II","frequency":56.04850787407274,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774573483329531,"acs":0,"articleLive":2,"columnArticles":1181,"formTitle":"[455]分发饼干","frequency":59.96008737481002,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36238095238095236,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[456]132 模式","frequency":72.76216736281455,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4351864796433509,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":30.47598238866149,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6082474226804123,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":17.428490500626694,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5116874413617477,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[459]重复的子字符串","frequency":54.54542785529277,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4395152952205021,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":64.05345075063177,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8116797348438003,"acs":0,"articleLive":2,"columnArticles":1314,"formTitle":"[461]汉明距离","frequency":58.18918882228352,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6019960615825277,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.34734663047714,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7147576776121118,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[463]岛屿的周长","frequency":38.34734663047714,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3588066745322771,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":39.04091359920645,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5291245204046041,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3734810229679101,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44024563060935284,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.428490500626694,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24882779883101033,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[468]验证IP地址","frequency":52.21496481158871,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.437245696400626,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":24.930054191784617,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5561486588243169,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":64.51258496417711,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6160804020100502,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":13.575321617993685,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4096126255380201,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4200832355138192,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":40.07795678748187,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6096390445746458,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[474]一和零","frequency":65.9434204007798,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32972539587091604,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":30.42470598608389,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012831251903746,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[476]数字的补数","frequency":5.26556001104653,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6037531407035176,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":47.85600744283266,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.436336717428088,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.42470598608389,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41333333333333333,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":11.124797764746551,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4483240223463687,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[480]滑动窗口中位数","frequency":42.82453264747138,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.535231031372156,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.807563470645132,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42550310929576174,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":15.659912964331685,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5894609752297866,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":33.46010126703396,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6405529953917051,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6063032900774709,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[485]最大连续 1 的个数","frequency":49.11380989222432,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5876426253532921,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[486]预测赢家","frequency":38.34734663047714,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5797549524791022,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":37.67835951885494,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38790284913591777,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7197931358721203,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48210078285323404,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[490]迷宫","frequency":7.581194484543051,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5478752844228523,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[491]递增子序列","frequency":50.867893952631206,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.550166345648748,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.372954961736547,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3439776059010043,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":39.04091359920645,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49845582382594855,"acs":0,"articleLive":2,"columnArticles":997,"formTitle":"[494]目标和","frequency":75.22524710492428,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5415683189089956,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[495]提莫攻击","frequency":30.42470598608389,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6872651536297855,"acs":0,"articleLive":2,"columnArticles":994,"formTitle":"[496]下一个更大元素 I","frequency":55.2827641667067,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4033893395133256,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.46033601168736304,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[498]对角线遍历","frequency":58.59199043295871,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3691704198750545,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7082280461097875,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[500]键盘行","frequency":16.816825637076768,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5107397788340602,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[501]二叉搜索树中的众数","frequency":49.607122478670604,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.41712077049803575,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":31.102897961739647,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6337980037655069,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[503]下一个更大元素 II","frequency":67.36517175063132,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5045333980548862,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[504]七进制数","frequency":24.291011183909514,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4832341806381828,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[505]迷宫 II","frequency":18.064392753020297,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5632083941196274,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[506]相对名次","frequency":15.659912964331685,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.40886327677055057,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[507]完美数","frequency":16.816825637076768,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6740278444551128,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":18.064392753020297,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.677507548420355,"acs":0,"articleLive":2,"columnArticles":1387,"formTitle":"[509]斐波那契数","frequency":66.46129006564978,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.61001754044046,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":8.228226822398781,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337841738485011,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":38.34734663047714,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537754222406692,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":5.807563470645132,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308027109370142,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[513]找树左下角的值","frequency":16.22778591339094,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5015030714939224,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":51.16606359912096,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6427584722197306,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[515]在每个树行中找最大值","frequency":36.163728225032465,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6516500532275235,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[516]最长回文子序列","frequency":38.05772606046903,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.43927368927368926,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":5.26556001104653,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6511032270288989,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[518]零钱兑换 II","frequency":70.74172785901666,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39447004608294933,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":19.41626647010178,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.56287555516851,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[520]检测大写字母","frequency":5.26556001104653,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7119716891561412,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.816825637076768,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35913124965547655,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[522]最长特殊序列 II","frequency":16.816825637076768,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27440287881958547,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[523]连续的子数组和","frequency":59.28189539915427,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4732038409046598,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":34.76271017598046,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364814792018022,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[525]连续数组","frequency":68.91384053792092,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344243664052733,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[526]优美的排列","frequency":35.803472924634924,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5744047619047619,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4693489392831017,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":16.816825637076768,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6465186935606381,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":36.90575682048831,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206981946657201,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":17.428490500626694,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6627885503231764,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3722032271609382,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[532]数组中的 k-diff 数对","frequency":17.428490500626694,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5224983210208194,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6759381673955049,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[534]游戏玩法分析 III","frequency":16.816825637076768,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8420332676734515,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[535]TinyURL 的加密与解密","frequency":30.42470598608389,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5347544022242817,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7119643641382771,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[537]复数乘法","frequency":5.807563470645132,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6956663908389611,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":31.102897961739647,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5939041187186209,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[539]最小时间差","frequency":29.771033702782653,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5807540708193332,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[540]有序数组中的单一元素","frequency":47.125397060032675,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6084152443135445,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[541]反转字符串 II","frequency":28.985978522252196,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45935930461813,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[542]01 矩阵","frequency":45.741584789373526,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5488119240473749,"acs":0,"articleLive":2,"columnArticles":1187,"formTitle":"[543]二叉树的直径","frequency":72.0605890182625,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7092539225104066,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4163714574898785,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6308861619464141,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.59353811370971,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6182455464921357,"acs":0,"articleLive":2,"columnArticles":1085,"formTitle":"[547]省份数量","frequency":54.42515709925072,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3575380359612725,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4835245301440078,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4380434782608696,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[550]游戏玩法分析 IV","frequency":29.771033702782653,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5670725709676785,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[551]学生出勤记录 I","frequency":21.08305931498101,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5783562790926778,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":31.381435053098567,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6017849553761156,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[553]最优除法","frequency":5.807563470645132,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5008781372160217,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[554]砖墙","frequency":60.856907792023094,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3419129329520178,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.32499941365480683,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[556]下一个更大元素 III","frequency":53.45721155323836,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7452804665424156,"acs":0,"articleLive":2,"columnArticles":1205,"formTitle":"[557]反转字符串中的单词 III","frequency":59.912667320130666,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5025686448184233,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7270146293082073,"acs":0,"articleLive":2,"columnArticles":537,"formTitle":"[559]N 叉树的最大深度","frequency":32.84174955467916,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4468217923320445,"acs":0,"articleLive":2,"columnArticles":867,"formTitle":"[560]和为K的子数组","frequency":81.88044889805244,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7734874895194387,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[561]数组拆分 I","frequency":24.291011183909514,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4607042612911457,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6045272969374168,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[563]二叉树的坡度","frequency":24.291011183909514,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17871326449563146,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":17.428490500626694,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6099014336917563,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[565]数组嵌套","frequency":16.816825637076768,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.696083802678004,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[566]重塑矩阵","frequency":30.42470598608389,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43039738885977036,"acs":0,"articleLive":2,"columnArticles":979,"formTitle":"[567]字符串的排列","frequency":53.79346824426845,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5031222123104371,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5628876209377326,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":30.42470598608389,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6642192579307252,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":17.428490500626694,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48949644732777264,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":17.428490500626694,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4742859543514923,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[572]另一棵树的子树","frequency":52.21496481158871,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6586345381526104,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":11.87772982056774,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6479136849058681,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6849120673052557,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[575]分糖果","frequency":30.42470598608389,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4694452796151533,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[576]出界的路径数","frequency":26.5490598465837,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7067074725835246,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":17.428490500626694,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49812876281390683,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[578]查询回答率最高的问题","frequency":5.807563470645132,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4135880858924036,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[579]查询员工的累计薪水","frequency":18.064392753020297,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5257474138910992,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[580]统计各专业学生人数","frequency":18.064392753020297,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.404000373787315,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[581]最短无序连续子数组","frequency":32.62838439188263,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4028463270880253,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5821445401190936,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[583]两个字符串的删除操作","frequency":39.44895498449858,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7729477385716018,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5944770768174537,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.749733997871983,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":24.930054191784617,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37940275650842264,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":13.575321617993685,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43121019108280256,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.907085991613243,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7449111076285501,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[589]N 叉树的前序遍历","frequency":39.760852262034476,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7597390377015244,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[590]N 叉树的后序遍历","frequency":16.816825637076768,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33956325004918353,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5216113628015183,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4411764705882353,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.930054191784617,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5156769816931512,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[594]最长和谐子序列","frequency":5.26556001104653,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796340525117815,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":42.732464413199445,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42034521941453384,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":23.674794572990148,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44138026607538805,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":17.428490500626694,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5171018012548068,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[598]范围求和 II","frequency":17.428490500626694,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222911857094198,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[599]两个列表的最小索引总和","frequency":18.064392753020297,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.34307083150022,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[600]不含连续1的非负整数","frequency":16.22778591339094,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4968711301907042,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[601]体育馆的人流量","frequency":54.649100328920476,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6285212739279445,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.428490500626694,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6735667874187798,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":26.283253785386695,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37326444946722637,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.372954961736547,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33505526112716116,"acs":0,"articleLive":2,"columnArticles":1222,"formTitle":"[605]种花问题","frequency":56.04850787407274,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5676971400231443,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[606]根据二叉树创建字符串","frequency":23.674794572990148,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.66476336237344,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.807563470645132,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6589563286454478,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4826127096476381,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[609]在系统中查找重复文件","frequency":6.963506971653366,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6674455363892516,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.807563470645132,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318250942190289,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[611]有效三角形的个数","frequency":51.148903186917536,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6691970802919708,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":5.807563470645132,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8165755783484315,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.807563470645132,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34664338556265223,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":17.428490500626694,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.423581910237707,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[615]平均工资：部门与公司比较","frequency":7.581194484543051,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4607648941033064,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.76271017598046,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7883639971220578,"acs":0,"articleLive":2,"columnArticles":1151,"formTitle":"[617]合并二叉树","frequency":63.67866838029498,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.62058526740666,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":31.102897961739647,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4657991911376824,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.807563470645132,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7725896991489252,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[620]有趣的电影","frequency":37.03233675576518,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5685872462579454,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[621]任务调度器","frequency":63.84816052399774,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.436399904476941,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[622]设计循环队列","frequency":52.92462013337828,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5452626158599382,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[623]在二叉树中增加一行","frequency":5.26556001104653,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4156638390215033,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.34020473986818117,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6829891621574721,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[626]换座位","frequency":43.38639480189253,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8067133609045454,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[627]变更性别","frequency":30.42470598608389,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5251117237474471,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[628]三个数的最大乘积","frequency":33.46010126703396,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4013278855975485,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[629]K个逆序对数组","frequency":26.283253785386695,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3649384831976495,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[630]课程表 III","frequency":7.581194484543051,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28311759845772516,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.596524598620156,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[632]最小区间","frequency":17.428490500626694,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39979553675969454,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[633]平方数之和","frequency":61.90275386169154,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4385790172642762,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5553080920564217,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5476804123711341,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":17.428490500626694,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6892436796874248,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[637]二叉树的层平均值","frequency":22.505133109081772,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5938458227984291,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[638]大礼包","frequency":18.064392753020297,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.3100211928549803,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[639]解码方法 II","frequency":25.59353811370971,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4238297872340426,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[640]求解方程","frequency":25.59353811370971,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5334075723830735,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[641]设计循环双端队列","frequency":27.941734157085214,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.491273432449903,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[642]设计搜索自动补全系统","frequency":10.371865708925363,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45198478551392945,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[643]子数组最大平均数 I","frequency":38.34734663047714,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.39941370465371934,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43572142357958815,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[645]错误的集合","frequency":44.063311649031796,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5744079179922233,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[646]最长数对链","frequency":16.22778591339094,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6558545462740724,"acs":0,"articleLive":2,"columnArticles":875,"formTitle":"[647]回文子串","frequency":61.1029885384346,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5815676439217042,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[648]单词替换","frequency":5.807563470645132,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4813807917568679,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[649]Dota2 参议院","frequency":5.26556001104653,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5350853427255486,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[650]只有两个键的键盘","frequency":16.816825637076768,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5792869817712534,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5704581804497131,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[652]寻找重复的子树","frequency":53.98471396681174,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5947347924293169,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8099102636822433,"acs":0,"articleLive":2,"columnArticles":568,"formTitle":"[654]最大二叉树","frequency":43.83502231730732,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5957087126137841,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[655]输出二叉树","frequency":17.428490500626694,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3070776255707763,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.783210082081462,"acs":0,"articleLive":2,"columnArticles":610,"formTitle":"[657]机器人能否返回原点","frequency":6.372954961736547,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.4524999094891568,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[658]找到 K 个最接近的元素","frequency":35.45004423730976,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5417939191160737,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.64746772591857,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":14.582492464688517,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5597312618097837,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":5.807563470645132,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4054821867321867,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[662]二叉树最大宽度","frequency":56.69312251423831,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4645931685642877,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.655564263322884,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":56.04850787407274,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2700382490437739,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[665]非递减数列","frequency":48.53777301997796,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6200750469043153,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235265816694732,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[667]优美的排列 II","frequency":16.22778591339094,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076327005036807,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":34.76271017598046,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6664711058961572,"acs":0,"articleLive":2,"columnArticles":288,"formTitle":"[669]修剪二叉搜索树","frequency":17.428490500626694,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4494309862049477,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[670]最大交换","frequency":62.67277008545459,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.4867348934228538,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[671]二叉树中第二小的节点","frequency":50.73811637152779,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5521032504780115,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.26556001104653,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3900641654291238,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[673]最长递增子序列的个数","frequency":50.45790163546804,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4913192785643228,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[674]最长连续递增序列","frequency":35.803472924634924,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3996269192136605,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5862379537062056,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6153812768543032,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3513069685670679,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[678]有效的括号字符串","frequency":72.93390911680159,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5410901058922887,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[679]24 点游戏","frequency":68.78125379133088,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015361205709731,"acs":0,"articleLive":2,"columnArticles":788,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":58.441856709621895,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4993882544861338,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6952969372509961,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[682]棒球比赛","frequency":29.771033702782653,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.42763022441836523,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6662050022695266,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[684]冗余连接","frequency":31.102897961739647,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43380362926482985,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":31.102897961739647,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.35478007228762865,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":6.963506971653366,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.43958318378675854,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[687]最长同值路径","frequency":50.45790163546804,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5111125766668865,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[688]“马”在棋盘上的概率","frequency":17.428490500626694,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48483896307934016,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[689]三个无重叠子数组的最大和","frequency":35.45004423730976,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6464675100700473,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[690]员工的重要性","frequency":66.31971846831,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4897840892624257,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.372954961736547,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5805496338450286,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[692]前K个高频单词","frequency":63.67866838029498,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.609184584570091,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":5.807563470645132,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5291888857704182,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[694]不同岛屿的数量","frequency":5.807563470645132,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.662747381333273,"acs":0,"articleLive":2,"columnArticles":1173,"formTitle":"[695]岛屿的最大面积","frequency":67.30523612267085,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6304133551260777,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[696]计数二进制子串","frequency":17.428490500626694,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6057856771026995,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[697]数组的度","frequency":34.09993431777147,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.440994697980028,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[698]划分为k个相等的子集","frequency":59.50246030592042,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4748653500897666,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.758694116459784,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[700]二叉搜索树中的搜索","frequency":28.530941529954447,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7239017889179353,"acs":0,"articleLive":2,"columnArticles":526,"formTitle":"[701]二叉搜索树中的插入操作","frequency":27.941734157085214,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7390195006378714,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5120302665882498,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":32.84174955467916,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5549678642924876,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[704]二分查找","frequency":83.8924307980136,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.647093346825196,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[705]设计哈希集合","frequency":53.83450399408937,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6446490273110238,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[706]设计哈希映射","frequency":44.44989674245616,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31780035456905587,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[707]设计链表","frequency":59.996425625655434,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3353439843495272,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":7.581194484543051,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7597501856138359,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[709]转换成小写字母","frequency":5.807563470645132,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.35004772043168636,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[710]黑名单中的随机数","frequency":25.59353811370971,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5725062866722548,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6718102586083726,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":38.34734663047714,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4045036358523161,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[713]乘积小于K的子数组","frequency":39.21835169013252,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7174653854419304,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.20159261809594,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4032392719986642,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":19.41626647010178,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4591951861602106,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":5.807563470645132,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5104192405897372,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":17.428490500626694,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5643441409831568,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[718]最长重复子数组","frequency":69.56432916066126,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3670112986956332,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":17.428490500626694,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48619639685359045,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[720]词典中最长的单词","frequency":3.764660279105947,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46949028480170346,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[721]账户合并","frequency":44.063311649031796,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.321538667738909,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":34.76271017598046,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7239370995923122,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45689946518474644,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[724]寻找数组的中心下标","frequency":31.102897961739647,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.562768278938155,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":24.291011183909514,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5546614226201257,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[726]原子的数量","frequency":50.45790163546804,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4124337799937675,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":31.102897961739647,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7591279162580674,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5068726183995645,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[729]我的日程安排表 I","frequency":24.930054191784617,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4882887495200307,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":44.360849939711734,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5090267408714538,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":5.807563470645132,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6119721038357225,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[732]我的日程安排表 III","frequency":7.581194484543051,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805930346680414,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[733]图像渲染","frequency":39.760852262034476,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4783366533864542,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4110575139146568,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":34.76271017598046,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4591117917304747,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4615481276702689,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5021757830288923,"acs":0,"articleLive":2,"columnArticles":572,"formTitle":"[738]单调递增的数字","frequency":31.102897961739647,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6777909560617834,"acs":0,"articleLive":2,"columnArticles":1434,"formTitle":"[739]每日温度","frequency":86.38968890809723,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.630944928987745,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[740]删除并获得点数","frequency":62.20056322172292,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3654729988510149,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[741]摘樱桃","frequency":27.749590321116784,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4924114671163575,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5167094867386559,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[743]网络延迟时间","frequency":28.347562565584745,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45897546577691706,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":25.59353811370971,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39131689023510746,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5803505201696495,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[746]使用最小花费爬楼梯","frequency":50.73811637152779,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.41490838293789417,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.807563470645132,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5986523583728475,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5051916932907349,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":19.41626647010178,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7236489076274435,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":24.291011183909514,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083426028921023,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.531816107780117,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[752]打开转盘锁","frequency":40.728474611104645,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5894937917860554,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":18.726320927274806,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4277882379000997,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":17.428490500626694,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5012,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5739921976592978,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":6.963506971653366,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4165046828061495,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":9.620573197727607,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4587732192970734,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":15.659912964331685,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6568181818181819,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":7.581194484543051,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.838611050447696,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5917951702065755,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":10.371865708925363,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6980851235014884,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7628735153570083,"acs":0,"articleLive":2,"columnArticles":933,"formTitle":"[763]划分字母区间","frequency":65.47546471992766,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49118669314796426,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.665635110423407,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[765]情侣牵手","frequency":57.35928413646071,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.708129221042181,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4777613634976254,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[767]重构字符串","frequency":43.57738646747157,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5001058425063506,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":26.283253785386695,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5898896404414382,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[769]最多能完成排序的块","frequency":5.807563470645132,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5516739446870451,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514114222533113,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[771]宝石与石头","frequency":45.084975326461326,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4891041162227603,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":29.348070070457418,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7143172153094975,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":51.90063348103637,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.594847775175644,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4608532583216127,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5708154506437768,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3240862007381831,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":17.428490500626694,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5980817478569935,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.372954961736547,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4358564613540761,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.76271017598046,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2841338618972988,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":20.136455596875148,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6214613504976458,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[781]森林中的兔子","frequency":90.85287914366225,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42071881606765327,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.04556444862114,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958134148359064,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":34.76271017598046,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6841820518022588,"acs":0,"articleLive":2,"columnArticles":436,"formTitle":"[784]字母大小写全排列","frequency":24.291011183909514,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5112187524747248,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[785]判断二分图","frequency":42.10005880880681,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.46174606899788784,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3927307658377361,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[787]K 站中转内最便宜的航班","frequency":33.41523733693393,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.606936609139767,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[788]旋转数字","frequency":18.726320927274806,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6926862150320189,"acs":0,"articleLive":2,"columnArticles":288,"formTitle":"[789]逃脱阻碍者","frequency":21.793607766506067,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44776119402985076,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948776467604919,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[791]自定义字符串排序","frequency":35.45004423730976,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4506797172376292,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.659912964331685,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39497053697402273,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.26556001104653,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407730255280425,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.372954961736547,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.53490345851899,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.523949192232183,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[796]旋转字符串","frequency":44.764830556635616,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7956853823027545,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[797]所有可能的路径","frequency":26.092438151485865,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.458195211786372,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40749007936507936,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":51.90063348103637,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7045918367346938,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.41796522471572106,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[801]使序列递增的最小交换次数","frequency":6.963506971653366,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5770647427378014,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[802]找到最终的安全状态","frequency":25.59353811370971,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4832767232767233,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7696603714009433,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[804]唯一摩尔斯密码词","frequency":24.930054191784617,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28956855448307944,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":6.963506971653366,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6582458999694407,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[806]写字符串需要的行数","frequency":17.428490500626694,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8442800528401585,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[807]保持城市天际线","frequency":5.807563470645132,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4788001804239964,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":27.749590321116784,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4196532830324261,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[809]情感丰富的文字","frequency":18.064392753020297,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366977016147168,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":41.401970095577205,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.703089087064448,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[811]子域名访问计数","frequency":16.816825637076768,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6292175595598016,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5469384373187505,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.963506971653366,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999268889665914,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[814]二叉树剪枝","frequency":5.26556001104653,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43487082375219804,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[815]公交路线","frequency":84.70172920970217,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5112309074573226,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.907085991613243,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5915543575920934,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42941032542206997,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.420838371624345,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":27.00119499144974,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5056894687932637,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[820]单词的压缩编码","frequency":39.760852262034476,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6920339930014409,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[821]字符的最短距离","frequency":30.42470598608389,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5022099447513813,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.43045112781954886,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":10.371865708925363,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6147374746488394,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.807563470645132,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.38989484164022153,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[825]适龄的朋友","frequency":5.807563470645132,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37226202133690667,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.807563470645132,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3927958833619211,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[827]最大人工岛","frequency":31.102897961739647,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4889176508655557,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3608649415101028,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[829]连续整数求和","frequency":30.42470598608389,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.543085982018488,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4033495771018876,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955398708514791,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[832]翻转图像","frequency":47.19723886201828,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42538026944806606,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.807563470645132,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292407108239096,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":19.41626647010178,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.572791372874326,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47758810930096707,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":18.064392753020297,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3969306398975503,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[837]新21点","frequency":17.428490500626694,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5013632009431876,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":4.745347976155885,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5743614811193939,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3587071133100819,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6566981397798106,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[841]钥匙和房间","frequency":17.428490500626694,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48955281486289715,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.732464413199445,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37469862430860873,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":7.581194484543051,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5159286023099253,"acs":0,"articleLive":2,"columnArticles":934,"formTitle":"[844]比较含退格的字符串","frequency":28.530941529954447,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4204583043423709,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[845]数组中的最长山脉","frequency":37.67835951885494,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5110255940382383,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6835400225479143,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":34.31823399656783,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44615625652809693,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42558633073951135,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":6.963506971653366,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44388152766952454,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":27.00119499144974,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4768616396523373,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":6.372954961736547,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7154239785199327,"acs":0,"articleLive":2,"columnArticles":706,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.445965309194115,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38169325540988785,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":36.90575682048831,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3611205432937182,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":6.963506971653366,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4091762056671045,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[855]考场就座","frequency":17.428490500626694,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6250346274090783,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":44.063311649031796,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4646367004994361,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.749590321116784,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5564368517388651,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":26.283253785386695,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30154132960484703,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":5.807563470645132,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5867786625940875,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[860]柠檬水找零","frequency":34.09993431777147,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090179475857769,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[861]翻转矩阵后的得分","frequency":5.807563470645132,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18804387568555758,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[862]和至少为 K 的最短子数组","frequency":47.85600744283266,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.603532753417362,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":56.04850787407274,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45324081375177416,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6537730830610229,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22345531810816593,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.726320927274806,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709241598546776,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[867]转置矩阵","frequency":45.741584789373526,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6241723800195886,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5501986754966888,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.807563470645132,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42407925909972,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.33937321937321935,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[871]最低加油次数","frequency":40.50915741481912,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520698287076004,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[872]叶子相似的树","frequency":54.739389829727806,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5092723669309174,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":34.76271017598046,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41362737959013834,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[874]模拟行走机器人","frequency":38.34734663047714,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47751845156536055,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.942980830049024,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7064604704175733,"acs":0,"articleLive":2,"columnArticles":1530,"formTitle":"[876]链表的中间结点","frequency":45.435769041042015,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567424885808066,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[877]石子游戏","frequency":61.90275386169154,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.27929944693178826,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5559775298678693,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":73.02870918042865,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2520841432335536,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":7.581194484543051,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5390562067929066,"acs":0,"articleLive":2,"columnArticles":553,"formTitle":"[881]救生艇","frequency":43.65431636321726,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48223350253807107,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6858631921824104,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6608412426014779,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[884]两句话中的不常见单词","frequency":5.26556001104653,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6894283476898982,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[885]螺旋矩阵 III","frequency":35.45004423730976,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42283220276594624,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29181902623132006,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[887]鸡蛋掉落","frequency":67.95784815289807,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6396196210546437,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[888]公平的糖果棒交换","frequency":5.26556001104653,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.679986898132984,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":47.85600744283266,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7257723233178164,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3264230077890953,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6388264475622045,"acs":0,"articleLive":2,"columnArticles":676,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7238582140422631,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":6.963506971653366,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7741009829659931,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5402871621621622,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[895]最大频率栈","frequency":24.930054191784617,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5868550257537878,"acs":0,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":16.816825637076768,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7455216854358485,"acs":0,"articleLive":2,"columnArticles":696,"formTitle":"[897]递增顺序搜索树","frequency":58.048454477619046,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3344443020125625,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.59353811370971,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.535030988951765,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":6.963506971653366,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49314857582755967,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5412157812452102,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3255599877262964,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.372954961736547,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5304686052972772,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":15.659912964331685,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45247749470838755,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[904]水果成篮","frequency":35.45004423730976,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7014966121466333,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[905]按奇偶排序数组","frequency":29.771033702782653,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2723231795005883,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[906]超级回文数","frequency":40.20629435267736,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31522770398481975,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":34.76271017598046,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.69817538504232,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":5.807563470645132,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.46139870223503965,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":42.10005880880681,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31739800228594145,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4255835101545923,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5658709349733002,"acs":0,"articleLive":2,"columnArticles":990,"formTitle":"[912]排序数组","frequency":84.64536285383481,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.4026117751217353,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":8.228226822398781,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888585472419443,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[914]卡牌分组","frequency":17.428490500626694,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4682556312205343,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":16.816825637076768,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4391992617306737,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5696950343285965,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[917]仅仅反转字母","frequency":36.163728225032465,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35839233198997933,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[918]环形子数组的最大和","frequency":31.102897961739647,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6262575452716298,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48045295227824214,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7352016954106986,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[921]使括号有效的最少添加","frequency":6.963506971653366,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7143696194384102,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[922]按奇偶排序数组 II","frequency":17.428490500626694,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33747899159663863,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":18.064392753020297,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35958225796770904,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.388277786898703,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5159923568995597,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.428490500626694,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33841494194851085,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":38.484038991034495,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.421601416486327,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6424857128147042,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.544966908184654,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":54.54542785529277,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6602985736457024,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[931]下降路径最小和","frequency":24.291011183909514,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.626769424347279,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[932]漂亮数组","frequency":17.428490500626694,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.723625713743916,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[933]最近的请求次数","frequency":34.76271017598046,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4750809346576519,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[934]最短的桥","frequency":44.764830556635616,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4743217054263566,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3783510369246333,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5881537038939689,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.816825637076768,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8182410926467687,"acs":0,"articleLive":2,"columnArticles":782,"formTitle":"[938]二叉搜索树的范围和","frequency":49.24415123007176,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45028109627547436,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.41143286949981195,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":5.807563470645132,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925288907742342,"acs":0,"articleLive":2,"columnArticles":603,"formTitle":"[941]有效的山脉数组","frequency":5.26556001104653,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.729183240519756,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4742021276595745,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6901865906605243,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4869045965838078,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":30.42470598608389,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6217166642744366,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[946]验证栈序列","frequency":49.774355615112746,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6123975262476629,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39141503848431025,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.36900606283299653,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":34.76271017598046,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.77451781627983,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[950]按递增顺序显示卡牌","frequency":18.064392753020297,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6621817038667086,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":29.771033702782653,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3481490355816461,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5525752424127943,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[953]验证外星语词典","frequency":24.930054191784617,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2991206195038719,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":30.42470598608389,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32721518987341774,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":6.963506971653366,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4350067234424025,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":25.59353811370971,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35956705191707944,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[957]N 天后的牢房","frequency":26.283253785386695,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5369133941177878,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[958]二叉树的完全性检验","frequency":32.84174955467916,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7440932801472845,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":26.283253785386695,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5526999711233035,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":8.907085991613243,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768432416052726,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[961]重复 N 次的元素","frequency":17.428490500626694,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44073234524847427,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[962]最大宽度坡","frequency":18.064392753020297,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5011167512690355,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4256223436551305,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":15.659912964331685,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839689417013427,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[965]单值二叉树","frequency":5.807563470645132,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4022693502634067,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":8.907085991613243,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4585832083958021,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4967143006154167,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[968]监控二叉树","frequency":36.40781675997899,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6520420902443375,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":5.807563470645132,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41447469031962075,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.441654950793332,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":8.228226822398781,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4115702479338843,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":16.816825637076768,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6386294664708762,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[973]最接近原点的 K 个点","frequency":5.26556001104653,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46550024642681126,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":56.04850787407274,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.444760053819704,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":7.581194484543051,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5969915777780297,"acs":0,"articleLive":2,"columnArticles":489,"formTitle":"[976]三角形的最大周长","frequency":25.59353811370971,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7175114556601431,"acs":0,"articleLive":2,"columnArticles":1160,"formTitle":"[977]有序数组的平方","frequency":48.307866271909425,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47349057442646275,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[978]最长湍流子数组","frequency":16.816825637076768,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7121514809345957,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":18.064392753020297,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7329451359581174,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[980]不同路径 III","frequency":31.102897961739647,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5356074669966997,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[981]基于时间的键值存储","frequency":53.66068591558103,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5413800754382072,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6332045559180896,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":47.19723886201828,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41637365770217616,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5990509639814676,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":5.807563470645132,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6761171497584542,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[986]区间列表的交集","frequency":45.942980830049024,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.532006899974007,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":31.102897961739647,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4959756852591884,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47281606479293503,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[989]数组形式的整数加法","frequency":17.428490500626694,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49885729388535627,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[990]等式方程的可满足性","frequency":5.807563470645132,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.517359413202934,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":18.064392753020297,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4513250194855807,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[992]K 个不同整数的子数组","frequency":18.726320927274806,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5573146784486991,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.16606359912096,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5094559030540424,"acs":0,"articleLive":2,"columnArticles":1344,"formTitle":"[994]腐烂的橘子","frequency":38.34734663047714,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402448355011477,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":27.00119499144974,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49618138424821,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":20.889387652696335,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5124304602813249,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[997]找到小镇的法官","frequency":15.659912964331685,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148915187376726,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6914260777693562,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.807563470645132,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.40710940314639127,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":31.80740110724047,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2913068508923431,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":15.659912964331685,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377558089959497,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[1002]查找常用字符","frequency":40.07795678748187,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5760706144817886,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.598627049371978,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[1004]最大连续1的个数 III","frequency":52.48490200701852,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5369113715813284,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":22.505133109081772,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6277610620730959,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[1006]笨阶乘","frequency":51.90063348103637,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46394012700332626,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7262918542957778,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.728474611104645,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5928915039955472,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.807563470645132,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4498454482002194,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6271645545129148,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":68.35893726709502,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.32989575159735457,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":20.889387652696335,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39829901135431506,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":35.45004423730976,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5462422799894214,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[1014]最佳观光组合","frequency":15.111883356183881,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3538634658664666,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":18.726320927274806,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5836598294537912,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5617243631613325,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5166810963388166,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5973023284201532,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.807563470645132,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.536520991897864,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.930054191784617,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834298909060742,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[1021]删除最外层的括号","frequency":30.42470598608389,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.702225010147227,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.807563470645132,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.56505762485385,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.963506971653366,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5599518113759573,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1024]视频拼接","frequency":16.816825637076768,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096338190184049,"acs":0,"articleLive":2,"columnArticles":638,"formTitle":"[1025]除数博弈","frequency":42.10005880880681,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6684473428611073,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4329702698999863,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1027]最长等差数列","frequency":31.80740110724047,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318949412066376,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[1028]从先序遍历还原二叉树","frequency":25.59353811370971,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6530702282116071,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114447260674596,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":6.372954961736547,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5667883211678832,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.372954961736547,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39490550534100244,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.38947216509723276,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.372954961736547,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4317834978125954,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6286337615842175,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1035]不相交的线","frequency":61.5480535682543,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2994831546707504,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":6.372954961736547,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4385009002179475,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7934608468203368,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":5.807563470645132,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5530341662417134,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5227041335776828,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48124306326304106,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.930054191784617,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5275390156062425,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":16.22778591339094,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6904606185181724,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20903999059966316,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":54.649100328920476,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6441987153427108,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1045]买下所有产品的客户","frequency":5.807563470645132,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6594706521516288,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[1046]最后一块石头的重量","frequency":29.771033702782653,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.726017609699769,"acs":0,"articleLive":2,"columnArticles":949,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":76.39968425180939,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45157514377322,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":32.54020985603995,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6423336501135577,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.996425625655434,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7573956020342383,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.807563470645132,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7520177711958533,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1051]高度检查器","frequency":5.807563470645132,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811046619556205,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1052]爱生气的书店老板","frequency":24.930054191784617,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4593014066698277,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":17.428490500626694,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3757679180887372,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":17.428490500626694,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.585578231292517,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4069534767383692,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4614165742354619,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3381731784582893,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35866416766058956,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5296632124352332,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":30.42470598608389,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5994092251760963,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5363651563283732,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6972843450479234,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6507737348389795,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5384615384615384,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47247929858743304,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4200743494423792,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8641493660303748,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.819818409517846,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.807563470645132,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.4833300192218466,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1070]产品销售分析 III","frequency":5.807563470645132,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866231647634584,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":18.064392753020297,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5782522163922562,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":9.620573197727607,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.3377854373115037,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":11.124797764746551,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6700283411240753,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":47.125397060032675,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6958186791715514,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.4969583528310716,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7217506902546272,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6218294878088693,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7352261920934655,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1079]活字印刷","frequency":5.26556001104653,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4894306990151333,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5711002585463947,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":42.10005880880681,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7596669489133503,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1082]销售分析 I ","frequency":6.372954961736547,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527495018042764,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":18.064392753020297,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5383034275873563,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7740026304252521,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6892986867840178,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5305997552019583,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4443458980044346,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5850186561314396,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":5.807563470645132,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5420707358813462,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37776407232467885,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":40.07795678748187,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4884272997032641,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":20.136455596875148,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3847978436657682,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":9.620573197727607,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6174892432295621,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1094]拼车","frequency":23.674794572990148,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3734982125065932,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5549810410203379,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5185660584945447,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":32.54020985603995,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4730795847750865,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1098]小众书籍","frequency":17.428490500626694,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.579528349222278,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6993927125506073,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6671490593342981,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36588658865886586,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6366895346932834,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":17.428490500626694,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610093347321981,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":45.084975326461326,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5558507694010849,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5733990147783251,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1106]解析布尔表达式","frequency":20.136455596875148,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4098360655737705,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":6.372954961736547,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839106712346149,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5091773245765642,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1109]航班预订统计","frequency":40.07795678748187,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6274054215072982,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":18.726320927274806,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7721780706855333,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.930054191784617,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6420824295010846,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":18.064392753020297,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5418569254185692,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6526850073139352,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[1114]按序打印","frequency":82.5485821735094,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5609549679902811,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1115]交替打印FooBar","frequency":56.736847529375176,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5155787599547674,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[1116]打印零与奇偶数","frequency":59.28189539915427,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.521278607906185,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1117]H2O 生成","frequency":43.83502231730732,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.640704945992041,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8664134219689775,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6040413759923021,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":8.228226822398781,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5717367853290184,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7071133435053292,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[1122]数组的相对排序","frequency":51.52992796876882,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7048942159266322,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31534604848296893,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":7.581194484543051,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49073762209498145,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6949025487256372,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":5.807563470645132,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4169410696037243,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448365935468551,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.816825637076768,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.378698971543946,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":7.581194484543051,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6273663234805712,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45235554200335415,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3941813509544787,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":17.428490500626694,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6448149840109639,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7739502137289415,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5348242811501598,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":24.930054191784617,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5667635875643033,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6061932584269663,"acs":0,"articleLive":2,"columnArticles":797,"formTitle":"[1137]第 N 个泰波那契数","frequency":15.820082026549704,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43126489922704614,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1138]字母板上的路径","frequency":6.372954961736547,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.47633104902477597,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.726320927274806,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6546510463602684,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.963506971653366,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5119392382929895,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":5.807563470645132,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37188091550507657,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6327198227481546,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[1143]最长公共子序列","frequency":83.87022781224277,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44192659346428104,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.291011183909514,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4690297692699614,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":36.90575682048831,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28629061306822273,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5557247259439708,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7183112420225822,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44432500223954136,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6072201189832341,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.726320927274806,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48368546068258533,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":16.816825637076768,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.38424678047319555,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":13.575321617993685,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3715761113605748,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5652858979143343,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1154]一年中的第几天","frequency":5.26556001104653,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47968290634187316,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":6.372954961736547,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43349125364431484,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31457744948946337,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":7.581194484543051,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5506116704557756,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4929975951336823,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1159]市场分析 II","frequency":19.41626647010178,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6877151615185098,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[1160]拼写单词","frequency":16.816825637076768,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6336271102284012,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1161]最大层内元素和","frequency":6.372954961736547,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4690609472293855,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[1162]地图分析","frequency":32.54020985603995,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2672787435335788,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":7.581194484543051,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6167251461988305,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":18.726320927274806,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8381059751972942,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.48253968253968255,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4210219545366233,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5705152312899586,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":11.87772982056774,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224676989841207,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1169]查询无效交易","frequency":18.726320927274806,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6172025281670789,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.963506971653366,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4721363396425609,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":5.807563470645132,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2713012075386525,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7571,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6200054734537493,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4881312953440868,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4453691848058045,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":7.581194484543051,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2631000527518903,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":6.963506971653366,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46211798863664805,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6338860217415175,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":53.98471396681174,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7731800766283525,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":8.228226822398781,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.36959837315709204,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3845026178010471,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6009523809523809,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854404751192297,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1184]公交站间的距离","frequency":17.428490500626694,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6102747775477083,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":16.816825637076768,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3915980230642504,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":33.303553453303415,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4375,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6934078212290503,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.644394219137964,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1189]“气球” 的最大数量","frequency":5.26556001104653,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510295570245422,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1190]反转每对括号间的子串","frequency":95.08317233551112,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2679564358255595,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4998100063331222,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6101534828807557,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.807563470645132,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.514094377822769,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.372954961736547,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6357519725059296,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1195]交替打印字符串","frequency":31.102897961739647,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6909241265247054,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.3664925738534356,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.726320927274806,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7473118279569892,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43317132442284323,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6861006164247365,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1200]最小绝对差","frequency":24.291011183909514,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24706082084801154,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5028134742605125,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[1202]交换字符串中的元素","frequency":6.963506971653366,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6241485102178774,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1203]项目管理","frequency":8.907085991613243,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7279544507707263,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":18.726320927274806,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.467496409765438,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1205]每月交易II","frequency":25.59353811370971,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6188512518409426,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1206]设计跳表","frequency":18.726320927274806,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7302898407359778,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49620923291431557,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1208]尽可能使字符串相等","frequency":17.428490500626694,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5327736519212141,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":36.163728225032465,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44823364812871636,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6585695006747638,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":18.064392753020297,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5149042645778938,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.807563470645132,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7724203133441383,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1213]三个有序数组的交集","frequency":19.41626647010178,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6321974148061105,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":8.907085991613243,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40878597706124215,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":15.659912964331685,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5329479768786127,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6946810960165783,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":35.45004423730976,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4213925645872716,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6304878710587725,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":34.76271017598046,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5260723296888141,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8044640735165967,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[1221]分割平衡字符串","frequency":16.816825637076768,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6720338983050848,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4736688548504741,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32529260633742507,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":26.283253785386695,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5448888888888889,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1225]报告系统状态的连续日期","frequency":20.889387652696335,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6001811304672101,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":54.54542785529277,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6620873487799877,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":4.745347976155885,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5388638412984671,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41315068493150686,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.48758263355368947,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5559137618375982,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":20.889387652696335,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4692115108723171,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1232]缀点成线","frequency":16.816825637076768,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48143720110747545,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.963506971653366,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3413059076775891,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.26556001104653,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4513749699350597,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":39.760852262034476,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5596605092361457,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7114389050421955,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6550199026979213,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":7.581194484543051,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4905671229725066,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":41.401970095577205,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4947517157852241,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":34.09993431777147,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5968272972164023,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4631454473787939,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":20.889387652696335,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393641988478771,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6219774314884471,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.620573197727607,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5065227170490328,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":7.581194484543051,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.47961229946524064,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":15.659912964331685,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6149455501314307,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1247]交换字符使得字符串相同","frequency":26.283253785386695,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5587080745341615,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1248]统计「优美子数组」","frequency":24.930054191784617,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5719591457753017,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1249]移除无效的括号","frequency":37.03233675576518,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5604301075268817,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":20.889387652696335,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7715823684745075,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":5.26556001104653,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7494597686538707,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3937827830916384,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":18.726320927274806,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5988941616961992,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.745347976155885,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6765977895242672,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6628216503992902,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5644699140401146,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5643705463182898,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.475482912332838,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":13.575321617993685,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033294774430418,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7287922705314009,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5263914127540886,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":44.063311649031796,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4175060292240034,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":11.124797764746551,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5730861394879556,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":6.963506971653366,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9194869967937299,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1265]逆序打印不可变链表","frequency":7.581194484543051,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236625859466712,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1266]访问所有点的最小时间","frequency":24.291011183909514,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6085962198156992,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.580955334987593,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1268]搜索推荐系统","frequency":6.372954961736547,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49185076092292584,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.125397060032675,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8045732140320977,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":4.745347976155885,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5051764208747095,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5178869943162822,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5408490902604353,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5983554712207464,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5401609164052912,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":17.428490500626694,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.501104797979798,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7241736772855947,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":24.930054191784617,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5956151035322778,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":59.50246030592042,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6211871393239901,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":21.677881642257475,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5053754749009781,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.816825637076768,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8315045564441138,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[1281]整数的各位积和之差","frequency":17.428490500626694,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113516836281675,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[1282]用户分组","frequency":5.807563470645132,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4154244178883824,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":18.064392753020297,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588514225500527,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":20.889387652696335,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8122650840751731,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6445034222656796,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":16.816825637076768,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6055443140428977,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":17.428490500626694,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633497187901333,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1288]删除被覆盖区间","frequency":30.42470598608389,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6288594164456234,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8091270885919135,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5181231761634157,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46903236405454246,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.372954961736547,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3555574872508113,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1293]网格中的最短路径","frequency":56.04850787407274,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6599738982029917,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8095278925796993,"acs":0,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.807563470645132,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4523881590895333,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45859826061536213,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1297]子串的最大出现次数","frequency":27.749590321116784,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5948694245435636,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7853174289701661,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4675567265720241,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":5.807563470645132,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3581624085402423,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.816323885240235,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.930054191784617,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8211382113821138,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7258865496257956,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.26556001104653,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7467358897913026,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.807563470645132,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5768704139311168,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":18.064392753020297,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3314211695040711,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7506384257172901,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":6.372954961736547,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552093023255814,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7123999302176821,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":52.48490200701852,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37646316674844044,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":7.581194484543051,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6659441885667841,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":34.09993431777147,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8310049137681857,"acs":0,"articleLive":2,"columnArticles":537,"formTitle":"[1313]解压缩编码列表","frequency":5.807563470645132,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7354429477585347,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1314]矩阵区域和","frequency":35.45004423730976,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096594587595494,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43717277486910994,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6142519880715706,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6492715807784301,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.44933600006597,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6177459705532543,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[1319]连通网络的操作次数","frequency":6.372954961736547,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5878312070657508,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6169481392915858,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.591783424364759,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7554474770422039,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.930054191784617,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5920875942567917,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7283969010727056,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.807563470645132,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47600349040139617,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":8.907085991613243,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6917835671342686,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45749738135524937,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1328]破坏回文串","frequency":17.428490500626694,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7714481811942348,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.372954961736547,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37658017298735863,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":18.064392753020297,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5353483124941243,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":5.26556001104653,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.683398850922286,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.807563470645132,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5424509411293552,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4886582789971531,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":50.45790163546804,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5820003515556337,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4233375156838143,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7065298229956865,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":14.070640690661609,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401695039088185,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1338]数组大小减半","frequency":5.26556001104653,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39614294945076794,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":7.581194484543051,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5713512782361694,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.48080133555926546,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202979145978153,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.542270636229494,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5935955518945635,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1344]时钟指针的夹角","frequency":6.963506971653366,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36777294876860267,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1345]跳跃游戏 IV","frequency":6.963506971653366,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4360950173812283,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7381602026895342,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3029819487384063,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":8.228226822398781,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5011784511784512,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":6.963506971653366,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8473031683797817,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.807563470645132,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7546993214257858,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.26556001104653,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44138123085491504,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.963506971653366,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28279791933502363,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.54542785529277,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2854081632653061,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6624745700018495,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7317632986891235,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.816825637076768,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5275742916378715,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48645670737306035,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.807563470645132,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5448233612415765,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5037496926481436,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":34.76271017598046,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.401545926427443,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1361]验证二叉树","frequency":5.807563470645132,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5232391482391482,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.36014611020439885,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":36.163728225032465,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6748229233741146,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.807563470645132,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8251265984906702,"acs":0,"articleLive":2,"columnArticles":1075,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.930054191784617,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5364113819863604,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":18.726320927274806,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.416867265158166,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1367]二叉树中的列表","frequency":16.816825637076768,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5184684684684685,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6067169627646629,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":6.963506971653366,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.790605517973206,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799949890036469,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.401970095577205,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5125578967969209,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":6.372954961736547,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39579384972794524,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":31.102897961739647,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7390354786949546,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5712435233160622,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5038571130724859,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32501003613006824,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8619739478957916,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8362747535007042,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274723305103733,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7322633475270226,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6894592476489029,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1382]将二叉搜索树变平衡","frequency":6.963506971653366,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32322062124393597,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.620573197727607,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5434331455677438,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7041127189642041,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1385]两个数组间的距离值","frequency":5.807563470645132,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3099590864363768,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":21.677881642257475,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6946397188049209,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.41626647010178,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5369191166508603,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":56.04850787407274,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8307983079830799,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[1389]按既定顺序创建目标数组","frequency":17.428490500626694,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35074797305013133,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39920703754181636,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":21.677881642257475,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.3994162674156066,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1392]最长快乐前缀","frequency":5.807563470645132,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8572069042815512,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6640196710738472,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7546450171634065,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.807563470645132,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4149717117875345,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1396]设计地铁系统","frequency":19.41626647010178,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.367003367003367,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7710911136107986,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6672091131000814,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6037629562866156,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.26556001104653,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41527472527472525,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":8.228226822398781,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7508513053348468,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":6.372954961736547,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912931409634118,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.816825637076768,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4916154276131917,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.581194484543051,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5059674842589982,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1405]最长快乐字符串","frequency":18.064392753020297,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5685230024213075,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":5.807563470645132,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6676628810520024,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":5.26556001104653,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6139663737103553,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.805032087195681,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4767449466867273,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":8.907085991613243,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5494672754946728,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":81.34897944766095,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5496166950596252,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6917569918372809,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.816825637076768,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6013143483023001,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6846046859955066,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.372954961736547,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.4077465845969074,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":25.25863353297969,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188312225809122,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.372954961736547,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7333085841567194,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1418]点菜展示表","frequency":50.73811637152779,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41793634441251426,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":25.59353811370971,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5928823826350328,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":24.291011183909514,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7481224725592144,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5404959557258407,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1422]分割字符串的最大得分","frequency":30.42470598608389,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5542135289323553,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1423]可获得的最大点数","frequency":16.816825637076768,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39606533036377134,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1424]对角线遍历 II","frequency":18.064392753020297,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43329532497149376,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.963506971653366,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7043206663196252,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6600133067198936,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5915966386554622,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5061845861084682,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.575812274368231,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462125590169118,"acs":0,"articleLive":2,"columnArticles":1022,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.807563470645132,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39212175470008953,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6413884589873977,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4473581973581974,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6207833733013589,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7830441581651649,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5889990557129368,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.372954961736547,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4820462223816785,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":34.932174572439784,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5615671641791045,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6955555555555556,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6467628312646763,"acs":0,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":7.581194484543051,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7917539538202998,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":53.83450399408937,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41036425084491174,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5240663900414938,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8575063613231552,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5727765982543053,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6165769644779333,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7127409496944053,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":5.26556001104653,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275851405156752,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.163728225032465,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8020974748846049,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":16.22778591339094,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5212976324087435,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":7.581194484543051,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4975525976814083,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.581194484543051,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.36243446546615,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4034349506225848,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":18.726320927274806,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6338182215902877,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5189714381438981,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6363561823548705,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4400128400609903,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5960190636389122,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7441988950276243,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.4999557482963094,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4252865119012636,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1462]课程表 IV","frequency":5.807563470645132,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5903859174001355,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":11.124797764746551,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7682497668962613,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1464]数组中两元素的最大乘积","frequency":5.807563470645132,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30760374430595183,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4848006316620608,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":18.726320927274806,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6115830115830115,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7141388174807198,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8035439137134053,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.84335417668751,"acs":0,"articleLive":2,"columnArticles":719,"formTitle":"[1470]重新排列数组","frequency":42.10005880880681,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5411941419451746,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6164383561643836,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.675211044671122,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":47.035965604678836,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7196039603960396,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7241324921135647,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8651403043417563,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":19.41626647010178,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2897913700241441,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":20.136455596875148,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5737853107344633,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":28.530941529954447,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5758346581875994,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":8.228226822398781,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8686529526091772,"acs":0,"articleLive":2,"columnArticles":1263,"formTitle":"[1480]一维数组的动态和","frequency":31.41264864862872,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5121666755023061,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1481]不同整数的最少数目","frequency":17.428490500626694,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.58697943617164,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":50.73811637152779,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3009938476100331,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8028169014084507,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6622666415236659,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585930151594737,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":48.53777301997796,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30768597083779553,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1487]保证文件名唯一","frequency":25.59353811370971,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23524223096756683,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1488]避免洪水泛滥","frequency":59.75540602679932,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6927930114049988,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8552425665101722,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.671396435369441,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6664155005382131,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5663681749742452,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.291011183909514,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3585301837270341,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":28.530941529954447,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5430590313558075,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5385560047075679,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[1496]判断路径是否相交","frequency":4.745347976155885,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3921668104104307,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33238240562595367,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":20.136455596875148,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3767173880927759,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2919563058589871,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5918876755070203,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":24.291011183909514,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7176836174599948,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1502]判断能否形成等差数列","frequency":34.09993431777147,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5113300492610837,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.726320927274806,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5934626316669454,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1504]统计全 1 子矩形","frequency":34.09993431777147,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3585374111274123,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":35.803472924634924,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8401976935749588,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":31.102897961739647,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900216919739696,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1507]转变日期格式","frequency":24.930054191784617,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5518796992481203,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":7.581194484543051,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5438028006017822,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5754873989538755,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1510]石子游戏 IV","frequency":29.771033702782653,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6822313313134913,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.372954961736547,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848570544827891,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[1512]好数对的数目","frequency":4.745347976155885,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3784521684343169,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":6.372954961736547,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31489026153239585,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3404443461921079,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":11.87772982056774,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5804020100502513,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.728558394160584,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6753232089425846,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1518]换酒问题","frequency":24.930054191784617,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29528726793364823,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.33014418541975477,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3952955552161295,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":15.659912964331685,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7050279329608938,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5773550724637682,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42304138950480413,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.816825637076768,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6595579682047306,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.372954961736547,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.612395172836981,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5088973384030419,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7840963855421687,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[1528]重新排列字符串","frequency":16.22778591339094,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886203901129274,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1529]灯泡开关 IV","frequency":5.807563470645132,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5656464626258585,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":18.726320927274806,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3228920050992533,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.677881642257475,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.62075,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":5.807563470645132,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6129032258064516,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7886705093073798,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1534]统计好三元组","frequency":5.807563470645132,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4524918329047056,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.581194484543051,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4381911748603964,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3653326578858494,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5978260869565217,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5373651905538024,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[1539]第 k 个缺失的正整数","frequency":58.048454477619046,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31530263422481397,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4572360375050958,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37936,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5485817742908872,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5432760983004402,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1544]整理字符串","frequency":24.291011183909514,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5524459613196815,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":18.726320927274806,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.40951908775409024,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5323839518006299,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":27.00119499144974,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.712742980561555,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6659824046920821,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":5.807563470645132,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6601482617586912,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.807563470645132,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8172997367431365,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.807563470645132,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5065751192831375,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":18.064392753020297,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29356030822456364,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":59.75540602679932,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7004470938897168,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43535861123800823,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5797869310089443,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1556]千位分隔数","frequency":45.741584789373526,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7613818104275509,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6208476517754868,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":9.620573197727607,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36622073578595316,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":11.124797764746551,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5736773663678051,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.963506971653366,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7794076944367562,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":17.428490500626694,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3094708759448644,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":11.124797764746551,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37790697674418605,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":44.360849939711734,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5857284440039643,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7253229344382159,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.372954961736547,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4459569992989016,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.807563470645132,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39095755182625863,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":22.505133109081772,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4543462381300219,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47193396226415096,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9011060507482108,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7583988563259471,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8049236657822626,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1572]矩阵对角线元素的和","frequency":15.111883356183881,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2954763536668951,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1573]分割字符串的方案数","frequency":6.372954961736547,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3259541436066988,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":35.45004423730976,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.601206980916653,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47630500136649356,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1576]替换所有的问号","frequency":6.372954961736547,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32358282526916593,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.620573197727607,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5793681424711915,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6198440107097125,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":22.505133109081772,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6302083333333334,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8123123123123123,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6712657032895215,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.372954961736547,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6855552650255874,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1583]统计不开心的朋友","frequency":26.710494487800464,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6664802088327739,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[1584]连接所有点的最小费用","frequency":18.726320927274806,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42957356470371055,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6274864376130199,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8248325605358063,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.2952998113362316,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26390815225766684,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":7.581194484543051,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5795763172189028,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4454649138603758,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5274374549572738,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.807563470645132,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.312533870093675,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":6.963506971653366,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.4614415322580645,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7610770279481935,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6609336609336609,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6705666582342524,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.807563470645132,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4185737976782753,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6825977871920372,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":18.064392753020297,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4805813676435549,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7813664596273292,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8449177651469343,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1603]设计停车系统","frequency":61.5480535682543,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4143139305216684,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7347310847766636,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3409433555890588,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5484540361070761,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.639197762466744,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5115393233251176,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":5.807563470645132,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2696933962264151,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6087735004476276,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7345132743362832,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7269736842105263,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8207298530157121,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.26556001104653,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49478260869565216,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27514542271418085,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":7.581194484543051,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6195532771878433,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5915492957746479,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6785575427682737,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.36886894630976325,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":9.620573197727607,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43585780525502316,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14572736520854526,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1622]奇妙序列","frequency":19.41626647010178,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7829172785119922,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.807563470645132,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6278060634112475,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":17.428490500626694,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5395888846593072,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3834771886559803,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":8.228226822398781,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.37744,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8419811320754716,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.52282847079152,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7692553191489362,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":6.372954961736547,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4923627829816504,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":26.283253785386695,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3163741390802044,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6582211665347057,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.963506971653366,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5216216216216216,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5455018200728029,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":7.581194484543051,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7067335361341774,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.807563470645132,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8064212999216914,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7114676486059969,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4007292011932383,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6635428938631251,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1640]能否连接形成数组","frequency":5.807563470645132,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7697415532842914,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":39.760852262034476,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45356800942632003,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":18.064392753020297,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44987520798668884,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5404939689833429,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":19.41626647010178,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4114671163575042,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1645]","frequency":6.372954961736547,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5378731135157533,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[1646]获取生成数组中的最大值","frequency":21.235258538601986,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5116976604679064,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":30.42470598608389,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27706422018348625,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.41626647010178,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47441323585994616,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7935285053929122,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.372954961736547,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6838383838383838,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6604114400401405,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1652]拆炸弹","frequency":17.428490500626694,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5021339220014717,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.807563470645132,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27357601713062096,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1654]到家的最少跳跃次数","frequency":25.59353811370971,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3818105616093881,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7802152317880795,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":5.807563470645132,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4648478488982162,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.372954961736547,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29638243818656745,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4060031595576619,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":29.771033702782653,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7419354838709677,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7319247276328822,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.726320927274806,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8131746810598626,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.816825637076768,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5718150896722325,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.59353811370971,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5442212096106048,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6669315322473844,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.963506971653366,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6823899371069182,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6031164069660861,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.4413632514817951,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7700019787612954,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1669]合并两个链表","frequency":18.064392753020297,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5289191311175085,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":6.372954961736547,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4641228701703864,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":11.87772982056774,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8503390632392367,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[1672]最富有客户的资产总量","frequency":5.807563470645132,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35090514120202754,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":6.372954961736547,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3598793363499246,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":20.889387652696335,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4359245549092191,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7663344407530454,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":10.371865708925363,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.4017036538892625,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300954245167604,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":5.807563470645132,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49453165687076855,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1679]K 和数对的最大数目","frequency":6.372954961736547,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46162009197028653,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.372954961736547,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.37995965030262274,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":14.582492464688517,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5266055045871559,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.894413407821229,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.827420604182804,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1684]统计一致字符串的数目","frequency":24.291011183909514,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.594341230611897,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4696998300925052,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.963506971653366,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39893380719680144,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8042722513089006,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[1688]比赛中的配对次数","frequency":16.816825637076768,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.869314661048457,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":23.674794572990148,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5112456747404844,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1690]石子游戏 VII","frequency":6.372954961736547,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.484472049689441,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6473029045643154,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8028996865203761,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6350295241403265,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4539208718313196,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":5.807563470645132,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39959016393442626,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":23.674794572990148,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5251118846345102,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5420918367346939,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7993874425727412,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7191402251791198,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.807563470645132,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6108251701809729,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1701]平均等待时间","frequency":18.064392753020297,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4768940044665865,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1702]修改后的最大二进制字符串","frequency":20.136455596875148,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889415481832543,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7815953385573639,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3462939698492462,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1705]吃苹果的最大数目","frequency":18.064392753020297,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5851274787535411,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1706]球会落何处","frequency":18.064392753020297,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032295105497344,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1707]与数组中元素的最大异或值","frequency":42.10005880880681,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7029045643153526,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7151548672566371,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6923867651782846,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1710]卡车上的最大单元数","frequency":24.930054191784617,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35925100848937325,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1711]大餐计数","frequency":51.90063348103637,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2650412366487899,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49745506088525226,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":45.741584789373526,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.635593220338983,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7378109452736319,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":18.064392753020297,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6760307718903967,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.43007209062821833,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4867118290776446,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3621853898096992,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693161339277246,"acs":0,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":57.35928413646071,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6490844844201734,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1721]交换链表中的节点","frequency":6.372954961736547,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5135194790861936,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5074867748587824,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.56554290450778,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5568760611205433,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7871321013004792,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.807563470645132,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4754884547069272,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5731497418244407,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":9.620573197727607,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3543673198272999,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6249590566655748,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.963506971653366,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.536663124335813,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47841409691629955,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7921654742509031,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1732]找到最高海拔","frequency":31.80740110724047,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4576809621057409,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":11.87772982056774,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232558744698014,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":55.33649307787714,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.483424047501237,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44913728551627446,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.741584789373526,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3087703834288233,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":21.677881642257475,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6539204955636804,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":43.57738646747157,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4711416681744165,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7006802721088435,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":11.87772982056774,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8438228438228438,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7063346439493229,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.26556001104653,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974670783189465,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":40.728474611104645,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36303890302005193,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":56.78693670707903,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4839291078401923,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5981012658227848,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7055589492974954,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7500725689404935,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":24.930054191784617,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5294208973761838,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.930054191784617,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4579273693534101,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4691011235955056,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":22.505133109081772,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6865827311331297,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6279709507042254,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42066805845511485,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":7.581194484543051,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39768683274021355,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.228226822398781,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8324468085106383,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9231027535258562,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.635362210604929,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42749492802627764,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.807563470645132,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5362827083895333,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.42844916124614857,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":9.620573197727607,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6655844155844156,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6092792046396023,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":6.963506971653366,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47694649847759896,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5595102040816327,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":17.428490500626694,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3756906077348066,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.659912964331685,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7958515283842795,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7693968619548006,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":23.674794572990148,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8549846288976723,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.807563470645132,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36847905951506243,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":11.87772982056774,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36385737439222043,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5342205323193916,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8411301276826949,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":29.771033702782653,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5542999425397434,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":6.372954961736547,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.472920027656142,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":19.41626647010178,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.45957095709570955,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":29.348070070457418,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7779789335088875,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":70.89004258693129,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5627240143369175,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6469410734392593,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.372954961736547,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6614583333333334,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5169270833333334,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":5.807563470645132,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2859631657541065,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7888293802601377,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4211959211959212,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1784]检查二进制字符串字段","frequency":5.807563470645132,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3473507148864592,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3397214367996649,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541361782941406,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":58.18918882228352,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6861924686192469,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7123362445414847,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.651434753490289,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.807563470645132,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8095405429148731,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1791]找出星型图的中心节点","frequency":5.26556001104653,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5140336808340016,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":35.45004423730976,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4118998140654052,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1793]好子数组的最大分数","frequency":19.41626647010178,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6887755102040817,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7921465968586388,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.59353811370971,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48660606548145763,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1796]字符串中第二大的数字","frequency":5.807563470645132,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5732145423192988,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1797]设计一个验证系统","frequency":18.064392753020297,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5190527065527065,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5111585944919278,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":9.620573197727607,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6832659065833027,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1800]最大升序子数组和","frequency":17.428490500626694,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37650288743728105,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26180836707152494,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4101898101898102,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.505133109081772,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5725429017160687,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":10.371865708925363,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.49473445301861096,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.26556001104653,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.663379355687048,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":27.00119499144974,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5840736040609137,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2659835152595233,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":13.575321617993685,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6382477626000942,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":26.283253785386695,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6617647058823529,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":34.09993431777147,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6617790811339198,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":5.807563470645132,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7947992031037013,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5199839325165696,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.59353811370971,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34153533299440775,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.372954961736547,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30067632850241544,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7542861536095948,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1816]截断句子","frequency":5.807563470645132,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6961045245584321,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":6.372954961736547,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37409722017510244,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.42118682622909,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36446469248291574,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.49700598802395207,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.8989854433171592,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.59353811370971,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8127105795148248,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1822]数组元素积的符号","frequency":16.816825637076768,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.707291265871489,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1823]找出游戏的获胜者","frequency":17.428490500626694,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6621432323586062,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28758025237989815,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":13.575321617993685,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.44893617021276594,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7961887477313975,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8698889295740266,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.22778591339094,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6770759403832506,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48213239601640306,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7344064386317908,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8219006905623151,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.930054191784617,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6851631340795428,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[1833]雪糕的最大数量","frequency":30.42470598608389,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.34975582617296164,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.80740110724047,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5083549409392106,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":13.575321617993685,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7117117117117117,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.371865708925363,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7942982456140351,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43088306794700376,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":58.76224920270936,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5793198529411765,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38822560724578015,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":10.371865708925363,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5128393250183418,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":24.930054191784617,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7109375,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5118577075098815,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":5.807563470645132,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8037394905257874,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5790143084260732,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336569278647406,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.401970095577205,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3595469771893444,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":9.620573197727607,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6869350080883052,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3295193122654074,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.581194484543051,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6043605424089338,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":11.124797764746551,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.3991246352646936,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7090909090909091,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6477635782747604,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":8.228226822398781,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7939088456623598,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1854]人口最多的年份","frequency":24.930054191784617,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6912769845029437,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":24.291011183909514,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3554884189325277,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":20.136455596875148,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.44971578487101005,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.656084656084656,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1858]包含所有前缀的最长单词","frequency":13.575321617993685,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7722784347190053,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7731264039207678,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1860]增长的内存泄露","frequency":5.807563470645132,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.61730319563523,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":5.807563470645132,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3107794842074761,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9219731637322578,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.401970095577205,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3860747835697182,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":8.907085991613243,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5168334849863512,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5947603121516165,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.677881642257475,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7642436149312377,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5459459459459459,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":19.41626647010178,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7994265606672749,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1869]哪种连续子字符串更长","frequency":24.291011183909514,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4612319757146471,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.963506971653366,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2759554910498307,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6244314489928525,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7996001999000499,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":34.76271017598046,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.875,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.732739420935412,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7302382241472658,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8195457899483479,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.54542785529277,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42815734989648035,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40570776255707763,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":8.907085991613243,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7742220260428162,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.807563470645132,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3518507226050369,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.276884063713448,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37216970762805013,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6965416463711641,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.76271017598046,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5276967930029155,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5733914209115282,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":18.064392753020297,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6402792413066386,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.963506971653366,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3141348973607038,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":8.228226822398781,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2749932267678136,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":21.677881642257475,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7002938295788442,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5339805825242718,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3556650246305419,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.963506971653366,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.59178636845657,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":43.83502231730732,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.43008096610402086,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5308468872686484,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5027794935145151,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5283035794384139,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.816825637076768,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3073376572634211,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.907085991613243,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6273676756948132,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4251968503937008,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":25.25863353297969,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6556776556776557,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.45588235294117646,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6439386725073802,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.275357385976855,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5730954935622318,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42262747875354106,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":20.889387652696335,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6312056737588653,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6691729323308271,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32736451841918435,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":5.807563470645132,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6769938037177693,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5646535036778939,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":16.816825637076768,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2992216117216117,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8464557564224549,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.26556001104653,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43941955480417016,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.428490500626694,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3894196492228718,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5525252525252525,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":20.136455596875148,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.291044776119403,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4772727272727273,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3942857142857143,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9396298803881742,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3427662750697735,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":17.428490500626694,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3620296465222349,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":6.372954961736547,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2358837287003007,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.59353811370971,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5135135135135135,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.696522309711286,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.42470598608389,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3459482574299765,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.40999010880316517,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.807563470645132,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3930749557348023,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":32.54020985603995,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9390416498180347,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1929]数组串联","frequency":3.764660279105947,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4750542299349241,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.816825637076768,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5523423944476576,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":6.372954961736547,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3239573229873909,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":11.124797764746551,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5734375,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.728,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7424021395575006,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.448585690515807,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.2392188122758071,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":18.726320927274806,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3360578434454574,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":18.064392753020297,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6423529411764706,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8307692307692308,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.772848948374761,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3895418927064497,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4017857142857143,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5653324512074098,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.963506971653366,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6611215159193566,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.26556001104653,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3024841406296318,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.428490500626694,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5373497424155695,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.519163763066202,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.228226822398781,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5403225806451613,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.55,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7339901477832512,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5413533834586466,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1952]三除数","frequency":0.7529320558211894,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31883127307754056,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4809027777777778,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":2.2587961674635686,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4931174089068826,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4311594202898551,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":18.064392753020297,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6080236764222295,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41812656417590277,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4074307304785894,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2772891877909984,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5361070850029841,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":1.5058641116423788,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4235294117647059,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1962]移除石子使总数最小","frequency":8.228226822398781,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6115378822111763,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":3.0117282232847575,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3819256973904101,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.73828125,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.7096774193548387,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7721337351126417,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3497805234921151,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27391952309985096,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":22.505133109081772,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4723630219647598,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":24.291011183909514,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5589123867069486,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4756756756756757,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":22.505133109081772,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4835164835164835,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7453491181444794,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":7.581194484543051,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.37042706260523495,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1975]最大方阵和","frequency":8.907085991613243,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2709053213545266,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.23661222939612608,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.5975609756097561,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8355919583023083,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5757475449630365,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.288268156424581,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":31.102897961739647,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4407979407979408,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1982]从子集的和还原数组","frequency":24.291011183909514,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":1.0,"acs":0,"articleLive":2,"columnArticles":1,"formTitle":"[1983]","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.8444289458111421,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[LCP 01]猜数字","frequency":44.063311649031796,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6875755187811925,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":30.42470598608389,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.217694098592975,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":30.42470598608389,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37473266116712495,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":41.28805866806293,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19578736208625877,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8392733186569088,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[LCP 06]拿硬币","frequency":34.76271017598046,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7702807634149332,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[LCP 07]传递信息","frequency":67.26384596549927,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28176763242610475,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.26603798645238413,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":62.59442833487575,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5800561797752809,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":25.59353811370971,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6836957652689627,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 11]期望个数统计","frequency":7.581194484543051,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4062457197644158,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":38.34734663047714,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6157000198399577,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":11.124797764746551,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2002097281600387,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":39.04091359920645,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.573170731707317,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":12.63066187638893,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2955906369080022,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.797651088818204,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[LCP 17]速算机器人","frequency":34.09993431777147,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.283369411443863,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":34.09993431777147,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5160235969387755,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":32.84174955467916,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29873039581777444,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 20]快速公交","frequency":22.505133109081772,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3216014078310603,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":23.374784255565253,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3317340644276902,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":50.45790163546804,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3333333333333333,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":20.889387652696335,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.26972833117723155,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.32279635258358663,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.33,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.32584573748308526,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":31.102897961739647,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2674551334897584,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[LCP 28]采购方案","frequency":29.771033702782653,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.17108204321549797,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 29]乐团站位","frequency":51.16606359912096,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.33438125178622463,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":5.807563470645132,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.2277723892660847,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":21.677881642257475,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3692927484333035,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":20.889387652696335,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.20006279763462242,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[LCP 33]蓄水","frequency":24.930054191784617,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4579310344827586,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCP 34]二叉树染色","frequency":30.42470598608389,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3700543056633049,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":20.136455596875148,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.23203592814371257,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":42.10005880880681,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1765030336458908,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 37]最小矩形面积","frequency":36.71747478691063,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5226939970717424,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":28.530941529954447,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5355337965887556,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[LCS 01]下载插件","frequency":26.283253785386695,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7018802572983671,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 02]完成一半题目","frequency":18.064392753020297,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41711663066954646,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 03]主题空间","frequency":6.372954961736547,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786756133954359,"acs":0,"articleLive":2,"columnArticles":2675,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.59831625951296,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030840480331428,"acs":0,"articleLive":2,"columnArticles":1974,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":78.79290785846271,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.762229048083502,"acs":0,"articleLive":2,"columnArticles":1840,"formTitle":"[剑指 Offer 05]替换空格","frequency":65.25796771258382,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7522699060597683,"acs":0,"articleLive":2,"columnArticles":1968,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":77.05175962444055,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6957337743838782,"acs":0,"articleLive":2,"columnArticles":1391,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":84.64536285383481,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7172645455697807,"acs":0,"articleLive":2,"columnArticles":1548,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":88.87890426212431,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3481380323427852,"acs":0,"articleLive":2,"columnArticles":1604,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":79.1264331094204,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4414265916087175,"acs":0,"articleLive":2,"columnArticles":1252,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":75.7006762370948,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4935799738206614,"acs":0,"articleLive":2,"columnArticles":1546,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":83.42426070750089,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4533069446124949,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":64.14824538847417,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5248929044816834,"acs":0,"articleLive":2,"columnArticles":1639,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.63350136128794,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5681240243476794,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":67.03770117498674,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3109368267508924,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":39.760852262034476,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7459800232471089,"acs":0,"articleLive":2,"columnArticles":1210,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":54.818731345248665,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33833891783473385,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.803472924634924,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773131435229803,"acs":0,"articleLive":2,"columnArticles":1084,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":64.82458565049252,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5950387197919594,"acs":0,"articleLive":2,"columnArticles":1398,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":58.76224920270936,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3743427970557308,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":57.925095060506884,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23895069276679226,"acs":0,"articleLive":2,"columnArticles":801,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":74.49810126047308,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6424019555135015,"acs":0,"articleLive":2,"columnArticles":1536,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":54.28395242064386,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7897527667969696,"acs":0,"articleLive":2,"columnArticles":2080,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":86.41483905844845,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428177208049683,"acs":0,"articleLive":2,"columnArticles":1740,"formTitle":"[剑指 Offer 24]反转链表","frequency":96.13134867783138,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7289817966490157,"acs":0,"articleLive":2,"columnArticles":1127,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.39795821609289,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4656637273385497,"acs":0,"articleLive":2,"columnArticles":1118,"formTitle":"[剑指 Offer 26]树的子结构","frequency":68.0364486638659,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7908445216307083,"acs":0,"articleLive":2,"columnArticles":1333,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":65.9799742252438,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5800132774224993,"acs":0,"articleLive":2,"columnArticles":1033,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":49.72962061559512,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4396854243394072,"acs":0,"articleLive":2,"columnArticles":1414,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":80.65122015051014,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5738392119360859,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":55.2827641667067,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6137467270394864,"acs":0,"articleLive":2,"columnArticles":870,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.2503116303776,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6460579027794986,"acs":0,"articleLive":2,"columnArticles":891,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":64.47267603405942,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6864287736568155,"acs":0,"articleLive":2,"columnArticles":1017,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.04850787407274,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.588801692591673,"acs":0,"articleLive":2,"columnArticles":1060,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.04850787407274,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5491400426962638,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.1029885384346,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5778223740794179,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":64.16182393814182,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7214931328375224,"acs":0,"articleLive":2,"columnArticles":762,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":58.870197461875904,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6540887826462187,"acs":0,"articleLive":2,"columnArticles":849,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":69.05622880025285,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5585538860498818,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.77253756703023,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5792660357436463,"acs":0,"articleLive":2,"columnArticles":1064,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":92.69571982132561,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.68907191009266,"acs":0,"articleLive":2,"columnArticles":974,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":59.593153239287375,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5692483493534095,"acs":0,"articleLive":2,"columnArticles":1735,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":75.61618299766563,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.579500286786681,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":46.10932713489231,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6055544788785332,"acs":0,"articleLive":2,"columnArticles":1461,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.06794353579926,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4821488015978695,"acs":0,"articleLive":2,"columnArticles":489,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.34187225926457,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41301965890685044,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":48.47480274903014,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5619142935128741,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.09186451526423,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5388056086868417,"acs":0,"articleLive":2,"columnArticles":1362,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":69.63344348602573,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6891470202386866,"acs":0,"articleLive":2,"columnArticles":920,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":54.20371299875111,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4646772597871954,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":71.6097142801842,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6511862976847098,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 49]丑数","frequency":66.08594712174344,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6138756868495909,"acs":0,"articleLive":2,"columnArticles":981,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":65.90085768334743,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4804667912658978,"acs":0,"articleLive":2,"columnArticles":805,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":92.09667280352818,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6473012275432493,"acs":0,"articleLive":2,"columnArticles":1008,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":68.5975493941864,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5399492923870391,"acs":0,"articleLive":2,"columnArticles":1499,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":59.12893312431896,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4473316185465576,"acs":0,"articleLive":2,"columnArticles":1379,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":56.44271913131975,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7550714389596842,"acs":0,"articleLive":2,"columnArticles":1086,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":49.347173684503765,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7889931343595392,"acs":0,"articleLive":2,"columnArticles":1215,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":63.31072996491728,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.586809303698783,"acs":0,"articleLive":2,"columnArticles":881,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.75533587279103,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6997758066088313,"acs":0,"articleLive":2,"columnArticles":975,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":62.976959238994446,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7991199119911991,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":50.867893952631206,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6629982105529015,"acs":0,"articleLive":2,"columnArticles":783,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.14824538847417,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7060011665334515,"acs":0,"articleLive":2,"columnArticles":1795,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":65.6263644384138,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4411491984837583,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.2835653804867,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.85656299083172,"acs":0,"articleLive":2,"columnArticles":1694,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":57.55377452610282,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.4442179271991183,"acs":0,"articleLive":2,"columnArticles":1134,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":77.27448061527734,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4741067136676815,"acs":0,"articleLive":2,"columnArticles":1034,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":52.354871748397315,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5590370758910085,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":58.91582419458652,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45999833152581965,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":63.11057033826264,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6548357792648132,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":73.27772368257747,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.633854113664726,"acs":0,"articleLive":2,"columnArticles":899,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":63.67866838029498,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568403359120117,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":57.20931354427605,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.581678331616158,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.063311649031796,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5974414976599064,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":54.507368817181145,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28445621660780585,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":51.22160730824666,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6931027035267812,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":46.10932713489231,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.699594891380654,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.63261237605511,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.21172442789356719,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[剑指 Offer II 001]整数除法","frequency":16.816825637076768,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5977423400824226,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7920640976726441,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":4.245484252307841,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7052099362497252,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.732943469785575,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6811460258780037,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":16.816825637076768,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4748439937597504,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5279474994342611,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5599513085818625,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44154118689105404,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5754124116260801,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6623609616074633,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6692737430167598,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5228635682158921,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6498237367802585,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5162444113263785,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5375655212580082,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5583788999678353,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.48530973451327436,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":18.726320927274806,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7126925119490175,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5405188553089061,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5224853356506626,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":4.245484252307841,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7159739201303994,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":5.26556001104653,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7765278710543989,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[剑指 Offer II 024]反转链表","frequency":16.816825637076768,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6170311772917636,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":18.726320927274806,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6807885906040269,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 026]重排链表","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6366934438973827,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 027]回文链表","frequency":4.745347976155885,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6038077969174978,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30337078651685395,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5488656195462478,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.6058543226684819,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5987394957983193,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7893175074183977,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5825095057034221,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6989935956084172,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.6045801526717557,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.46938775510204084,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7914244186046512,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5207860922146637,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5793357933579336,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7930555555555555,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8743016759776536,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6591251885369532,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6668887408394404,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7972972972972973,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7293172690763052,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7068811438784629,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":7.581194484543051,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.7089084065244667,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7648601398601399,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6335797254487856,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4308466051969824,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":18.726320927274806,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7698713096139288,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.659308314937454,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8733624454148472,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.9058441558441559,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7467581998474447,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3498419388830348,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5927835051546392,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6355851569933397,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6405622489959839,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5222672064777328,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7003311258278145,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7278617710583153,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.5815085158150851,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5739795918367347,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6523929471032746,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6716417910447762,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5366863905325444,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7406440382941688,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6962142197599261,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.49144254278728605,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.43471400394477316,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5638020833333334,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5489396411092985,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 074]合并区间","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7174757281553398,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6688586190699859,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5517403574788335,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6475349521707138,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8642987249544627,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7777777777777778,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.8019543973941368,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6572302983932671,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8723088344469191,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":7.581194484543051,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.7013422818791947,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8618012422360248,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":5.807563470645132,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7551963048498845,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6261343012704175,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7416879795396419,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6296296296296297,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5236318407960199,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7596899224806202,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6506746626686657,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5336391437308868,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6292134831460674,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6895924308588064,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":36.163728225032465,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5161812297734628,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5310492505353319,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7503201024327785,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6558620689655172,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":24.930054191784617,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7489823609226595,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.46138743455497383,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.56047197640118,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.508869179600887,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":27.00119499144974,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5615141955835962,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6809151113786875,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5526838966202783,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":6.372954961736547,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5696465696465697,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5454545454545454,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5692883895131086,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8467741935483871,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7087378640776699,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5854700854700855,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6053042121684867,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":18.726320927274806,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4273255813953488,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.26214833759590794,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 115]重建序列","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6408125577100646,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6111111111111112,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.688,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.45932584269662924,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":6.963506971653366,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.721103576789689,"acs":0,"articleLive":2,"columnArticles":1471,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.56151217327186,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6505371775417299,"acs":0,"articleLive":2,"columnArticles":1044,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":48.47480274903014,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5796945853169277,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[面试题 01.03]URL化","frequency":40.07795678748187,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510331508559978,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[面试题 01.04]回文排列","frequency":41.401970095577205,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33389470439960817,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[面试题 01.05]一次编辑","frequency":44.44989674245616,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4733833584818455,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[面试题 01.06]字符串压缩","frequency":68.82839795316107,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7551725816659364,"acs":0,"articleLive":2,"columnArticles":938,"formTitle":"[面试题 01.07]旋转矩阵","frequency":56.69312251423831,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6218617404224683,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[面试题 01.08]零矩阵","frequency":40.07795678748187,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5518229495197073,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[面试题 01.09]字符串轮转","frequency":30.42470598608389,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846605064093854,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.01]移除重复节点","frequency":52.48490200701852,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7803238353236489,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":58.048454477619046,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540450170258276,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.898299001050916,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6574585635359116,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 02.04]分割链表","frequency":50.867893952631206,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46677410690303517,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":75.57946189949384,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48263037009970244,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[面试题 02.06]回文链表","frequency":35.803472924634924,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6876233619155476,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 02.07]链表相交","frequency":23.07994375959179,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5305637123123371,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 02.08]环路检测","frequency":48.53777301997796,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5426040268456376,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6123681375128417,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":44.063311649031796,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3871753246753247,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 03.03]堆盘子","frequency":29.771033702782653,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7118595462656131,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":40.728474611104645,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5461705706198465,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.05]栈排序","frequency":16.816825637076768,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5893544998249095,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.06]动物收容所","frequency":31.102897961739647,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5343746955476895,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.01]节点间通路","frequency":34.76271017598046,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.789522385934942,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[面试题 04.02]最小高度树","frequency":52.21496481158871,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.805873499247436,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":40.07795678748187,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5838691998538545,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[面试题 04.04]检查平衡性","frequency":24.291011183909514,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3511938498205229,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":41.401970095577205,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5911633284379589,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":16.816825637076768,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7169716606580568,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.771033702782653,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.478182229256161,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":25.59353811370971,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7176300172889117,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":5.26556001104653,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48882886585831303,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 04.12]求和路径","frequency":34.09993431777147,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5066215673909304,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6850118203309693,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":24.930054191784617,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3917364426011425,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 05.03]翻转数位","frequency":39.04091359920645,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39419054384718605,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5277564717162032,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 05.06]整数转换","frequency":5.807563470645132,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040664115701407,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":17.428490500626694,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5538616183615346,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":24.291011183909514,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36401957027385906,"acs":0,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 08.01]三步问题","frequency":46.56000556894126,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36115956738240984,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":37.67835951885494,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768472122802831,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 08.03]魔术索引","frequency":5.807563470645132,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8224121557454891,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":44.063311649031796,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6793767247761998,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":5.807563470645132,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.655430162685036,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":59.996425625655434,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8131611267382434,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":43.38639480189253,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7175320139697322,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":44.063311649031796,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8113000977517106,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 08.09]括号","frequency":64.08637226713621,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.559082283939969,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":16.816825637076768,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49466282112274024,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":50.45790163546804,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7590604995908937,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 08.12]八皇后","frequency":49.774355615112746,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5016486104569006,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":18.064392753020297,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.533698399326032,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5539525189365055,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":71.43807219507909,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395984492430313,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.5480535682543,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3961920852557021,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":60.445965309194115,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5526671269474379,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.930054191784617,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4561932423986176,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":45.741584789373526,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6300058892815077,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":8.228226822398781,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6672525439407956,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":40.07795678748187,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8328755044595924,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 16.01]交换数字","frequency":31.102897961739647,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7650962540448637,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":6.372954961736547,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44350388176971284,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":7.581194484543051,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.461528212644061,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46410059945012844,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.42470598608389,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42395423919146547,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":31.102897961739647,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7336241140275722,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 16.07]最大数值","frequency":41.401970095577205,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.376005476638713,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":8.228226822398781,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5478765497230282,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6845459001470485,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.10]生存人数","frequency":24.930054191784617,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44115423275010895,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[面试题 16.11]跳水板","frequency":24.291011183909514,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4330819981149859,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5501214574898785,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5029418686749824,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.372954961736547,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45171379332354633,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[面试题 16.16]部分排序","frequency":40.728474611104645,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6012800460241267,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":43.38639480189253,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3442181567138419,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":30.42470598608389,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6092976942465071,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[面试题 16.19]水域大小","frequency":49.774355615112746,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7205217836132662,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 16.20]T9键盘","frequency":30.42470598608389,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4646433364302674,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 16.21]交换和","frequency":5.807563470645132,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5820994475138122,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.581194484543051,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47063387030529824,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 16.24]数对和","frequency":24.291011183909514,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5440924104589153,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.80967539382787,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38646381345087444,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.26]计算器","frequency":60.188772968928596,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5984368614630159,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":24.930054191784617,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6452773321666424,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[面试题 17.04]消失的数字","frequency":41.401970095577205,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38587566394852996,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":18.064392753020297,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44822723609991943,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.807563470645132,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41122138154662474,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":36.163728225032465,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27166547485272585,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.08]马戏团人塔","frequency":39.760852262034476,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5502090335273383,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 17.09]第 k 个数","frequency":56.04850787407274,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5714038278340694,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[面试题 17.10]主要元素","frequency":59.75540602679932,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6862504298275778,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 17.11]单词距离","frequency":35.45004423730976,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.631774992897503,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.807563470645132,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530981539023945,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[面试题 17.13]恢复空格","frequency":31.102897961739647,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5477769481897902,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[面试题 17.14]最小K个数","frequency":72.03269519587371,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4029047478619876,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.15]最长单词","frequency":31.102897961739647,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195506834011206,"acs":0,"articleLive":2,"columnArticles":1120,"formTitle":"[面试题 17.16]按摩师","frequency":56.04850787407274,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424328481836469,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":17.428490500626694,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44694156732460427,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.18]最短超串","frequency":18.726320927274806,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.581865577004368,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":33.46010126703396,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5707727620504973,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":17.428490500626694,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.635199953346649,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.8187898297514,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37112713675213677,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.728474611104645,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3803043867502238,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":6.963506971653366,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5159097568121886,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 17.24]最大子矩阵","frequency":69.44965936288745,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4948905109489051,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":27.749590321116784,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34055015165777636,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":18.064392753020297,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file diff --git a/src/main/java/study/plan/meituan/meituan010/Solution.java b/src/main/java/study/plan/meituan/meituan010/Solution.java new file mode 100644 index 0000000..12af3df --- /dev/null +++ b/src/main/java/study/plan/meituan/meituan010/Solution.java @@ -0,0 +1,91 @@ +package study.plan.meituan.meituan010; + +import java.io.*; +import java.util.StringTokenizer; + +public class Solution { + + static Scanner sc; + static PrintWriter pw; + + public static void main(String[] args) throws IOException { + sc = new Scanner(System.in); + pw = new PrintWriter(System.out); + solve(); + pw.close(); + } + + public static void solve() throws IOException { + int m = sc.nextInt(); + int n = sc.nextInt(); + int[] arr = sc.nextIntArr(n); + int count = 0; + for (int i = 1; i <= m; i++) { + int left = i, right = m + 1; + while (left < right) { + int mid = (right - left) / 2 + left; + boolean bl = true; + int pre = -1; + for (int x : arr) { + if (i > x || mid < x) { + if (x < pre) { + bl = false; + break; + } + pre = x; + } + } + if (bl) { + right = mid; + } else { + left = mid + 1; + } + } + count += m - left + 1; + if (left == m + 1) { + break; + } + } + pw.println(count); + } + + static class Scanner { + BufferedReader br; + StringTokenizer st; + + public Scanner(InputStream s) { + br = new BufferedReader(new InputStreamReader(s)); + } + + public Scanner(FileReader f) { + br = new BufferedReader(f); + } + + public String next() throws IOException { + while (st == null || !st.hasMoreTokens()) + st = new StringTokenizer(br.readLine()); + return st.nextToken(); + } + + public int nextInt() throws IOException { + return Integer.parseInt(next()); + } + + public long nextLong() throws IOException { + return Long.parseLong(next()); + } + + public double nextDouble() throws IOException { + return Double.parseDouble(next()); + } + + public int[] nextIntArr(int n) throws IOException { + int[] arr = new int[n]; + for (int i = 0; i < n; i++) { + arr[i] = Integer.parseInt(next()); + } + return arr; + } + + } +}