From b031bc898080a374802a258b90f40abf7e2a6742 Mon Sep 17 00:00:00 2001 From: huangge1199 Date: Wed, 25 Aug 2021 11:54:31 +0800 Subject: [PATCH] =?UTF-8?q?797:=E6=89=80=E6=9C=89=E5=8F=AF=E8=83=BD?= =?UTF-8?q?=E7=9A=84=E8=B7=AF=E5=BE=84(=E4=BF=AE=E6=94=B9=E7=89=88)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../editor/cn/AllPathsFromSourceToTarget.java | 62 +++++++------------ src/main/java/leetcode/editor/cn/doc/all.json | 2 +- 2 files changed, 24 insertions(+), 40 deletions(-) diff --git a/src/main/java/leetcode/editor/cn/AllPathsFromSourceToTarget.java b/src/main/java/leetcode/editor/cn/AllPathsFromSourceToTarget.java index 612e095..b61e49f 100644 --- a/src/main/java/leetcode/editor/cn/AllPathsFromSourceToTarget.java +++ b/src/main/java/leetcode/editor/cn/AllPathsFromSourceToTarget.java @@ -62,8 +62,9 @@ package leetcode.editor.cn; -import java.util.ArrayList; -import java.util.List; +import javafx.util.Pair; + +import java.util.*; //797:所有可能的路径 class AllPathsFromSourceToTarget { @@ -75,46 +76,29 @@ class AllPathsFromSourceToTarget { //力扣代码 //leetcode submit region begin(Prohibit modification and deletion) class Solution { - // List> result = new ArrayList<>(); -// -// public List> allPathsSourceTarget(int[][] graph) { -// path(graph, 0, new ArrayList<>()); -// return result; -// } -// -// public void path(int[][] graph, int index, List list) { -// list.add(index); -// if (index == graph.length) { -// result.add(new ArrayList<>(list)); -// list.remove(list.size() - 1); -// return; -// } -// for (int i = 0; i < graph[index].length; i++) { -// path(graph, graph[index][i], list); -// } -// list.remove(list.size() - 1); -// } public List> allPathsSourceTarget(int[][] graph) { - return solve(graph, 0); - } - - public List> solve(int[][] graph, int node) { - int N = graph.length; - List> ans = new ArrayList(); - if (node == N - 1) { - List path = new ArrayList(); - path.add(N - 1); - ans.add(path); - return ans; - } - - for (int nei : graph[node]) { - for (List path : solve(graph, nei)) { - path.add(0, node); - ans.add(path); + List> result = new ArrayList<>(); + Queue>> queue = new LinkedList<>(); + queue.add(new Pair<>(0, new ArrayList<>(Collections.singletonList(0)))); + while (!queue.isEmpty()) { + Pair> pair = queue.poll(); + int index = pair.getKey(); + List paths = pair.getValue(); + for (int gr : graph[index]) { + if (paths.contains(gr)) { + continue; + } + paths.add(gr); + if (gr == graph.length - 1) { + result.add(new ArrayList<>(paths)); + paths.remove((Integer) gr); + continue; + } + queue.add(new Pair<>(gr, new ArrayList<>(paths))); + paths.remove((Integer) gr); } } - return ans; + return result; } } //leetcode submit region end(Prohibit modification and deletion) diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json index 87646bf..ae11983 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.37061781210067224,"acs":26683,"articleLive":2,"columnArticles":279,"formTitle":"[787]K 站中转内最便宜的航班","frequency":1.965832545,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"803","status":"","submitted":71996,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.5187109097070021,"acs":2394160,"articleLive":2,"columnArticles":13760,"formTitle":"[1]两数之和","frequency":4.7896758659,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":4615596,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40733147889326016,"acs":957097,"articleLive":2,"columnArticles":6855,"formTitle":"[2]两数相加","frequency":4.7559572299,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":2349676,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37835204528977023,"acs":1171569,"articleLive":2,"columnArticles":7040,"formTitle":"[3]无重复字符的最长子串","frequency":4.6885199579,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":3096505,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40684583058710094,"acs":482712,"articleLive":2,"columnArticles":3594,"formTitle":"[4]寻找两个正序数组的中位数","frequency":4.5465465375,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":1186474,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35193234008617696,"acs":694170,"articleLive":2,"columnArticles":3788,"formTitle":"[5]最长回文子串","frequency":4.5799721092,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":1972453,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.505945386380169,"acs":289336,"articleLive":2,"columnArticles":2334,"formTitle":"[6]Z 字形变换","frequency":3.6478128451,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":571872,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35385073114924226,"acs":799220,"articleLive":2,"columnArticles":5061,"formTitle":"[7]整数反转","frequency":4.7222385939,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":2258636,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21677431348560333,"acs":331162,"articleLive":2,"columnArticles":2586,"formTitle":"[8]字符串转换整数 (atoi)","frequency":3.5986246015,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"","submitted":1527681,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5855351940069334,"acs":736752,"articleLive":2,"columnArticles":4729,"formTitle":"[9]回文数","frequency":3.8010181179,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"","submitted":1258254,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3162768338812196,"acs":195405,"articleLive":2,"columnArticles":1190,"formTitle":"[10]正则表达式匹配","frequency":4.1940067194,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":617829,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6322556464693976,"acs":509452,"articleLive":2,"columnArticles":2882,"formTitle":"[11]盛最多水的容器","frequency":4.0897959801,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":805769,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.665673243495991,"acs":217106,"articleLive":2,"columnArticles":1707,"formTitle":"[12]整数转罗马数字","frequency":3.6189625032,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":326145,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6331807038142273,"acs":447068,"articleLive":2,"columnArticles":3733,"formTitle":"[13]罗马数字转整数","frequency":3.9426431036,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":706067,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.40621658352334106,"acs":594513,"articleLive":2,"columnArticles":3715,"formTitle":"[14]最长公共前缀","frequency":4.2941689847,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"","submitted":1463537,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33218269379140225,"acs":615688,"articleLive":2,"columnArticles":2902,"formTitle":"[15]三数之和","frequency":4.474500365,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":1853462,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45978838726910504,"acs":247871,"articleLive":2,"columnArticles":1360,"formTitle":"[16]最接近的三数之和","frequency":4.1134206925,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"","submitted":539098,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5713778478787997,"acs":320235,"articleLive":2,"columnArticles":2901,"formTitle":"[17]电话号码的字母组合","frequency":3.7760120346,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":560461,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4022598372258286,"acs":210009,"articleLive":2,"columnArticles":1445,"formTitle":"[18]四数之和","frequency":3.3286871282,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"","submitted":522073,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42730983289176,"acs":479172,"articleLive":2,"columnArticles":3601,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":3.7019655499,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":1121369,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44456850128728986,"acs":740608,"articleLive":2,"columnArticles":5300,"formTitle":"[20]有效的括号","frequency":4.4262961504,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":1665903,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6662298666089999,"acs":671619,"articleLive":2,"columnArticles":3269,"formTitle":"[21]合并两个有序链表","frequency":4.0575991702,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":1008089,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724931149509954,"acs":329303,"articleLive":2,"columnArticles":2499,"formTitle":"[22]括号生成","frequency":4.3693331445,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":426286,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5582550774281546,"acs":305739,"articleLive":2,"columnArticles":1998,"formTitle":"[23]合并K个升序链表","frequency":3.9851684687,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":547669,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7021929248997038,"acs":299651,"articleLive":2,"columnArticles":2402,"formTitle":"[24]两两交换链表中的节点","frequency":2.9141310484,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":426736,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6561854943924146,"acs":214259,"articleLive":2,"columnArticles":2058,"formTitle":"[25]K 个一组翻转链表","frequency":4.3529871587,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":326522,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403919695746345,"acs":771690,"articleLive":2,"columnArticles":4321,"formTitle":"[26]删除有序数组中的重复项","frequency":3.845193828,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":1428019,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982561087423124,"acs":455444,"articleLive":2,"columnArticles":3874,"formTitle":"[27]移除元素","frequency":3.5682434085,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":761286,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40717071175845565,"acs":446049,"articleLive":2,"columnArticles":3110,"formTitle":"[28]实现 strStr()","frequency":3.6304357819,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":1095484,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20729674402397932,"acs":104706,"articleLive":2,"columnArticles":857,"formTitle":"[29]两数相除","frequency":3.2591588032,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"","submitted":505102,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35524623148728435,"acs":75390,"articleLive":2,"columnArticles":556,"formTitle":"[30]串联所有单词的子串","frequency":2.8523285071,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"notac","submitted":212219,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3731223831931528,"acs":201404,"articleLive":2,"columnArticles":1645,"formTitle":"[31]下一个排列","frequency":3.8976322423,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":539780,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.35515655488227216,"acs":179467,"articleLive":2,"columnArticles":1245,"formTitle":"[32]最长有效括号","frequency":3.7250612647,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"","submitted":505318,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4251365425506722,"acs":341093,"articleLive":2,"columnArticles":2274,"formTitle":"[33]搜索旋转排序数组","frequency":3.7033230284,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":802314,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42478728054297427,"acs":316814,"articleLive":2,"columnArticles":3069,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":3.460945086,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":745818,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4668087123574761,"acs":467754,"articleLive":2,"columnArticles":3689,"formTitle":"[35]搜索插入位置","frequency":3.4215436103,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":1002025,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282438594186854,"acs":167405,"articleLive":2,"columnArticles":1089,"formTitle":"[36]有效的数独","frequency":2.6024291221,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":266465,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6706471304751913,"acs":95250,"articleLive":2,"columnArticles":809,"formTitle":"[37]解数独","frequency":3.143837199,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"","submitted":142027,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.579271436888359,"acs":208949,"articleLive":2,"columnArticles":2199,"formTitle":"[38]外观数列","frequency":3.0721879832,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"","submitted":360710,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7267194072258281,"acs":313062,"articleLive":2,"columnArticles":1842,"formTitle":"[39]组合总和","frequency":3.4732574799,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":430788,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6289539989440408,"acs":188217,"articleLive":2,"columnArticles":1313,"formTitle":"[40]组合总和 II","frequency":3.4101211405,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":299254,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4182994927272972,"acs":155438,"articleLive":2,"columnArticles":1366,"formTitle":"[41]缺失的第一个正数","frequency":4.1313562483,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":371595,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5735896920585927,"acs":302533,"articleLive":2,"columnArticles":2325,"formTitle":"[42]接雨水","frequency":4.6127677981,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":527438,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4486855128390476,"acs":161385,"articleLive":2,"columnArticles":1080,"formTitle":"[43]字符串相乘","frequency":3.8846974796,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":359684,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3277793528006156,"acs":80932,"articleLive":2,"columnArticles":525,"formTitle":"[44]通配符匹配","frequency":3.1035254128,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"","submitted":246910,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42402655606345413,"acs":180238,"articleLive":2,"columnArticles":1482,"formTitle":"[45]跳跃游戏 II","frequency":4.6548013219,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":425063,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7820966474724269,"acs":393203,"articleLive":2,"columnArticles":2534,"formTitle":"[46]全排列","frequency":4.5594121744,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":502755,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6357980415885945,"acs":201218,"articleLive":2,"columnArticles":1402,"formTitle":"[47]全排列 II","frequency":3.3816454124,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":316481,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7348463500204303,"acs":208617,"articleLive":2,"columnArticles":1782,"formTitle":"[48]旋转图像","frequency":3.4655441697,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":283892,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6635858193340108,"acs":221996,"articleLive":2,"columnArticles":1245,"formTitle":"[49]字母异位词分组","frequency":3.3565751598,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"","submitted":334540,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37672889604502563,"acs":207769,"articleLive":2,"columnArticles":1234,"formTitle":"[50]Pow(x, n)","frequency":3.1815589385,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":551508,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7389338724588799,"acs":145468,"articleLive":2,"columnArticles":1471,"formTitle":"[51]N 皇后","frequency":3.2400289827,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":196862,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8237774030354131,"acs":71321,"articleLive":2,"columnArticles":584,"formTitle":"[52]N皇后 II","frequency":1.3735755286,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"","submitted":86578,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5504420712592739,"acs":627739,"articleLive":2,"columnArticles":3549,"formTitle":"[53]最大子序和","frequency":3.7138582928,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":1140427,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47859330069583433,"acs":179584,"articleLive":2,"columnArticles":1907,"formTitle":"[54]螺旋矩阵","frequency":4.1946367201,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"","submitted":375233,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4317126107742117,"acs":299356,"articleLive":2,"columnArticles":2327,"formTitle":"[55]跳跃游戏","frequency":3.5339989594,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":693415,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4656674926167982,"acs":282086,"articleLive":2,"columnArticles":2187,"formTitle":"[56]合并区间","frequency":4.1146264562,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"","submitted":605767,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4103710149513488,"acs":83000,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":1.9135383063,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"","submitted":202256,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3517912985774128,"acs":212051,"articleLive":2,"columnArticles":2290,"formTitle":"[58]最后一个单词的长度","frequency":2.5522429766,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"","submitted":602775,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7935847975426603,"acs":119102,"articleLive":2,"columnArticles":1485,"formTitle":"[59]螺旋矩阵 II","frequency":3.605686944,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"","submitted":150081,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233548510839792,"acs":87316,"articleLive":2,"columnArticles":912,"formTitle":"[60]排列序列","frequency":1.7246081343,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"","submitted":166839,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4182716366486721,"acs":188899,"articleLive":2,"columnArticles":1920,"formTitle":"[61]旋转链表","frequency":3.5268608792,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":451618,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6594821254490338,"acs":296304,"articleLive":2,"columnArticles":2306,"formTitle":"[62]不同路径","frequency":3.2078972352,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":449298,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3894479232178502,"acs":170910,"articleLive":2,"columnArticles":1621,"formTitle":"[63]不同路径 II","frequency":3.3294511753,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"","submitted":438852,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6876286851514538,"acs":254818,"articleLive":2,"columnArticles":1989,"formTitle":"[64]最小路径和","frequency":3.4475138238,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":370575,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2688947831657855,"acs":44910,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":2.2082675518,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":167017,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.45846566049881093,"acs":333327,"articleLive":2,"columnArticles":3037,"formTitle":"[66]加一","frequency":3.0451544393,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":727049,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5441404519273372,"acs":186675,"articleLive":2,"columnArticles":1715,"formTitle":"[67]二进制求和","frequency":2.7539691869,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"","submitted":343064,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47033908679152897,"acs":19211,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":2.1130515548,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"","submitted":40845,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39295656281642793,"acs":365182,"articleLive":2,"columnArticles":1845,"formTitle":"[69]x 的平方根","frequency":3.7516643146,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"","submitted":929319,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5274079131304764,"acs":536117,"articleLive":2,"columnArticles":3384,"formTitle":"[70]爬楼梯","frequency":4.3026821945,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":1016513,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42145099798161023,"acs":90204,"articleLive":2,"columnArticles":795,"formTitle":"[71]简化路径","frequency":2.5799289603,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":214032,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.612461063844091,"acs":163984,"articleLive":2,"columnArticles":1172,"formTitle":"[72]编辑距离","frequency":4.4440949651,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":267746,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6007847101867899,"acs":124795,"articleLive":2,"columnArticles":911,"formTitle":"[73]矩阵置零","frequency":2.5579452216,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":207720,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45781052245772175,"acs":159883,"articleLive":2,"columnArticles":1614,"formTitle":"[74]搜索二维矩阵","frequency":3.6028559255,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":349234,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.59378193205095,"acs":252197,"articleLive":2,"columnArticles":1763,"formTitle":"[75]颜色分类","frequency":2.2562394756,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"","submitted":424730,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42312067106942397,"acs":170744,"articleLive":2,"columnArticles":1180,"formTitle":"[76]最小覆盖子串","frequency":3.992384707,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"","submitted":403535,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7699102960420262,"acs":202983,"articleLive":2,"columnArticles":1199,"formTitle":"[77]组合","frequency":3.4233705153,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":263645,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8002940369203845,"acs":294493,"articleLive":2,"columnArticles":1939,"formTitle":"[78]子集","frequency":3.6832712664,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":367981,"title":"子集","titleSlug":"subsets"},{"acceptance":0.4568658436501423,"acs":209314,"articleLive":2,"columnArticles":1329,"formTitle":"[79]单词搜索","frequency":3.495044834,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":458152,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6158868054360915,"acs":143206,"articleLive":2,"columnArticles":1290,"formTitle":"[80]删除有序数组中的重复项 II","frequency":3.1940385813,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":232520,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41629079331387636,"acs":119244,"articleLive":2,"columnArticles":956,"formTitle":"[81]搜索旋转排序数组 II","frequency":3.4358559627,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":286444,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5285845220584762,"acs":167824,"articleLive":2,"columnArticles":1610,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":3.787121285,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":317497,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386518433096689,"acs":298941,"articleLive":2,"columnArticles":1841,"formTitle":"[83]删除排序链表中的重复元素","frequency":3.3361621219,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":554980,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4324939823648994,"acs":173389,"articleLive":2,"columnArticles":1100,"formTitle":"[84]柱状图中最大的矩形","frequency":3.8572004214,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":400905,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5162253099185101,"acs":92362,"articleLive":2,"columnArticles":651,"formTitle":"[85]最大矩形","frequency":2.8622148951,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":178918,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6319462777191129,"acs":114903,"articleLive":2,"columnArticles":1059,"formTitle":"[86]分隔链表","frequency":2.7824397943,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":181824,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4893965288977686,"acs":40662,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":3.3192155666,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":83086,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5148527215123636,"acs":432917,"articleLive":2,"columnArticles":3053,"formTitle":"[88]合并两个有序数组","frequency":4.5260631533,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":840856,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7090534927468531,"acs":56162,"articleLive":2,"columnArticles":455,"formTitle":"[89]格雷编码","frequency":2.2082675518,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":79207,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338326317791836,"acs":129949,"articleLive":2,"columnArticles":1152,"formTitle":"[90]子集 II","frequency":3.6022355704,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":205021,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.30416169569712875,"acs":152969,"articleLive":2,"columnArticles":1455,"formTitle":"[91]解码方法","frequency":3.1663012748,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":502920,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5467557436684787,"acs":197644,"articleLive":2,"columnArticles":1936,"formTitle":"[92]反转链表 II","frequency":4.305645745,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":361485,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5368055921324896,"acs":142684,"articleLive":2,"columnArticles":1254,"formTitle":"[93]复原 IP 地址","frequency":3.9399516742,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":265802,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.755988750437411,"acs":524979,"articleLive":2,"columnArticles":2169,"formTitle":"[94]二叉树的中序遍历","frequency":2.9704329312,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":694427,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6986257380363308,"acs":95725,"articleLive":2,"columnArticles":593,"formTitle":"[95]不同的二叉搜索树 II","frequency":2.8732607209,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"","submitted":137019,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993664484331322,"acs":152115,"articleLive":2,"columnArticles":1219,"formTitle":"[96]不同的二叉搜索树","frequency":3.3565751598,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"","submitted":217504,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4571776214147915,"acs":57112,"articleLive":2,"columnArticles":517,"formTitle":"[97]交错字符串","frequency":2.0833522823,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"","submitted":124923,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3482063471902161,"acs":326230,"articleLive":2,"columnArticles":1830,"formTitle":"[98]验证二叉搜索树","frequency":3.4732574799,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":936887,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6158998360081812,"acs":66851,"articleLive":2,"columnArticles":554,"formTitle":"[99]恢复二叉搜索树","frequency":2.6431211744,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"","submitted":108542,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039962581279934,"acs":236958,"articleLive":2,"columnArticles":1798,"formTitle":"[100]相同的树","frequency":2.6522002371,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"","submitted":392317,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5604691165879058,"acs":386759,"articleLive":2,"columnArticles":2145,"formTitle":"[101]对称二叉树","frequency":3.4994938997,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"","submitted":690063,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421633436124791,"acs":372544,"articleLive":2,"columnArticles":2372,"formTitle":"[102]二叉树的层序遍历","frequency":4.1838723535,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":580139,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718301452011438,"acs":164774,"articleLive":2,"columnArticles":1521,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":3.8202124535,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":288152,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.765634285534611,"acs":486997,"articleLive":2,"columnArticles":2424,"formTitle":"[104]二叉树的最大深度","frequency":3.5995429089,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"","submitted":636070,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7033484630473507,"acs":234144,"articleLive":2,"columnArticles":1360,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":3.9341190534,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"","submitted":332899,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211634045178761,"acs":126231,"articleLive":2,"columnArticles":836,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":3.2549908106,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"","submitted":175038,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6950237647839063,"acs":157197,"articleLive":2,"columnArticles":1269,"formTitle":"[107]二叉树的层序遍历 II","frequency":2.9998573535,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"","submitted":226175,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7588803064739293,"acs":182642,"articleLive":2,"columnArticles":1143,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":2.4309436673,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":240673,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7635482127170755,"acs":90398,"articleLive":2,"columnArticles":692,"formTitle":"[109]有序链表转换二叉搜索树","frequency":2.7639219936,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":118392,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5622530511897444,"acs":243333,"articleLive":2,"columnArticles":1393,"formTitle":"[110]平衡二叉树","frequency":3.0721879832,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":432782,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.484038045369936,"acs":255878,"articleLive":2,"columnArticles":1706,"formTitle":"[111]二叉树的最小深度","frequency":1.999551181,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"","submitted":528632,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258607846469886,"acs":250610,"articleLive":2,"columnArticles":1577,"formTitle":"[112]路径总和","frequency":2.7950427221,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"","submitted":476571,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6258021926912791,"acs":166847,"articleLive":2,"columnArticles":1171,"formTitle":"[113]路径总和 II","frequency":3.0478242639,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"","submitted":266613,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7253147938955935,"acs":166298,"articleLive":2,"columnArticles":1236,"formTitle":"[114]二叉树展开为链表","frequency":2.2106567537,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"","submitted":229277,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5256585312921048,"acs":58131,"articleLive":2,"columnArticles":653,"formTitle":"[115]不同的子序列","frequency":3.2198905599,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"","submitted":110587,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7022337407088044,"acs":145776,"articleLive":2,"columnArticles":1095,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":2.4275524541,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":207589,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6093401015228427,"acs":84028,"articleLive":2,"columnArticles":706,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":1.1860873936,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":137900,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7246419123000511,"acs":201049,"articleLive":2,"columnArticles":1643,"formTitle":"[118]杨辉三角","frequency":3.3793396302,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":277446,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6623786312355046,"acs":134802,"articleLive":2,"columnArticles":1154,"formTitle":"[119]杨辉三角 II","frequency":2.6203017861,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":203512,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.678836429702636,"acs":168885,"articleLive":2,"columnArticles":1494,"formTitle":"[120]三角形最小路径和","frequency":2.4797345756,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":248786,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5728005168177123,"acs":528448,"articleLive":2,"columnArticles":3230,"formTitle":"[121]买卖股票的最佳时机","frequency":4.0681743412,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":922569,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.686661228980339,"acs":434397,"articleLive":2,"columnArticles":2530,"formTitle":"[122]买卖股票的最佳时机 II","frequency":3.3996388642,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"","submitted":632622,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5327458236187461,"acs":124532,"articleLive":2,"columnArticles":794,"formTitle":"[123]买卖股票的最佳时机 III","frequency":2.8453281285,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"","submitted":233755,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4426220691015248,"acs":148131,"articleLive":2,"columnArticles":1038,"formTitle":"[124]二叉树中的最大路径和","frequency":3.9962181121,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":334667,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47387879675924105,"acs":265193,"articleLive":2,"columnArticles":1780,"formTitle":"[125]验证回文串","frequency":3.2040732849,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"","submitted":559622,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3934361058350634,"acs":35628,"articleLive":2,"columnArticles":318,"formTitle":"[126]单词接龙 II","frequency":1.965832545,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"","submitted":90556,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4669314087913725,"acs":119110,"articleLive":2,"columnArticles":629,"formTitle":"[127]单词接龙","frequency":2.4032463771,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"","submitted":255091,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5428160899737439,"acs":157535,"articleLive":2,"columnArticles":1034,"formTitle":"[128]最长连续序列","frequency":3.6532541698,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"","submitted":290218,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6794325985255739,"acs":112991,"articleLive":2,"columnArticles":1070,"formTitle":"[129]求根节点到叶节点数字之和","frequency":3.0418274243,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"","submitted":166302,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44162360490867497,"acs":120845,"articleLive":2,"columnArticles":1112,"formTitle":"[130]被围绕的区域","frequency":2.7263149723,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":273638,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7237936581540064,"acs":126433,"articleLive":2,"columnArticles":829,"formTitle":"[131]分割回文串","frequency":4.0308433787,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"","submitted":174681,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4928146603527442,"acs":47976,"articleLive":2,"columnArticles":429,"formTitle":"[132]分割回文串 II","frequency":3.1540284442,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"","submitted":97351,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6753848091211144,"acs":69722,"articleLive":2,"columnArticles":508,"formTitle":"[133]克隆图","frequency":0.2672681876,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":103233,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5759910880778825,"acs":118922,"articleLive":2,"columnArticles":926,"formTitle":"[134]加油站","frequency":3.4845860505,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":206465,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48545359477124184,"acs":92843,"articleLive":2,"columnArticles":741,"formTitle":"[135]分发糖果","frequency":4.1289134692,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"","submitted":191250,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7189567105971567,"acs":471389,"articleLive":2,"columnArticles":2148,"formTitle":"[136]只出现一次的数字","frequency":3.7150689532,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":655657,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194377163915182,"acs":96832,"articleLive":2,"columnArticles":740,"formTitle":"[137]只出现一次的数字 II","frequency":3.5047308099,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":134594,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.658683957084757,"acs":107378,"articleLive":2,"columnArticles":833,"formTitle":"[138]复制带随机指针的链表","frequency":3.2327312782,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":163019,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5122151632362667,"acs":178906,"articleLive":2,"columnArticles":1137,"formTitle":"[139]单词拆分","frequency":3.7420396012,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":349279,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48124198778372673,"acs":51054,"articleLive":2,"columnArticles":516,"formTitle":"[140]单词拆分 II","frequency":1.999551181,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"","submitted":106088,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5121513785940497,"acs":496309,"articleLive":2,"columnArticles":2589,"formTitle":"[141]环形链表","frequency":3.7177703252,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":969067,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5512528972315895,"acs":277079,"articleLive":2,"columnArticles":1628,"formTitle":"[142]环形链表 II","frequency":3.4121244265,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":502635,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6163691195477424,"acs":117316,"articleLive":2,"columnArticles":1025,"formTitle":"[143]重排链表","frequency":4.401063525,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":190334,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7023617199922048,"acs":385631,"articleLive":2,"columnArticles":1744,"formTitle":"[144]二叉树的前序遍历","frequency":2.6086583134,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":549049,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7491113269782982,"acs":280704,"articleLive":2,"columnArticles":1474,"formTitle":"[145]二叉树的后序遍历","frequency":3.1841058994,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":374716,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5264666352821799,"acs":215835,"articleLive":2,"columnArticles":1314,"formTitle":"[146]LRU 缓存机制","frequency":4.420008008,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"","submitted":409969,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6804034277250767,"acs":96471,"articleLive":2,"columnArticles":759,"formTitle":"[147]对链表进行插入排序","frequency":2.2775713425,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":141785,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675640431009565,"acs":198623,"articleLive":2,"columnArticles":1193,"formTitle":"[148]排序链表","frequency":3.7897832328,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":297534,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33551491964030183,"acs":44549,"articleLive":2,"columnArticles":490,"formTitle":"[149]直线上最多的点数","frequency":3.1035254128,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":132778,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.536839430894309,"acs":126780,"articleLive":2,"columnArticles":1004,"formTitle":"[150]逆波兰表达式求值","frequency":3.3251457973,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":236160,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.47939809320060456,"acs":159548,"articleLive":2,"columnArticles":1360,"formTitle":"[151]翻转字符串里的单词","frequency":2.9560483333,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"","submitted":332809,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42005726156158074,"acs":171070,"articleLive":2,"columnArticles":1166,"formTitle":"[152]乘积最大子数组","frequency":3.5736790908,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"","submitted":407254,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5652964930924549,"acs":199479,"articleLive":2,"columnArticles":1415,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":2.6981077674,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":352875,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5318955443535572,"acs":108787,"articleLive":2,"columnArticles":861,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":3.0302002876,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":204527,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5721204191217506,"acs":273719,"articleLive":2,"columnArticles":1530,"formTitle":"[155]最小栈","frequency":3.2599516611,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":478429,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7261199336335624,"acs":6127,"articleLive":2,"columnArticles":105,"formTitle":"[156]上下翻转二叉树","frequency":0.7903397577,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"","submitted":8438,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.530234002899151,"acs":5121,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"","submitted":9658,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5886348200135839,"acs":2600,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":0.4169793485,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"","submitted":4417,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5398064080438209,"acs":14388,"articleLive":2,"columnArticles":179,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":2.0616829621,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"","submitted":26654,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6114318158476585,"acs":315530,"articleLive":2,"columnArticles":1871,"formTitle":"[160]相交链表","frequency":3.555444053,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":516051,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33650288069698814,"acs":7184,"articleLive":2,"columnArticles":98,"formTitle":"[161]相隔为 1 的编辑距离","frequency":0.294577367,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"","submitted":21349,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4943163255903566,"acs":118020,"articleLive":2,"columnArticles":690,"formTitle":"[162]寻找峰值","frequency":2.8871600648,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":238754,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32265861027190335,"acs":8544,"articleLive":2,"columnArticles":134,"formTitle":"[163]缺失的区间","frequency":0.819884004,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"","submitted":26480,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6107820853475046,"acs":57237,"articleLive":2,"columnArticles":482,"formTitle":"[164]最大间距","frequency":2.877236395,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"","submitted":93711,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.4852413076359182,"acs":52293,"articleLive":2,"columnArticles":518,"formTitle":"[165]比较版本号","frequency":3.8692627648,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"","submitted":107767,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.298093121197941,"acs":25481,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":2.4881149225,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"","submitted":85480,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863476091349469,"acs":269561,"articleLive":2,"columnArticles":1762,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":2.7845059108,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":459729,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325945827334664,"acs":80829,"articleLive":2,"columnArticles":733,"formTitle":"[168]Excel表列名称","frequency":2.9863720636,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":186847,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.664107642548243,"acs":365485,"articleLive":2,"columnArticles":2085,"formTitle":"[169]多数元素","frequency":3.4005963518,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"","submitted":550340,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41649015859895644,"acs":8062,"articleLive":2,"columnArticles":79,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":0.2672681876,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"","submitted":19357,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7172240062008637,"acs":103636,"articleLive":2,"columnArticles":891,"formTitle":"[171]Excel 表列序号","frequency":1.0478387687,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":144496,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.437158497464383,"acs":86807,"articleLive":2,"columnArticles":566,"formTitle":"[172]阶乘后的零","frequency":2.2775713425,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"","submitted":198571,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8029397137647124,"acs":72654,"articleLive":2,"columnArticles":609,"formTitle":"[173]二叉搜索树迭代器","frequency":2.3331103228,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":90485,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4795574481425362,"acs":36713,"articleLive":2,"columnArticles":394,"formTitle":"[174]地下城游戏","frequency":3.0599299234,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"","submitted":76556,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7397468160392422,"acs":289548,"articleLive":2,"columnArticles":1420,"formTitle":"[175]组合两个表","frequency":4.5060832671,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"","submitted":391415,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35615455250559425,"acs":239697,"articleLive":2,"columnArticles":973,"formTitle":"[176]第二高的薪水","frequency":4.5395984683,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"","submitted":673014,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4617376459400314,"acs":120900,"articleLive":2,"columnArticles":462,"formTitle":"[177]第N高的薪水","frequency":3.6946373623,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"","submitted":261837,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6013986387865632,"acs":112485,"articleLive":2,"columnArticles":638,"formTitle":"[178]分数排名","frequency":3.3565751598,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"","submitted":187039,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40977594712935594,"acs":115204,"articleLive":2,"columnArticles":930,"formTitle":"[179]最大数","frequency":3.943016341,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":281139,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48700411206105965,"acs":82311,"articleLive":2,"columnArticles":473,"formTitle":"[180]连续出现的数字","frequency":3.5268608792,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"","submitted":169015,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7032205240174673,"acs":154596,"articleLive":2,"columnArticles":639,"formTitle":"[181]超过经理收入的员工","frequency":3.411609679,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"","submitted":219840,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971435981031417,"acs":172132,"articleLive":2,"columnArticles":551,"formTitle":"[182]查找重复的电子邮箱","frequency":2.9998573535,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"","submitted":215936,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6776672801898592,"acs":142487,"articleLive":2,"columnArticles":522,"formTitle":"[183]从不订购的客户","frequency":2.1851695506,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"","submitted":210261,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47403571743799466,"acs":96672,"articleLive":2,"columnArticles":633,"formTitle":"[184]部门工资最高的员工","frequency":3.6723249686,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"","submitted":203934,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49196895202010893,"acs":66741,"articleLive":2,"columnArticles":596,"formTitle":"[185]部门工资前三高的所有员工","frequency":3.6502990325,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"","submitted":135661,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7530309364548495,"acs":7205,"articleLive":2,"columnArticles":105,"formTitle":"[186]翻转字符串里的单词 II","frequency":0.294577367,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"","submitted":9568,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4818977628877121,"acs":40131,"articleLive":2,"columnArticles":265,"formTitle":"[187]重复的DNA序列","frequency":1.6451472448,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"","submitted":83277,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38813119124778783,"acs":84436,"articleLive":2,"columnArticles":661,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":2.3921128842,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"","submitted":217545,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4532036411876076,"acs":316691,"articleLive":2,"columnArticles":1571,"formTitle":"[189]旋转数组","frequency":3.028334128,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":698783,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6951228257931408,"acs":126007,"articleLive":2,"columnArticles":795,"formTitle":"[190]颠倒二进制位","frequency":2.4275524541,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":181273,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7470055219649675,"acs":182356,"articleLive":2,"columnArticles":1154,"formTitle":"[191]位1的个数","frequency":2.9560483333,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":244116,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35522692503824577,"acs":20898,"articleLive":2,"columnArticles":167,"formTitle":"[192]统计词频","frequency":2.7698804216,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"","submitted":58830,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3236210136161231,"acs":25146,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":1.9018808982,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"","submitted":77702,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3448875291172687,"acs":9920,"articleLive":2,"columnArticles":67,"formTitle":"[194]转置文件","frequency":1.4356157319,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"","submitted":28763,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4358245329000812,"acs":34336,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":2.5425460877,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"","submitted":78784,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6647215439583937,"acs":96370,"articleLive":2,"columnArticles":363,"formTitle":"[196]删除重复的电子邮箱","frequency":2.9102317999,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"","submitted":144978,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334614305917735,"acs":89398,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":2.7639219936,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"","submitted":167581,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5104895302733035,"acs":360887,"articleLive":2,"columnArticles":2522,"formTitle":"[198]打家劫舍","frequency":3.8395626012,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":706943,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6519801488833747,"acs":131374,"articleLive":2,"columnArticles":1507,"formTitle":"[199]二叉树的右视图","frequency":3.9476312205,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":201500,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5506201944001161,"acs":303634,"articleLive":2,"columnArticles":2019,"formTitle":"[200]岛屿数量","frequency":4.256761165,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":551440,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5219341919529036,"acs":47698,"articleLive":2,"columnArticles":312,"formTitle":"[201]数字范围按位与","frequency":1.754773301,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":91387,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6178383638678508,"acs":160625,"articleLive":2,"columnArticles":1319,"formTitle":"[202]快乐数","frequency":2.6994323937,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":259979,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5126158763231644,"acs":217486,"articleLive":2,"columnArticles":1556,"formTitle":"[203]移除链表元素","frequency":2.7668063337,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":424267,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37946185469188576,"acs":162363,"articleLive":2,"columnArticles":707,"formTitle":"[204]计数质数","frequency":2.6100480904,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"","submitted":427877,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010397010058076,"acs":109393,"articleLive":2,"columnArticles":845,"formTitle":"[205]同构字符串","frequency":2.3383249146,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":218332,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7218974572265396,"acs":661292,"articleLive":2,"columnArticles":7154,"formTitle":"[206]反转链表","frequency":4.6417515419,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":916047,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5452679626953895,"acs":132836,"articleLive":2,"columnArticles":886,"formTitle":"[207]课程表","frequency":3.3861368749,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"","submitted":243616,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7162201200712234,"acs":136359,"articleLive":2,"columnArticles":921,"formTitle":"[208]实现 Trie (前缀树)","frequency":3.1156806615,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":190387,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.46861663729590863,"acs":176571,"articleLive":2,"columnArticles":1258,"formTitle":"[209]长度最小的子数组","frequency":2.7497701465,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":376792,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5410997530320021,"acs":83476,"articleLive":2,"columnArticles":645,"formTitle":"[210]课程表 II","frequency":2.3331103228,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"","submitted":154271,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4814074370251899,"acs":27692,"articleLive":2,"columnArticles":303,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":1.6451472448,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"","submitted":57523,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4512674849806693,"acs":40036,"articleLive":2,"columnArticles":387,"formTitle":"[212]单词搜索 II","frequency":1.999551181,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"","submitted":88719,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4319272013033828,"acs":152174,"articleLive":2,"columnArticles":1426,"formTitle":"[213]打家劫舍 II","frequency":3.4773281523,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":352314,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3706406739811912,"acs":30268,"articleLive":2,"columnArticles":297,"formTitle":"[214]最短回文串","frequency":2.8043576793,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"","submitted":81664,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6470376883946976,"acs":410592,"articleLive":2,"columnArticles":2177,"formTitle":"[215]数组中的第K个最大元素","frequency":4.3004495523,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":634572,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7398021509497233,"acs":92658,"articleLive":2,"columnArticles":976,"formTitle":"[216]组合总和 III","frequency":3.0123853919,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"","submitted":125247,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614784870546907,"acs":335014,"articleLive":2,"columnArticles":1551,"formTitle":"[217]存在重复元素","frequency":3.1403032768,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":596664,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422033532417069,"acs":30140,"articleLive":2,"columnArticles":264,"formTitle":"[218]天际线问题","frequency":2.9560483333,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":55588,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42533214592257385,"acs":105550,"articleLive":2,"columnArticles":836,"formTitle":"[219]存在重复元素 II","frequency":2.2775713425,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"","submitted":248159,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28702187551745073,"acs":62402,"articleLive":2,"columnArticles":411,"formTitle":"[220]存在重复元素 III","frequency":3.0302002876,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":217412,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4718902715959669,"acs":129876,"articleLive":2,"columnArticles":939,"formTitle":"[221]最大正方形","frequency":3.56599657,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"","submitted":275225,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7796805835900704,"acs":110087,"articleLive":2,"columnArticles":846,"formTitle":"[222]完全二叉树的节点个数","frequency":1.9333017954,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"","submitted":141195,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4595414462081129,"acs":19542,"articleLive":2,"columnArticles":246,"formTitle":"[223]矩形面积","frequency":2.3446205788,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"","submitted":42525,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4175807849449053,"acs":67456,"articleLive":2,"columnArticles":632,"formTitle":"[224]基本计算器","frequency":4.3362263074,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":161540,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754835912133935,"acs":127738,"articleLive":2,"columnArticles":4713,"formTitle":"[225]用队列实现栈","frequency":2.6431211744,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":189106,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7873310908694561,"acs":285328,"articleLive":2,"columnArticles":1766,"formTitle":"[226]翻转二叉树","frequency":3.6759285761,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":362399,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4367919573861505,"acs":81508,"articleLive":2,"columnArticles":681,"formTitle":"[227]基本计算器 II","frequency":3.6946373623,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":186606,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.581645395474845,"acs":54962,"articleLive":2,"columnArticles":619,"formTitle":"[228]汇总区间","frequency":0.7618883365,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"","submitted":94494,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4629100240662687,"acs":34815,"articleLive":2,"columnArticles":299,"formTitle":"[229]求众数 II","frequency":1.754773301,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"","submitted":75209,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7401614789877607,"acs":129717,"articleLive":2,"columnArticles":803,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":1.8865643176,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":175255,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5034432410395143,"acs":159298,"articleLive":2,"columnArticles":1158,"formTitle":"[231]2 的幂","frequency":2.1932043038,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":316417,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6907449314611118,"acs":148955,"articleLive":2,"columnArticles":1199,"formTitle":"[232]用栈实现队列","frequency":3.2169955874,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":215644,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47589659488153296,"acs":33081,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":2.0616829621,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":69513,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4919062043752699,"acs":292787,"articleLive":2,"columnArticles":1890,"formTitle":"[234]回文链表","frequency":3.6507616849,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":595209,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.665658759739672,"acs":161807,"articleLive":2,"columnArticles":926,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":2.3748770215,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"","submitted":243078,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6791420472973926,"acs":240800,"articleLive":2,"columnArticles":1308,"formTitle":"[236]二叉树的最近公共祖先","frequency":3.5501257402,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"","submitted":354565,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8479640980735552,"acs":201422,"articleLive":2,"columnArticles":993,"formTitle":"[237]删除链表中的节点","frequency":2.6230184409,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":237536,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7224631110378369,"acs":131463,"articleLive":2,"columnArticles":829,"formTitle":"[238]除自身以外数组的乘积","frequency":2.6478206521,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"","submitted":181965,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4961030820703287,"acs":180457,"articleLive":2,"columnArticles":1259,"formTitle":"[239]滑动窗口最大值","frequency":3.4318363415,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":363749,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47349449704426394,"acs":157632,"articleLive":2,"columnArticles":707,"formTitle":"[240]搜索二维矩阵 II","frequency":3.0563998435,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"","submitted":332912,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.736870897155361,"acs":29634,"articleLive":2,"columnArticles":267,"formTitle":"[241]为运算表达式设计优先级","frequency":2.5011532569,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"","submitted":40216,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6434515998018588,"acs":274084,"articleLive":2,"columnArticles":1582,"formTitle":"[242]有效的字母异位词","frequency":2.6732802757,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":425959,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6565934065934066,"acs":8365,"articleLive":2,"columnArticles":96,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"","submitted":12740,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5478485774747237,"acs":4660,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"","submitted":8506,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6105404198302814,"acs":4101,"articleLive":2,"columnArticles":55,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"","submitted":6717,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4741969457609268,"acs":5403,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"","submitted":11394,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5205913410770855,"acs":4930,"articleLive":2,"columnArticles":88,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"","submitted":9470,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4659111679766039,"acs":2549,"articleLive":2,"columnArticles":50,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"","submitted":5471,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6373626373626373,"acs":5394,"articleLive":2,"columnArticles":94,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"","submitted":8463,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6345723242274967,"acs":4251,"articleLive":2,"columnArticles":72,"formTitle":"[250]统计同值子树","frequency":0.294577367,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"","submitted":6699,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5415673183913527,"acs":3407,"articleLive":2,"columnArticles":65,"formTitle":"[251]展开二维向量","frequency":0.7903397577,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"","submitted":6291,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5611837785970406,"acs":11112,"articleLive":2,"columnArticles":146,"formTitle":"[252]会议室","frequency":0.294577367,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"","submitted":19801,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49647893213789873,"acs":29681,"articleLive":2,"columnArticles":317,"formTitle":"[253]会议室 II","frequency":2.5663408717,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"","submitted":59783,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5690758293838862,"acs":4803,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":0.819884004,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"","submitted":8440,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47303898094052294,"acs":4939,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"","submitted":10441,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6300734214390602,"acs":10727,"articleLive":2,"columnArticles":166,"formTitle":"[256]粉刷房子","frequency":0.294577367,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"","submitted":17025,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.67985994440156,"acs":134753,"articleLive":2,"columnArticles":1001,"formTitle":"[257]二叉树的所有路径","frequency":2.9028017933,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":198207,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.691272720643197,"acs":75834,"articleLive":2,"columnArticles":624,"formTitle":"[258]各位相加","frequency":2.3074599989,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"","submitted":109702,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5678016472785938,"acs":6687,"articleLive":2,"columnArticles":81,"formTitle":"[259]较小的三数之和","frequency":0.241088682,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"","submitted":11777,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253564423105073,"acs":49552,"articleLive":2,"columnArticles":420,"formTitle":"[260]只出现一次的数字 III","frequency":2.4230495646,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":68314,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4966371901855773,"acs":7975,"articleLive":2,"columnArticles":113,"formTitle":"[261]以图判树","frequency":1.2355779478,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"","submitted":16058,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4385044709836164,"acs":36534,"articleLive":2,"columnArticles":354,"formTitle":"[262]行程和用户","frequency":3.0375664779,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"","submitted":83315,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154778395070923,"acs":103826,"articleLive":2,"columnArticles":815,"formTitle":"[263]丑数","frequency":2.6138803937,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":201417,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.577863945495542,"acs":95080,"articleLive":2,"columnArticles":590,"formTitle":"[264]丑数 II","frequency":2.9102317999,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"","submitted":164537,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5799034913426058,"acs":6129,"articleLive":2,"columnArticles":126,"formTitle":"[265]粉刷房子 II","frequency":0.215961732,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"","submitted":10569,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6693916551650918,"acs":6305,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"","submitted":9419,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44415513224612857,"acs":3241,"articleLive":2,"columnArticles":74,"formTitle":"[267]回文排列 II","frequency":0.294577367,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"","submitted":7297,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6224984617502916,"acs":144673,"articleLive":2,"columnArticles":1049,"formTitle":"[268]丢失的数字","frequency":1.6131342678,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":232407,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3403054827311068,"acs":5971,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"","submitted":17546,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.54958155217051,"acs":9128,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":0.819884004,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"","submitted":16609,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5504467204183918,"acs":2526,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"","submitted":4589,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6451421800947867,"acs":3267,"articleLive":2,"columnArticles":70,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":0.4869864364,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"","submitted":5064,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30846371941615036,"acs":11750,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":1.8182900697,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"","submitted":38092,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44042010705300305,"acs":52166,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":2.7365925551,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":118446,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4633407298290104,"acs":49697,"articleLive":2,"columnArticles":405,"formTitle":"[275]H 指数 II","frequency":1.5523622295,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":107258,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48470892998488885,"acs":6736,"articleLive":2,"columnArticles":120,"formTitle":"[276]栅栏涂色","frequency":1.2022637412,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"","submitted":13897,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5684393350425937,"acs":6873,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":0.3231018337,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"","submitted":12091,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45490228637849783,"acs":158891,"articleLive":2,"columnArticles":920,"formTitle":"[278]第一个错误的版本","frequency":3.2010734327,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":349286,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6300072616847109,"acs":190867,"articleLive":2,"columnArticles":1139,"formTitle":"[279]完全平方数","frequency":3.4582628968,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":302960,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864788369998713,"acs":5336,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":0.8505989493,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"","submitted":7773,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7555697008274984,"acs":2374,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"","submitted":3142,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3878264793817341,"acs":6875,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"","submitted":17727,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390987467150375,"acs":450633,"articleLive":2,"columnArticles":3151,"formTitle":"[283]移动零","frequency":3.4752578806,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":705107,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7330990128626982,"acs":9803,"articleLive":2,"columnArticles":95,"formTitle":"[284]顶端迭代器","frequency":0.819884004,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"","submitted":13372,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6359790150617702,"acs":7516,"articleLive":2,"columnArticles":95,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"","submitted":11818,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5067048922593175,"acs":10958,"articleLive":2,"columnArticles":138,"formTitle":"[286]墙与门","frequency":0.3841895257,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":21626,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6629451365661698,"acs":170656,"articleLive":2,"columnArticles":1178,"formTitle":"[287]寻找重复数","frequency":2.9010168435,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"","submitted":257421,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4240892000518605,"acs":3271,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"","submitted":7713,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7530215449290594,"acs":51588,"articleLive":2,"columnArticles":808,"formTitle":"[289]生命游戏","frequency":0.8505989493,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"","submitted":68508,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570588201235576,"acs":78940,"articleLive":2,"columnArticles":1049,"formTitle":"[290]单词规律","frequency":1.2614526125,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"","submitted":172713,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5352175863615971,"acs":2386,"articleLive":2,"columnArticles":50,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"","submitted":4458,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.696565469446489,"acs":84228,"articleLive":2,"columnArticles":552,"formTitle":"[292]Nim 游戏","frequency":2.0300972333,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"","submitted":120919,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7104387291981845,"acs":4696,"articleLive":2,"columnArticles":78,"formTitle":"[293]翻转游戏","frequency":0.2672681876,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"","submitted":6610,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5867654661382044,"acs":3405,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"","submitted":5803,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5210695489385752,"acs":44256,"articleLive":2,"columnArticles":350,"formTitle":"[295]数据流的中位数","frequency":3.0375664779,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":84933,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6185622317596566,"acs":2306,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":1.2355779478,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"","submitted":3728,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5572125262468673,"acs":98718,"articleLive":2,"columnArticles":717,"formTitle":"[297]二叉树的序列化与反序列化","frequency":2.7961339488,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":177164,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5791540020263425,"acs":4573,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"","submitted":7896,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038614718614719,"acs":29098,"articleLive":2,"columnArticles":340,"formTitle":"[299]猜数字游戏","frequency":1.1393499157,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"","submitted":57750,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5103102244665968,"acs":330853,"articleLive":2,"columnArticles":1879,"formTitle":"[300]最长递增子序列","frequency":3.7873667609,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":648337,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220840956891982,"acs":30532,"articleLive":2,"columnArticles":217,"formTitle":"[301]删除无效的括号","frequency":2.4550267096,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"","submitted":58481,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6722262509064539,"acs":1854,"articleLive":2,"columnArticles":32,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"","submitted":2758,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7235682756166302,"acs":126055,"articleLive":2,"columnArticles":775,"formTitle":"[303]区域和检索 - 数组不可变","frequency":2.9894571528,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"","submitted":174213,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.538367262339254,"acs":59741,"articleLive":2,"columnArticles":544,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":2.7961339488,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"","submitted":110967,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3766922275868598,"acs":3979,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":0.294577367,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"","submitted":10563,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33695697796432317,"acs":16056,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":1.8865643176,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"","submitted":47650,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5437802366240361,"acs":22705,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":0.8505989493,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":41754,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6043103448275862,"acs":2103,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"","submitted":3480,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6041583411038586,"acs":108850,"articleLive":2,"columnArticles":881,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":3.460945086,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"","submitted":180168,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3791528776645898,"acs":20508,"articleLive":2,"columnArticles":203,"formTitle":"[310]最小高度树","frequency":2.0709081197,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"","submitted":54089,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7630255941499086,"acs":3339,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":0.8505989493,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"","submitted":4376,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6822020364621262,"acs":53398,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":2.6056869845,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"","submitted":78273,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.656721872456353,"acs":39534,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":1.5653057185,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":60199,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5471648467306933,"acs":4159,"articleLive":2,"columnArticles":84,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"","submitted":7601,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41861323264395434,"acs":48781,"articleLive":2,"columnArticles":469,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":2.7327508293,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":116530,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4770406075889105,"acs":64130,"articleLive":2,"columnArticles":498,"formTitle":"[316]去除重复字母","frequency":2.7586563293,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":134433,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4852491124984698,"acs":3964,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.294577367,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"","submitted":8169,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6822372016760795,"acs":18724,"articleLive":2,"columnArticles":163,"formTitle":"[318]最大单词长度乘积","frequency":0.294577367,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"","submitted":27445,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5155392626147057,"acs":22079,"articleLive":2,"columnArticles":211,"formTitle":"[319]灯泡开关","frequency":0.819884004,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":42827,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6706443914081146,"acs":2810,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"","submitted":4190,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42598440738182175,"acs":25899,"articleLive":2,"columnArticles":222,"formTitle":"[321]拼接最大数","frequency":1.6131342678,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"","submitted":60798,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.44240803701206144,"acs":282762,"articleLive":2,"columnArticles":1730,"formTitle":"[322]零钱兑换","frequency":3.8552848442,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":639143,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6347961366435471,"acs":9793,"articleLive":2,"columnArticles":131,"formTitle":"[323]无向图中连通分量的数目","frequency":1.6783464165,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"","submitted":15427,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.3766857681136667,"acs":23993,"articleLive":2,"columnArticles":161,"formTitle":"[324]摆动排序 II","frequency":1.8517902992,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"","submitted":63695,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.537896412391331,"acs":8786,"articleLive":2,"columnArticles":98,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":1.5523622295,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"","submitted":16334,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4893060811451822,"acs":92838,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":1.1095858138,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"","submitted":189734,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4247126131392033,"acs":23978,"articleLive":2,"columnArticles":200,"formTitle":"[327]区间和的个数","frequency":1.7486593177,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"","submitted":56457,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6566628826034355,"acs":123209,"articleLive":2,"columnArticles":1028,"formTitle":"[328]奇偶链表","frequency":2.9704329312,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":187629,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4820638280326562,"acs":52611,"articleLive":2,"columnArticles":462,"formTitle":"[329]矩阵中的最长递增路径","frequency":2.6411438341,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"","submitted":109137,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5343614485511616,"acs":18607,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":1.6131342678,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"","submitted":34821,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798725682318295,"acs":43833,"articleLive":2,"columnArticles":493,"formTitle":"[331]验证二叉树的前序序列化","frequency":2.7766780822,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":91343,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4486376185331893,"acs":37376,"articleLive":2,"columnArticles":313,"formTitle":"[332]重新安排行程","frequency":2.2149726862,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"","submitted":83310,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4649383765405865,"acs":4376,"articleLive":2,"columnArticles":74,"formTitle":"[333]最大 BST 子树","frequency":0.882570982,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"","submitted":9412,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4133851777870434,"acs":42632,"articleLive":2,"columnArticles":276,"formTitle":"[334]递增的三元子序列","frequency":0.241088682,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"","submitted":103129,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36881777307590585,"acs":2789,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"","submitted":7562,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40125814009260796,"acs":21751,"articleLive":2,"columnArticles":185,"formTitle":"[336]回文对","frequency":1.6451472448,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"","submitted":54207,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6092051244002572,"acs":123163,"articleLive":2,"columnArticles":893,"formTitle":"[337]打家劫舍 III","frequency":3.3852797712,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"","submitted":202170,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7874875404933964,"acs":151689,"articleLive":2,"columnArticles":1323,"formTitle":"[338]比特位计数","frequency":3.3565751598,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"","submitted":192624,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8096846846846847,"acs":3595,"articleLive":2,"columnArticles":57,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"","submitted":4440,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4938412408759124,"acs":10825,"articleLive":2,"columnArticles":167,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":1.3441443284,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"","submitted":21920,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7272406648150598,"acs":49488,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":3.4540865837,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":68049,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5152343558882528,"acs":84247,"articleLive":2,"columnArticles":750,"formTitle":"[342]4的幂","frequency":2.2775713425,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":163512,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6038959890067764,"acs":102396,"articleLive":2,"columnArticles":989,"formTitle":"[343]整数拆分","frequency":3.0240554975,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":169559,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7643225588819412,"acs":342136,"articleLive":2,"columnArticles":1818,"formTitle":"[344]反转字符串","frequency":3.3094299693,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":447633,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5383730307528727,"acs":104811,"articleLive":2,"columnArticles":1007,"formTitle":"[345]反转字符串中的元音字母","frequency":1.40404247,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":194681,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060429559519475,"acs":11637,"articleLive":2,"columnArticles":128,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":16482,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6223328684880745,"acs":190109,"articleLive":2,"columnArticles":1404,"formTitle":"[347]前 K 个高频元素","frequency":3.739064294,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"","submitted":305478,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6001300390117035,"acs":4615,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"","submitted":7690,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7382162536181743,"acs":203775,"articleLive":2,"columnArticles":1435,"formTitle":"[349]两个数组的交集","frequency":3.2946933724,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":276037,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5492195599994318,"acs":232020,"articleLive":2,"columnArticles":1295,"formTitle":"[350]两个数组的交集 II","frequency":3.0240554975,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":422454,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5890856118332586,"acs":5257,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":0.9496149277,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"","submitted":8924,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5928110081437798,"acs":4222,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"","submitted":7122,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4247916666666667,"acs":2039,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":0.3529369822,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"","submitted":4800,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4505321886087263,"acs":66540,"articleLive":2,"columnArticles":517,"formTitle":"[354]俄罗斯套娃信封问题","frequency":3.6754322981,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"","submitted":147692,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40679477823724963,"acs":25085,"articleLive":2,"columnArticles":415,"formTitle":"[355]设计推特","frequency":1.7859770807,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"","submitted":61665,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3520730850316233,"acs":1503,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"","submitted":4269,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5193714322922319,"acs":23929,"articleLive":2,"columnArticles":369,"formTitle":"[357]计算各个位数不同的数字个数","frequency":2.1437267157,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"","submitted":46073,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35175547294506404,"acs":4258,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"","submitted":12105,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.724292339676955,"acs":4529,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"","submitted":6253,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6059721598563089,"acs":2699,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"","submitted":4454,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5654031958379785,"acs":3043,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"","submitted":5382,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6958105646630237,"acs":3056,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":0.3529369822,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"","submitted":4392,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49073184127420016,"acs":32166,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":2.7065280189,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":65547,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7167558666117744,"acs":1741,"articleLive":2,"columnArticles":47,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"","submitted":2429,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3634962180866402,"acs":32775,"articleLive":2,"columnArticles":475,"formTitle":"[365]水壶问题","frequency":2.0300972333,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"","submitted":90166,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7642093415869443,"acs":4074,"articleLive":2,"columnArticles":117,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"","submitted":5331,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4391173787211417,"acs":72677,"articleLive":2,"columnArticles":573,"formTitle":"[367]有效的完全平方数","frequency":0.191817633,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"","submitted":165507,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.458845222742596,"acs":40561,"articleLive":2,"columnArticles":441,"formTitle":"[368]最大整除子集","frequency":3.3913250078,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":88398,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6161601817665436,"acs":4339,"articleLive":2,"columnArticles":117,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"","submitted":7042,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7179294823705926,"acs":2871,"articleLive":2,"columnArticles":43,"formTitle":"[370]区间加法","frequency":0.294577367,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"","submitted":3999,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5793178244129927,"acs":53416,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":2.3105015488,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":92205,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5064925260455987,"acs":13418,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":0.3231018337,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"","submitted":26492,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4274971655984636,"acs":18476,"articleLive":2,"columnArticles":185,"formTitle":"[373]查找和最小的K对数字","frequency":2.0616829621,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":43219,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5141394457414447,"acs":79942,"articleLive":2,"columnArticles":547,"formTitle":"[374]猜数字大小","frequency":1.6451472448,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":155487,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4668218085106383,"acs":14042,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":1.6451472448,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"","submitted":30080,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46154351741090793,"acs":70222,"articleLive":2,"columnArticles":768,"formTitle":"[376]摆动序列","frequency":1.5822294597,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"","submitted":152146,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5067944088821993,"acs":59933,"articleLive":2,"columnArticles":519,"formTitle":"[377]组合总和 Ⅳ","frequency":2.8622148951,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":118259,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390343222803956,"acs":76895,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":2.6056869845,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":120330,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.645482728077945,"acs":2915,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"","submitted":4516,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021086579012652,"acs":32384,"articleLive":2,"columnArticles":200,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":1.6451472448,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":64496,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44322789943227897,"acs":20767,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.294577367,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"","submitted":46854,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6262459176315901,"acs":14765,"articleLive":2,"columnArticles":118,"formTitle":"[382]链表随机节点","frequency":1.4683733283,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"","submitted":23577,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5941736935808895,"acs":60740,"articleLive":2,"columnArticles":663,"formTitle":"[383]赎金信","frequency":0.7079887226,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":102226,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5749566672643596,"acs":48098,"articleLive":2,"columnArticles":188,"formTitle":"[384]打乱数组","frequency":2.6732802757,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":83655,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.4146726730240449,"acs":7088,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":0.241088682,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":17093,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7459016393442623,"acs":20930,"articleLive":2,"columnArticles":227,"formTitle":"[386]字典序排数","frequency":2.6388889909,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"","submitted":28060,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5300913091029326,"acs":208416,"articleLive":2,"columnArticles":1130,"formTitle":"[387]字符串中的第一个唯一字符","frequency":2.9418737516,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":393170,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5233539673607203,"acs":5580,"articleLive":2,"columnArticles":101,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"","submitted":10662,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6923208458611796,"acs":97170,"articleLive":2,"columnArticles":958,"formTitle":"[389]找不同","frequency":1.1095858138,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"","submitted":140354,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46661598009400057,"acs":6751,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":1.6783464165,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"","submitted":14468,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3542917410352101,"acs":4367,"articleLive":2,"columnArticles":64,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"","submitted":12326,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5142480347538271,"acs":139209,"articleLive":2,"columnArticles":1516,"formTitle":"[392]判断子序列","frequency":2.7639219936,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"","submitted":270704,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3912056529857577,"acs":10685,"articleLive":2,"columnArticles":125,"formTitle":"[393]UTF-8 编码验证","frequency":1.6783464165,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"","submitted":27313,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5510268302365438,"acs":113819,"articleLive":2,"columnArticles":1240,"formTitle":"[394]字符串解码","frequency":4.1450870696,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":206558,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202304858465316,"acs":49566,"articleLive":2,"columnArticles":418,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":3.0834671463,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"","submitted":95277,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42282871077392975,"acs":8583,"articleLive":2,"columnArticles":142,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"","submitted":20299,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37791273523432206,"acs":14499,"articleLive":2,"columnArticles":179,"formTitle":"[397]整数替换","frequency":1.4356157319,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"","submitted":38366,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6521029383522182,"acs":13582,"articleLive":2,"columnArticles":115,"formTitle":"[398]随机数索引","frequency":1.965832545,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"","submitted":20828,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.592175729755179,"acs":40249,"articleLive":2,"columnArticles":510,"formTitle":"[399]除法求值","frequency":1.40404247,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"","submitted":67968,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4135384615384615,"acs":18144,"articleLive":2,"columnArticles":188,"formTitle":"[400]第 N 位数字","frequency":2.3105015488,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":43875,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6135720029367548,"acs":52650,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":2.4230495646,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"","submitted":85809,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.327908990475053,"acs":76874,"articleLive":2,"columnArticles":563,"formTitle":"[402]移掉 K 位数字","frequency":3.2882892519,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":234437,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4562415474775624,"acs":44531,"articleLive":2,"columnArticles":451,"formTitle":"[403]青蛙过河","frequency":3.2740541361,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":97604,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5815220402208638,"acs":94470,"articleLive":2,"columnArticles":1072,"formTitle":"[404]左叶子之和","frequency":2.7365925551,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":162453,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5230543495738865,"acs":26023,"articleLive":2,"columnArticles":267,"formTitle":"[405]数字转换为十六进制数","frequency":2.2082675518,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"","submitted":49752,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7352585208417382,"acs":112996,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":2.7539691869,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"","submitted":153682,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4820386395653049,"acs":9581,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":2.2082675518,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"","submitted":19876,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32486370716510904,"acs":3337,"articleLive":2,"columnArticles":76,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"","submitted":10272,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5552985046705661,"acs":89051,"articleLive":2,"columnArticles":1265,"formTitle":"[409]最长回文串","frequency":3.120826241,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"","submitted":160366,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5613632243640099,"acs":37160,"articleLive":2,"columnArticles":300,"formTitle":"[410]分割数组的最大值","frequency":3.4573992344,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"","submitted":66196,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49510086455331415,"acs":859,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"","submitted":1735,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6723718241290126,"acs":70712,"articleLive":2,"columnArticles":357,"formTitle":"[412]Fizz Buzz","frequency":1.1702165637,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"","submitted":105168,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6860443450717347,"acs":66276,"articleLive":2,"columnArticles":870,"formTitle":"[413]等差数列划分","frequency":1.7417220717,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":96606,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36458689689060836,"acs":58615,"articleLive":2,"columnArticles":808,"formTitle":"[414]第三大的数","frequency":1.8182900697,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":160771,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.535247223737192,"acs":138378,"articleLive":2,"columnArticles":1022,"formTitle":"[415]字符串相加","frequency":4.2634328379,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"","submitted":258531,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5059625589157607,"acs":160379,"articleLive":2,"columnArticles":924,"formTitle":"[416]分割等和子集","frequency":3.2372157247,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":316978,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47607758218372564,"acs":25503,"articleLive":2,"columnArticles":295,"formTitle":"[417]太平洋大西洋水流问题","frequency":2.8294572986,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":53569,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3596291761413329,"acs":2056,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"","submitted":5717,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7567125081859856,"acs":11555,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":0.7618883365,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"","submitted":15270,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20556977736405244,"acs":2650,"articleLive":2,"columnArticles":49,"formTitle":"[420]强密码检验器","frequency":0.9833335637,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"","submitted":12891,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.622341345322497,"acs":32391,"articleLive":2,"columnArticles":297,"formTitle":"[421]数组中两个数的最大异或值","frequency":2.8639700821,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":52047,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42628571428571427,"acs":1865,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"","submitted":4375,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5694809344599873,"acs":8020,"articleLive":2,"columnArticles":133,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"","submitted":14083,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5300644581983773,"acs":49587,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":3.0938808078,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"","submitted":93549,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6110183639398998,"acs":1464,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"","submitted":2396,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6688359399601134,"acs":6372,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":1.3735755286,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"","submitted":9527,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129729729729729,"acs":3969,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"772","status":"","submitted":6475,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.64859228362878,"acs":2488,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"","submitted":3836,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6976597409810407,"acs":55270,"articleLive":2,"columnArticles":440,"formTitle":"[429]N 叉树的层序遍历","frequency":1.3156848095,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"ac","submitted":79222,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5409088567159566,"acs":20997,"articleLive":2,"columnArticles":302,"formTitle":"[430]扁平化多级双向链表","frequency":1.4356157319,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"766","status":"ac","submitted":38818,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7262569832402235,"acs":780,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"771","status":"","submitted":1074,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37740883486510524,"acs":6365,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":0.9158962917,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"","submitted":16865,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.533116216503239,"acs":15060,"articleLive":2,"columnArticles":207,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"","submitted":28249,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3739701313019946,"acs":37311,"articleLive":2,"columnArticles":511,"formTitle":"[434]字符串中的单词数","frequency":1.40404247,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"","submitted":99770,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.510067153047425,"acs":87881,"articleLive":2,"columnArticles":796,"formTitle":"[435]无重叠区间","frequency":3.0123853919,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"","submitted":172293,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4860482876108794,"acs":8274,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":0.3231018337,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":17023,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668696565171741,"acs":94483,"articleLive":2,"columnArticles":786,"formTitle":"[437]路径总和 III","frequency":2.4833171395,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"","submitted":166675,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5157929383602633,"acs":86189,"articleLive":2,"columnArticles":735,"formTitle":"[438]找到字符串中所有字母异位词","frequency":2.3748770215,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":167100,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5885678391959799,"acs":2811,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"","submitted":4776,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37945745992601726,"acs":15387,"articleLive":2,"columnArticles":118,"formTitle":"[440]字典序的第K小数字","frequency":3.3925891346,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"","submitted":40550,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4258566244049583,"acs":45177,"articleLive":2,"columnArticles":450,"formTitle":"[441]排列硬币","frequency":1.1702165637,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":106085,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6960402604689121,"acs":40939,"articleLive":2,"columnArticles":400,"formTitle":"[442]数组中重复的数据","frequency":3.1124835234,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"","submitted":58817,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4764791507642057,"acs":53683,"articleLive":2,"columnArticles":672,"formTitle":"[443]压缩字符串","frequency":1.999551181,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"","submitted":112666,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24815628432449396,"acs":3163,"articleLive":2,"columnArticles":51,"formTitle":"[444]序列重建","frequency":0.882570982,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"","submitted":12746,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.587493024813065,"acs":78962,"articleLive":2,"columnArticles":905,"formTitle":"[445]两数相加 II","frequency":3.3218373843,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":134405,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5514792204742898,"acs":18790,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":1.3917270434,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":34072,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6037479395008531,"acs":20877,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"","submitted":34579,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6470257494713273,"acs":130036,"articleLive":2,"columnArticles":1029,"formTitle":"[448]找到所有数组中消失的数字","frequency":2.9290597839,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"","submitted":200975,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5542343720129994,"acs":14496,"articleLive":2,"columnArticles":132,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.294577367,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"","submitted":26155,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4835476617125189,"acs":55049,"articleLive":2,"columnArticles":575,"formTitle":"[450]删除二叉搜索树中的节点","frequency":2.1282632872,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"","submitted":113844,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7109245072112108,"acs":78228,"articleLive":2,"columnArticles":907,"formTitle":"[451]根据字符出现频率排序","frequency":2.8420297549,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":110037,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.509377568136532,"acs":90495,"articleLive":2,"columnArticles":793,"formTitle":"[452]用最少数量的箭引爆气球","frequency":2.3383249146,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":177658,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5541440578784977,"acs":26042,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":1.3735755286,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"","submitted":46995,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5994811558694242,"acs":74871,"articleLive":2,"columnArticles":465,"formTitle":"[454]四数相加 II","frequency":2.6411438341,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"","submitted":124893,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774840951789645,"acs":143238,"articleLive":2,"columnArticles":1174,"formTitle":"[455]分发饼干","frequency":2.7586563293,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"","submitted":248038,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36217045320468283,"acs":55252,"articleLive":2,"columnArticles":443,"formTitle":"[456]132 模式","frequency":3.4805728014,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":152558,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4351609281437126,"acs":27906,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":1.4480701236,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":64128,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6077249175694771,"acs":6451,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":0.7903397577,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"","submitted":10615,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115597393583687,"acs":75917,"articleLive":2,"columnArticles":617,"formTitle":"[459]重复的子字符串","frequency":2.5331914825,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"","submitted":148403,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4397261992722812,"acs":31542,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":3.0240554975,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"","submitted":71731,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8115349049943822,"acs":163237,"articleLive":2,"columnArticles":1312,"formTitle":"[461]汉明距离","frequency":2.7714945748,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":201146,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6023280996210071,"acs":13350,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":1.8182900697,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"","submitted":22164,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.715061595006801,"acs":74124,"articleLive":2,"columnArticles":883,"formTitle":"[463]岛屿的周长","frequency":1.7859770807,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"","submitted":103661,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3582546047712907,"acs":10542,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":1.8517902992,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"","submitted":29426,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5290819901892081,"acs":1510,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"","submitted":2854,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37363749102539,"acs":11449,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"","submitted":30642,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4402032929218063,"acs":8315,"articleLive":2,"columnArticles":110,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":0.819884004,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"","submitted":18889,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24794944488930248,"acs":22914,"articleLive":2,"columnArticles":286,"formTitle":"[468]验证IP地址","frequency":2.4881149225,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"","submitted":92414,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.43805309734513276,"acs":1386,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":1.2022637412,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"","submitted":3164,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5560957239207094,"acs":32486,"articleLive":2,"columnArticles":156,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":3.1035254128,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"903","status":"","submitted":58418,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6186354378818737,"acs":1215,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":0.6337706971,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"","submitted":1964,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.41113814188967057,"acs":6253,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"","submitted":15209,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.41977191211528964,"acs":19545,"articleLive":2,"columnArticles":172,"formTitle":"[473]火柴拼正方形","frequency":1.9333017954,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"","submitted":46561,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6098566139692365,"acs":71327,"articleLive":2,"columnArticles":577,"formTitle":"[474]一和零","frequency":3.1512180326,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":116957,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32950866421753644,"acs":19643,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":1.4356157319,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"","submitted":59613,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7011786280540221,"acs":36706,"articleLive":2,"columnArticles":460,"formTitle":"[476]数字的补数","frequency":0.241088682,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"","submitted":52349,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6036768521867677,"acs":38386,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":2.2775713425,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":63587,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.4363687983533253,"acs":6148,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":1.4683733283,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"","submitted":14089,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.412988473432668,"acs":2938,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":0.4169793485,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"","submitted":7114,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44844910441240715,"acs":28742,"articleLive":2,"columnArticles":401,"formTitle":"[480]滑动窗口中位数","frequency":2.163422472,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":64092,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.53455202892728,"acs":5322,"articleLive":2,"columnArticles":94,"formTitle":"[481]神奇字符串","frequency":0.2672681876,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"","submitted":9956,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4250115366866636,"acs":18420,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":0.7344592993,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"","submitted":43340,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5896442409299049,"acs":15066,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":1.5234685056,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"notac","submitted":25551,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6412037037037037,"acs":1385,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"","submitted":2160,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6059226216537805,"acs":117632,"articleLive":2,"columnArticles":951,"formTitle":"[485]最大连续 1 的个数","frequency":2.3921128842,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"","submitted":194137,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5881045098142399,"acs":44703,"articleLive":2,"columnArticles":394,"formTitle":"[486]预测赢家","frequency":1.965832545,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":76012,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.579002808988764,"acs":4947,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":1.7859770807,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"","submitted":8544,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3884976525821596,"acs":3310,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"","submitted":8520,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7188679245283018,"acs":1524,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"865","status":"","submitted":2120,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48253577473457454,"acs":6272,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":0.3529369822,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"","submitted":12998,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5476246603555875,"acs":44138,"articleLive":2,"columnArticles":377,"formTitle":"[491]递增子序列","frequency":2.4550267096,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":80599,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5496966321775069,"acs":18754,"articleLive":2,"columnArticles":173,"formTitle":"[492]构造矩形","frequency":0.2672681876,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"","submitted":34117,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3439762958238663,"acs":25888,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":1.8865643176,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"","submitted":75261,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.5001488367422326,"acs":139456,"articleLive":2,"columnArticles":987,"formTitle":"[494]目标和","frequency":3.545907001,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":278829,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5413271009043796,"acs":26636,"articleLive":2,"columnArticles":406,"formTitle":"[495]提莫攻击","frequency":1.1702165637,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"","submitted":49205,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6870693149574382,"acs":94920,"articleLive":2,"columnArticles":985,"formTitle":"[496]下一个更大元素 I","frequency":2.6006794628,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":138152,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4037565521258008,"acs":2773,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"914","status":"","submitted":6868,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4593968042158116,"acs":40624,"articleLive":2,"columnArticles":421,"formTitle":"[498]对角线遍历","frequency":2.6732802757,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"","submitted":88429,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3688584341740779,"acs":2530,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"","submitted":6859,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.707713552013179,"acs":29213,"articleLive":2,"columnArticles":443,"formTitle":"[500]键盘行","frequency":0.7903397577,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"","submitted":41278,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5105082626613254,"acs":62063,"articleLive":2,"columnArticles":519,"formTitle":"[501]二叉搜索树中的众数","frequency":2.1851695506,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"","submitted":121571,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4170492221372099,"acs":6541,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":1.5024017902,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"","submitted":15684,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6334455624103952,"acs":97645,"articleLive":2,"columnArticles":943,"formTitle":"[503]下一个更大元素 II","frequency":3.2149963865,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":154149,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5048632006157722,"acs":28860,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":1.1393499157,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"","submitted":57164,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4825952250774558,"acs":5296,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":0.882570982,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"","submitted":10974,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.562806242388195,"acs":19871,"articleLive":2,"columnArticles":268,"formTitle":"[506]相对名次","frequency":0.7344592993,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"","submitted":35307,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4082938561329349,"acs":28011,"articleLive":2,"columnArticles":221,"formTitle":"[507]完美数","frequency":1.1393499157,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"","submitted":68605,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6735166425470333,"acs":13962,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":0.8505989493,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"","submitted":20730,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6777631607592142,"acs":217930,"articleLive":2,"columnArticles":1369,"formTitle":"[509]斐波那契数","frequency":3.2006352014,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"","submitted":321543,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6116333725029377,"acs":3123,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":0.3841895257,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"509","status":"","submitted":5106,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337665042275813,"acs":17617,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":1.8182900697,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"","submitted":24009,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5374508919945901,"acs":16690,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":0.2672681876,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"","submitted":31054,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7305620553732117,"acs":46520,"articleLive":2,"columnArticles":526,"formTitle":"[513]找树左下角的值","frequency":0.215961732,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"","submitted":63677,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5015855544198967,"acs":19139,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":2.472932291,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"","submitted":38157,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6428791419823541,"acs":35485,"articleLive":2,"columnArticles":389,"formTitle":"[515]在每个树行中找最大值","frequency":1.7128183255,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"","submitted":55197,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6512468848240027,"acs":79964,"articleLive":2,"columnArticles":588,"formTitle":"[516]最长回文子序列","frequency":1.7765028269,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":122786,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4393737104017478,"acs":3620,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":0.2672681876,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"","submitted":8239,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6503784998843013,"acs":98373,"articleLive":2,"columnArticles":642,"formTitle":"[518]零钱兑换 II","frequency":3.4667580419,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":151255,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39575259649666716,"acs":2553,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":0.9158962917,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"913","status":"","submitted":6451,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5626576832771871,"acs":38582,"articleLive":2,"columnArticles":620,"formTitle":"[520]检测大写字母","frequency":0.7903397577,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"","submitted":68571,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120778808100067,"acs":24650,"articleLive":2,"columnArticles":241,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":0.819884004,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"","submitted":34617,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35769059791064683,"acs":6437,"articleLive":2,"columnArticles":101,"formTitle":"[522]最长特殊序列 II","frequency":0.819884004,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"","submitted":17996,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2743301207698615,"acs":66578,"articleLive":2,"columnArticles":586,"formTitle":"[523]连续的子数组和","frequency":2.7961339488,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":242693,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.47302277585317315,"acs":38505,"articleLive":2,"columnArticles":367,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":1.6451472448,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"","submitted":81402,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5363252088792209,"acs":43393,"articleLive":2,"columnArticles":498,"formTitle":"[525]连续数组","frequency":3.3565751598,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":80908,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7341306137382237,"acs":32105,"articleLive":2,"columnArticles":376,"formTitle":"[526]优美的排列","frequency":1.6343484703,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":43732,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5758661887694145,"acs":1928,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"","submitted":3348,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.46932286750459534,"acs":9447,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":0.7903397577,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"","submitted":20129,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464937397285804,"acs":38158,"articleLive":2,"columnArticles":455,"formTitle":"[529]扫雷游戏","frequency":1.7486593177,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"","submitted":59023,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206122669503853,"acs":74664,"articleLive":2,"columnArticles":620,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":0.7903397577,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":120307,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6639970199292233,"acs":3565,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"","submitted":5369,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37207485956321906,"acs":24772,"articleLive":2,"columnArticles":265,"formTitle":"[532]数组中的 k-diff 数对","frequency":0.819884004,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"","submitted":66578,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5265486725663717,"acs":1547,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"","submitted":2938,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6760613994558242,"acs":13169,"articleLive":2,"columnArticles":131,"formTitle":"[534]游戏玩法分析 III","frequency":0.7903397577,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"","submitted":19479,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8416053585154277,"acs":15329,"articleLive":2,"columnArticles":93,"formTitle":"[535]TinyURL 的加密与解密","frequency":1.4683733283,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"","submitted":18214,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5343639411436022,"acs":2869,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.3841895257,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"","submitted":5369,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7110282971197575,"acs":11257,"articleLive":2,"columnArticles":166,"formTitle":"[537]复数乘法","frequency":0.2672681876,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"","submitted":15832,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6948629332617522,"acs":103545,"articleLive":2,"columnArticles":789,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":1.6954175036,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"","submitted":149015,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5937430067582689,"acs":13266,"articleLive":2,"columnArticles":169,"formTitle":"[539]最小时间差","frequency":1.3735755286,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"","submitted":22343,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5812120618758567,"acs":35619,"articleLive":2,"columnArticles":371,"formTitle":"[540]有序数组中的单一元素","frequency":2.2422818656,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":61284,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.608256288970114,"acs":67896,"articleLive":2,"columnArticles":770,"formTitle":"[541]反转字符串 II","frequency":1.3735755286,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":111624,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4593236264576702,"acs":63061,"articleLive":2,"columnArticles":598,"formTitle":"[542]01 矩阵","frequency":2.0616829621,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":137291,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5482541193500297,"acs":139381,"articleLive":2,"columnArticles":1180,"formTitle":"[543]二叉树的直径","frequency":3.4732574799,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"","submitted":254227,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7102382485511912,"acs":2206,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"","submitted":3106,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4162552221800228,"acs":3288,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"","submitted":7899,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6307083935708819,"acs":14833,"articleLive":2,"columnArticles":118,"formTitle":"[546]移除盒子","frequency":1.2022637412,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"","submitted":23518,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6180093330206151,"acs":152830,"articleLive":2,"columnArticles":1073,"formTitle":"[547]省份数量","frequency":2.7263149723,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":247294,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35710987996306554,"acs":1547,"articleLive":2,"columnArticles":39,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"","submitted":4332,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.4839506172839506,"acs":1960,"articleLive":2,"columnArticles":47,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"","submitted":4050,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4383094751192911,"acs":11574,"articleLive":2,"columnArticles":167,"formTitle":"[550]游戏玩法分析 IV","frequency":1.40404247,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"","submitted":26406,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5667678075489974,"acs":57345,"articleLive":2,"columnArticles":736,"formTitle":"[551]学生出勤记录 I","frequency":0.9926881689,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":101179,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5782110433100164,"acs":23310,"articleLive":2,"columnArticles":284,"formTitle":"[552]学生出勤记录 II","frequency":1.4954899573,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":40314,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.602028830752803,"acs":5638,"articleLive":2,"columnArticles":80,"formTitle":"[553]最优除法","frequency":0.2672681876,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"","submitted":9365,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5003352310821714,"acs":44029,"articleLive":2,"columnArticles":481,"formTitle":"[554]砖墙","frequency":2.9055325432,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":87999,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.341502227880331,"acs":1073,"articleLive":2,"columnArticles":21,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"","submitted":3142,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.324756031284705,"acs":13744,"articleLive":2,"columnArticles":205,"formTitle":"[556]下一个更大元素 III","frequency":2.5097849136,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"","submitted":42321,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7450976418010276,"acs":147048,"articleLive":2,"columnArticles":1189,"formTitle":"[557]反转字符串中的单词 III","frequency":2.9430001315,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":197354,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5017743080198722,"acs":2828,"articleLive":2,"columnArticles":35,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"773","status":"","submitted":5636,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7266846965863629,"acs":58307,"articleLive":2,"columnArticles":534,"formTitle":"[559]N 叉树的最大深度","frequency":1.5822294597,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"774","status":"","submitted":80237,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44704973442781265,"acs":138876,"articleLive":2,"columnArticles":859,"formTitle":"[560]和为K的子数组","frequency":3.8683903927,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"","submitted":310650,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7733090065274961,"acs":87312,"articleLive":2,"columnArticles":725,"formTitle":"[561]数组拆分 I","frequency":1.1095858138,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"","submitted":112907,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46004624871531347,"acs":3581,"articleLive":2,"columnArticles":51,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"","submitted":7784,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6040221645290038,"acs":31176,"articleLive":2,"columnArticles":312,"formTitle":"[563]二叉树的坡度","frequency":1.3735755286,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"","submitted":51614,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17849354135212211,"acs":4256,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":0.8505989493,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"notac","submitted":23844,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.609704451252478,"acs":13533,"articleLive":2,"columnArticles":133,"formTitle":"[565]数组嵌套","frequency":0.7903397577,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"","submitted":22196,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6967797757046668,"acs":62814,"articleLive":2,"columnArticles":580,"formTitle":"[566]重塑矩阵","frequency":1.4356157319,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":90149,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.42989951163782353,"acs":106867,"articleLive":2,"columnArticles":963,"formTitle":"[567]字符串的排列","frequency":2.5311573077,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":248586,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.501806684733514,"acs":1111,"articleLive":2,"columnArticles":25,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"","submitted":2214,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5636694713047846,"acs":8977,"articleLive":2,"columnArticles":149,"formTitle":"[569]员工薪水中位数","frequency":1.2022637412,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"","submitted":15926,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6645888819629399,"acs":11728,"articleLive":2,"columnArticles":105,"formTitle":"[570]至少有5名直接下属的经理","frequency":0.819884004,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"","submitted":17647,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48947614593077643,"acs":6279,"articleLive":2,"columnArticles":95,"formTitle":"[571]给定数字的频率查询中位数","frequency":0.819884004,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"","submitted":12828,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47397658164654627,"acs":78327,"articleLive":2,"columnArticles":688,"formTitle":"[572]另一棵树的子树","frequency":2.5223922415,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":165255,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6605814739688979,"acs":977,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.5881423444,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"","submitted":1479,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6472773649772652,"acs":11673,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"","submitted":18034,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6847064016161067,"acs":40334,"articleLive":2,"columnArticles":402,"formTitle":"[575]分糖果","frequency":1.4356157319,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"","submitted":58907,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46908574135480813,"acs":24756,"articleLive":2,"columnArticles":272,"formTitle":"[576]出界的路径数","frequency":1.2355779478,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":52775,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7069347770043826,"acs":13711,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":0.819884004,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"","submitted":19395,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4983561643835616,"acs":9095,"articleLive":2,"columnArticles":106,"formTitle":"[578]查询回答率最高的问题","frequency":0.2672681876,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"","submitted":18250,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4140920463140746,"acs":7117,"articleLive":2,"columnArticles":122,"formTitle":"[579]查询员工的累计薪水","frequency":0.819884004,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"","submitted":17187,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5263853759484939,"acs":9157,"articleLive":2,"columnArticles":74,"formTitle":"[580]统计各专业学生人数","frequency":0.7903397577,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"","submitted":17396,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40364180380423165,"acs":94432,"articleLive":2,"columnArticles":825,"formTitle":"[581]最短无序连续子数组","frequency":1.5251422583,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":233950,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4023751141881821,"acs":8369,"articleLive":2,"columnArticles":128,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"","submitted":20799,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5810081499770577,"acs":26591,"articleLive":2,"columnArticles":254,"formTitle":"[583]两个字符串的删除操作","frequency":1.8420927834,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":45767,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7724967927179425,"acs":12645,"articleLive":2,"columnArticles":54,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"","submitted":16369,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5938340893365112,"acs":7724,"articleLive":2,"columnArticles":91,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"","submitted":13007,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7491088100492276,"acs":13239,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":1.1702165637,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"","submitted":17673,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37914510254935785,"acs":1978,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":0.5881423444,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"","submitted":5217,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.43302280758111145,"acs":1348,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":0.4169793485,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"","submitted":3113,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7447564068923292,"acs":85148,"articleLive":2,"columnArticles":547,"formTitle":"[589]N 叉树的前序遍历","frequency":1.8865643176,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"775","status":"","submitted":114330,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7594373511135759,"acs":60253,"articleLive":2,"columnArticles":441,"formTitle":"[590]N 叉树的后序遍历","frequency":0.7903397577,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"776","status":"","submitted":79339,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33913731697665217,"acs":1714,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":5054,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5206306195344255,"acs":4227,"articleLive":2,"columnArticles":102,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"","submitted":8119,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44080237574942566,"acs":7867,"articleLive":2,"columnArticles":123,"formTitle":"[593]有效的正方形","frequency":1.1702165637,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"","submitted":17847,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5159165341068588,"acs":27568,"articleLive":2,"columnArticles":258,"formTitle":"[594]最长和谐子序列","frequency":0.215961732,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"","submitted":53435,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7963152425221335,"acs":98849,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":1.9018808982,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"","submitted":124133,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4202448144297914,"acs":77212,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":1.1393499157,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"","submitted":183731,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44078365675461867,"acs":9472,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":0.819884004,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"","submitted":21489,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5167553281604716,"acs":15251,"articleLive":2,"columnArticles":192,"formTitle":"[598]范围求和 II","frequency":0.819884004,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"","submitted":29513,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5220901889092017,"acs":27416,"articleLive":2,"columnArticles":255,"formTitle":"[599]两个列表的最小索引总和","frequency":0.8505989493,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":52512,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3428748122625674,"acs":3881,"articleLive":2,"columnArticles":67,"formTitle":"[600]不含连续1的非负整数","frequency":0.7903397577,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"","submitted":11319,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49663649198571547,"acs":29900,"articleLive":2,"columnArticles":353,"formTitle":"[601]体育馆的人流量","frequency":2.6388889909,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"","submitted":60205,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6275467250378851,"acs":7454,"articleLive":2,"columnArticles":81,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":0.3231018337,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"","submitted":11878,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6729563399907106,"acs":11591,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":1.2355779478,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"","submitted":17224,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37268593699253005,"acs":2295,"articleLive":2,"columnArticles":50,"formTitle":"[604]迭代压缩字符串","frequency":0.3529369822,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"","submitted":6158,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33508207222355674,"acs":104621,"articleLive":2,"columnArticles":1215,"formTitle":"[605]种花问题","frequency":2.6411438341,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"","submitted":312225,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5674761311747614,"acs":27341,"articleLive":2,"columnArticles":298,"formTitle":"[606]根据二叉树创建字符串","frequency":1.1095858138,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"","submitted":48180,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6637393935797781,"acs":11186,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":0.2672681876,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"","submitted":16853,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.65836132885405,"acs":7055,"articleLive":2,"columnArticles":90,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"","submitted":10716,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4804932909330645,"acs":6195,"articleLive":2,"columnArticles":95,"formTitle":"[609]在系统中查找重复文件","frequency":0.294577367,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"","submitted":12893,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6675229103026937,"acs":9615,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":0.2672681876,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"","submitted":14404,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5320102503799519,"acs":47957,"articleLive":2,"columnArticles":374,"formTitle":"[611]有效三角形的个数","frequency":2.4222829051,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":90143,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.669050651513667,"acs":6829,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"","submitted":10207,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8171709531013616,"acs":10803,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":0.2672681876,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"","submitted":13220,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.346679642244775,"acs":7481,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":0.819884004,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"","submitted":21579,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42389326864766524,"acs":4893,"articleLive":2,"columnArticles":82,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.3529369822,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"","submitted":11543,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46127842655193607,"acs":3002,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":1.6451472448,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"","submitted":6508,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881531088386869,"acs":174650,"articleLive":2,"columnArticles":1144,"formTitle":"[617]合并二叉树","frequency":3.0196627823,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":221594,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6206041149861374,"acs":4253,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":1.4683733283,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"","submitted":6853,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4653904103518568,"acs":10502,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":0.2672681876,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"","submitted":22566,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7723818848176611,"acs":89146,"articleLive":2,"columnArticles":298,"formTitle":"[620]有趣的电影","frequency":1.9018808982,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"","submitted":115417,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5683060526476517,"acs":74439,"articleLive":2,"columnArticles":479,"formTitle":"[621]任务调度器","frequency":2.923751,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"","submitted":130984,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4360687967638364,"acs":61661,"articleLive":2,"columnArticles":398,"formTitle":"[622]设计循环队列","frequency":2.5223922415,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"860","status":"ac","submitted":141402,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5451207529606454,"acs":10541,"articleLive":2,"columnArticles":179,"formTitle":"[623]在二叉树中增加一行","frequency":0.241088682,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"","submitted":19337,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41561014263074486,"acs":2098,"articleLive":2,"columnArticles":45,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"","submitted":5048,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33962264150943394,"acs":2412,"articleLive":2,"columnArticles":50,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"","submitted":7102,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6830688670263408,"acs":43047,"articleLive":2,"columnArticles":330,"formTitle":"[626]换座位","frequency":2.0300972333,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"","submitted":63020,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8066000473971088,"acs":81686,"articleLive":2,"columnArticles":317,"formTitle":"[627]变更性别","frequency":1.3735755286,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"","submitted":101272,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5251082543978349,"acs":77611,"articleLive":2,"columnArticles":735,"formTitle":"[628]三个数的最大乘积","frequency":1.5822294597,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":147800,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40119206659130613,"acs":3904,"articleLive":2,"columnArticles":54,"formTitle":"[629]K个逆序对数组","frequency":1.2355779478,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"","submitted":9731,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36451772261331356,"acs":5903,"articleLive":2,"columnArticles":71,"formTitle":"[630]课程表 III","frequency":0.3231018337,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"","submitted":16194,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28137092316196793,"acs":1018,"articleLive":2,"columnArticles":32,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"","submitted":3618,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5966606381604443,"acs":18475,"articleLive":2,"columnArticles":232,"formTitle":"[632]最小区间","frequency":0.8505989493,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"","submitted":30964,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.399705312272516,"acs":91148,"articleLive":2,"columnArticles":737,"formTitle":"[633]平方数之和","frequency":2.923751,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":228038,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4370838881491345,"acs":1313,"articleLive":2,"columnArticles":18,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"","submitted":3004,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5549917922698104,"acs":3719,"articleLive":2,"columnArticles":61,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"","submitted":6701,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5465842167255595,"acs":9281,"articleLive":2,"columnArticles":108,"formTitle":"[636]函数的独占时间","frequency":0.819884004,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":16980,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6890860365894953,"acs":71226,"articleLive":2,"columnArticles":624,"formTitle":"[637]二叉树的层平均值","frequency":1.0345218106,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"","submitted":103363,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5938923844651768,"acs":10949,"articleLive":2,"columnArticles":113,"formTitle":"[638]大礼包","frequency":0.8505989493,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"","submitted":18436,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.31015066199969565,"acs":4076,"articleLive":2,"columnArticles":78,"formTitle":"[639]解码方法 II","frequency":1.2355779478,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"","submitted":13142,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42332816199885687,"acs":10369,"articleLive":2,"columnArticles":198,"formTitle":"[640]求解方程","frequency":1.2022637412,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"","submitted":24494,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5333368127136557,"acs":20438,"articleLive":2,"columnArticles":229,"formTitle":"[641]设计循环双端队列","frequency":1.3441443284,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"859","status":"","submitted":38321,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49077891082664354,"acs":2262,"articleLive":2,"columnArticles":51,"formTitle":"[642]设计搜索自动补全系统","frequency":0.4169793485,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"","submitted":4609,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4522242229241078,"acs":61280,"articleLive":2,"columnArticles":559,"formTitle":"[643]子数组最大平均数 I","frequency":1.7859770807,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"","submitted":135508,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4,"acs":1084,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"","submitted":2710,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4358848286984227,"acs":66489,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":2.0300972333,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":152538,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5739800817580729,"acs":20921,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":0.7618883365,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"","submitted":36449,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6556379172047354,"acs":115250,"articleLive":2,"columnArticles":870,"formTitle":"[647]回文子串","frequency":2.9174185785,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"","submitted":175783,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.581032622955599,"acs":19930,"articleLive":2,"columnArticles":255,"formTitle":"[648]单词替换","frequency":0.241088682,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"","submitted":34301,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4811849210220869,"acs":28605,"articleLive":2,"columnArticles":305,"formTitle":"[649]Dota2 参议院","frequency":0.241088682,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"","submitted":59447,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5343807685853331,"acs":25475,"articleLive":2,"columnArticles":296,"formTitle":"[650]只有两个键的键盘","frequency":0.819884004,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"","submitted":47672,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5795601552393272,"acs":3584,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"","submitted":6184,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5711921789409616,"acs":30031,"articleLive":2,"columnArticles":217,"formTitle":"[652]寻找重复的子树","frequency":2.6732802757,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"","submitted":52576,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.593907830766084,"acs":37747,"articleLive":2,"columnArticles":358,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"","submitted":63557,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8098078197481776,"acs":54990,"articleLive":2,"columnArticles":564,"formTitle":"[654]最大二叉树","frequency":2.1562841734,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"","submitted":67905,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5952131833638504,"acs":9102,"articleLive":2,"columnArticles":132,"formTitle":"[655]输出二叉树","frequency":0.8505989493,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"","submitted":15292,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30592734225621415,"acs":800,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"","submitted":2615,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831828803583722,"acs":80772,"articleLive":2,"columnArticles":608,"formTitle":"[657]机器人能否返回原点","frequency":0.8505989493,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"","submitted":103133,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45272305698062915,"acs":24797,"articleLive":2,"columnArticles":224,"formTitle":"[658]找到 K 个最接近的元素","frequency":1.6451472448,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"","submitted":54773,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.542305064897043,"acs":27785,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"","submitted":51235,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6467661691542289,"acs":650,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":0.5881423444,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"","submitted":1005,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5596024164091037,"acs":15933,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":0.2672681876,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"","submitted":28472,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4055634164165876,"acs":26083,"articleLive":2,"columnArticles":251,"formTitle":"[662]二叉树最大宽度","frequency":2.7639219936,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","status":"","submitted":64313,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46427578537670283,"acs":1670,"articleLive":2,"columnArticles":33,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","questionId":"663","status":"","submitted":3597,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6557292924414393,"acs":21723,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":2.7089473944,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":33128,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2698830701764133,"acs":72866,"articleLive":2,"columnArticles":914,"formTitle":"[665]非递减数列","frequency":2.3446205788,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"","submitted":269991,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6191222570532915,"acs":1975,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"","submitted":3190,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6240219407921271,"acs":7736,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":0.7618883365,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"","submitted":12397,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5074313283012996,"acs":6521,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":1.6451472448,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"","submitted":12851,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6668902655565639,"acs":33802,"articleLive":2,"columnArticles":286,"formTitle":"[669]修剪二叉搜索树","frequency":0.819884004,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"","submitted":50686,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4492339652038432,"acs":17300,"articleLive":2,"columnArticles":265,"formTitle":"[670]最大交换","frequency":3.0852600648,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"","submitted":38510,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48674401659099825,"acs":52104,"articleLive":2,"columnArticles":653,"formTitle":"[671]二叉树中第二小的节点","frequency":1.0613762707,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":107046,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5524755648133312,"acs":3448,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":0.241088682,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"","submitted":6241,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3895087545190331,"acs":27474,"articleLive":2,"columnArticles":256,"formTitle":"[673]最长递增子序列的个数","frequency":2.4032463771,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":70535,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4901274101566036,"acs":86631,"articleLive":2,"columnArticles":734,"formTitle":"[674]最长连续递增序列","frequency":1.6671430728,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"","submitted":176752,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.39997121473805414,"acs":2779,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"","submitted":6948,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.585555149744339,"acs":6413,"articleLive":2,"columnArticles":114,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"","submitted":10952,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6153778942769769,"acs":14086,"articleLive":2,"columnArticles":231,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"","submitted":22890,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35109564673456223,"acs":17961,"articleLive":2,"columnArticles":219,"formTitle":"[678]有效的括号字符串","frequency":3.524925969,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"","submitted":51157,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5409725544778392,"acs":24875,"articleLive":2,"columnArticles":255,"formTitle":"[679]24 点游戏","frequency":3.2882892519,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"","submitted":45982,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015443452568968,"acs":82631,"articleLive":2,"columnArticles":785,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":2.7888822854,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"","submitted":205783,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5,"acs":2445,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"","submitted":4890,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953242128935532,"acs":44523,"articleLive":2,"columnArticles":495,"formTitle":"[682]棒球比赛","frequency":1.40404247,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":64032,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.42730276745146634,"acs":2069,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"","submitted":4842,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6665257570953841,"acs":56762,"articleLive":2,"columnArticles":587,"formTitle":"[684]冗余连接","frequency":1.40404247,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"","submitted":85161,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4341999821921467,"acs":19506,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":1.4356157319,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"","submitted":44924,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3543764441523753,"acs":16717,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":0.294577367,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"","submitted":47173,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4392488511416404,"acs":36513,"articleLive":2,"columnArticles":261,"formTitle":"[687]最长同值路径","frequency":2.3446205788,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"","submitted":83126,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5109358430540827,"acs":7709,"articleLive":2,"columnArticles":102,"formTitle":"[688]“马”在棋盘上的概率","frequency":0.2672681876,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"","submitted":15088,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48516108554197745,"acs":3057,"articleLive":2,"columnArticles":65,"formTitle":"[689]三个无重叠子数组的最大和","frequency":1.7128183255,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"","submitted":6301,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6463325038511673,"acs":54544,"articleLive":2,"columnArticles":555,"formTitle":"[690]员工的重要性","frequency":3.169393742,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":84390,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4885551829712786,"acs":3351,"articleLive":2,"columnArticles":44,"formTitle":"[691]贴纸拼词","frequency":0.3231018337,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"","submitted":6859,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5810242587601078,"acs":64668,"articleLive":2,"columnArticles":709,"formTitle":"[692]前K个高频单词","frequency":3.0721879832,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":111300,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6091464005425831,"acs":25148,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":0.241088682,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"","submitted":41284,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5291042667420175,"acs":3745,"articleLive":2,"columnArticles":70,"formTitle":"[694]不同岛屿的数量","frequency":0.294577367,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"","submitted":7078,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6623273144167383,"acs":115543,"articleLive":2,"columnArticles":1156,"formTitle":"[695]岛屿的最大面积","frequency":3.1115197794,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":174450,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6301654184223359,"acs":50400,"articleLive":2,"columnArticles":461,"formTitle":"[696]计数二进制子串","frequency":0.7903397577,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"","submitted":79979,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6059024703898016,"acs":65020,"articleLive":2,"columnArticles":824,"formTitle":"[697]数组的度","frequency":1.6131342678,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"","submitted":107311,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44041774084960345,"acs":26821,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":2.8043576793,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"","submitted":60899,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47251936554776836,"acs":2562,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"","submitted":5422,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7588850885701158,"acs":74329,"articleLive":2,"columnArticles":467,"formTitle":"[700]二叉搜索树中的搜索","frequency":1.2614526125,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"","submitted":97945,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7240091455529232,"acs":69982,"articleLive":2,"columnArticles":521,"formTitle":"[701]二叉搜索树中的插入操作","frequency":1.3917270434,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"","submitted":96659,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7383966244725738,"acs":4025,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"786","status":"","submitted":5451,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5118808390622246,"acs":58078,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":1.4954899573,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"789","status":"","submitted":113460,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5550232252729882,"acs":205398,"articleLive":2,"columnArticles":1001,"formTitle":"[704]二分查找","frequency":3.8371590103,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"792","status":"ac","submitted":370071,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6473344333761127,"acs":63554,"articleLive":2,"columnArticles":417,"formTitle":"[705]设计哈希集合","frequency":2.6388889909,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"816","status":"ac","submitted":98178,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6448489912856631,"acs":54019,"articleLive":2,"columnArticles":374,"formTitle":"[706]设计哈希映射","frequency":2.0833522823,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"817","status":"ac","submitted":83770,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3174056512214735,"acs":57233,"articleLive":2,"columnArticles":403,"formTitle":"[707]设计链表","frequency":2.7961339488,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"ac","submitted":180315,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3366238894373149,"acs":2046,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":0.3529369822,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"850","status":"","submitted":6078,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7596774546488982,"acs":69433,"articleLive":2,"columnArticles":494,"formTitle":"[709]转换成小写字母","frequency":0.2672681876,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"742","status":"","submitted":91398,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3505368382080711,"acs":4734,"articleLive":2,"columnArticles":55,"formTitle":"[710]黑名单中的随机数","frequency":1.2022637412,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"894","status":"","submitted":13505,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5750421585160203,"acs":682,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"","submitted":1186,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6713045147051768,"acs":13992,"articleLive":2,"columnArticles":148,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":1.7859770807,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"","submitted":20843,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4032522323257148,"acs":19690,"articleLive":2,"columnArticles":178,"formTitle":"[713]乘积小于K的子数组","frequency":1.999551181,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":48828,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7168632624553779,"acs":92375,"articleLive":2,"columnArticles":629,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":2.0746239385,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"","submitted":128860,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40252951096121414,"acs":2387,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":0.9158962917,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"","submitted":5930,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4586599241466498,"acs":3628,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":0.2672681876,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":7910,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5102603015406948,"acs":30933,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":0.819884004,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"","submitted":60622,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5638587850132636,"acs":77159,"articleLive":2,"columnArticles":555,"formTitle":"[718]最长重复子数组","frequency":3.3251457973,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"","submitted":136841,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3665061295971979,"acs":8371,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":0.819884004,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"","submitted":22840,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48606652112495186,"acs":18925,"articleLive":2,"columnArticles":247,"formTitle":"[720]词典中最长的单词","frequency":0.134874544,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"","submitted":38935,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46959702065832765,"acs":28119,"articleLive":2,"columnArticles":328,"formTitle":"[721]账户合并","frequency":2.2082675518,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"","submitted":59879,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3218042071197411,"acs":4773,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":1.6131342678,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"","submitted":14832,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7256061502069782,"acs":1227,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"","submitted":1691,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4562043795620438,"acs":130375,"articleLive":2,"columnArticles":820,"formTitle":"[724]寻找数组的中心下标","frequency":1.2355779478,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"","submitted":285782,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5624427628090808,"acs":23338,"articleLive":2,"columnArticles":305,"formTitle":"[725]分隔链表","frequency":1.1702165637,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":41494,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5555930531398457,"acs":21402,"articleLive":2,"columnArticles":389,"formTitle":"[726]原子的数量","frequency":2.4881149225,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":38521,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4130162703379224,"acs":2640,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":1.4683733283,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"","submitted":6392,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7589548997645553,"acs":33202,"articleLive":2,"columnArticles":299,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"","submitted":43747,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5056971203646157,"acs":7323,"articleLive":2,"columnArticles":82,"formTitle":"[729]我的日程安排表 I","frequency":1.1702165637,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"","submitted":14481,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4879120879120879,"acs":3774,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":1.999551181,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"","submitted":7735,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5097797838872932,"acs":3727,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":0.2672681876,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"","submitted":7311,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6111874386653582,"acs":3114,"articleLive":2,"columnArticles":49,"formTitle":"[732]我的日程安排表 III","frequency":0.4169793485,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"","submitted":5095,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805184998741505,"acs":57660,"articleLive":2,"columnArticles":491,"formTitle":"[733]图像渲染","frequency":1.8420927834,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":99325,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784892446223112,"acs":1913,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"","submitted":3998,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41007856006364357,"acs":16495,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":1.4356157319,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":40224,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4585516178736518,"acs":1488,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"","submitted":3245,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4627530879918503,"acs":3634,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"","submitted":7853,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5019010923333206,"acs":39469,"articleLive":2,"columnArticles":569,"formTitle":"[738]单调递增的数字","frequency":1.5024017902,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"","submitted":78639,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6775779158059005,"acs":197123,"articleLive":2,"columnArticles":1424,"formTitle":"[739]每日温度","frequency":4.2283553561,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":290923,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6311061439868717,"acs":44611,"articleLive":2,"columnArticles":527,"formTitle":"[740]删除并获得点数","frequency":2.8981030885,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"","submitted":70687,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3656213928434013,"acs":3801,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":1.3441443284,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"","submitted":10396,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.49272419627749575,"acs":1456,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"","submitted":2955,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5155676849487925,"acs":52707,"articleLive":2,"columnArticles":494,"formTitle":"[743]网络延迟时间","frequency":1.3178408656,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"744","status":"ac","submitted":102231,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.459272991810011,"acs":39142,"articleLive":2,"columnArticles":347,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":1.40404247,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"745","status":"","submitted":85226,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3909512761020882,"acs":2696,"articleLive":2,"columnArticles":51,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"746","status":"","submitted":6896,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5793829006649902,"acs":120496,"articleLive":2,"columnArticles":1191,"formTitle":"[746]使用最小花费爬楼梯","frequency":2.3009751722,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"","submitted":207973,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4146193537551435,"acs":44436,"articleLive":2,"columnArticles":393,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":0.2672681876,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"","submitted":107173,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5984784023224385,"acs":11957,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":0.2672681876,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"749","status":"","submitted":19979,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5064516129032258,"acs":1256,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.9158962917,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"750","status":"","submitted":2480,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7232486528098537,"acs":1879,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":1.1860873936,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"","submitted":2598,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083674228337672,"acs":1367,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"","submitted":2689,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5319131780945623,"acs":65970,"articleLive":2,"columnArticles":560,"formTitle":"[752]打开转盘锁","frequency":1.9333017954,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"753","status":"ac","submitted":124024,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5870992661259173,"acs":3040,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":0.9833335637,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"754","status":"","submitted":5178,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4276111111111111,"acs":7697,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":0.819884004,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"","submitted":18000,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5014061872237846,"acs":1248,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"","submitted":2489,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5736484721859494,"acs":4393,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":0.294577367,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"757","status":"","submitted":7658,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41616448068060974,"acs":2348,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":0.4506979845,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"","submitted":5642,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45853397538790797,"acs":3428,"articleLive":2,"columnArticles":68,"formTitle":"[758]字符串中的加粗单词","frequency":0.6337706971,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"760","status":"","submitted":7476,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6580152671755726,"acs":1724,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":0.3529369822,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"","submitted":2620,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8382997370727432,"acs":3826,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"","submitted":4564,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5941520467836258,"acs":2032,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":0.5881423444,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"763","status":"","submitted":3420,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6976941062646134,"acs":17307,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"767","status":"","submitted":24806,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7625482818160949,"acs":76402,"articleLive":2,"columnArticles":925,"formTitle":"[763]划分字母区间","frequency":3.0913530006,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"768","status":"","submitted":100193,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4904862579281184,"acs":3944,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"","submitted":8041,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6656698846244408,"acs":28271,"articleLive":2,"columnArticles":424,"formTitle":"[765]情侣牵手","frequency":2.7698804216,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"","submitted":42470,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081921310531618,"acs":54125,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":0.294577367,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"777","status":"","submitted":76427,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4774677717517721,"acs":39001,"articleLive":2,"columnArticles":487,"formTitle":"[767]重构字符串","frequency":2.0709081197,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"778","status":"","submitted":81683,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.49968186638388123,"acs":4712,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":1.2022637412,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"779","status":"","submitted":9430,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5908203125,"acs":11495,"articleLive":2,"columnArticles":134,"formTitle":"[769]最多能完成排序的块","frequency":0.2672681876,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"780","status":"","submitted":19456,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5520428015564203,"acs":1135,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"781","status":"","submitted":2056,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514108176811185,"acs":150721,"articleLive":2,"columnArticles":1096,"formTitle":"[771]宝石与石头","frequency":2.1437267157,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"782","status":"","submitted":177025,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.488826570852686,"acs":5578,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":1.3441443284,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"785","status":"","submitted":11411,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7155565404584019,"acs":22603,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":2.472932291,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"787","status":"","submitted":31588,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5941348973607038,"acs":1013,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"788","status":"","submitted":1705,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4613285660519383,"acs":4903,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"","submitted":10628,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5709560039695667,"acs":1726,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"","submitted":3023,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3239285073823899,"acs":5419,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":0.8505989493,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"793","status":"","submitted":16729,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5984332693672616,"acs":22765,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":0.3231018337,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"794","status":"","submitted":38041,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4354888067606695,"acs":18500,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":1.6451472448,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"","submitted":42481,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.284077257185103,"acs":3074,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":0.9496149277,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"796","status":"","submitted":10821,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6232106339468303,"acs":41446,"articleLive":2,"columnArticles":637,"formTitle":"[781]森林中的兔子","frequency":4.3213047066,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"","submitted":66504,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4216133942161339,"acs":1385,"articleLive":2,"columnArticles":28,"formTitle":"[782]变为棋盘","frequency":1.6131342678,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"","submitted":3285,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957892348901938,"acs":68284,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":1.6451472448,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"799","status":"ac","submitted":114611,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6839663819516955,"acs":39958,"articleLive":2,"columnArticles":430,"formTitle":"[784]字母大小写全排列","frequency":1.1393499157,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"800","status":"","submitted":58421,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5109784411276949,"acs":38515,"articleLive":2,"columnArticles":395,"formTitle":"[785]判断二分图","frequency":1.999551181,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"801","status":"ac","submitted":75375,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.460431654676259,"acs":3904,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"802","status":"","submitted":8479,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.6067171175997857,"acs":18119,"articleLive":2,"columnArticles":181,"formTitle":"[788]旋转数字","frequency":0.882570982,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"804","status":"","submitted":29864,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.69248729570114,"acs":20168,"articleLive":2,"columnArticles":283,"formTitle":"[789]逃脱阻碍者","frequency":1.0383045356,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"805","status":"ac","submitted":29124,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4477211796246649,"acs":3674,"articleLive":2,"columnArticles":59,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"806","status":"","submitted":8206,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.694860199987262,"acs":10910,"articleLive":2,"columnArticles":192,"formTitle":"[791]自定义字符串排序","frequency":1.6783464165,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"","submitted":15701,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4503620008775779,"acs":8211,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":0.819884004,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"","submitted":18232,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39409360140151833,"acs":4724,"articleLive":2,"columnArticles":64,"formTitle":"[793]阶乘函数后 K 个零","frequency":0.241088682,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"809","status":"","submitted":11987,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34094295189119045,"acs":7094,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":0.294577367,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"810","status":"","submitted":20807,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5342260844789515,"acs":7500,"articleLive":2,"columnArticles":83,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"","submitted":14039,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5230084705434472,"acs":21981,"articleLive":2,"columnArticles":260,"formTitle":"[796]旋转字符串","frequency":2.1282632872,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"","submitted":42028,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7404689535388623,"acs":17053,"articleLive":2,"columnArticles":249,"formTitle":"[797]所有可能的路径","frequency":1.1702165637,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"ac","submitted":23030,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.45706883789785346,"acs":1235,"articleLive":2,"columnArticles":30,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"814","status":"","submitted":2702,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4067667904151198,"acs":4821,"articleLive":2,"columnArticles":65,"formTitle":"[799]香槟塔","frequency":2.472932291,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"815","status":"","submitted":11852,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7053388090349076,"acs":1374,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"818","status":"","submitted":1948,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4175844124410021,"acs":6901,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.3841895257,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"819","status":"","submitted":16526,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.577152665204539,"acs":30263,"articleLive":2,"columnArticles":329,"formTitle":"[802]找到最终的安全状态","frequency":1.2022637412,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"ac","submitted":52435,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48347554380483115,"acs":12069,"articleLive":2,"columnArticles":122,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"821","status":"","submitted":24963,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7694603676615932,"acs":38927,"articleLive":2,"columnArticles":388,"formTitle":"[804]唯一摩尔斯密码词","frequency":1.1393499157,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"822","status":"","submitted":50590,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2897229042441249,"acs":2478,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":0.8505989493,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"823","status":"","submitted":8553,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6582608695652173,"acs":12869,"articleLive":2,"columnArticles":144,"formTitle":"[806]写字符串需要的行数","frequency":0.819884004,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"","submitted":19550,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8438679496039552,"acs":15874,"articleLive":2,"columnArticles":203,"formTitle":"[807]保持城市天际线","frequency":0.2672681876,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"","submitted":18811,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47850742883066805,"acs":4219,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":1.2702554863,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"","submitted":8817,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41780759815033097,"acs":4608,"articleLive":2,"columnArticles":84,"formTitle":"[809]情感丰富的文字","frequency":0.8505989493,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"827","status":"","submitted":11029,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7367141055665646,"acs":16358,"articleLive":2,"columnArticles":132,"formTitle":"[810]黑板异或游戏","frequency":1.965832545,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"ac","submitted":22204,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7027637033625057,"acs":15257,"articleLive":2,"columnArticles":187,"formTitle":"[811]子域名访问计数","frequency":0.7903397577,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"829","status":"","submitted":21710,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6295239251882438,"acs":10367,"articleLive":2,"columnArticles":90,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"","submitted":16468,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5473939596753953,"acs":6543,"articleLive":2,"columnArticles":80,"formTitle":"[813]最大平均值和的分组","frequency":0.3529369822,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"","submitted":11953,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998207885304659,"acs":21868,"articleLive":2,"columnArticles":336,"formTitle":"[814]二叉树剪枝","frequency":0.2672681876,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"832","status":"","submitted":31248,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43500374226032523,"acs":25573,"articleLive":2,"columnArticles":308,"formTitle":"[815]公交路线","frequency":4.044759551,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"833","status":"ac","submitted":58788,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51171875,"acs":3406,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":0.4169793485,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"834","status":"","submitted":6656,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.59152198421646,"acs":13117,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"ac","submitted":22175,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.4292929292929293,"acs":3485,"articleLive":2,"columnArticles":42,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"836","status":"","submitted":8118,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4207018112565339,"acs":20765,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":0.9158962917,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"837","status":"","submitted":49358,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5056417287970977,"acs":53103,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":1.922708476,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"839","status":"","submitted":105021,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6917077782044844,"acs":23415,"articleLive":2,"columnArticles":314,"formTitle":"[821]字符的最短距离","frequency":1.4356157319,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"841","status":"","submitted":33851,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5020310192023634,"acs":2719,"articleLive":2,"columnArticles":35,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"","submitted":5416,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4291127249763183,"acs":2718,"articleLive":2,"columnArticles":52,"formTitle":"[823]带因子的二叉树","frequency":0.5207050724,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"843","status":"","submitted":6334,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6142808722178285,"acs":16311,"articleLive":2,"columnArticles":232,"formTitle":"[824]山羊拉丁文","frequency":0.2672681876,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"851","status":"","submitted":26553,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.389330661824557,"acs":6218,"articleLive":2,"columnArticles":84,"formTitle":"[825]适龄的朋友","frequency":0.2672681876,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"852","status":"","submitted":15971,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37298282144716294,"acs":7165,"articleLive":2,"columnArticles":104,"formTitle":"[826]安排工作以达到最大收益","frequency":0.294577367,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"","submitted":19210,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39335596508244425,"acs":8111,"articleLive":2,"columnArticles":170,"formTitle":"[827]最大人工岛","frequency":1.4683733283,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"","submitted":20620,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4872881355932203,"acs":2990,"articleLive":2,"columnArticles":49,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"855","status":"","submitted":6136,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3608985765124555,"acs":8113,"articleLive":2,"columnArticles":94,"formTitle":"[829]连续整数求和","frequency":1.4356157319,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"856","status":"","submitted":22480,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431690408758507,"acs":51399,"articleLive":2,"columnArticles":572,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"857","status":"","submitted":94628,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4033736294630306,"acs":7174,"articleLive":2,"columnArticles":68,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"","submitted":17785,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.795457962190401,"acs":84659,"articleLive":2,"columnArticles":909,"formTitle":"[832]翻转图像","frequency":2.3383249146,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"861","status":"","submitted":106428,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4248496993987976,"acs":4876,"articleLive":2,"columnArticles":73,"formTitle":"[833]字符串中的查找与替换","frequency":0.2672681876,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"862","status":"","submitted":11477,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292047568966912,"acs":13083,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":0.882570982,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"863","status":"","submitted":24722,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5729137787635153,"acs":4133,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"864","status":"","submitted":7214,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47726296889027675,"acs":36681,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":0.819884004,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"866","status":"","submitted":76857,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.3968782303080422,"acs":19197,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":0.8505989493,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"867","status":"","submitted":48370,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5007039644312709,"acs":6757,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":0.215961732,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"868","status":"","submitted":13495,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5742901773408068,"acs":18750,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"869","status":"","submitted":32649,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35868903058116397,"acs":8832,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"","submitted":24623,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.656425576906527,"acs":53393,"articleLive":2,"columnArticles":522,"formTitle":"[841]钥匙和房间","frequency":0.819884004,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"871","status":"ac","submitted":81339,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4894118474743211,"acs":27826,"articleLive":2,"columnArticles":318,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":2.0300972333,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"872","status":"","submitted":56856,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3756258046059219,"acs":2626,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":0.4506979845,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"873","status":"","submitted":6991,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5161809672386896,"acs":82718,"articleLive":2,"columnArticles":922,"formTitle":"[844]比较含退格的字符串","frequency":1.3156848095,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"ac","submitted":160250,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4201487676961574,"acs":36771,"articleLive":2,"columnArticles":547,"formTitle":"[845]数组中的最长山脉","frequency":1.6131342678,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"","submitted":87519,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5109758347168419,"acs":8310,"articleLive":2,"columnArticles":112,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"876","status":"","submitted":16263,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6839145531400966,"acs":18121,"articleLive":2,"columnArticles":155,"formTitle":"[847]访问所有节点的最短路径","frequency":1.5586783059,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"877","status":"ac","submitted":26496,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4460027313793466,"acs":8491,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"878","status":"","submitted":19038,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4256693861906587,"acs":15548,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":0.3529369822,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"879","status":"","submitted":36526,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4410840534171249,"acs":2246,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":1.4249637351,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"880","status":"","submitted":5092,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4826586102719033,"acs":3994,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":1.1702165637,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"","submitted":8275,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7154251830084223,"acs":81801,"articleLive":2,"columnArticles":702,"formTitle":"[852]山脉数组的峰顶索引","frequency":2.8856834613,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"882","status":"ac","submitted":114339,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3814884053935802,"acs":9591,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":1.7486593177,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"883","status":"","submitted":25141,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3609951435630911,"acs":4237,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.3841895257,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"884","status":"","submitted":11737,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40817872018174933,"acs":4312,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":0.819884004,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"","submitted":10564,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6247908866406436,"acs":15686,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":1.8517902992,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"ac","submitted":25106,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4657244964262508,"acs":2867,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":1.3064040004,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"","submitted":6156,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5571047775271684,"acs":2717,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":1.2355779478,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"888","status":"","submitted":4877,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30147026113261266,"acs":27107,"articleLive":2,"columnArticles":351,"formTitle":"[859]亲密字符串","frequency":0.819884004,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"889","status":"","submitted":89916,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5864923060043339,"acs":85527,"articleLive":2,"columnArticles":747,"formTitle":"[860]柠檬水找零","frequency":1.6131342678,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"890","status":"","submitted":145828,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8089978168208753,"acs":31127,"articleLive":2,"columnArticles":435,"formTitle":"[861]翻转矩阵后的得分","frequency":0.2672681876,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"891","status":"","submitted":38476,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18731861430513208,"acs":15297,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":2.2457519225,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"892","status":"","submitted":81663,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6035942876499848,"acs":33855,"articleLive":2,"columnArticles":549,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":1.4334749077,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"ac","submitted":56089,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45279444269024316,"acs":2868,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"","submitted":6334,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.65377264735112,"acs":8552,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"896","status":"","submitted":13081,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22319703058376023,"acs":7276,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":0.8505989493,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"897","status":"","submitted":32599,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709875490363295,"acs":82614,"articleLive":2,"columnArticles":741,"formTitle":"[867]转置矩阵","frequency":3.0938808078,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"898","status":"","submitted":123123,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6236900977275404,"acs":15891,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"899","status":"","submitted":25479,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5502082779402642,"acs":6208,"articleLive":2,"columnArticles":87,"formTitle":"[869]重新排序得到 2 的幂","frequency":0.2672681876,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"","submitted":11283,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4232723892159901,"acs":13659,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":32270,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.338632021398548,"acs":8862,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":1.7859770807,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"","submitted":26170,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521639143195059,"acs":59553,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":2.6411438341,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"904","status":"ac","submitted":91316,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.508724449825511,"acs":14286,"articleLive":2,"columnArticles":102,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":1.6451472448,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"905","status":"","submitted":28082,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41298348316955885,"acs":19753,"articleLive":2,"columnArticles":216,"formTitle":"[874]模拟行走机器人","frequency":1.8182900697,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"906","status":"","submitted":47830,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4763829190805457,"acs":40786,"articleLive":2,"columnArticles":316,"formTitle":"[875]爱吃香蕉的珂珂","frequency":2.1130515548,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"","submitted":85616,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7062546733647173,"acs":134122,"articleLive":2,"columnArticles":1517,"formTitle":"[876]链表的中间结点","frequency":2.1177057567,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"ac","submitted":189906,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7566713928369702,"acs":65642,"articleLive":2,"columnArticles":471,"formTitle":"[877]石子游戏","frequency":2.8420297549,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":86751,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2796048269460284,"acs":4217,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"910","status":"","submitted":15082,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5560202218046107,"acs":21007,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":3.4573992344,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"911","status":"ac","submitted":37781,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25224404839339143,"acs":5817,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":0.3841895257,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"ac","submitted":23061,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.479087162265303,"acs":18831,"articleLive":2,"columnArticles":180,"formTitle":"[881]救生艇","frequency":1.6131342678,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"917","status":"","submitted":39306,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48211036992116435,"acs":1590,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"918","status":"","submitted":3298,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6850843231183148,"acs":10440,"articleLive":2,"columnArticles":102,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"919","status":"","submitted":15239,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6608851674641149,"acs":18785,"articleLive":2,"columnArticles":241,"formTitle":"[884]两句话中的不常见单词","frequency":0.241088682,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"920","status":"","submitted":28424,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6894703656998739,"acs":4374,"articleLive":2,"columnArticles":65,"formTitle":"[885]螺旋矩阵 III","frequency":1.4683733283,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"","submitted":6344,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4226307146262648,"acs":7978,"articleLive":2,"columnArticles":105,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"922","status":"","submitted":18877,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2916425560056212,"acs":49392,"articleLive":2,"columnArticles":323,"formTitle":"[887]鸡蛋掉落","frequency":3.244433888,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"923","status":"","submitted":169358,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6394311911231342,"acs":53420,"articleLive":2,"columnArticles":448,"formTitle":"[888]公平的糖果棒交换","frequency":0.215961732,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"924","status":"","submitted":83543,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.679786933157349,"acs":14421,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":2.2457519225,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"925","status":"","submitted":21214,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7256516939797911,"acs":8546,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"","submitted":11777,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3260895665746188,"acs":2716,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"","submitted":8329,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6388096208724011,"acs":32907,"articleLive":2,"columnArticles":674,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"928","status":"","submitted":51513,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7237470981838044,"acs":10600,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":0.3231018337,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"929","status":"","submitted":14646,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.774211366147048,"acs":12615,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"","submitted":16294,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5393747864707892,"acs":6315,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":1.1702165637,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"931","status":"","submitted":11708,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5866794104331203,"acs":58313,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":1.9333017954,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"932","status":"","submitted":99395,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7455281064181941,"acs":60809,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":2.8294572986,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"ac","submitted":81565,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3340410474168436,"acs":5192,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":1.2022637412,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"","submitted":15543,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5350033852403521,"acs":3951,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":0.3231018337,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"935","status":"","submitted":7385,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49289465554525796,"acs":3191,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"936","status":"","submitted":6474,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5406651198762568,"acs":17477,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"937","status":"ac","submitted":32325,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32573020951594595,"acs":3156,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"938","status":"","submitted":9689,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5308206461195693,"acs":2859,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":0.6824184212,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"939","status":"","submitted":5386,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.452176395774392,"acs":17421,"articleLive":2,"columnArticles":241,"formTitle":"[904]水果成篮","frequency":1.6451472448,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"940","status":"","submitted":38527,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7015697022548898,"acs":56315,"articleLive":2,"columnArticles":579,"formTitle":"[905]按奇偶排序数组","frequency":1.4356157319,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"","submitted":80270,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2719621251972646,"acs":2068,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":1.952682247,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"942","status":"","submitted":7604,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3151795024579175,"acs":10579,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":1.6451472448,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"943","status":"ac","submitted":33565,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6980744454890491,"acs":20048,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":0.2672681876,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"","submitted":28719,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.46160293650105494,"acs":15971,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":1.9603304678,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"ac","submitted":34599,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31704279380262046,"acs":6364,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"","submitted":20073,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.43122479303757166,"acs":4063,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"","submitted":9422,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5670384741089611,"acs":202989,"articleLive":2,"columnArticles":985,"formTitle":"[912]排序数组","frequency":3.992384707,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"ac","submitted":357981,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.401910686514108,"acs":1809,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":0.4169793485,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"949","status":"","submitted":4501,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3889299901892983,"acs":48365,"articleLive":2,"columnArticles":607,"formTitle":"[914]卡牌分组","frequency":0.819884004,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"950","status":"ac","submitted":124354,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4679304897314376,"acs":8886,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":0.819884004,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"","submitted":18990,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.43862019914651496,"acs":6167,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"952","status":"","submitted":14060,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5693749249189124,"acs":28438,"articleLive":2,"columnArticles":419,"formTitle":"[917]仅仅反转字母","frequency":1.7128183255,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"","submitted":49946,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3582620115020604,"acs":15823,"articleLive":2,"columnArticles":190,"formTitle":"[918]环形子数组的最大和","frequency":1.3735755286,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"","submitted":44166,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6252844500632111,"acs":4946,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"","submitted":7910,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.47953374898346435,"acs":1769,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"","submitted":3689,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7350502604739892,"acs":20036,"articleLive":2,"columnArticles":289,"formTitle":"[921]使括号有效的最少添加","frequency":0.3231018337,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"ac","submitted":27258,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144930106573368,"acs":88630,"articleLive":2,"columnArticles":815,"formTitle":"[922]按奇偶排序数组 II","frequency":0.819884004,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"958","status":"ac","submitted":124046,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.33735480612760227,"acs":6012,"articleLive":2,"columnArticles":79,"formTitle":"[923]三数之和的多种可能","frequency":0.8505989493,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"","submitted":17821,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35939012584704744,"acs":5940,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"","submitted":16528,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3883111692748944,"acs":49552,"articleLive":2,"columnArticles":665,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"","submitted":127609,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5145988454781226,"acs":6151,"articleLive":2,"columnArticles":110,"formTitle":"[926]将字符串翻转到单调递增","frequency":0.8505989493,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"","submitted":11953,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3375570197668525,"acs":3330,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":1.8248924969,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"963","status":"","submitted":9865,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42026117926394935,"acs":2124,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"","submitted":5054,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6422999431730123,"acs":24866,"articleLive":2,"columnArticles":224,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"","submitted":38714,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449474468261193,"acs":32923,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":2.5663408717,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"ac","submitted":60415,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6590686459196745,"acs":17493,"articleLive":2,"columnArticles":219,"formTitle":"[931]下降路径最小和","frequency":1.1095858138,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"","submitted":26542,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.627236737925574,"acs":7922,"articleLive":2,"columnArticles":75,"formTitle":"[932]漂亮数组","frequency":0.819884004,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"968","status":"","submitted":12630,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7233600033956578,"acs":34084,"articleLive":2,"columnArticles":291,"formTitle":"[933]最近的请求次数","frequency":1.6451472448,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"969","status":"","submitted":47119,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4750345503990014,"acs":21311,"articleLive":2,"columnArticles":244,"formTitle":"[934]最短的桥","frequency":2.163422472,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"","submitted":44862,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47480730223123735,"acs":5852,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"972","status":"","submitted":12325,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3787147574295149,"acs":1491,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"973","status":"","submitted":3937,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5878465589343796,"acs":11386,"articleLive":2,"columnArticles":119,"formTitle":"[937]重新排列日志文件","frequency":0.819884004,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"974","status":"","submitted":19369,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8181646103281538,"acs":95092,"articleLive":2,"columnArticles":781,"formTitle":"[938]二叉搜索树的范围和","frequency":2.4374515648,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"975","status":"ac","submitted":116226,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.45000440489824683,"acs":5108,"articleLive":2,"columnArticles":59,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"976","status":"","submitted":11351,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.412093640413231,"acs":4348,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":0.2672681876,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"977","status":"","submitted":10551,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.392581671152088,"acs":60975,"articleLive":2,"columnArticles":602,"formTitle":"[941]有效的山脉数组","frequency":0.241088682,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"978","status":"","submitted":155318,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7288693743139407,"acs":21912,"articleLive":2,"columnArticles":202,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"979","status":"","submitted":30063,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.4740780331373597,"acs":1774,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"","submitted":3742,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6901076268934361,"acs":20775,"articleLive":2,"columnArticles":174,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"981","status":"","submitted":30104,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48699401863958824,"acs":35010,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":1.4356157319,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"982","status":"","submitted":71890,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.621661935235529,"acs":25840,"articleLive":2,"columnArticles":285,"formTitle":"[946]验证栈序列","frequency":2.370230173,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"ac","submitted":41566,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127155120590569,"acs":25481,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"","submitted":41587,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3911983348201011,"acs":6578,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"","submitted":16815,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3695712437627056,"acs":7999,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":1.6451472448,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"","submitted":21644,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7742358436450053,"acs":9448,"articleLive":2,"columnArticles":136,"formTitle":"[950]按递增顺序显示卡牌","frequency":0.819884004,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"987","status":"","submitted":12203,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.66158517300272,"acs":10459,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":1.40404247,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"","submitted":15809,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34841902003379194,"acs":2887,"articleLive":2,"columnArticles":52,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"989","status":"","submitted":8286,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5525781910397295,"acs":13074,"articleLive":2,"columnArticles":155,"formTitle":"[953]验证外星语词典","frequency":1.1702165637,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"990","status":"","submitted":23660,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2989206739206739,"acs":6813,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":1.4356157319,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"","submitted":22792,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3296339771635898,"acs":3089,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":0.294577367,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"992","status":"","submitted":9371,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43514456069299134,"acs":3868,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":1.2355779478,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"993","status":"","submitted":8889,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35949260487394075,"acs":13660,"articleLive":2,"columnArticles":131,"formTitle":"[957]N 天后的牢房","frequency":1.2355779478,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"","submitted":37998,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5366514960782415,"acs":22168,"articleLive":2,"columnArticles":214,"formTitle":"[958]二叉树的完全性检验","frequency":1.6131342678,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"","submitted":41308,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437021653013346,"acs":19337,"articleLive":2,"columnArticles":298,"formTitle":"[959]由斜杠划分区域","frequency":1.1702165637,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"999","status":"","submitted":26001,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5525021695111368,"acs":1910,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":0.4169793485,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"","submitted":3457,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768864782567323,"acs":35567,"articleLive":2,"columnArticles":283,"formTitle":"[961]重复 N 次的元素","frequency":0.819884004,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"1001","status":"","submitted":52545,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4409839527027027,"acs":12531,"articleLive":2,"columnArticles":119,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"1002","status":"","submitted":28416,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.502454991816694,"acs":2456,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"","submitted":4888,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.425869432580842,"acs":1396,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":0.9158962917,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"1004","status":"","submitted":3278,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839542349873953,"acs":31743,"articleLive":2,"columnArticles":373,"formTitle":"[965]单值二叉树","frequency":0.2672681876,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"","submitted":46411,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40205766887775823,"acs":2970,"articleLive":2,"columnArticles":45,"formTitle":"[966]元音拼写检查器","frequency":0.4869864364,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"","submitted":7387,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.45784264595339513,"acs":7309,"articleLive":2,"columnArticles":139,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"","submitted":15964,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.49623332351332017,"acs":23582,"articleLive":2,"columnArticles":314,"formTitle":"[968]监控二叉树","frequency":1.754773301,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"1008","status":"","submitted":47522,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.651887384560208,"acs":14541,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":0.294577367,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"1009","status":"","submitted":22306,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41440441092009034,"acs":10823,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"","submitted":26117,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4427944650691866,"acs":6560,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":0.3841895257,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"","submitted":14815,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104180491041805,"acs":1237,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":0.7903397577,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"","submitted":3014,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6384293461175731,"acs":64987,"articleLive":2,"columnArticles":622,"formTitle":"[973]最接近原点的 K 个点","frequency":0.2672681876,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"ac","submitted":101792,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4653043126719787,"acs":35680,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":2.6411438341,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"","submitted":76681,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44216867469879517,"acs":2936,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":0.3529369822,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"1017","status":"","submitted":6640,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5970211992456431,"acs":52551,"articleLive":2,"columnArticles":486,"formTitle":"[976]三角形的最大周长","frequency":1.2022637412,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"","submitted":88022,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7177543086112642,"acs":144555,"articleLive":2,"columnArticles":1137,"formTitle":"[977]有序数组的平方","frequency":2.3189166277,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"1019","status":"ac","submitted":201399,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735986640690231,"acs":42541,"articleLive":2,"columnArticles":590,"formTitle":"[978]最长湍流子数组","frequency":0.819884004,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"","submitted":89825,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7120286312849162,"acs":8157,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":0.8505989493,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"1021","status":"","submitted":11456,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7332722766943217,"acs":13611,"articleLive":2,"columnArticles":201,"formTitle":"[980]不同路径 III","frequency":1.2702554863,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"1022","status":"","submitted":18562,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5356662876046728,"acs":20726,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":2.5579452216,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"ac","submitted":38692,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.541750167000668,"acs":2433,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"1024","status":"","submitted":4491,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6335816549868477,"acs":31553,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":2.2775713425,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"1025","status":"","submitted":49801,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41620485381234473,"acs":8712,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"","submitted":20932,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5991023003553394,"acs":16017,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":0.2672681876,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"","submitted":26735,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6761423197878769,"acs":21930,"articleLive":2,"columnArticles":214,"formTitle":"[986]区间列表的交集","frequency":2.1851695506,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"1028","status":"ac","submitted":32434,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5321116142338967,"acs":22445,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":1.4088260237,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"1029","status":"ac","submitted":42181,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4953562124815947,"acs":8747,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"1030","status":"","submitted":17658,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4729826453118174,"acs":50883,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":0.7903397577,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"1031","status":"","submitted":107579,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.4987431890212487,"acs":31945,"articleLive":2,"columnArticles":484,"formTitle":"[990]等式方程的可满足性","frequency":0.2672681876,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"1032","status":"","submitted":64051,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5177717857580586,"acs":8449,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":0.8505989493,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"","submitted":16318,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4512211788133773,"acs":23112,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":0.8505989493,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"1034","status":"","submitted":51221,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5576015214229779,"acs":49844,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":2.4032463771,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"1035","status":"ac","submitted":89390,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5088977149636355,"acs":49330,"articleLive":2,"columnArticles":1335,"formTitle":"[994]腐烂的橘子","frequency":1.8182900697,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"1036","status":"ac","submitted":96935,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402991169414527,"acs":21170,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":1.2022637412,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"1037","status":"","submitted":39182,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4966394623139702,"acs":4138,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":1.0613762707,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"1038","status":"","submitted":8332,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5122920966371252,"acs":33758,"articleLive":2,"columnArticles":363,"formTitle":"[997]找到小镇的法官","frequency":0.7344592993,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"1039","status":"","submitted":65896,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6143198483974623,"acs":7456,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"","submitted":12137,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913458223192737,"acs":30077,"articleLive":2,"columnArticles":564,"formTitle":"[999]可以被一步捕获的棋子数","frequency":0.2672681876,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"1041","status":"","submitted":43505,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4069655338635816,"acs":3377,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":1.5024017902,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1042","status":"","submitted":8298,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2912214842622004,"acs":2017,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":0.6337706971,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1043","status":"","submitted":6926,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377549381724747,"acs":55128,"articleLive":2,"columnArticles":586,"formTitle":"[1002]查找常用字符","frequency":1.9333017954,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1044","status":"","submitted":74724,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5758681062153487,"acs":11841,"articleLive":2,"columnArticles":178,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"ac","submitted":20562,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.598579074325343,"acs":63526,"articleLive":2,"columnArticles":679,"formTitle":"[1004]最大连续1的个数 III","frequency":2.4701555912,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1046","status":"","submitted":106128,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5376610735144155,"acs":23199,"articleLive":2,"columnArticles":382,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":1.0613762707,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"","submitted":43148,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6276929661863319,"acs":43995,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":2.472932291,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"ac","submitted":70090,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4639089184060721,"acs":6112,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"","submitted":13175,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7267214661096887,"acs":16179,"articleLive":2,"columnArticles":212,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":1.965832545,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1050","status":"","submitted":22263,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5925232154955961,"acs":14867,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":0.2672681876,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1054","status":"","submitted":25091,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4496067906628386,"acs":18009,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"","submitted":40055,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.627195117992664,"acs":57966,"articleLive":2,"columnArticles":558,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":3.2400289827,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1056","status":"ac","submitted":92421,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3292134831460674,"acs":2930,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":1.0950949067,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1057","status":"","submitted":8900,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39831807592042473,"acs":45991,"articleLive":2,"columnArticles":909,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":1.7128183255,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1062","status":"","submitted":115463,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5453329767317464,"acs":34663,"articleLive":2,"columnArticles":420,"formTitle":"[1014]最佳观光组合","frequency":0.7344592993,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1063","status":"","submitted":63563,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35347227447144686,"acs":4698,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":0.882570982,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1064","status":"","submitted":13291,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5832948777111213,"acs":5056,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1065","status":"","submitted":8668,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5616909716532853,"acs":3428,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"","submitted":6103,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167442523275698,"acs":43514,"articleLive":2,"columnArticles":369,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"","submitted":84208,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5973246808901405,"acs":19514,"articleLive":2,"columnArticles":255,"formTitle":"[1019]链表中的下一个更大节点","frequency":0.2672681876,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"ac","submitted":32669,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5366170199616834,"acs":8683,"articleLive":2,"columnArticles":130,"formTitle":"[1020]飞地的数量","frequency":1.1702165637,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"","submitted":16181,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834638575091829,"acs":56523,"articleLive":2,"columnArticles":639,"formTitle":"[1021]删除最外层的括号","frequency":1.4356157319,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"ac","submitted":72145,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7021600356294537,"acs":18919,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":0.2672681876,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1079","status":"","submitted":26944,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5643547709121479,"acs":6713,"articleLive":2,"columnArticles":145,"formTitle":"[1023]驼峰式匹配","frequency":0.294577367,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"","submitted":11895,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5604968987024654,"acs":32441,"articleLive":2,"columnArticles":371,"formTitle":"[1024]视频拼接","frequency":0.7903397577,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"","submitted":57879,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096464258262875,"acs":73860,"articleLive":2,"columnArticles":636,"formTitle":"[1025]除数博弈","frequency":2.0300972333,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"","submitted":104080,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.667943450100982,"acs":9591,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1092","status":"","submitted":14359,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43323083301661885,"acs":12539,"articleLive":2,"columnArticles":113,"formTitle":"[1027]最长等差数列","frequency":1.4683733283,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"ac","submitted":28943,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7319769363546219,"acs":19931,"articleLive":2,"columnArticles":418,"formTitle":"[1028]从先序遍历还原二叉树","frequency":0.8505989493,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1093","status":"","submitted":27229,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6525778170996541,"acs":16227,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1095","status":"","submitted":24866,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.712166435703372,"acs":40085,"articleLive":2,"columnArticles":440,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.3231018337,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1094","status":"","submitted":56286,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5669031311154599,"acs":4635,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":0.294577367,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1096","status":"","submitted":8176,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453317964762064,"acs":2396,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"","submitted":6073,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.38917395389173953,"acs":10770,"articleLive":2,"columnArticles":161,"formTitle":"[1033]移动石子直到连续","frequency":0.2672681876,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1103","status":"","submitted":27674,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4324046468592577,"acs":4206,"articleLive":2,"columnArticles":90,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"","submitted":9727,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.627492997988684,"acs":33382,"articleLive":2,"columnArticles":367,"formTitle":"[1035]不相交的线","frequency":2.9055325432,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"ac","submitted":53199,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29979782420333106,"acs":3114,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.294577367,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"","submitted":10387,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43853141199410284,"acs":9221,"articleLive":2,"columnArticles":104,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1115","status":"","submitted":21027,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7937578109583635,"acs":24135,"articleLive":2,"columnArticles":307,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":0.241088682,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1114","status":"","submitted":30406,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5532650448143406,"acs":4321,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"","submitted":7810,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.522537222108913,"acs":2562,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1113","status":"","submitted":4903,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4811362958544587,"acs":6453,"articleLive":2,"columnArticles":109,"formTitle":"[1041]困于环中的机器人","frequency":1.1702165637,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1119","status":"","submitted":13412,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5267227215618053,"acs":10900,"articleLive":2,"columnArticles":146,"formTitle":"[1042]不邻接植花","frequency":0.7903397577,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1120","status":"","submitted":20694,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6901699370951084,"acs":7351,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1121","status":"","submitted":10651,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20958579881656805,"acs":5313,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":2.5331914825,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1122","status":"","submitted":25350,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6445827532552616,"acs":7871,"articleLive":2,"columnArticles":97,"formTitle":"[1045]买下所有产品的客户","frequency":0.2672681876,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"","submitted":12211,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595633133904891,"acs":64161,"articleLive":2,"columnArticles":894,"formTitle":"[1046]最后一块石头的重量","frequency":1.4683733283,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1127","status":"","submitted":97278,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259297438168316,"acs":99999,"articleLive":2,"columnArticles":944,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":3.7072616114,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"ac","submitted":137753,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4506176003280201,"acs":8792,"articleLive":2,"columnArticles":123,"formTitle":"[1048]最长字符串链","frequency":1.4683733283,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"","submitted":19511,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6417567369296229,"acs":39366,"articleLive":2,"columnArticles":382,"formTitle":"[1049]最后一块石头的重量 II","frequency":2.8294572986,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":61341,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7568426373943814,"acs":10480,"articleLive":2,"columnArticles":49,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":0.2672681876,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1136","status":"","submitted":13847,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7518737477428451,"acs":30396,"articleLive":2,"columnArticles":356,"formTitle":"[1051]高度检查器","frequency":0.2672681876,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"","submitted":40427,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5808620989155521,"acs":46814,"articleLive":2,"columnArticles":735,"formTitle":"[1052]爱生气的书店老板","frequency":1.4356157319,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"","submitted":80594,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4589930335655478,"acs":5798,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":0.819884004,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"","submitted":12632,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37533590658132604,"acs":7682,"articleLive":2,"columnArticles":104,"formTitle":"[1054]距离相等的条形码","frequency":0.819884004,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"","submitted":20467,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5856650585802895,"acs":4249,"articleLive":2,"columnArticles":74,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1051","status":"","submitted":7255,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40632847815168255,"acs":3236,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"","submitted":7964,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4610749960361503,"acs":2908,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"","submitted":6307,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3380058185665168,"acs":1278,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"","submitted":3781,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35958140332818667,"acs":2096,"articleLive":2,"columnArticles":35,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"511","status":"","submitted":5829,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5290204773705491,"acs":4056,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":1.4356157319,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"","submitted":7667,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5988584474885845,"acs":2623,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"","submitted":4380,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5355868863597758,"acs":3153,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"","submitted":5887,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.697991967871486,"acs":1738,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1061","status":"","submitted":2490,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.651048951048951,"acs":4655,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1066","status":"","submitted":7150,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5376665135507579,"acs":2341,"articleLive":2,"columnArticles":64,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"","submitted":4354,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.471923828125,"acs":1933,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1067","status":"","submitted":4096,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.4199042043640234,"acs":789,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","questionId":"1068","status":"","submitted":1879,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8641308161976279,"acs":12313,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1153","status":"","submitted":14249,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8203488831004815,"acs":10393,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":0.2672681876,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"","submitted":12669,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48314306696041126,"acs":7237,"articleLive":2,"columnArticles":64,"formTitle":"[1070]产品销售分析 III","frequency":0.2672681876,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"","submitted":14979,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865916984765639,"acs":34115,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":0.2672681876,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1146","status":"ac","submitted":58158,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5782214156079855,"acs":3186,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":0.4869864364,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1147","status":"","submitted":5510,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33717413221950165,"acs":2341,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.4869864364,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1148","status":"","submitted":6943,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6699343996462004,"acs":18178,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":2.2422818656,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1145","status":"ac","submitted":27134,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6954362733506739,"acs":8823,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1161","status":"","submitted":12687,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.497112557748845,"acs":9469,"articleLive":2,"columnArticles":81,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1162","status":"","submitted":19048,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7203991358913692,"acs":7003,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1163","status":"","submitted":9721,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6218984499096237,"acs":11354,"articleLive":2,"columnArticles":172,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1156","status":"","submitted":18257,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7349110004773921,"acs":10776,"articleLive":2,"columnArticles":178,"formTitle":"[1079]活字印刷","frequency":0.241088682,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1160","status":"","submitted":14663,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48980822578699795,"acs":4061,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1157","status":"","submitted":8291,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5712276637988087,"acs":13810,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":1.999551181,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1159","status":"ac","submitted":24176,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7593263696439991,"acs":10686,"articleLive":2,"columnArticles":89,"formTitle":"[1082]销售分析 I ","frequency":0.3231018337,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1172","status":"","submitted":14073,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5274504480043443,"acs":9713,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":0.8505989493,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"","submitted":18415,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5387455939126056,"acs":9629,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1174","status":"","submitted":17873,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7732570925885199,"acs":3516,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"","submitted":4547,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6898485698261357,"acs":4920,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1074","status":"","submitted":7132,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5307125307125307,"acs":1728,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1076","status":"","submitted":3256,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44483985765124556,"acs":1000,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1077","status":"","submitted":2248,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5856043401463538,"acs":18566,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":0.241088682,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1168","status":"","submitted":31704,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5412489258092237,"acs":3779,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"","submitted":6982,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.37737437435905286,"acs":24655,"articleLive":2,"columnArticles":258,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":1.9333017954,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":65333,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4883210221601118,"acs":2446,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":0.9158962917,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1170","status":"","submitted":5009,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.38640331732867744,"acs":3541,"articleLive":2,"columnArticles":53,"formTitle":"[1093]大样本统计","frequency":0.4506979845,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1183","status":"","submitted":9164,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.618490721225518,"acs":24063,"articleLive":2,"columnArticles":355,"formTitle":"[1094]拼车","frequency":0.7618883365,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1184","status":"","submitted":38906,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37311646523308745,"acs":19017,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1185","status":"","submitted":50968,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5584958217270195,"acs":1604,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1188","status":"","submitted":2872,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.518415694984268,"acs":5602,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":1.5377974512,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1193","status":"","submitted":10806,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.47409272078875603,"acs":6780,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":0.8505989493,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1198","status":"","submitted":14301,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5795124415814071,"acs":4588,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"","submitted":7917,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6979758264161934,"acs":4793,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1084","status":"","submitted":6867,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6668599594085242,"acs":2300,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1085","status":"","submitted":3449,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3657116940055938,"acs":4838,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1099","status":"","submitted":13229,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6365145076869768,"acs":34902,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":0.819884004,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1195","status":"","submitted":54833,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7613758895837827,"acs":28244,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":1.0000395988,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1194","status":"ac","submitted":37096,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5556541019955654,"acs":5012,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1196","status":"","submitted":9020,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5732412237417172,"acs":4066,"articleLive":2,"columnArticles":119,"formTitle":"[1106]解析布尔表达式","frequency":0.882570982,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1197","status":"","submitted":7093,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4106241163401333,"acs":6099,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":0.294577367,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"","submitted":14853,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8390893721955994,"acs":66012,"articleLive":2,"columnArticles":671,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1205","status":"","submitted":78671,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.507942313721392,"acs":29163,"articleLive":2,"columnArticles":270,"formTitle":"[1109]航班预订统计","frequency":1.9018808982,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1206","status":"","submitted":57414,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6265154243188092,"acs":10439,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":0.882570982,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1207","status":"","submitted":16662,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.772572870499175,"acs":23881,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":1.2022637412,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"","submitted":30911,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6416849015317286,"acs":7038,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":0.819884004,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"","submitted":10968,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5431285298647954,"acs":6347,"articleLive":2,"columnArticles":45,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1215","status":"","submitted":11686,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6525530480448514,"acs":73561,"articleLive":2,"columnArticles":553,"formTitle":"[1114]按序打印","frequency":3.9213637784,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1203","status":"","submitted":112728,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.560999766152661,"acs":40783,"articleLive":2,"columnArticles":464,"formTitle":"[1115]交替打印FooBar","frequency":2.7766780822,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1187","status":"","submitted":72697,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5148502848830161,"acs":21235,"articleLive":2,"columnArticles":349,"formTitle":"[1116]打印零与奇偶数","frequency":2.7698804216,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1216","status":"","submitted":41245,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5211509146341463,"acs":16410,"articleLive":2,"columnArticles":242,"formTitle":"[1117]H2O 生成","frequency":2.1754418474,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"","submitted":31488,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.641223556317896,"acs":2243,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1088","status":"","submitted":3498,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662507929794883,"acs":8193,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"","submitted":9458,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6038053949903661,"acs":2507,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":0.3529369822,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"","submitted":4152,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5717367853290184,"acs":1060,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","questionId":"1118","status":"","submitted":1854,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070540160328697,"acs":63328,"articleLive":2,"columnArticles":855,"formTitle":"[1122]数组的相对排序","frequency":2.4550267096,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"","submitted":89566,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7044002190980464,"acs":7716,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"","submitted":10954,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3149911541263399,"acs":12107,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":0.3231018337,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"ac","submitted":38436,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49021592442645073,"acs":2906,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"","submitted":5928,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.69632714880727,"acs":5517,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":0.2672681876,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1225","status":"","submitted":7923,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41772586739951906,"acs":3648,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1226","status":"","submitted":8733,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.54481426448737,"acs":36666,"articleLive":2,"columnArticles":474,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":0.7903397577,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1227","status":"","submitted":67300,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3785822977428354,"acs":5971,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":0.3231018337,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"","submitted":15772,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6266266266266266,"acs":5634,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1228","status":"ac","submitted":8991,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45277820296953925,"acs":2958,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"","submitted":6533,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3938441630464923,"acs":4261,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":0.819884004,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"","submitted":10819,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6435779816513761,"acs":2806,"articleLive":2,"columnArticles":57,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1098","status":"","submitted":4360,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7745839636913767,"acs":3072,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1090","status":"","submitted":3966,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5340982696400481,"acs":5772,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":1.1393499157,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"","submitted":10807,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5667420814479638,"acs":2505,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"","submitted":4420,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6055198515362886,"acs":66236,"articleLive":2,"columnArticles":789,"formTitle":"[1137]第 N 个泰波那契数","frequency":0.6182424347,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1236","status":"ac","submitted":109387,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4313342025206432,"acs":5955,"articleLive":2,"columnArticles":134,"formTitle":"[1138]字母板上的路径","frequency":0.294577367,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"","submitted":13806,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4764575177229923,"acs":9006,"articleLive":2,"columnArticles":144,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":0.882570982,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"","submitted":18902,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6539624924379915,"acs":6486,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":0.3231018337,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1240","status":"","submitted":9918,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5124600286690925,"acs":9295,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":0.2672681876,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1245","status":"","submitted":18138,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3714054272985014,"acs":6419,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1246","status":"","submitted":17283,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6321965483533893,"acs":150043,"articleLive":2,"columnArticles":1039,"formTitle":"[1143]最长公共子序列","frequency":3.9691663399,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1250","status":"ac","submitted":237336,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44171967536740514,"acs":10069,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":1.1393499157,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"notac","submitted":22795,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46879101647951,"acs":6429,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":1.6783464165,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"","submitted":13714,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.28638941398865786,"acs":3939,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"","submitted":13754,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5547233261999388,"acs":3629,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1251","status":"","submitted":6542,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7180146331817283,"acs":7262,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1258","status":"","submitted":10114,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44414316702819956,"acs":4914,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1259","status":"","submitted":11064,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6075415191941193,"acs":4463,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":0.882570982,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1102","status":"","submitted":7346,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48351231838281744,"acs":3827,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":0.7618883365,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"","submitted":7915,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3834087481146305,"acs":1271,"articleLive":2,"columnArticles":29,"formTitle":"[1152]用户网站访问行为分析","frequency":0.6824184212,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1108","status":"","submitted":3315,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3714606741573034,"acs":1653,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1124","status":"","submitted":4450,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5654799345829664,"acs":13485,"articleLive":2,"columnArticles":214,"formTitle":"[1154]一年中的第几天","frequency":0.241088682,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"","submitted":23847,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4796286472148541,"acs":9041,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":0.294577367,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1263","status":"","submitted":18850,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.434233409610984,"acs":4744,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"","submitted":10925,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3132437197003085,"acs":2843,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.4506979845,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1262","status":"","submitted":9076,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5518222611360403,"acs":5042,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"","submitted":9137,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.49511915015790986,"acs":3449,"articleLive":2,"columnArticles":73,"formTitle":"[1159]市场分析 II","frequency":0.9496149277,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"","submitted":6966,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6877973344665982,"acs":58264,"articleLive":2,"columnArticles":897,"formTitle":"[1160]拼写单词","frequency":0.819884004,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1112","status":"","submitted":84711,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6338729763387297,"acs":10180,"articleLive":2,"columnArticles":163,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"","submitted":16060,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4689192772453502,"acs":37137,"articleLive":2,"columnArticles":486,"formTitle":"[1162]地图分析","frequency":1.5377974512,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"","submitted":79197,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2672244554548004,"acs":5717,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.3529369822,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1133","status":"","submitted":21394,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6175984902099552,"acs":5236,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":0.8505989493,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1278","status":"","submitted":8478,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837889742431089,"acs":7417,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1123","status":"","submitted":8852,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4821748655646286,"acs":2421,"articleLive":2,"columnArticles":44,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1125","status":"","submitted":5021,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.420591669910471,"acs":2161,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"","submitted":5138,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5695963787250095,"acs":1510,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":0.4869864364,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1144","status":"","submitted":2651,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224319904861008,"acs":6507,"articleLive":2,"columnArticles":76,"formTitle":"[1169]查询无效交易","frequency":0.9158962917,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"","submitted":20181,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.617229048230332,"acs":13463,"articleLive":2,"columnArticles":209,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":0.3231018337,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"","submitted":21812,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47168241965973534,"acs":12476,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":0.294577367,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"ac","submitted":26450,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.270896957357765,"acs":2395,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1270","status":"","submitted":8841,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7584292348071876,"acs":7513,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1291","status":"","submitted":9906,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6192382003864201,"acs":4487,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"","submitted":7246,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4874929338609384,"acs":6899,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"","submitted":14152,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.44458735262593785,"acs":4148,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":0.3529369822,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"","submitted":9330,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.263610569249867,"acs":5946,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":0.3231018337,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1281","status":"","submitted":22556,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46213354029492026,"acs":18459,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":2.1282632872,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1282","status":"","submitted":39943,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6338866755201417,"acs":28639,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":2.5425460877,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1301","status":"","submitted":45180,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7732513451191392,"acs":3018,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":0.3529369822,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1131","status":"","submitted":3903,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3694380879735571,"acs":1453,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"","submitted":3933,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3841735800893427,"acs":1806,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1134","status":"","submitted":4701,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.5994263862332696,"acs":627,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1152","status":"","submitted":1046,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5849848765292763,"acs":12958,"articleLive":2,"columnArticles":250,"formTitle":"[1184]公交站间的距离","frequency":0.819884004,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"","submitted":22151,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6100011224604333,"acs":10869,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":0.7903397577,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1289","status":"","submitted":17818,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39094172880419775,"acs":7078,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":1.3064040004,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"","submitted":18105,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4370186335403727,"acs":1759,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1290","status":"","submitted":4025,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6924977538185085,"acs":3083,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"","submitted":4452,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6445346199316229,"acs":20172,"articleLive":2,"columnArticles":309,"formTitle":"[1189]“气球” 的最大数量","frequency":0.241088682,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1297","status":"","submitted":31297,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6510005507618872,"acs":42552,"articleLive":2,"columnArticles":595,"formTitle":"[1190]反转每对括号间的子串","frequency":4.622869529,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1298","status":"ac","submitted":65364,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26766398158803223,"acs":5815,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1299","status":"","submitted":21725,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49904470768055026,"acs":3918,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1300","status":"","submitted":7851,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6111375535459305,"acs":5136,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":0.2672681876,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1317","status":"","submitted":8404,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5133816120906801,"acs":3261,"articleLive":2,"columnArticles":57,"formTitle":"[1194]锦标赛优胜者","frequency":0.294577367,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1318","status":"","submitted":6352,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.635401940233023,"acs":13034,"articleLive":2,"columnArticles":255,"formTitle":"[1195]交替打印字符串","frequency":1.4356157319,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1316","status":"","submitted":20513,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6916043225270158,"acs":3328,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"","submitted":4812,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36572365723657235,"acs":4460,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":0.9158962917,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1142","status":"","submitted":12195,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7484872932634127,"acs":3711,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"","submitted":4958,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.43317132442284323,"acs":713,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","questionId":"1167","status":"","submitted":1646,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6859171220037491,"acs":17198,"articleLive":2,"columnArticles":240,"formTitle":"[1200]最小绝对差","frequency":0.819884004,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1306","status":"","submitted":25073,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24691252874542202,"acs":5798,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1307","status":"","submitted":23482,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.502516010978957,"acs":26364,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":0.294577367,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"","submitted":52464,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6248697102355639,"acs":11990,"articleLive":2,"columnArticles":141,"formTitle":"[1203]项目管理","frequency":0.4506979845,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1309","status":"","submitted":19188,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.727107761027359,"acs":5209,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":0.8505989493,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1327","status":"","submitted":7164,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4677388289676425,"acs":4857,"articleLive":2,"columnArticles":76,"formTitle":"[1205]每月交易II","frequency":1.2022637412,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"","submitted":10384,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6185353335965259,"acs":6267,"articleLive":2,"columnArticles":84,"formTitle":"[1206]设计跳表","frequency":0.8505989493,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1337","status":"","submitted":10132,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7302263384676341,"acs":58976,"articleLive":2,"columnArticles":817,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1319","status":"","submitted":80764,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4964009831460674,"acs":45240,"articleLive":2,"columnArticles":596,"formTitle":"[1208]尽可能使字符串相等","frequency":1.2022637412,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"","submitted":91136,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5329069336299592,"acs":11498,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":1.7128183255,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1320","status":"ac","submitted":21576,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44832426741533604,"acs":2555,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1322","status":"","submitted":5699,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6591284092012035,"acs":6791,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":0.819884004,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1338","status":"","submitted":10303,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5154209197673142,"acs":4696,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":0.2672681876,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"","submitted":9111,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7727581983943393,"acs":5679,"articleLive":2,"columnArticles":118,"formTitle":"[1213]三个有序数组的交集","frequency":0.882570982,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1149","status":"","submitted":7349,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6320235756385069,"acs":3217,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":0.4506979845,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1150","status":"","submitted":5090,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40878597706124215,"acs":1889,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.6337706971,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"","submitted":4621,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5324074074074074,"acs":1380,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"","submitted":2592,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6943573150196454,"acs":21030,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":1.6783464165,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1329","status":"","submitted":30287,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4214662447257384,"acs":7991,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1330","status":"","submitted":18960,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6313374125874126,"acs":11556,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":1.6783464165,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1331","status":"","submitted":18304,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.526093684062456,"acs":3740,"articleLive":2,"columnArticles":68,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1332","status":"","submitted":7109,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.804163438809765,"acs":40484,"articleLive":2,"columnArticles":651,"formTitle":"[1221]分割平衡字符串","frequency":0.7903397577,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1341","status":"","submitted":50343,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6717612809315866,"acs":5538,"articleLive":2,"columnArticles":122,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1342","status":"","submitted":8244,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47363038714390066,"acs":3242,"articleLive":2,"columnArticles":55,"formTitle":"[1223]掷骰子模拟","frequency":0.4506979845,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1343","status":"","submitted":6845,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3245953301819224,"acs":4532,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":1.2355779478,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1344","status":"","submitted":13962,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.544995491433724,"acs":3022,"articleLive":2,"columnArticles":71,"formTitle":"[1225]报告系统状态的连续日期","frequency":0.9496149277,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1357","status":"","submitted":5545,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6007512744834987,"acs":11195,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":2.4881149225,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1340","status":"","submitted":18635,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6619119462350843,"acs":9652,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":0.241088682,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"","submitted":14582,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5395618323374978,"acs":2980,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1164","status":"","submitted":5523,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4125,"acs":2244,"articleLive":2,"columnArticles":41,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1165","status":"","submitted":5440,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4872351982618142,"acs":2691,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"","submitted":5523,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5549929106744986,"acs":2740,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":1.0214188978,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"","submitted":4937,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4690759429441281,"acs":33280,"articleLive":2,"columnArticles":410,"formTitle":"[1232]缀点成线","frequency":0.7903397577,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1349","status":"","submitted":70948,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48191858630482803,"acs":7636,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":0.294577367,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1350","status":"","submitted":15845,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.341300822773407,"acs":5683,"articleLive":2,"columnArticles":83,"formTitle":"[1234]替换子串得到平衡字符串","frequency":0.819884004,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1351","status":"","submitted":16651,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45031181663562,"acs":5560,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":1.922708476,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1352","status":"","submitted":12347,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5593390085127692,"acs":1117,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1271","status":"","submitted":1997,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7114346590909091,"acs":10017,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"","submitted":14080,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6550422034651266,"acs":2949,"articleLive":2,"columnArticles":69,"formTitle":"[1238]循环码排列","frequency":0.3841895257,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1359","status":"","submitted":4502,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49073300089355204,"acs":34050,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":1.999551181,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1360","status":"","submitted":69386,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4949372215471851,"acs":2444,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":1.6131342678,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1361","status":"","submitted":4938,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5971440064360418,"acs":5938,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1377","status":"","submitted":9944,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4634630659253376,"acs":1167,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":0.9833335637,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1368","status":"","submitted":2518,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393667094565683,"acs":2521,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"","submitted":4674,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6226670273194482,"acs":2302,"articleLive":2,"columnArticles":37,"formTitle":"[1244]力扣排行榜","frequency":0.4169793485,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1176","status":"","submitted":3697,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5055790108564535,"acs":3353,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":0.3529369822,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"","submitted":6632,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4791352438411262,"acs":2859,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":0.7344592993,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1202","status":"","submitted":5967,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.615116894908073,"acs":8130,"articleLive":2,"columnArticles":151,"formTitle":"[1247]交换字符使得字符串相同","frequency":1.5377974512,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1369","status":"","submitted":13217,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5583942819148936,"acs":33593,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":0.7903397577,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1370","status":"","submitted":60160,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5717705982717816,"acs":20777,"articleLive":2,"columnArticles":304,"formTitle":"[1249]移除无效的括号","frequency":1.7859770807,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"ac","submitted":36338,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5602928509905254,"acs":2602,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":0.882570982,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1372","status":"","submitted":4644,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7722438126406218,"acs":7551,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.2672681876,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1390","status":"","submitted":9778,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7499362624288264,"acs":17649,"articleLive":2,"columnArticles":302,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"","submitted":23534,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3936252514312239,"acs":5088,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":0.9833335637,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"","submitted":12926,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5993223024115473,"acs":13619,"articleLive":2,"columnArticles":209,"formTitle":"[1254]统计封闭岛屿的数目","frequency":0.215961732,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1380","status":"ac","submitted":22724,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6766337111164697,"acs":2806,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1381","status":"","submitted":4147,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6626719928983578,"acs":1493,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","questionId":"1189","status":"","submitted":2253,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5640535372848948,"acs":1770,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"","submitted":3138,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5637488106565176,"acs":1185,"articleLive":2,"columnArticles":42,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"","submitted":2102,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47622603933283547,"acs":1913,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":0.7344592993,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1213","status":"","submitted":4017,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6033308099924299,"acs":11955,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1386","status":"","submitted":19815,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7299227232710555,"acs":7462,"articleLive":2,"columnArticles":96,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"","submitted":10223,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5264456831624186,"acs":12372,"articleLive":2,"columnArticles":187,"formTitle":"[1262]可被三整除的最大和","frequency":2.0616829621,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1388","status":"","submitted":23501,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4171901770416905,"acs":2922,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":0.5207050724,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1389","status":"","submitted":7004,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5735892221657346,"acs":4513,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":0.3231018337,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1399","status":"","submitted":7868,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9192680301399354,"acs":2562,"articleLive":2,"columnArticles":62,"formTitle":"[1265]逆序打印不可变链表","frequency":0.3231018337,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"","submitted":2787,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8236661531998319,"acs":29409,"articleLive":2,"columnArticles":448,"formTitle":"[1266]访问所有点的最小时间","frequency":1.1393499157,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1395","status":"","submitted":35705,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6089249492900608,"acs":9006,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"","submitted":14790,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5805748111223615,"acs":7454,"articleLive":2,"columnArticles":135,"formTitle":"[1268]搜索推荐系统","frequency":0.294577367,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1397","status":"","submitted":12839,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.491727007634088,"acs":30016,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":2.2775713425,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1398","status":"ac","submitted":61042,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8043726779079737,"acs":5629,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.7618883365,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"","submitted":6998,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.5046629927935566,"acs":2381,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1199","status":"","submitted":4718,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.519004372687521,"acs":1543,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1200","status":"","submitted":2973,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5407725321888412,"acs":1512,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"","submitted":2796,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5970719287078294,"acs":938,"articleLive":2,"columnArticles":23,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1233","status":"","submitted":1571,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5399890440975076,"acs":7886,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":0.819884004,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1400","status":"","submitted":14604,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5007120253164556,"acs":6329,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"","submitted":12640,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7239608409565078,"acs":18044,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":1.1702165637,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1402","status":"","submitted":24924,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5945234333859927,"acs":3387,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":2.8401108842,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1403","status":"","submitted":5697,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6205468102734052,"acs":1498,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":1.0613762707,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1410","status":"","submitted":2414,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5064935064935064,"acs":6201,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":0.7903397577,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1415","status":"","submitted":12243,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314060667001844,"acs":44649,"articleLive":2,"columnArticles":604,"formTitle":"[1281]整数的各位积和之差","frequency":1.1702165637,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1406","status":"","submitted":53703,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113491683208981,"acs":11853,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":0.2672681876,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1407","status":"","submitted":14609,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4158201189296333,"acs":6713,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":0.819884004,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1408","status":"","submitted":16144,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588328492210193,"acs":2495,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":1.0613762707,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1409","status":"","submitted":3787,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8119266055045872,"acs":4071,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1420","status":"","submitted":5014,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6446408529741863,"acs":4595,"articleLive":2,"columnArticles":86,"formTitle":"[1286]字母组合迭代器","frequency":0.819884004,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1211","status":"","submitted":7128,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6055478727731229,"acs":14888,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":0.819884004,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"","submitted":24586,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5633991600393173,"acs":12610,"articleLive":2,"columnArticles":161,"formTitle":"[1288]删除被覆盖区间","frequency":1.40404247,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"","submitted":22382,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6301221753703103,"acs":5828,"articleLive":2,"columnArticles":86,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"","submitted":9249,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089592591441623,"acs":52063,"articleLive":2,"columnArticles":680,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1411","status":"ac","submitted":64358,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.517690588144608,"acs":6716,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"","submitted":12973,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46862858559973547,"acs":5669,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":0.294577367,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1413","status":"","submitted":12097,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3557500878322989,"acs":12151,"articleLive":2,"columnArticles":122,"formTitle":"[1293]网格中的最短路径","frequency":2.6732802757,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1414","status":"","submitted":34156,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6605569620253164,"acs":6523,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1425","status":"","submitted":9875,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8093821982328876,"acs":47085,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":0.2672681876,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1421","status":"","submitted":58174,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45149140392442744,"acs":7432,"articleLive":2,"columnArticles":119,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1422","status":"","submitted":16461,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.4598749540272159,"acs":6252,"articleLive":2,"columnArticles":87,"formTitle":"[1297]子串的最大出现次数","frequency":1.2355779478,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"","submitted":13595,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5946820809248555,"acs":2572,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1424","status":"","submitted":4325,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855690788605222,"acs":29755,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1231","status":"","submitted":37877,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46745876928533425,"acs":23724,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":0.2672681876,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1232","status":"","submitted":50751,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35815991237677985,"acs":2943,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1234","status":"","submitted":8217,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8163850397463186,"acs":18794,"articleLive":2,"columnArticles":284,"formTitle":"[1302]层数最深叶子节点的和","frequency":1.2022637412,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"","submitted":23021,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8215096201282683,"acs":8326,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1438","status":"","submitted":10135,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7258443516992249,"acs":20696,"articleLive":2,"columnArticles":370,"formTitle":"[1304]和为零的N个唯一整数","frequency":0.241088682,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"","submitted":28513,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7474266797703408,"acs":14450,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":0.241088682,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1427","status":"","submitted":19333,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5773275922919461,"acs":16358,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":0.8505989493,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"","submitted":28334,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3316582914572864,"acs":1782,"articleLive":2,"columnArticles":52,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1429","status":"","submitted":5373,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7518535330609775,"acs":4969,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":0.294577367,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1439","status":"","submitted":6609,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552675741189633,"acs":16202,"articleLive":2,"columnArticles":279,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1434","status":"","submitted":21452,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.712298469239276,"acs":36714,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":2.5331914825,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1435","status":"ac","submitted":51543,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3755970778308514,"acs":5347,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":0.3529369822,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1436","status":"","submitted":14236,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6657781423005946,"acs":9741,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":1.6131342678,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1437","status":"","submitted":14631,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8309937288953207,"acs":34453,"articleLive":2,"columnArticles":536,"formTitle":"[1313]解压缩编码列表","frequency":0.2672681876,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"","submitted":41460,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7335507246376811,"acs":10123,"articleLive":2,"columnArticles":173,"formTitle":"[1314]矩阵区域和","frequency":1.6783464165,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"","submitted":13800,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8095794392523364,"acs":12474,"articleLive":2,"columnArticles":255,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1243","status":"","submitted":15408,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43609146241158087,"acs":2651,"articleLive":2,"columnArticles":55,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1244","status":"","submitted":6079,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6142562886211846,"acs":9841,"articleLive":2,"columnArticles":184,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1440","status":"ac","submitted":16021,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6481623697202413,"acs":5908,"articleLive":2,"columnArticles":101,"formTitle":"[1318]或运算的最小翻转次数","frequency":3.1273530828,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1441","status":"","submitted":9115,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6177622089429219,"acs":29980,"articleLive":2,"columnArticles":507,"formTitle":"[1319]连通网络的操作次数","frequency":0.294577367,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"","submitted":48530,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5874538745387454,"acs":2388,"articleLive":2,"columnArticles":55,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1443","status":"","submitted":4065,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6184944938904812,"acs":4100,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1452","status":"","submitted":6629,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5926324602320296,"acs":4955,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1453","status":"","submitted":8361,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7554093097913323,"acs":23531,"articleLive":2,"columnArticles":465,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":1.1702165637,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1448","status":"","submitted":31150,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5922653082441002,"acs":5697,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1449","status":"","submitted":9619,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7280102155787576,"acs":9692,"articleLive":2,"columnArticles":174,"formTitle":"[1325]删除给定值的叶子节点","frequency":0.2672681876,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1450","status":"","submitted":13313,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47564494971578486,"acs":5439,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":0.3841895257,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1451","status":"","submitted":11435,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6935418632870433,"acs":5144,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1462","status":"","submitted":7417,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4565815006468305,"acs":5647,"articleLive":2,"columnArticles":114,"formTitle":"[1328]破坏回文串","frequency":0.8505989493,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1252","status":"","submitted":12368,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7742344001842044,"acs":6725,"articleLive":2,"columnArticles":152,"formTitle":"[1329]将矩阵按对角线排序","frequency":0.3529369822,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"","submitted":8686,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3760826115922718,"acs":1129,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":0.7903397577,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1255","status":"","submitted":3002,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5347363442894302,"acs":11307,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":0.241088682,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1256","status":"","submitted":21145,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6830047948854555,"acs":8974,"articleLive":2,"columnArticles":130,"formTitle":"[1332]删除回文子序列","frequency":0.2672681876,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1454","status":"ac","submitted":13139,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5422775657762603,"acs":5400,"articleLive":2,"columnArticles":114,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1455","status":"","submitted":9958,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4867980661956118,"acs":5236,"articleLive":2,"columnArticles":89,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":2.3800149869,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"","submitted":10756,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5815677966101694,"acs":3294,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1457","status":"","submitted":5664,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.422289613343442,"acs":1671,"articleLive":2,"columnArticles":46,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"","submitted":3957,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7071148543452571,"acs":37697,"articleLive":2,"columnArticles":605,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":0.6658452875,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1463","status":"ac","submitted":53311,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6400351828776663,"acs":8732,"articleLive":2,"columnArticles":124,"formTitle":"[1338]数组大小减半","frequency":0.241088682,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1464","status":"ac","submitted":13643,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39671819500725397,"acs":7930,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":0.3529369822,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"","submitted":19989,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5711382113821138,"acs":4215,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1466","status":"","submitted":7380,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4832999846082807,"acs":3140,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1480","status":"","submitted":6497,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202602674307545,"acs":41223,"articleLive":2,"columnArticles":628,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1444","status":"","submitted":50256,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.541782729805014,"acs":12448,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"","submitted":22976,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5927995034140285,"acs":5730,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":0.294577367,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1446","status":"","submitted":9666,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3676607024519549,"acs":5548,"articleLive":2,"columnArticles":107,"formTitle":"[1345]跳跃游戏 IV","frequency":0.3529369822,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1447","status":"","submitted":15090,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43607053483093755,"acs":14986,"articleLive":2,"columnArticles":256,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1468","status":"","submitted":34366,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7376503961655091,"acs":7541,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1469","status":"ac","submitted":10223,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30266733769501764,"acs":3007,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":0.3841895257,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1470","status":"","submitted":9935,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5004223686433519,"acs":2962,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":0.3231018337,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1471","status":"","submitted":5919,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8478168264110756,"acs":7961,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":0.2672681876,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1481","status":"","submitted":9390,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7543598967701572,"acs":28938,"articleLive":2,"columnArticles":535,"formTitle":"[1351]统计有序矩阵中的负数","frequency":0.241088682,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1476","status":"","submitted":38361,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4412896006713756,"acs":6310,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":0.3231018337,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"","submitted":14299,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28245983671319463,"acs":10725,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":2.5223922415,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1478","status":"","submitted":37970,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.285056765879104,"acs":2787,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"","submitted":9777,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6621998883305416,"acs":3558,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1494","status":"","submitted":5373,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7317558709760953,"acs":45213,"articleLive":2,"columnArticles":498,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":0.7903397577,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1458","status":"","submitted":61787,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5268340036056025,"acs":3799,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"","submitted":7211,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4851292504401001,"acs":5236,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":0.2672681876,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1460","status":"","submitted":10793,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5441870002050441,"acs":2654,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1461","status":"","submitted":4877,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5036171396772399,"acs":8145,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":1.6451472448,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1274","status":"","submitted":16173,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4010540632437946,"acs":7077,"articleLive":2,"columnArticles":188,"formTitle":"[1361]验证二叉树","frequency":0.241088682,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1275","status":"","submitted":17646,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.523305954825462,"acs":5097,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"","submitted":9740,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3599345998131423,"acs":4623,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":1.6783464165,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1277","status":"","submitted":12844,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6753949361610041,"acs":3121,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":0.2672681876,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1495","status":"","submitted":4621,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.825,"acs":83589,"articleLive":2,"columnArticles":1074,"formTitle":"[1365]有多少小于当前数字的数字","frequency":1.1702165637,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1482","status":"","submitted":101320,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5361658682164454,"acs":6827,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":0.8505989493,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1483","status":"","submitted":12733,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41672588760339974,"acs":14660,"articleLive":2,"columnArticles":216,"formTitle":"[1367]二叉树中的列表","frequency":0.7903397577,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"ac","submitted":35179,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5171945701357467,"acs":3429,"articleLive":2,"columnArticles":83,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1485","status":"","submitted":6630,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6069236435060152,"acs":2472,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":0.3231018337,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1504","status":"","submitted":4073,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905648789070929,"acs":47626,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1472","status":"","submitted":60243,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5798138468848701,"acs":20744,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":1.965832545,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1473","status":"","submitted":35777,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5146264329951246,"acs":7811,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":0.3231018337,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1474","status":"","submitted":15178,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39637289609341037,"acs":6382,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":1.1702165637,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1475","status":"","submitted":16101,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7385906939358757,"acs":16540,"articleLive":2,"columnArticles":221,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1490","status":"","submitted":22394,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5708526919923477,"acs":8355,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1491","status":"","submitted":14636,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5039955138090565,"acs":7190,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.2672681876,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"","submitted":14266,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32519342359767894,"acs":4035,"articleLive":2,"columnArticles":128,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1493","status":"","submitted":12408,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8624858330185116,"acs":6849,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1509","status":"","submitted":7941,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8363001164531692,"acs":10054,"articleLive":2,"columnArticles":157,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"","submitted":12022,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7273177540636678,"acs":16153,"articleLive":2,"columnArticles":243,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"","submitted":22209,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7321851170128846,"acs":11138,"articleLive":2,"columnArticles":140,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"ac","submitted":15212,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6890143804583361,"acs":10493,"articleLive":2,"columnArticles":166,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.3231018337,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"","submitted":15229,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32277975455667707,"acs":4445,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":0.4506979845,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"","submitted":13771,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5417661097852029,"acs":1816,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1518","status":"","submitted":3352,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7035093473269924,"acs":12870,"articleLive":2,"columnArticles":191,"formTitle":"[1385]两个数组间的距离值","frequency":0.2672681876,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"","submitted":18294,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30977810037328907,"acs":5975,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":0.9833335637,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"","submitted":19288,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6945545281080288,"acs":9464,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":0.9158962917,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"","submitted":13626,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5355728526560153,"acs":3922,"articleLive":2,"columnArticles":51,"formTitle":"[1388]3n 块披萨","frequency":2.7089473944,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"","submitted":7323,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8306873534187263,"acs":27627,"articleLive":2,"columnArticles":471,"formTitle":"[1389]按既定顺序创建目标数组","frequency":0.819884004,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1505","status":"","submitted":33258,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3502889511929965,"acs":6122,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1284","status":"","submitted":17477,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39922938288484244,"acs":6424,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":0.9496149277,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1507","status":"","submitted":16091,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.3980566352026652,"acs":7169,"articleLive":2,"columnArticles":128,"formTitle":"[1392]最长快乐前缀","frequency":0.2672681876,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1508","status":"","submitted":18010,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8566275924256087,"acs":3800,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1523","status":"","submitted":4436,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6642784861364096,"acs":16411,"articleLive":2,"columnArticles":262,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1510","status":"","submitted":24705,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7545673339897166,"acs":13795,"articleLive":2,"columnArticles":208,"formTitle":"[1395]统计作战单位数","frequency":0.2672681876,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1511","status":"","submitted":18282,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4150862683587623,"acs":8733,"articleLive":2,"columnArticles":130,"formTitle":"[1396]设计地铁系统","frequency":0.9496149277,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1512","status":"","submitted":21039,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3655146506386176,"acs":973,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1513","status":"","submitted":2662,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7725297562818817,"acs":4089,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"","submitted":5293,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.666790794667461,"acs":8953,"articleLive":2,"columnArticles":147,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1500","status":"","submitted":13427,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6035710249745734,"acs":5341,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":0.241088682,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1502","status":"","submitted":8849,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41491353673312037,"acs":3767,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.294577367,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"","submitted":9079,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7508743391622611,"acs":9232,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":0.294577367,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1503","status":"","submitted":12295,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6913062443378183,"acs":20603,"articleLive":2,"columnArticles":350,"formTitle":"[1403]非递增顺序的最小子序列","frequency":0.7618883365,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1519","status":"","submitted":29803,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4913201735965281,"acs":7019,"articleLive":2,"columnArticles":150,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":0.3529369822,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1520","status":"","submitted":14286,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5056603773584906,"acs":5360,"articleLive":2,"columnArticles":134,"formTitle":"[1405]最长快乐字符串","frequency":0.8505989493,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1304","status":"","submitted":10600,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5682900036616624,"acs":4656,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":0.2672681876,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1522","status":"","submitted":8193,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6675078106224466,"acs":5555,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.7903397577,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1541","status":"","submitted":8322,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6136581622865912,"acs":12796,"articleLive":2,"columnArticles":196,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1524","status":"","submitted":20852,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8052717613404169,"acs":7882,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"","submitted":9788,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47681425203039035,"acs":7280,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":0.3841895257,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1526","status":"ac","submitted":15268,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5491797302223842,"acs":7532,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":3.8971352491,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1527","status":"","submitted":13715,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5495049504950495,"acs":2553,"articleLive":2,"columnArticles":62,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1546","status":"","submitted":4646,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6914020452099031,"acs":10277,"articleLive":2,"columnArticles":209,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":0.819884004,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1514","status":"","submitted":14864,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6020114942528736,"acs":7123,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1515","status":"","submitted":11832,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6841766723842195,"acs":6382,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":0.241088682,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1516","status":"","submitted":9328,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40741298779569085,"acs":2704,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":1.2355779478,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1517","status":"","submitted":6637,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5187923086506915,"acs":12492,"articleLive":2,"columnArticles":180,"formTitle":"[1417]重新格式化字符串","frequency":0.215961732,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1532","status":"","submitted":24079,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7333238027162259,"acs":25648,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":2.3800149869,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"ac","submitted":34975,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4178837070416418,"acs":7697,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":1.2355779478,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1534","status":"","submitted":18419,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5922649140546006,"acs":2343,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":1.1393499157,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1535","status":"","submitted":3956,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7496356747303993,"acs":2572,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"","submitted":3431,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.540329899108525,"acs":10122,"articleLive":2,"columnArticles":186,"formTitle":"[1422]分割字符串的最大得分","frequency":1.4356157319,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1537","status":"","submitted":18733,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.554660246646686,"acs":33867,"articleLive":2,"columnArticles":500,"formTitle":"[1423]可获得的最大点数","frequency":0.7903397577,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"ac","submitted":61059,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.396013702896294,"acs":6358,"articleLive":2,"columnArticles":133,"formTitle":"[1424]对角线遍历 II","frequency":0.8505989493,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1539","status":"","submitted":16055,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43367273770256703,"acs":3024,"articleLive":2,"columnArticles":66,"formTitle":"[1425]带限制的子序列和","frequency":0.3231018337,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1286","status":"","submitted":6973,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7026315789473684,"acs":1335,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1391","status":"","submitted":1900,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6588785046728972,"acs":987,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1345","status":"","submitted":1498,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5895904436860068,"acs":691,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1374","status":"","submitted":1172,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5072674418604651,"acs":1047,"articleLive":2,"columnArticles":35,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"","submitted":2064,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5762557077625571,"acs":631,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"","submitted":1095,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.846126975809973,"acs":77512,"articleLive":2,"columnArticles":1021,"formTitle":"[1431]拥有最多糖果的孩子","frequency":0.2672681876,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"","submitted":91608,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3921938088829071,"acs":4371,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"","submitted":11145,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6408974786182383,"acs":5770,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"","submitted":9003,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.44621979734996103,"acs":2290,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"","submitted":5132,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6234059725585149,"acs":3862,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1564","status":"","submitted":6195,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7830097087378641,"acs":20969,"articleLive":2,"columnArticles":364,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1547","status":"","submitted":26780,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5893376030362332,"acs":9938,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":0.2672681876,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1548","status":"","submitted":16863,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4819437984786881,"acs":32123,"articleLive":2,"columnArticles":458,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":1.5377974512,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"","submitted":66653,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5604743083003952,"acs":3545,"articleLive":2,"columnArticles":55,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1550","status":"","submitted":6325,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6952753704221415,"acs":2487,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1565","status":"","submitted":3577,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6466081106335264,"acs":17300,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":0.3231018337,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1552","status":"ac","submitted":26755,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916417085195595,"acs":34362,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":2.6006794628,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1553","status":"ac","submitted":43406,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41064981949458484,"acs":5460,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"","submitted":13296,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5237798546209761,"acs":2522,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1555","status":"","submitted":4815,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8566767653227686,"acs":3676,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"","submitted":4291,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729122207995447,"acs":12081,"articleLive":2,"columnArticles":205,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1542","status":"","submitted":21087,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6169498863513367,"acs":5700,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1543","status":"","submitted":9239,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7134627525252525,"acs":9041,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":0.215961732,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1544","status":"","submitted":12672,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275208051093478,"acs":16212,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":1.7486593177,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1545","status":"ac","submitted":25835,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8022448979591836,"acs":23586,"articleLive":2,"columnArticles":337,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":0.7903397577,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"","submitted":29400,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5209728397707184,"acs":9725,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":0.3231018337,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"","submitted":18667,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4971157985363754,"acs":5774,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":0.3841895257,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"","submitted":11615,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3622891016871865,"acs":1589,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"","submitted":4386,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4027645788336933,"acs":4662,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":0.9158962917,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1579","status":"","submitted":11575,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6341557228419143,"acs":11541,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"","submitted":18199,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5182006510802012,"acs":12257,"articleLive":2,"columnArticles":191,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"","submitted":23653,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.636954197845572,"acs":7746,"articleLive":2,"columnArticles":134,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1568","status":"","submitted":12161,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4401286690792119,"acs":5473,"articleLive":2,"columnArticles":85,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"","submitted":12435,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5947546531302876,"acs":2109,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1607","status":"","submitted":3546,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7438095718392254,"acs":14749,"articleLive":2,"columnArticles":305,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"ac","submitted":19829,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.49875111507582515,"acs":5591,"articleLive":2,"columnArticles":79,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"","submitted":11210,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42529850746268655,"acs":5699,"articleLive":2,"columnArticles":119,"formTitle":"[1462]课程表 IV","frequency":0.2672681876,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"","submitted":13400,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5881282692745053,"acs":2586,"articleLive":2,"columnArticles":62,"formTitle":"[1463]摘樱桃 II","frequency":0.5207050724,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"","submitted":4397,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7675634824667473,"acs":25391,"articleLive":2,"columnArticles":358,"formTitle":"[1464]数组中两元素的最大乘积","frequency":0.2672681876,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1574","status":"","submitted":33080,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3074877045066747,"acs":6127,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1575","status":"","submitted":19926,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4840708667672996,"acs":6093,"articleLive":2,"columnArticles":121,"formTitle":"[1466]重新规划路线","frequency":0.8505989493,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1576","status":"","submitted":12587,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6112828438948995,"acs":1582,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1577","status":"","submitted":2588,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7146189735614308,"acs":2757,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1608","status":"","submitted":3858,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8029480217222653,"acs":2070,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1609","status":"","submitted":2578,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433965295629821,"acs":52493,"articleLive":2,"columnArticles":718,"formTitle":"[1470]重新排列数组","frequency":2.0300972333,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1580","status":"","submitted":62240,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5410428109246859,"acs":7191,"articleLive":2,"columnArticles":101,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1581","status":"","submitted":13291,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6162572500852951,"acs":7225,"articleLive":2,"columnArticles":121,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1582","status":"","submitted":11724,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6754791804362195,"acs":15330,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":2.2379622044,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1583","status":"","submitted":22695,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7192631157388867,"acs":1796,"articleLive":2,"columnArticles":59,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1618","status":"","submitted":2497,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7242711254563734,"acs":13688,"articleLive":2,"columnArticles":218,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1570","status":"","submitted":18899,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8657436542899098,"acs":12381,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":0.8505989493,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1572","status":"","submitted":14301,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2898613787530304,"acs":4663,"articleLive":2,"columnArticles":95,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":0.9496149277,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"","submitted":16087,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.569926873857404,"acs":2494,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":1.3836127502,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1571","status":"","submitted":4376,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5752895752895753,"acs":1788,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":0.4169793485,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1623","status":"","submitted":3108,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8544612752252025,"acs":101874,"articleLive":2,"columnArticles":1071,"formTitle":"[1480]一维数组的动态和","frequency":2.9734886079,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"","submitted":119226,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5137015859316,"acs":9523,"articleLive":2,"columnArticles":138,"formTitle":"[1481]不同整数的最少数目","frequency":0.819884004,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"","submitted":18538,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869949640564334,"acs":30539,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":2.4167811307,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"ac","submitted":52026,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30025736345438947,"acs":3150,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1296","status":"","submitted":10491,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8030467899891186,"acs":738,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1624","status":"","submitted":919,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6626116707850218,"acs":3486,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1625","status":"","submitted":5261,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585478031118505,"acs":70188,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":2.3105015488,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1610","status":"ac","submitted":81752,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30744430207084694,"acs":7438,"articleLive":2,"columnArticles":99,"formTitle":"[1487]保证文件名唯一","frequency":1.2022637412,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1611","status":"","submitted":24193,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2347639045375397,"acs":6876,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":2.8523285071,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"","submitted":29289,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6932806324110672,"acs":11401,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1613","status":"","submitted":16445,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8556782334384858,"acs":1085,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"","submitted":1268,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.671005136748577,"acs":19333,"articleLive":2,"columnArticles":291,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1584","status":"","submitted":28812,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6666666666666666,"acs":6168,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1585","status":"","submitted":9252,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5663709741868457,"acs":7087,"articleLive":2,"columnArticles":136,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":1.1095858138,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"","submitted":12513,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3598799223026664,"acs":2038,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":1.3064040004,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1587","status":"","submitted":5663,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428952437398133,"acs":3664,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1639","status":"","submitted":6749,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5385530945973919,"acs":10407,"articleLive":2,"columnArticles":157,"formTitle":"[1496]判断路径是否相交","frequency":0.215961732,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"","submitted":19324,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39212790875299147,"acs":7701,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"","submitted":19639,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3319123426363818,"acs":4983,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":0.8505989493,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"","submitted":15013,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.3778277153558052,"acs":2522,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"","submitted":6675,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2933264355923435,"acs":567,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1640","status":"","submitted":1933,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5922086082312285,"acs":3770,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":1.1393499157,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"","submitted":6366,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7181313868613138,"acs":24596,"articleLive":2,"columnArticles":295,"formTitle":"[1502]判断能否形成等差数列","frequency":1.40404247,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1626","status":"","submitted":34250,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5117286624992263,"acs":8268,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":0.882570982,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1627","status":"","submitted":16157,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5930496096701083,"acs":7065,"articleLive":2,"columnArticles":126,"formTitle":"[1504]统计全 1 子矩形","frequency":1.6131342678,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"","submitted":11913,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.3573852069667496,"acs":3160,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":1.6533326061,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1629","status":"","submitted":8842,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8388704318936877,"acs":505,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":1.5377974512,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"","submitted":602,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5904241645244216,"acs":9187,"articleLive":2,"columnArticles":125,"formTitle":"[1507]转变日期格式","frequency":1.4356157319,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1283","status":"","submitted":15560,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5515843078083742,"acs":5849,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":0.294577367,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"","submitted":10604,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5444055944055944,"acs":4671,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"","submitted":8580,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5762835295545576,"acs":4748,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":0.7903397577,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"","submitted":8239,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6842295200288705,"acs":3792,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":0.2672681876,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1654","status":"","submitted":5542,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8484548716207237,"acs":57465,"articleLive":2,"columnArticles":732,"formTitle":"[1512]好数对的数目","frequency":0.241088682,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1635","status":"","submitted":67729,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37782067029303384,"acs":10766,"articleLive":2,"columnArticles":146,"formTitle":"[1513]仅含 1 的子串数","frequency":0.294577367,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1636","status":"","submitted":28495,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.314627495821972,"acs":7154,"articleLive":2,"columnArticles":128,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"","submitted":22738,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3406423034330011,"acs":3076,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.6337706971,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1638","status":"","submitted":9030,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5369318181818182,"acs":189,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"","submitted":352,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7287822878228782,"acs":3160,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1664","status":"","submitted":4336,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6752279549187291,"acs":23845,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":1.1393499157,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1642","status":"","submitted":35314,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2949636323561825,"acs":5353,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1643","status":"","submitted":18148,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3294021960146401,"acs":2430,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1644","status":"","submitted":7377,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.3957078894549946,"acs":2563,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":0.7903397577,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"","submitted":6477,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7003444316877153,"acs":610,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1665","status":"","submitted":871,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5772061059417382,"acs":9491,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1630","status":"","submitted":16443,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.422480260102183,"acs":4548,"articleLive":2,"columnArticles":96,"formTitle":"[1524]和为奇数的子数组数目","frequency":0.819884004,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"","submitted":10765,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.659820616144547,"acs":5076,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":0.294577367,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1632","status":"","submitted":7693,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6119433613790273,"acs":2982,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1633","status":"","submitted":4873,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5092222563787273,"acs":3313,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1670","status":"","submitted":6506,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7841037204058624,"acs":29211,"articleLive":2,"columnArticles":347,"formTitle":"[1528]重新排列字符串","frequency":0.7618883365,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1651","status":"","submitted":37254,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886142144045638,"acs":8691,"articleLive":2,"columnArticles":130,"formTitle":"[1529]灯泡开关 IV","frequency":0.2672681876,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1652","status":"","submitted":12621,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5656450749464668,"acs":8453,"articleLive":2,"columnArticles":143,"formTitle":"[1530]好叶子节点对的数量","frequency":0.9496149277,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"","submitted":14944,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32230951945916314,"acs":1764,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":1.0950949067,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1637","status":"","submitted":5473,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6211164435463501,"acs":2459,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":0.2672681876,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1671","status":"","submitted":3959,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6093023255813953,"acs":262,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1672","status":"","submitted":430,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7883329381076595,"acs":16622,"articleLive":2,"columnArticles":156,"formTitle":"[1534]统计好三元组","frequency":0.241088682,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"","submitted":21085,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4524165767772017,"acs":13002,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":0.3841895257,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"","submitted":28739,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43793859649122807,"acs":3994,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"","submitted":9120,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3650376895062251,"acs":4310,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"","submitted":11807,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5956284153005464,"acs":109,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1681","status":"","submitted":183,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5368395286218834,"acs":15352,"articleLive":2,"columnArticles":227,"formTitle":"[1539]第 k 个缺失的正整数","frequency":2.7365925551,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"","submitted":28597,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31540736757192794,"acs":4692,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"","submitted":14876,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4568887424853825,"acs":5548,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"ac","submitted":12143,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.37836970474967907,"acs":2358,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1668","status":"","submitted":6232,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5488920512299248,"acs":2700,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1686","status":"","submitted":4919,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.54298682284041,"acs":18543,"articleLive":2,"columnArticles":303,"formTitle":"[1544]整理字符串","frequency":1.1393499157,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1666","status":"ac","submitted":34150,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5523468454739409,"acs":7249,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":0.3231018337,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1667","status":"","submitted":13124,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.40846358496840707,"acs":4913,"articleLive":2,"columnArticles":74,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1649","status":"","submitted":12028,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5317133443163097,"acs":3873,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":1.3441443284,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1669","status":"","submitted":7284,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7108695652173913,"acs":327,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"","submitted":460,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6658746658746659,"acs":2242,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":0.294577367,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1688","status":"","submitted":3367,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6600314132769176,"acs":20591,"articleLive":2,"columnArticles":279,"formTitle":"[1550]存在连续三个奇数的数组","frequency":0.2672681876,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1293","status":"","submitted":31197,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8171467350324234,"acs":10837,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":0.2672681876,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"","submitted":13262,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5059840037363535,"acs":8667,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":0.294577367,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1675","status":"","submitted":17129,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2932612641047897,"acs":7433,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":2.7961339488,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1676","status":"","submitted":25346,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6992481203007519,"acs":465,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1697","status":"","submitted":665,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43644198214835334,"acs":2836,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"","submitted":6498,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5793897524467473,"acs":10064,"articleLive":2,"columnArticles":153,"formTitle":"[1556]千位分隔数","frequency":2.1754418474,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1660","status":"","submitted":17370,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7614629409860827,"acs":7058,"articleLive":2,"columnArticles":93,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1661","status":"","submitted":9269,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6209075244112578,"acs":4324,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":0.4506979845,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1662","status":"","submitted":6964,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.3651716810200201,"acs":3265,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":0.5207050724,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1663","status":"","submitted":8941,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5734265734265734,"acs":8364,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":0.3231018337,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1682","status":"","submitted":14586,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7791125616276647,"acs":11220,"articleLive":2,"columnArticles":150,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":0.819884004,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1683","status":"","submitted":14401,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30910305910305913,"acs":4163,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":0.4869864364,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1684","status":"","submitted":13468,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37632386419875286,"acs":3802,"articleLive":2,"columnArticles":65,"formTitle":"[1563]石子游戏 V","frequency":2.1087504729,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1685","status":"","submitted":10103,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5853174603174603,"acs":590,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1703","status":"","submitted":1008,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7250986193293886,"acs":2941,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":0.2672681876,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1712","status":"","submitted":4056,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4455909943714822,"acs":7600,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":0.2672681876,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1689","status":"","submitted":17056,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.38958751484864623,"acs":9511,"articleLive":2,"columnArticles":168,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":0.7344592993,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"","submitted":24413,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4537121906507791,"acs":2475,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"","submitted":5455,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.47214979853045747,"acs":1992,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"","submitted":4219,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8991373589913736,"acs":1355,"articleLive":2,"columnArticles":33,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1713","status":"","submitted":1507,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7573211713874219,"acs":3155,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1718","status":"","submitted":4166,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048354717639871,"acs":18442,"articleLive":2,"columnArticles":313,"formTitle":"[1572]矩阵对角线元素的和","frequency":0.16859318,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"","submitted":22914,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.295562435500516,"acs":4296,"articleLive":2,"columnArticles":59,"formTitle":"[1573]分割字符串的方案数","frequency":0.294577367,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1678","status":"","submitted":14535,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3258735200693041,"acs":4514,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":1.6783464165,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"","submitted":13852,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6021612635078969,"acs":3622,"articleLive":2,"columnArticles":60,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1680","status":"","submitted":6015,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47637590149998627,"acs":17372,"articleLive":2,"columnArticles":244,"formTitle":"[1576]替换所有的问号","frequency":0.294577367,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1698","status":"","submitted":36467,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3233019174520637,"acs":4974,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":0.4506979845,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"","submitted":15385,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5792413182924132,"acs":10475,"articleLive":2,"columnArticles":198,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1700","status":"","submitted":18084,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.619683846661747,"acs":15955,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":1.1860873936,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1701","status":"","submitted":25747,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6282722513089005,"acs":240,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1719","status":"","submitted":382,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8146267140680549,"acs":3208,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1724","status":"","submitted":3938,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6710353866317169,"acs":9216,"articleLive":2,"columnArticles":106,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":0.2672681876,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"","submitted":13734,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6850473612990527,"acs":18225,"articleLive":2,"columnArticles":240,"formTitle":"[1583]统计不开心的朋友","frequency":1.2667234114,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"","submitted":26604,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6666487906901915,"acs":24862,"articleLive":2,"columnArticles":319,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"","submitted":37294,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4296022201665125,"acs":2322,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"","submitted":5405,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6268115942028986,"acs":346,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1729","status":"","submitted":552,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8254630837464128,"acs":3164,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1734","status":"","submitted":3833,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8018573435305135,"acs":20550,"articleLive":2,"columnArticles":385,"formTitle":"[1588]所有奇数长度子数组的和","frequency":0.819884004,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"","submitted":25628,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2947298860069387,"acs":3568,"articleLive":2,"columnArticles":51,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"","submitted":12106,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.263825508546678,"acs":3411,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":0.4169793485,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1694","status":"","submitted":12929,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.575973669775096,"acs":1050,"articleLive":2,"columnArticles":30,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1696","status":"","submitted":1823,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4453893010071769,"acs":7385,"articleLive":2,"columnArticles":118,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1714","status":"","submitted":16581,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.526712824222383,"acs":5097,"articleLive":2,"columnArticles":87,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":0.2672681876,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"","submitted":9677,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3125776397515528,"acs":4026,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":0.3231018337,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1716","status":"","submitted":12880,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.461226558540294,"acs":1820,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1717","status":"","submitted":3946,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7630397236614853,"acs":2209,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1735","status":"","submitted":2895,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6548223350253807,"acs":258,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1736","status":"","submitted":394,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6704934669542052,"acs":10571,"articleLive":2,"columnArticles":145,"formTitle":"[1598]文件夹操作日志搜集器","frequency":0.2672681876,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":15766,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4190465607289699,"acs":3771,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"","submitted":8999,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6832136667491954,"acs":16557,"articleLive":2,"columnArticles":203,"formTitle":"[1600]皇位继承顺序","frequency":0.8505989493,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"","submitted":24234,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.4804295942720764,"acs":2013,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"","submitted":4190,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7802746566791511,"acs":625,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1745","status":"","submitted":801,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8449166275424435,"acs":55789,"articleLive":2,"columnArticles":447,"formTitle":"[1603]设计停车系统","frequency":2.9560483333,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"ac","submitted":66029,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4143189755529686,"acs":3559,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"","submitted":8590,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7348484848484849,"acs":3201,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"","submitted":4356,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34025075659316906,"acs":1574,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1710","status":"","submitted":4626,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.551455082243779,"acs":2615,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1749","status":"","submitted":4742,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6390220517737296,"acs":9331,"articleLive":2,"columnArticles":150,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1730","status":"","submitted":14602,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5118636431896681,"acs":6817,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":0.2672681876,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1731","status":"","submitted":13318,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27030862007804185,"acs":2286,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1733","status":"","submitted":8457,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6082535885167464,"acs":2034,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1732","status":"","submitted":3344,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7335701598579041,"acs":413,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"","submitted":563,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7273593898951383,"acs":1526,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"","submitted":2098,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8202602704771625,"acs":16073,"articleLive":2,"columnArticles":271,"formTitle":"[1614]括号的最大嵌套深度","frequency":0.241088682,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1737","status":"","submitted":19595,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49495733126454616,"acs":5104,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"","submitted":10312,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.275008477449983,"acs":4866,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":0.3529369822,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1739","status":"","submitted":17694,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6181885125184094,"acs":1679,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1740","status":"","submitted":2716,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5894308943089431,"acs":290,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1384","status":"","submitted":492,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6783831282952548,"acs":6948,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1210","status":"","submitted":10242,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.36781789638932494,"acs":2343,"articleLive":2,"columnArticles":40,"formTitle":"[1620]网络信号最好的坐标","frequency":0.5207050724,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"","submitted":6370,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43517561983471076,"acs":1685,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1725","status":"","submitted":3872,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14530298172491182,"acs":2266,"articleLive":2,"columnArticles":50,"formTitle":"[1622]奇妙序列","frequency":0.9496149277,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"","submitted":15595,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7831683168316832,"acs":3164,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":0.294577367,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"","submitted":4040,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6277177072433437,"acs":10798,"articleLive":2,"columnArticles":184,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":0.819884004,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1746","status":"","submitted":17202,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5394887447539107,"acs":2828,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"","submitted":5242,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3831996709849887,"acs":3727,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":0.3231018337,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1748","status":"","submitted":9726,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3791323980003225,"acs":2351,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"","submitted":6201,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8416075650118203,"acs":356,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1768","status":"","submitted":423,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5222755768974257,"acs":7831,"articleLive":2,"columnArticles":86,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1751","status":"","submitted":14994,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7695179180887372,"acs":7215,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":0.294577367,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1752","status":"","submitted":9376,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4920792883545229,"acs":24229,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":1.2022637412,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"","submitted":49238,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31590656284760843,"acs":1420,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1257","status":"","submitted":4495,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6583734617442483,"acs":2461,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.294577367,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"","submitted":3738,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5203804347826086,"acs":383,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"","submitted":736,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5452620434092113,"acs":1030,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":0.3231018337,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1779","status":"","submitted":1889,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7069879119059447,"acs":8539,"articleLive":2,"columnArticles":169,"formTitle":"[1636]按照频率将数组升序排序","frequency":0.2672681876,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"","submitted":12078,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8060100692259282,"acs":5123,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1742","status":"","submitted":6356,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.71005291005291,"acs":2684,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"","submitted":3780,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4018629407850965,"acs":1208,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1744","status":"","submitted":3006,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6635373638753286,"acs":12369,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":0.2672681876,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1760","status":"","submitted":18641,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7693162504902602,"acs":11769,"articleLive":2,"columnArticles":263,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":1.8182900697,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1761","status":"","submitted":15298,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45404085257548843,"acs":6135,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":0.819884004,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"","submitted":13512,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44944757139879093,"acs":2156,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"","submitted":4797,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.537122969837587,"acs":926,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":0.8505989493,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"","submitted":1724,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.40939977349943374,"acs":723,"articleLive":2,"columnArticles":23,"formTitle":"[1645]Hopper Company Queries II","frequency":0.3529369822,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1785","status":"","submitted":1766,"title":"Hopper Company Queries II","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5376271632126481,"acs":32713,"articleLive":2,"columnArticles":342,"formTitle":"[1646]获取生成数组中的最大值","frequency":0.9158962917,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1769","status":"ac","submitted":60847,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5119425547996976,"acs":6773,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":1.1702165637,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"","submitted":13230,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2775304493910122,"acs":3304,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":0.9158962917,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1771","status":"","submitted":11905,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4747006566241792,"acs":2458,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1772","status":"","submitted":5178,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7954898911353032,"acs":1023,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":0.294577367,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1790","status":"","submitted":1286,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6931818181818182,"acs":671,"articleLive":2,"columnArticles":22,"formTitle":"[1651]Hopper Company Queries III","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1795","status":"","submitted":968,"title":"Hopper Company Queries III","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6597418313836224,"acs":6542,"articleLive":2,"columnArticles":167,"formTitle":"[1652]拆炸弹","frequency":0.819884004,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1755","status":"","submitted":9916,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5012579547136303,"acs":3387,"articleLive":2,"columnArticles":80,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":0.294577367,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"","submitted":6757,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27371507416350466,"acs":3174,"articleLive":2,"columnArticles":46,"formTitle":"[1654]到家的最少跳跃次数","frequency":1.1702165637,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1757","status":"","submitted":11596,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3816649104320337,"acs":1811,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1758","status":"","submitted":4745,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7803612206767698,"acs":7518,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":0.2672681876,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1775","status":"","submitted":9634,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46486154924640727,"acs":5305,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":0.294577367,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1777","status":"","submitted":11412,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29559861691398936,"acs":8207,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1776","status":"","submitted":27764,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40582462804685027,"acs":1282,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":1.3441443284,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1778","status":"","submitted":3159,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7414141414141414,"acs":367,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1796","status":"","submitted":495,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.731969137873197,"acs":2182,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":0.8505989493,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1801","status":"","submitted":2981,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8133859238259583,"acs":19797,"articleLive":2,"columnArticles":270,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":0.7903397577,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1781","status":"","submitted":24339,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5714174998062466,"acs":7373,"articleLive":2,"columnArticles":127,"formTitle":"[1663]具有给定数值的最小字符串","frequency":1.2022637412,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1782","status":"","submitted":12903,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.544557540506855,"acs":5243,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"","submitted":9628,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6675521317572055,"acs":5026,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":0.3231018337,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1784","status":"","submitted":7529,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.680379746835443,"acs":215,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"","submitted":316,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6064858122856251,"acs":1945,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1811","status":"","submitted":3207,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44110542767831773,"acs":6209,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1764","status":"","submitted":14076,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7689441820238174,"acs":11558,"articleLive":2,"columnArticles":211,"formTitle":"[1669]合并两个链表","frequency":0.819884004,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"ac","submitted":15031,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5281121841513428,"acs":3992,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":0.3231018337,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1767","status":"ac","submitted":7559,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4652912621359223,"acs":1917,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":0.5881423444,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"","submitted":4120,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8502585642345821,"acs":37652,"articleLive":2,"columnArticles":433,"formTitle":"[1672]最富有客户的资产总量","frequency":0.2672681876,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"","submitted":44283,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35075279261777564,"acs":7222,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":0.294577367,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"ac","submitted":20590,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3590131678522779,"acs":2372,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":0.9833335637,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1793","status":"","submitted":6607,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4356839121190645,"acs":2459,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1794","status":"","submitted":5644,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7655719139297849,"acs":676,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":0.5207050724,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1816","status":"","submitted":883,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.4048275862068966,"acs":1761,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"","submitted":4350,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.829732914375491,"acs":16900,"articleLive":2,"columnArticles":272,"formTitle":"[1678]设计 Goal 解析器","frequency":0.2672681876,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1797","status":"","submitted":20368,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4942571599045346,"acs":6627,"articleLive":2,"columnArticles":106,"formTitle":"[1679]K 和数对的最大数目","frequency":0.294577367,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"","submitted":13408,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46115687837718133,"acs":5206,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":0.294577367,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1800","status":"","submitted":11289,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3803339517625232,"acs":2255,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.6337706971,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"","submitted":5929,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5335892514395394,"acs":278,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1822","status":"","submitted":521,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8950198075834748,"acs":3163,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"","submitted":3534,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8270528391985882,"acs":15934,"articleLive":2,"columnArticles":337,"formTitle":"[1684]统计一致字符串的数目","frequency":1.1393499157,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1786","status":"","submitted":19266,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5942078951904844,"acs":3447,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1787","status":"","submitted":5801,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.46841500765696786,"acs":2447,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":0.3231018337,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1788","status":"","submitted":5224,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39883876730683343,"acs":893,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1789","status":"","submitted":2239,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8037261334006224,"acs":19111,"articleLive":2,"columnArticles":251,"formTitle":"[1688]比赛中的配对次数","frequency":0.7903397577,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1806","status":"","submitted":23778,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8690838982523789,"acs":13974,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":1.1095858138,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"","submitted":16079,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5092016911216115,"acs":4095,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":0.3231018337,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1808","status":"","submitted":8042,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4849052675411201,"acs":2329,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1367","status":"","submitted":4803,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6455696202531646,"acs":153,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1828","status":"","submitted":237,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8061797752808989,"acs":2009,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"","submitted":2492,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6364908597918306,"acs":7277,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"","submitted":11433,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45335776308452164,"acs":5691,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":0.294577367,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"","submitted":12553,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39966923925027564,"acs":5800,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":1.1393499157,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"","submitted":14512,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.52453300124533,"acs":2106,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"","submitted":4015,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5438144329896907,"acs":422,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"","submitted":776,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8001038421599169,"acs":1541,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1842","status":"","submitted":1926,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7196835640678672,"acs":6914,"articleLive":2,"columnArticles":165,"formTitle":"[1700]无法吃午餐的学生数量","frequency":0.2672681876,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1802","status":"","submitted":9607,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6105913798864016,"acs":3655,"articleLive":2,"columnArticles":75,"formTitle":"[1701]平均等待时间","frequency":0.8505989493,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1803","status":"","submitted":5986,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4748700173310225,"acs":2740,"articleLive":2,"columnArticles":65,"formTitle":"[1702]修改后的最大二进制字符串","frequency":0.9158962917,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"","submitted":5770,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889240506329114,"acs":1229,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1805","status":"","submitted":3160,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814369245244976,"acs":11627,"articleLive":2,"columnArticles":176,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1823","status":"","submitted":14879,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34582441113490364,"acs":5491,"articleLive":2,"columnArticles":114,"formTitle":"[1705]吃苹果的最大数目","frequency":0.8505989493,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"","submitted":15878,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5846963447589247,"acs":4111,"articleLive":2,"columnArticles":106,"formTitle":"[1706]球会落何处","frequency":0.882570982,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"","submitted":7031,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5034487713751976,"acs":14014,"articleLive":2,"columnArticles":148,"formTitle":"[1707]与数组中元素的最大异或值","frequency":1.999551181,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1826","status":"","submitted":27836,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.664396887159533,"acs":683,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1847","status":"","submitted":1028,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7173303421200224,"acs":1279,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"","submitted":1783,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6926359345703756,"acs":10713,"articleLive":2,"columnArticles":175,"formTitle":"[1710]卡车上的最大单元数","frequency":1.1702165637,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1829","status":"","submitted":15467,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35923032407407407,"acs":29796,"articleLive":2,"columnArticles":357,"formTitle":"[1711]大餐计数","frequency":2.472932291,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1830","status":"ac","submitted":82944,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26559795974132433,"acs":5832,"articleLive":2,"columnArticles":102,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"","submitted":21958,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49737105254669206,"acs":15419,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":1.1393499157,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1832","status":"ac","submitted":31001,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6342857142857142,"acs":222,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1809","status":"","submitted":350,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7375063099444725,"acs":1461,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":0.8505989493,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1862","status":"","submitted":1981,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6746156533892383,"acs":7723,"articleLive":2,"columnArticles":182,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1817","status":"","submitted":11448,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4310740354535975,"acs":2067,"articleLive":2,"columnArticles":48,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"","submitted":4795,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48599842973043705,"acs":1857,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1819","status":"","submitted":3821,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3614013521819299,"acs":588,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1820","status":"","submitted":1627,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8692860128434092,"acs":45754,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":2.7365925551,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1839","status":"ac","submitted":52634,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6496393059075843,"acs":9996,"articleLive":2,"columnArticles":157,"formTitle":"[1721]交换链表中的节点","frequency":0.294577367,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"ac","submitted":15387,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5132949257699978,"acs":4633,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1840","status":"","submitted":9026,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5078648150644914,"acs":22601,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":3.555444053,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"ac","submitted":44502,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5536332179930796,"acs":320,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1865","status":"","submitted":578,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7869365928189458,"acs":10301,"articleLive":2,"columnArticles":138,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":0.2672681876,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1843","status":"","submitted":13090,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4750824641169653,"acs":5329,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"","submitted":11217,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5728105026774918,"acs":3316,"articleLive":2,"columnArticles":82,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":0.4869864364,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"","submitted":5789,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.34772344013490725,"acs":1031,"articleLive":2,"columnArticles":24,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1727","status":"","submitted":2965,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6249582916249583,"acs":1873,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":0.294577367,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1877","status":"","submitted":2997,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5342763873775843,"acs":491,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"","submitted":919,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4772253646918726,"acs":1603,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1882","status":"","submitted":3359,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7928943425840052,"acs":11114,"articleLive":2,"columnArticles":192,"formTitle":"[1732]找到最高海拔","frequency":1.5024017902,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1833","status":"","submitted":14017,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4575460960619167,"acs":2010,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":0.5544237084,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"","submitted":4393,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232984429516222,"acs":27779,"articleLive":2,"columnArticles":368,"formTitle":"[1734]解码异或后的排列","frequency":2.6388889909,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1835","status":"ac","submitted":38406,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.484,"acs":968,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1836","status":"","submitted":2000,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491398295617759,"acs":28144,"articleLive":2,"columnArticles":349,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":2.1437267157,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1858","status":"ac","submitted":62662,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30810045985143264,"acs":3484,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":0.9833335637,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1859","status":"","submitted":11308,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6541037548715316,"acs":28029,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":2.0709081197,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":42851,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4711765775595563,"acs":2591,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1861","status":"","submitted":5499,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7006896551724138,"acs":508,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":0.5544237084,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1883","status":"","submitted":725,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8432304038004751,"acs":1775,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1892","status":"","submitted":2105,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7057997718697903,"acs":8044,"articleLive":2,"columnArticles":124,"formTitle":"[1742]盒子中小球的最大数量","frequency":0.2672681876,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"","submitted":11397,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974705103135054,"acs":22114,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":1.7591658232,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1866","status":"ac","submitted":31706,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3631182392700673,"acs":28097,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":2.6732802757,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1872","status":"ac","submitted":77377,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.484660722381744,"acs":3207,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1871","status":"","submitted":6617,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6024498886414253,"acs":541,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1893","status":"","submitted":898,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7028535980148883,"acs":1133,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"","submitted":1612,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.749488453668518,"acs":10256,"articleLive":2,"columnArticles":213,"formTitle":"[1748]唯一元素的和","frequency":1.1702165637,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"","submitted":13684,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5300734260271832,"acs":3393,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":1.1702165637,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"","submitted":6401,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4590625927024622,"acs":3095,"articleLive":2,"columnArticles":78,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"","submitted":6742,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46818501995773654,"acs":1994,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":1.0950949067,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"","submitted":4259,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6867289719626168,"acs":9185,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1878","status":"","submitted":13375,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6273857079449623,"acs":5654,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1879","status":"","submitted":9012,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4205187199330684,"acs":4021,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":0.3231018337,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1880","status":"","submitted":9562,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39684898929845425,"acs":2670,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":0.294577367,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1881","status":"","submitted":6728,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8050314465408805,"acs":256,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1903","status":"","submitted":318,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9222938581608415,"acs":2718,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1908","status":"","submitted":2947,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6350440157332834,"acs":6781,"articleLive":2,"columnArticles":108,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1884","status":"","submitted":10678,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42753342375508624,"acs":4413,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":0.2672681876,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"","submitted":10322,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5362754474655007,"acs":3925,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1886","status":"","submitted":7319,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4283015627683325,"acs":2494,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.4169793485,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1887","status":"","submitted":5823,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.669449081803005,"acs":401,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1909","status":"","submitted":599,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6106268856855515,"acs":3643,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":0.3231018337,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"","submitted":5966,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47643979057591623,"acs":2184,"articleLive":2,"columnArticles":51,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"","submitted":4584,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5649082189515462,"acs":3416,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":0.3231018337,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1876","status":"","submitted":6047,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37527716186252774,"acs":1354,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":0.7344592993,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1875","status":"","submitted":3608,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.8065610859728507,"acs":713,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1914","status":"","submitted":884,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.769058457981068,"acs":10643,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":1.1095858138,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1894","status":"","submitted":13839,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8547121572776162,"acs":9695,"articleLive":2,"columnArticles":164,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":0.2672681876,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"","submitted":11343,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36841621472561814,"acs":4008,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":0.5207050724,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1896","status":"","submitted":10879,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3637987012987013,"acs":2241,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1897","status":"","submitted":6160,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5363457760314342,"acs":273,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1919","status":"","submitted":509,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8409660887580417,"acs":15425,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":1.40404247,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1899","status":"","submitted":18342,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5552238805970149,"acs":5766,"articleLive":2,"columnArticles":88,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":0.8505989493,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1900","status":"","submitted":10385,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4721516061936677,"acs":4086,"articleLive":2,"columnArticles":88,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":0.882570982,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"","submitted":8654,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4631637475674173,"acs":1666,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":1.3441443284,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1902","status":"","submitted":3597,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.778600269179004,"acs":4628,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":3.3565751598,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1926","status":"","submitted":5944,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5571955719557196,"acs":151,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1931","status":"","submitted":271,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6471329552614997,"acs":5135,"articleLive":2,"columnArticles":65,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":0.294577367,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1888","status":"","submitted":7935,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6616052060737527,"acs":5185,"articleLive":2,"columnArticles":106,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1889","status":"","submitted":7837,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5164405010438413,"acs":3958,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":0.241088682,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1890","status":"","submitted":7664,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2851085058618109,"acs":1143,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1891","status":"","submitted":4009,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7905882352941176,"acs":1008,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1932","status":"","submitted":1275,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4205505316506012,"acs":8464,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":0.2672681876,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1910","status":"","submitted":20126,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34717934325007016,"acs":6185,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"","submitted":17815,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.33929322675641566,"acs":3226,"articleLive":2,"columnArticles":84,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1912","status":"","submitted":9508,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.654073991281994,"acs":11704,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":2.6732802757,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1913","status":"ac","submitted":17894,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6810344827586207,"acs":158,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1937","status":"","submitted":232,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7162921348314607,"acs":1275,"articleLive":2,"columnArticles":27,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1942","status":"","submitted":1780,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6519579949304226,"acs":12603,"articleLive":2,"columnArticles":136,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.2672681876,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1915","status":"","submitted":19331,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8095195808542758,"acs":9116,"articleLive":2,"columnArticles":124,"formTitle":"[1791]找出星型图的中心节点","frequency":0.215961732,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1916","status":"","submitted":11261,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136005150490907,"acs":6382,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":1.7128183255,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1917","status":"","submitted":12426,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4110867178924259,"acs":3745,"articleLive":2,"columnArticles":90,"formTitle":"[1793]好子数组的最大分数","frequency":0.9158962917,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1918","status":"","submitted":9110,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6822916666666666,"acs":131,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"","submitted":192,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7911255411255411,"acs":1462,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":1.2355779478,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1948","status":"","submitted":1848,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4867853948117427,"acs":5986,"articleLive":2,"columnArticles":113,"formTitle":"[1796]字符串中第二大的数字","frequency":0.2672681876,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1904","status":"ac","submitted":12297,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.573216885007278,"acs":3938,"articleLive":2,"columnArticles":60,"formTitle":"[1797]设计一个验证系统","frequency":0.8505989493,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"ac","submitted":6870,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5180679785330948,"acs":2896,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"","submitted":5590,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.510825600761361,"acs":2147,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":0.4169793485,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1906","status":"","submitted":4203,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6836795252225519,"acs":9216,"articleLive":2,"columnArticles":148,"formTitle":"[1800]最大升序子数组和","frequency":0.819884004,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1927","status":"ac","submitted":13480,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.376303317535545,"acs":3970,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1928","status":"notac","submitted":10550,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2619569421167977,"acs":4064,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1929","status":"","submitted":15514,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4107825387246027,"acs":2042,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":1.0613762707,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1907","status":"ac","submitted":4971,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5766773162939297,"acs":361,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":0.5544237084,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"","submitted":626,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4956160379943374,"acs":10853,"articleLive":2,"columnArticles":143,"formTitle":"[1805]字符串中不同整数的数目","frequency":0.241088682,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"","submitted":21898,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.663372859025033,"acs":5035,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":1.2355779478,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1935","status":"","submitted":7590,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5846251858143979,"acs":5506,"articleLive":2,"columnArticles":83,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"","submitted":9418,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26569294235700747,"acs":2383,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":0.6337706971,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1936","status":"","submitted":8969,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6402349486049926,"acs":1308,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":0.819884004,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1958","status":"","submitted":2043,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6567164179104478,"acs":132,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":1.3441443284,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"","submitted":201,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.667005076142132,"acs":657,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":0.2672681876,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1964","status":"","submitted":985,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7947223399745655,"acs":7499,"articleLive":2,"columnArticles":175,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":9436,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5229069531725117,"acs":5159,"articleLive":2,"columnArticles":68,"formTitle":"[1813]句子相似性 III","frequency":1.2022637412,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1923","status":"ac","submitted":9866,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.3413039035356632,"acs":3340,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":0.3231018337,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1925","status":"ac","submitted":9786,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30058027079303673,"acs":1554,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"","submitted":5170,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540044881219531,"acs":9744,"articleLive":2,"columnArticles":142,"formTitle":"[1816]截断句子","frequency":0.2672681876,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1944","status":"ac","submitted":12923,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6952716664640817,"acs":5720,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":0.3231018337,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1945","status":"ac","submitted":8227,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3741528739535502,"acs":25341,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":2.2422818656,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":67729,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36442197945540517,"acs":2235,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1947","status":"","submitted":6133,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46496815286624205,"acs":73,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"","submitted":157,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9012233801540552,"acs":1989,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":1.2355779478,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"","submitted":2207,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8133231694405624,"acs":19205,"articleLive":2,"columnArticles":188,"formTitle":"[1822]数组元素积的符号","frequency":0.7903397577,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1950","status":"","submitted":23613,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7057963955187531,"acs":7245,"articleLive":2,"columnArticles":90,"formTitle":"[1823]找出游戏的获胜者","frequency":0.7903397577,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"","submitted":10265,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6618976564557184,"acs":7541,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1952","status":"","submitted":11393,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.2869226488592098,"acs":2578,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":0.5881423444,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1953","status":"","submitted":8985,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4426605504587156,"acs":193,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1980","status":"","submitted":436,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7961654894046418,"acs":8679,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1938","status":"ac","submitted":10901,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8708086785009862,"acs":7064,"articleLive":2,"columnArticles":91,"formTitle":"[1828]统计一个圆中点的数目","frequency":0.7903397577,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1939","status":"ac","submitted":8112,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.676412907826707,"acs":3794,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"ac","submitted":5609,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.48148148148148145,"acs":819,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1941","status":"ac","submitted":1701,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7375,"acs":708,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"","submitted":960,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.821764472115512,"acs":12407,"articleLive":2,"columnArticles":204,"formTitle":"[1832]判断句子是否为全字母句","frequency":1.1702165637,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1960","status":"ac","submitted":15098,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6852305246422894,"acs":43101,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":1.4356157319,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1961","status":"ac","submitted":62900,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35055787570903196,"acs":5624,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":1.5024017902,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"","submitted":16043,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5072903132669265,"acs":3514,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":0.6824184212,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1963","status":"","submitted":6927,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7105263157894737,"acs":297,"articleLive":2,"columnArticles":21,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":0.4869864364,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1982","status":"","submitted":418,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7939226519337017,"acs":7185,"articleLive":2,"columnArticles":82,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"ac","submitted":9050,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4308873720136519,"acs":28280,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":2.8043576793,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"ac","submitted":65632,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5803885291396855,"acs":6274,"articleLive":2,"columnArticles":123,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1967","status":"ac","submitted":10810,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.39034079029897556,"acs":1867,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":0.4506979845,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1968","status":"ac","submitted":4783,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5110771581359816,"acs":669,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":1.2022637412,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1991","status":"","submitted":1309,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7086614173228346,"acs":90,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1997","status":"","submitted":127,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5216016859852476,"acs":495,"articleLive":2,"columnArticles":20,"formTitle":"[1843]Suspicious Bank Accounts","frequency":0.3231018337,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1998","status":"","submitted":949,"title":"Suspicious Bank Accounts","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8023181760285314,"acs":6299,"articleLive":2,"columnArticles":106,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1954","status":"","submitted":7851,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5817281825029592,"acs":5406,"articleLive":2,"columnArticles":53,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1955","status":"","submitted":9293,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335263610781646,"acs":27241,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":1.965832545,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1956","status":"ac","submitted":42999,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35933237040603433,"acs":2239,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":0.4869864364,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1957","status":"","submitted":6231,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6853630426431041,"acs":7136,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1975","status":"","submitted":10412,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3292216078264568,"acs":5418,"articleLive":2,"columnArticles":106,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":0.3841895257,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"","submitted":16457,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6052490626673809,"acs":2260,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":0.4506979845,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1978","status":"","submitted":3734,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.3966820663586728,"acs":1889,"articleLive":2,"columnArticles":45,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"","submitted":4762,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7009803921568627,"acs":143,"articleLive":2,"columnArticles":10,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"2003","status":"","submitted":204,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6495016611295681,"acs":782,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":0.3231018337,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"2004","status":"","submitted":1204,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7945303550973654,"acs":11098,"articleLive":2,"columnArticles":111,"formTitle":"[1854]人口最多的年份","frequency":1.1702165637,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1983","status":"ac","submitted":13968,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6917957076881283,"acs":10186,"articleLive":2,"columnArticles":97,"formTitle":"[1855]下标对中的最大距离","frequency":1.1702165637,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1984","status":"notac","submitted":14724,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35650548143112093,"acs":4195,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":0.9158962917,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1985","status":"ac","submitted":11767,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4480231008440693,"acs":2017,"articleLive":2,"columnArticles":30,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1986","status":"","submitted":4502,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.7084548104956269,"acs":243,"articleLive":2,"columnArticles":14,"formTitle":"[1858]包含所有前缀的最长单词","frequency":0.6337706971,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"2009","status":"","submitted":343,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.773308504034761,"acs":6229,"articleLive":2,"columnArticles":130,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1970","status":"ac","submitted":8055,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7718756434012765,"acs":3749,"articleLive":2,"columnArticles":60,"formTitle":"[1860]增长的内存泄露","frequency":0.2672681876,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1971","status":"ac","submitted":4857,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6182785109316525,"acs":3139,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":0.294577367,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1972","status":"notac","submitted":5077,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31017369727047145,"acs":2125,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"notac","submitted":6851,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9234449760765551,"acs":11773,"articleLive":2,"columnArticles":134,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":1.9333017954,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1993","status":"","submitted":12749,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3860818064038497,"acs":4172,"articleLive":2,"columnArticles":102,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":0.3841895257,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1994","status":"ac","submitted":10806,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5171118107037677,"acs":5092,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1995","status":"ac","submitted":9847,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5944584382871536,"acs":2124,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":0.9833335637,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1996","status":"","submitted":3573,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7736625514403292,"acs":376,"articleLive":2,"columnArticles":13,"formTitle":"[1867]Orders With Maximum Quantity Above Average","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"2014","status":"","submitted":486,"title":"Orders With Maximum Quantity Above Average","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5561797752808989,"acs":99,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":0.9158962917,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"2019","status":"","submitted":178,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.8023754536456615,"acs":12160,"articleLive":2,"columnArticles":131,"formTitle":"[1869]哪种连续子字符串更长","frequency":1.1393499157,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1999","status":"ac","submitted":15155,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.46111851710785245,"acs":7264,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":0.3231018337,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"2000","status":"notac","submitted":15753,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.275493341110139,"acs":5668,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"2001","status":"notac","submitted":20574,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6241299303944315,"acs":1883,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"2002","status":"","submitted":3017,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7977059436913452,"acs":1530,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":1.7128183255,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"2024","status":"","submitted":1918,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.868995633187773,"acs":199,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"2029","status":"","submitted":229,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7365967365967366,"acs":316,"articleLive":2,"columnArticles":17,"formTitle":"[1875]Group Employees of the Same Salary","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"2030","status":"","submitted":429,"title":"Group Employees of the Same Salary","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7318690426854538,"acs":5298,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1987","status":"ac","submitted":7239,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8195000274107779,"acs":29897,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":2.6006794628,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1988","status":"ac","submitted":36482,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42738070431339864,"acs":2051,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1990","status":"ac","submitted":4799,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40404040404040403,"acs":1760,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":0.4169793485,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1989","status":"","submitted":4356,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7725954028118723,"acs":6924,"articleLive":2,"columnArticles":88,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":0.2672681876,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"2010","status":"ac","submitted":8962,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35152851804202656,"acs":5738,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"2011","status":"ac","submitted":16323,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2764925669767072,"acs":3478,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"2012","status":"notac","submitted":12579,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37037856984724377,"acs":1673,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"2013","status":"","submitted":4517,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.69923273657289,"acs":1367,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":1.6783464165,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"2031","status":"","submitted":1955,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5365853658536586,"acs":176,"articleLive":2,"columnArticles":8,"formTitle":"[1885]Count Pairs in Two Arrays","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"2036","status":"","submitted":328,"title":"Count Pairs in Two Arrays","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5721045515998198,"acs":5078,"articleLive":2,"columnArticles":75,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":0.294577367,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"2015","status":"","submitted":8876,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6400688103744873,"acs":4837,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"2016","status":"","submitted":7557,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3140369455230027,"acs":2669,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":0.3841895257,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"2017","status":"","submitted":8499,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2745923913043478,"acs":2021,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":0.9833335637,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"2018","status":"","submitted":7360,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.6996935648621042,"acs":685,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"2041","status":"","submitted":979,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5035211267605634,"acs":143,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"2045","status":"","submitted":284,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3505807814149947,"acs":332,"articleLive":2,"columnArticles":11,"formTitle":"[1892]页面推荐Ⅱ","frequency":0.3529369822,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"2046","status":"","submitted":947,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5916373205371309,"acs":30577,"articleLive":2,"columnArticles":403,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":2.0833522823,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"2005","status":"ac","submitted":51682,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.42942071063182635,"acs":3106,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"2006","status":"ac","submitted":7233,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5311004784688995,"acs":1887,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"notac","submitted":3553,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5012391573729864,"acs":809,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"2008","status":"","submitted":1614,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5277025807615954,"acs":5848,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":0.7903397577,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"2025","status":"ac","submitted":11082,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3067772734387228,"acs":3920,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":0.3841895257,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"2027","status":"notac","submitted":12778,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.626711719722568,"acs":3524,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"2026","status":"","submitted":5623,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4239457831325301,"acs":1126,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":1.1860873936,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"2028","status":"","submitted":2656,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6586901763224181,"acs":523,"articleLive":2,"columnArticles":22,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"2047","status":"","submitted":794,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4296875,"acs":55,"articleLive":2,"columnArticles":3,"formTitle":"[1902]Depth of BST Given Insertion Order","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"2052","status":"","submitted":128,"title":"Depth of BST Given Insertion Order","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6446705426356589,"acs":6653,"articleLive":2,"columnArticles":94,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"2032","status":"","submitted":10320,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.2750321199143469,"acs":3211,"articleLive":2,"columnArticles":67,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"2033","status":"","submitted":11675,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5734952913880169,"acs":4202,"articleLive":2,"columnArticles":86,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"2035","status":"","submitted":7327,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4218026362664767,"acs":2368,"articleLive":2,"columnArticles":53,"formTitle":"[1906]查询差绝对值的最小值","frequency":1.0214188978,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"2034","status":"","submitted":5614,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.632183908045977,"acs":330,"articleLive":2,"columnArticles":14,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"2057","status":"","submitted":522,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6507936507936508,"acs":82,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"2062","status":"","submitted":126,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.328995983935743,"acs":4096,"articleLive":2,"columnArticles":65,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":0.241088682,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"2020","status":"notac","submitted":12450,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6784114052953156,"acs":3331,"articleLive":2,"columnArticles":54,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"2021","status":"ac","submitted":4910,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5642425424059271,"acs":2894,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":0.241088682,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"2022","status":"notac","submitted":5129,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.3043170559094126,"acs":1290,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"2023","status":"","submitted":4239,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8469733656174334,"acs":6996,"articleLive":2,"columnArticles":74,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":0.241088682,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"2042","status":"ac","submitted":8260,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43924837524724497,"acs":3109,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":0.8505989493,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"2043","status":"","submitted":7078,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.38874570446735396,"acs":2715,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"2044","status":"notac","submitted":6984,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5545361875637105,"acs":1088,"articleLive":2,"columnArticles":17,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":0.9496149277,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1313","status":"","submitted":1962,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.287758346581876,"acs":181,"articleLive":2,"columnArticles":8,"formTitle":"[1917]Leetcodify Friends Recommendations","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"2063","status":"","submitted":629,"title":"Leetcodify Friends Recommendations","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4642857142857143,"acs":78,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"2069","status":"","submitted":168,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.4106280193236715,"acs":255,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"2064","status":"","submitted":621,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9405361114362636,"acs":8035,"articleLive":2,"columnArticles":69,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"2048","status":"ac","submitted":8543,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.342081211646429,"acs":5240,"articleLive":2,"columnArticles":86,"formTitle":"[1921]消灭怪物的最大数量","frequency":0.9158962917,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"2049","status":"ac","submitted":15318,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36252562525625254,"acs":4421,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":0.294577367,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"2050","status":"","submitted":12195,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23518580515567458,"acs":1405,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":1.2022637412,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"2051","status":"","submitted":5974,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5223880597014925,"acs":35,"articleLive":2,"columnArticles":2,"formTitle":"[1924]Erect the Fence II","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"2074","status":"","submitted":67,"title":"Erect the Fence II","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6988617341814529,"acs":4175,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":1.4356157319,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"2037","status":"ac","submitted":5974,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3461329272272381,"acs":3182,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"2038","status":"notac","submitted":9193,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4103267647792467,"acs":1645,"articleLive":2,"columnArticles":36,"formTitle":"[1927]求和游戏","frequency":0.2672681876,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"2039","status":"notac","submitted":4009,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3647890758351622,"acs":1496,"articleLive":2,"columnArticles":32,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":1.2702554863,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"2040","status":"notac","submitted":4101,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9421119592875318,"acs":8886,"articleLive":2,"columnArticles":75,"formTitle":"[1929]数组串联","frequency":0.16859318,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"2058","status":"","submitted":9432,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.474990872581234,"acs":5204,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":0.7903397577,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"2059","status":"","submitted":10956,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5515838419064225,"acs":1898,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":0.2672681876,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"2061","status":"","submitted":3441,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.32407709898725906,"acs":992,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":0.4869864364,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"2060","status":"","submitted":3061,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5732484076433121,"acs":360,"articleLive":2,"columnArticles":21,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"2070","status":"","submitted":628,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7316017316017316,"acs":169,"articleLive":2,"columnArticles":8,"formTitle":"[1934]Confirmation Rate","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"2087","status":"","submitted":231,"title":"Confirmation Rate","titleSlug":"confirmation-rate"},{"acceptance":0.7431930693069307,"acs":6005,"articleLive":2,"columnArticles":85,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1264","status":"","submitted":8080,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4487599831862127,"acs":5338,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"2066","status":"","submitted":11895,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23827120822622108,"acs":2966,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":0.8505989493,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"2067","status":"","submitted":12448,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.33322754681053635,"acs":1050,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":0.8505989493,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"2068","status":"","submitted":3151,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6657963446475196,"acs":255,"articleLive":2,"columnArticles":9,"formTitle":"[1939]Users That Actively Request Confirmation Messages","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"2092","status":"","submitted":383,"title":"Users That Actively Request Confirmation Messages","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8264984227129337,"acs":262,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"2071","status":"","submitted":317,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7780642602142007,"acs":3923,"articleLive":2,"columnArticles":68,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"2053","status":"ac","submitted":5042,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38781121124179013,"acs":2539,"articleLive":2,"columnArticles":62,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"2054","status":"ac","submitted":6547,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4012389802239695,"acs":1684,"articleLive":2,"columnArticles":47,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"2055","status":"notac","submitted":4197,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5726872246696035,"acs":1690,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":0.3231018337,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1305","status":"","submitted":2951,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6619781201160974,"acs":5930,"articleLive":2,"columnArticles":65,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":0.191817633,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"2076","status":"ac","submitted":8958,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30248239646735886,"acs":5069,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":0.819884004,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"2077","status":"ac","submitted":16758,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5364381198792583,"acs":3732,"articleLive":2,"columnArticles":80,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"2078","status":"ac","submitted":6957,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5178258328462887,"acs":886,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":0.294577367,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"2079","status":"","submitted":1711,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5374449339207048,"acs":122,"articleLive":2,"columnArticles":9,"formTitle":"[1949]Strong Friendship","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"2097","status":"","submitted":227,"title":"Strong Friendship","titleSlug":"strong-friendship"},{"acceptance":0.5572916666666666,"acs":107,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"2072","status":"","submitted":192,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7288135593220338,"acs":129,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"2098","status":"","submitted":177,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5412243453644727,"acs":6118,"articleLive":2,"columnArticles":67,"formTitle":"[1952]三除数","frequency":0.033718636,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"2083","status":"ac","submitted":11304,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31810463329829386,"acs":3934,"articleLive":2,"columnArticles":81,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"2084","status":"ac","submitted":12367,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4806056056056056,"acs":3841,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":0.101155908,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1295","status":"ac","submitted":7992,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49304987735077677,"acs":2412,"articleLive":2,"columnArticles":38,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"2086","status":"","submitted":4892,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.43014705882352944,"acs":117,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":0.9833335637,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"2073","status":"","submitted":272,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6073051674802222,"acs":3608,"articleLive":2,"columnArticles":45,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1302","status":"","submitted":5941,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.4182475158084914,"acs":2315,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"2080","status":"","submitted":5535,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4099935938500961,"acs":1280,"articleLive":2,"columnArticles":30,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"2081","status":"","submitted":3122,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2783018867924528,"acs":531,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"","submitted":1908,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5345037371806014,"acs":6150,"articleLive":2,"columnArticles":53,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.067437272,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"2093","status":"","submitted":11506,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4231995971126406,"acs":5042,"articleLive":2,"columnArticles":68,"formTitle":"[1962]移除石子使总数最小","frequency":0.4686035658,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"2094","status":"","submitted":11914,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6112563432262033,"acs":3975,"articleLive":2,"columnArticles":52,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":0.16859318,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"2095","status":"","submitted":6503,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3815668202764977,"acs":2898,"articleLive":2,"columnArticles":43,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"2096","status":"","submitted":7595,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7361702127659574,"acs":173,"articleLive":2,"columnArticles":7,"formTitle":"[1965]Employees With Missing Information","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"2110","status":"","submitted":235,"title":"Employees With Missing Information","titleSlug":"employees-with-missing-information"},{"acceptance":0.6785714285714286,"acs":19,"articleLive":2,"columnArticles":4,"formTitle":"[1966]Binary Searchable Numbers in an Unsorted Array","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"2111","status":"","submitted":28,"title":"Binary Searchable Numbers in an Unsorted Array","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7699853587115666,"acs":5259,"articleLive":2,"columnArticles":46,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"2099","status":"","submitted":6830,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.346767560454022,"acs":4216,"articleLive":2,"columnArticles":64,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"2085","status":"","submitted":12158,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27133259801463955,"acs":2706,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":1.2881386524,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"2100","status":"","submitted":9973,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4719211822660099,"acs":1916,"articleLive":2,"columnArticles":45,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":1.3441443284,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"2101","status":"","submitted":4060,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.54,"acs":135,"articleLive":2,"columnArticles":11,"formTitle":"[1971]Find if Path Exists in Graph","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"2121","status":"","submitted":250,"title":"Find if Path Exists in Graph","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.42,"acs":42,"articleLive":2,"columnArticles":5,"formTitle":"[1972]First and Last Call On the Same Day","frequency":1.4683733283,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"2120","status":"","submitted":100,"title":"First and Last Call On the Same Day","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.41975308641975306,"acs":34,"articleLive":2,"columnArticles":8,"formTitle":"[1973]Count Nodes Equal to Sum of Descendants","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"2126","status":"","submitted":81,"title":"Count Nodes Equal to Sum of Descendants","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7469814864502281,"acs":2784,"articleLive":2,"columnArticles":36,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.5207050724,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"2088","status":"ac","submitted":3727,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3667448876969494,"acs":2188,"articleLive":2,"columnArticles":36,"formTitle":"[1975]最大方阵和","frequency":0.6337706971,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"2089","status":"ac","submitted":5966,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.25485625485625485,"acs":1312,"articleLive":2,"columnArticles":20,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"2090","status":"notac","submitted":5148,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.20071364852809992,"acs":450,"articleLive":2,"columnArticles":10,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"2091","status":"","submitted":2242,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.8492263404102195,"acs":4720,"articleLive":2,"columnArticles":39,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"2106","status":"ac","submitted":5558,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5326046911457694,"acs":4337,"articleLive":2,"columnArticles":76,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"2107","status":"ac","submitted":8143,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.265794110244148,"acs":3168,"articleLive":2,"columnArticles":64,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":1.40404247,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"2108","status":"","submitted":11919,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.42846441947565544,"acs":572,"articleLive":2,"columnArticles":14,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"2109","status":"","submitted":1335,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.8443331816112881,"acs":79765,"articleLive":2,"columnArticles":616,"formTitle":"[LCP 01]猜数字","frequency":2.0943789681,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"100107","status":"","submitted":94471,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6879649659684482,"acs":13039,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":1.4356157319,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"100092","status":"","submitted":18953,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21753174200101574,"acs":10708,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":1.4683733283,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"100096","status":"","submitted":49225,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3729779694962255,"acs":2421,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":1.9603304678,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"100093","status":"","submitted":6491,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19525547445255476,"acs":1926,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"100094","status":"","submitted":9864,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8390015910898966,"acs":42185,"articleLive":2,"columnArticles":640,"formTitle":"[LCP 06]拿硬币","frequency":1.6451472448,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"1000056","status":"","submitted":50280,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7707999506964132,"acs":37521,"articleLive":2,"columnArticles":453,"formTitle":"[LCP 07]传递信息","frequency":3.2485176377,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"1000063","status":"ac","submitted":48678,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28102810867906813,"acs":4789,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"1000057","status":"","submitted":17041,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.264654749699104,"acs":5937,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":2.9734886079,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"1000090","status":"","submitted":22433,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5805880269217145,"acs":1639,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":1.2022637412,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"1000062","status":"","submitted":2823,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6829751721260171,"acs":6547,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 11]期望个数统计","frequency":0.3529369822,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"1000086","status":"","submitted":9586,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.40528057355577,"acs":5879,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":1.8182900697,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"1000087","status":"","submitted":14506,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6159554730983302,"acs":9296,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":0.5544237084,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"1000093","status":"","submitted":15092,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.1991906110886281,"acs":2461,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":1.9603304678,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"1000059","status":"","submitted":12355,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5717375630857967,"acs":793,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":0.7344592993,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"1000088","status":"","submitted":1387,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2931793179317932,"acs":533,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"1000085","status":"","submitted":1818,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7974465995580653,"acs":22736,"articleLive":2,"columnArticles":239,"formTitle":"[LCP 17]速算机器人","frequency":1.6131342678,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"1000139","status":"","submitted":28511,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28297337505771303,"acs":16548,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":1.6451472448,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"1000146","status":"ac","submitted":58479,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5158757618502648,"acs":19383,"articleLive":2,"columnArticles":201,"formTitle":"[LCP 19]秋叶收藏集","frequency":1.5822294597,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"1000130","status":"","submitted":37573,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29651928504233305,"acs":1576,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 20]快速公交","frequency":1.0950949067,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"1000133","status":"","submitted":5315,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.31607142857142856,"acs":708,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":1.2355779478,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"1000134","status":"","submitted":2240,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3316402520527019,"acs":8684,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":2.4881149225,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"1000140","status":"ac","submitted":26185,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33174126637554585,"acs":2431,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":1.0214188978,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"1000058","status":"","submitted":7328,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2662760416666667,"acs":818,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"1000131","status":"","submitted":3072,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3193637197919853,"acs":1044,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"1000138","status":"","submitted":3269,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.327027027027027,"acs":484,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"1000132","status":"","submitted":1480,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3254228041462084,"acs":1193,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":1.5377974512,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"1000147","status":"","submitted":3666,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.26490855229263266,"acs":8227,"articleLive":2,"columnArticles":146,"formTitle":"[LCP 28]采购方案","frequency":1.4356157319,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"1000215","status":"ac","submitted":31056,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1685094530722485,"acs":3993,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 29]乐团站位","frequency":2.3446205788,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"1000216","status":"ac","submitted":23696,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.33062232227144,"acs":4553,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":0.3231018337,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"1000224","status":"notac","submitted":13771,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.21919841662543296,"acs":1329,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":0.5544237084,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"1000218","status":"","submitted":6063,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3517048108360579,"acs":753,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 32]批量处理任务","frequency":1.0613762707,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"1000219","status":"","submitted":2141,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.19589215582209957,"acs":3691,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 33]蓄水","frequency":1.1702165637,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"1000221","status":"","submitted":18842,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4552447552447552,"acs":1953,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 34]二叉树染色","frequency":1.4356157319,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"1000089","status":"","submitted":4290,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.3595238095238095,"acs":906,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":1.0613762707,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"1000220","status":"","submitted":2520,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.22391469916222392,"acs":588,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":1.9080797775,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"1000222","status":"notac","submitted":2626,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.17347789824854046,"acs":624,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 37]最小矩形面积","frequency":1.6954175036,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"1000091","status":"","submitted":3597,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5156017830609212,"acs":347,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":1.4683733283,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"1000223","status":"","submitted":673,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5361377294136755,"acs":3301,"articleLive":2,"columnArticles":82,"formTitle":"[LCS 01]下载插件","frequency":1.2022637412,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"1000225","status":"","submitted":6157,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7058071117932975,"acs":2759,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 02]完成一半题目","frequency":0.819884004,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"1000226","status":"","submitted":3909,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4164622512946307,"acs":1528,"articleLive":2,"columnArticles":50,"formTitle":"[LCS 03]主题空间","frequency":0.2672681876,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"1000227","status":"","submitted":3669,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786493291660872,"acs":370871,"articleLive":2,"columnArticles":2655,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":4.6372451315,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"100275","status":"","submitted":546484,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.40315345929047164,"acs":240246,"articleLive":2,"columnArticles":1964,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":3.8171964786,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"100276","status":"","submitted":595917,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.761995460580351,"acs":258843,"articleLive":2,"columnArticles":1829,"formTitle":"[剑指 Offer 05]替换空格","frequency":3.2010734327,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"100280","status":"","submitted":339691,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523158298618724,"acs":274505,"articleLive":2,"columnArticles":1959,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":3.7238796504,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"100282","status":"ac","submitted":364880,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6953361049534162,"acs":176283,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":4.1586319062,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"100283","status":"","submitted":253522,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7176926986693121,"acs":234397,"articleLive":2,"columnArticles":1528,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":4.2613795399,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"100273","status":"ac","submitted":326598,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.34793222539892227,"acs":216497,"articleLive":2,"columnArticles":1591,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":3.7743793546,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"100274","status":"","submitted":622239,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4409389866896728,"acs":177862,"articleLive":2,"columnArticles":1240,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":3.592150175,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"100277","status":"","submitted":403371,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49369440690097893,"acs":240717,"articleLive":2,"columnArticles":1540,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":4.0085761537,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"100278","status":"","submitted":487583,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45310335373945304,"acs":155356,"articleLive":2,"columnArticles":1052,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":3.0794713366,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"100279","status":"","submitted":342871,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5245681866754746,"acs":161994,"articleLive":2,"columnArticles":1628,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":3.592150175,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"100281","status":"","submitted":308814,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5680582726970453,"acs":146926,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":3.2622545892,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"100284","status":"","submitted":258646,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31084622369490067,"acs":78051,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":1.8517902992,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"100285","status":"","submitted":251092,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7458214285714285,"acs":187947,"articleLive":2,"columnArticles":1208,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":2.5579452216,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"100292","status":"ac","submitted":252000,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3378790338050198,"acs":114492,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":1.6397315803,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"100295","status":"","submitted":338855,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773936767598187,"acs":141900,"articleLive":2,"columnArticles":1083,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":3.0971767897,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"100296","status":"","submitted":182533,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5946945315602788,"acs":173696,"articleLive":2,"columnArticles":1390,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":2.8280456466,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"100299","status":"ac","submitted":292076,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37405499109163576,"acs":62144,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":2.7327508293,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"100297","status":"","submitted":166136,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23873513571161947,"acs":71632,"articleLive":2,"columnArticles":796,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":3.5268608792,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"100290","status":"","submitted":300048,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6422539502894703,"acs":177054,"articleLive":2,"columnArticles":1514,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":2.6297193818,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"100291","status":"","submitted":275676,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7895691525863828,"acs":212856,"articleLive":2,"columnArticles":2068,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":4.1396173445,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"100294","status":"ac","submitted":269585,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7425472209644871,"acs":265673,"articleLive":2,"columnArticles":1733,"formTitle":"[剑指 Offer 24]反转链表","frequency":4.6427121998,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"100298","status":"ac","submitted":357786,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7288164828246414,"acs":169014,"articleLive":2,"columnArticles":1110,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":3.7295182621,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"100286","status":"","submitted":231902,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4653280146240886,"acs":131350,"articleLive":2,"columnArticles":1103,"formTitle":"[剑指 Offer 26]树的子结构","frequency":3.2327312782,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"100287","status":"","submitted":282274,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7905817623513627,"acs":175589,"articleLive":2,"columnArticles":1319,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":3.1080855921,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"100288","status":"","submitted":222101,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5797794086382693,"acs":136356,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":2.2993967396,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"100289","status":"","submitted":235186,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43965871877014373,"acs":135731,"articleLive":2,"columnArticles":1407,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":3.8467264893,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"100293","status":"","submitted":308719,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5743220535541008,"acs":121333,"articleLive":2,"columnArticles":824,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":2.6332749411,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"100302","status":"ac","submitted":211263,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6135105924320365,"acs":103879,"articleLive":2,"columnArticles":866,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":1.8865643176,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"100306","status":"","submitted":169319,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6462946776717627,"acs":123483,"articleLive":2,"columnArticles":882,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":3.0563998435,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100311","status":"","submitted":191063,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6862345052715162,"acs":124450,"articleLive":2,"columnArticles":1011,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":2.6958240618,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100312","status":"","submitted":181352,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887279534929549,"acs":107550,"articleLive":2,"columnArticles":1052,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":2.6732802757,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"100314","status":"","submitted":182682,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.548592733231861,"acs":103441,"articleLive":2,"columnArticles":886,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":2.99627902,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"100315","status":"","submitted":188557,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5776214577793028,"acs":121200,"articleLive":2,"columnArticles":802,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":3.176231843,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"100317","status":"","submitted":209826,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7219417180668467,"acs":104522,"articleLive":2,"columnArticles":756,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":2.7888822854,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"100300","status":"ac","submitted":144779,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6537147143809735,"acs":94114,"articleLive":2,"columnArticles":836,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":3.3565751598,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"100305","status":"","submitted":143968,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5585301474763286,"acs":72791,"articleLive":2,"columnArticles":538,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":3.3565751598,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"100307","status":"ac","submitted":130326,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5795602365840719,"acs":147472,"articleLive":2,"columnArticles":1062,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":4.5256108999,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"100308","status":"ac","submitted":254455,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6889278116140104,"acs":155759,"articleLive":2,"columnArticles":970,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":2.9439606725,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"100310","status":"ac","submitted":226089,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5690263484399048,"acs":228855,"articleLive":2,"columnArticles":1725,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":3.6974622548,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"100301","status":"","submitted":402187,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5790921454939616,"acs":56630,"articleLive":2,"columnArticles":422,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":2.166685224,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"100303","status":"","submitted":97791,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.605438620980508,"acs":203853,"articleLive":2,"columnArticles":1456,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":4.4350009408,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"100304","status":"ac","submitted":336703,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4816533461824505,"acs":45982,"articleLive":2,"columnArticles":480,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":2.5425460877,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"100309","status":"","submitted":95467,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4129169169169169,"acs":51563,"articleLive":2,"columnArticles":432,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":2.3383249146,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"100313","status":"","submitted":124875,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.561787187400848,"acs":97383,"articleLive":2,"columnArticles":739,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":3.3308601918,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"100323","status":"","submitted":173345,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5393404649807305,"acs":107339,"articleLive":2,"columnArticles":1348,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":3.4166172008,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"100325","status":"","submitted":199019,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6889432377698842,"acs":106481,"articleLive":2,"columnArticles":906,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":2.7459867059,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"100327","status":"","submitted":154557,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4643588000368967,"acs":135922,"articleLive":2,"columnArticles":940,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":3.4760774016,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"100332","status":"","submitted":292709,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6512231580300887,"acs":81033,"articleLive":2,"columnArticles":486,"formTitle":"[剑指 Offer 49]丑数","frequency":3.0999932963,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"100334","status":"","submitted":124432,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140229771707509,"acs":136983,"articleLive":2,"columnArticles":974,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":3.1491621953,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"100316","status":"","submitted":223091,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48067749068424714,"acs":93909,"articleLive":2,"columnArticles":801,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":4.3712222187,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"100318","status":"","submitted":195368,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6467871534203338,"acs":161473,"articleLive":2,"columnArticles":1002,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":3.3308601918,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"100326","status":"ac","submitted":249654,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5404417307402382,"acs":172068,"articleLive":2,"columnArticles":1488,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":2.8401108842,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100329","status":"ac","submitted":318384,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44752399663869524,"acs":151247,"articleLive":2,"columnArticles":1372,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":2.8189920868,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100331","status":"","submitted":337964,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7543053611635124,"acs":148746,"articleLive":2,"columnArticles":1071,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":2.3249735814,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"100333","status":"","submitted":197196,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888386629788172,"acs":164562,"articleLive":2,"columnArticles":1205,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":3.0563998435,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100319","status":"","submitted":208613,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5862625697020601,"acs":125639,"articleLive":2,"columnArticles":875,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":2.514215581,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100342","status":"","submitted":214305,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6999049149152431,"acs":106732,"articleLive":2,"columnArticles":971,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":3.0810391651,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"100320","status":"","submitted":152495,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.799326540683329,"acs":82608,"articleLive":2,"columnArticles":655,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":2.3383249146,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100321","status":"","submitted":103347,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6623974907700853,"acs":121644,"articleLive":2,"columnArticles":771,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":3.087730727,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"100322","status":"","submitted":183642,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7059309909645272,"acs":129772,"articleLive":2,"columnArticles":1792,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":3.1286151356,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100324","status":"","submitted":183831,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4407746245749195,"acs":117172,"articleLive":2,"columnArticles":887,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":2.7812365985,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100328","status":"","submitted":265832,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8562767722229667,"acs":185306,"articleLive":2,"columnArticles":1682,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":2.7487878282,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100330","status":"","submitted":216409,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44411744426985617,"acs":122385,"articleLive":2,"columnArticles":1130,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":3.6488435871,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"100336","status":"","submitted":275569,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4741810792066965,"acs":88201,"articleLive":2,"columnArticles":1031,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":2.4681244738,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"100337","status":"ac","submitted":186007,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5587219664339819,"acs":60190,"articleLive":2,"columnArticles":544,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":2.8924945488,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"100339","status":"","submitted":107728,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.46024271868874045,"acs":92269,"articleLive":2,"columnArticles":891,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":3.199216077,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"100341","status":"","submitted":200479,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6547159582295311,"acs":101443,"articleLive":2,"columnArticles":717,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":3.56599657,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"100343","status":"","submitted":154942,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6339754053759931,"acs":116512,"articleLive":2,"columnArticles":888,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":3.087730727,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"100344","status":"","submitted":183780,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.856615314755828,"acs":128279,"articleLive":2,"columnArticles":1236,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":2.7586563293,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"100345","status":"","submitted":149751,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5812594929314172,"acs":64675,"articleLive":2,"columnArticles":456,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":2.1282632872,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"100335","status":"","submitted":111267,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.597386798828565,"acs":66295,"articleLive":2,"columnArticles":470,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":2.6981077674,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"100338","status":"","submitted":110975,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28444903009025707,"acs":62306,"articleLive":2,"columnArticles":521,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":2.5331914825,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"100340","status":"","submitted":219041,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930217011210532,"acs":107812,"articleLive":2,"columnArticles":634,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":2.1932043038,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"100346","status":"","submitted":155568,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6990364583333334,"acs":107372,"articleLive":2,"columnArticles":639,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":2.9430001315,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"100347","status":"","submitted":153600,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2146492586855499,"acs":2910,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 001]整数除法","frequency":0.4169793485,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"1000228","status":"","submitted":13557,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5951873935264055,"acs":2795,"articleLive":2,"columnArticles":68,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"1000231","status":"","submitted":4696,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.793369663941871,"acs":3494,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":0.3529369822,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"1000230","status":"","submitted":4404,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6998664886515353,"acs":2621,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"1000233","status":"","submitted":3745,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7237460815047022,"acs":1847,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"1000236","status":"","submitted":2552,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6797093348239239,"acs":2432,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"1000237","status":"","submitted":3578,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4840204928031227,"acs":1984,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"1000239","status":"","submitted":4099,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5285234899328859,"acs":1890,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"1000242","status":"","submitted":3576,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5669910179640718,"acs":1515,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"1000244","status":"","submitted":2672,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4399890889252591,"acs":1613,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"1000246","status":"","submitted":3666,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5800385728061717,"acs":1203,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"1000247","status":"","submitted":2074,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6725197541703248,"acs":1532,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":0.4169793485,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"1000248","status":"","submitted":2278,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.672082717872969,"acs":910,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"1000249","status":"","submitted":1354,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.526685393258427,"acs":1125,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"1000250","status":"","submitted":2136,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6511111111111111,"acs":879,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"1000251","status":"","submitted":1350,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5062225475841874,"acs":1383,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"1000252","status":"","submitted":2732,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5509293680297398,"acs":741,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"1000253","status":"","submitted":1345,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5532173209227034,"acs":1367,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"1000254","status":"","submitted":2471,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.49303996407723394,"acs":1098,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":1.0613762707,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"1000255","status":"","submitted":2227,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.6958867161159811,"acs":1032,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"1000256","status":"","submitted":1483,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5318227257580806,"acs":1596,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"1000257","status":"","submitted":3001,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5243706480985538,"acs":1958,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":0.3841895257,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"1000258","status":"","submitted":3734,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7072434607645876,"acs":1406,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":0.3841895257,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"1000259","status":"","submitted":1988,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7789256198347108,"acs":3770,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 024]反转链表","frequency":0.9496149277,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"1000260","status":"","submitted":4840,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6099125364431487,"acs":1046,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":1.0613762707,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"1000261","status":"","submitted":1715,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6827242524916943,"acs":1233,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 026]重排链表","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"1000262","status":"","submitted":1806,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6439739413680782,"acs":1977,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"1000263","status":"","submitted":3070,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.5880239520958084,"acs":491,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"1000264","status":"","submitted":835,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30559916274201987,"acs":584,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"1000265","status":"","submitted":1911,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.558645707376058,"acs":462,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"1000267","status":"","submitted":827,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.6065292096219931,"acs":706,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"1000270","status":"","submitted":1164,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5988973121984839,"acs":869,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"1000273","status":"","submitted":1451,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7893432465923172,"acs":637,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"1000275","status":"","submitted":807,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5614366729678639,"acs":594,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"1000276","status":"","submitted":1058,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.72400513478819,"acs":564,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"1000278","status":"","submitted":779,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5780952380952381,"acs":607,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"1000279","status":"","submitted":1050,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4767225325884544,"acs":512,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"1000281","status":"","submitted":1074,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7823639774859287,"acs":834,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"1000282","status":"","submitted":1066,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5318471337579618,"acs":501,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"1000283","status":"","submitted":942,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.555008210180624,"acs":338,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"1000284","status":"","submitted":609,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7928888888888889,"acs":892,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"1000292","status":"","submitted":1125,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.867699642431466,"acs":728,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"1000293","status":"","submitted":839,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6547884187082406,"acs":294,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"1000295","status":"","submitted":449,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6654676258992805,"acs":740,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"1000297","status":"","submitted":1112,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7842696629213484,"acs":698,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"1000298","status":"","submitted":890,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.715,"acs":715,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"1000299","status":"","submitted":1000,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7141119221411192,"acs":587,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"1000301","status":"","submitted":822,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6986754966887417,"acs":422,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"1000304","status":"","submitted":604,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7552447552447552,"acs":648,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"1000306","status":"","submitted":858,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6243980738362761,"acs":389,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"1000307","status":"","submitted":623,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4148936170212766,"acs":351,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"1000309","status":"","submitted":846,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7601990049751244,"acs":764,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":0.4169793485,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"1000311","status":"","submitted":1005,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6514563106796116,"acs":671,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"1000313","status":"","submitted":1030,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8931185944363104,"acs":610,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"1000315","status":"","submitted":683,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8883826879271071,"acs":390,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"1000316","status":"","submitted":439,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.743,"acs":743,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"1000319","status":"","submitted":1000,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.34551495016611294,"acs":208,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"1000321","status":"","submitted":602,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.584,"acs":219,"articleLive":2,"columnArticles":4,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"1000322","status":"","submitted":375,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6195652173913043,"acs":456,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"1000323","status":"","submitted":736,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6297376093294461,"acs":432,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"1000324","status":"","submitted":686,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5076252723311547,"acs":233,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"1000326","status":"","submitted":459,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7004608294930875,"acs":304,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"1000325","status":"","submitted":434,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7584905660377359,"acs":201,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"1000327","status":"","submitted":265,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6491228070175439,"acs":148,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"1000328","status":"","submitted":228,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5661016949152542,"acs":167,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"1000329","status":"","submitted":295,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6401384083044983,"acs":185,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"1000330","status":"","submitted":289,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.679324894514768,"acs":161,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"1000331","status":"","submitted":237,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5327446651949963,"acs":724,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"1000332","status":"","submitted":1359,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7294372294372294,"acs":674,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"1000333","status":"","submitted":924,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6977025392986699,"acs":577,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"1000334","status":"","submitted":827,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.4925925925925926,"acs":133,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"1000335","status":"","submitted":270,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.43931535269709543,"acs":847,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"1000336","status":"","submitted":1928,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5511265164644714,"acs":318,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"1000337","status":"","submitted":577,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.53125,"acs":527,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 074]合并区间","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"1000338","status":"","submitted":992,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7296296296296296,"acs":591,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"1000339","status":"","submitted":810,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6616586538461539,"acs":1101,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"1000340","status":"","submitted":1664,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5292414591777649,"acs":914,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"1000341","status":"","submitted":1727,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6330275229357798,"acs":690,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"1000342","status":"","submitted":1090,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8721461187214612,"acs":764,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"1000343","status":"","submitted":876,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7476635514018691,"acs":480,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"1000344","status":"","submitted":642,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7995245641838352,"acs":1009,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"1000229","status":"","submitted":1262,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6514445479962722,"acs":699,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":0.4169793485,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"1000232","status":"","submitted":1073,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8759964570416298,"acs":989,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":0.5207050724,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"1000234","status":"","submitted":1129,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6996966632962589,"acs":692,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"1000235","status":"","submitted":989,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8673076923076923,"acs":902,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":0.4169793485,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"1000238","status":"","submitted":1040,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7450142450142451,"acs":523,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"1000240","status":"","submitted":702,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6166281755196305,"acs":534,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"1000241","status":"","submitted":866,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7362908194701171,"acs":1195,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"1000243","status":"","submitted":1623,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6116910229645094,"acs":586,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"1000245","status":"","submitted":958,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5182608695652174,"acs":298,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"1000266","status":"","submitted":575,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7544169611307421,"acs":427,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"1000268","status":"","submitted":566,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6391129032258065,"acs":317,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"1000269","status":"","submitted":496,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5331905781584583,"acs":249,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"1000271","status":"","submitted":467,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6138328530259366,"acs":213,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"1000272","status":"","submitted":347,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6929990539262062,"acs":1465,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":1.6954175036,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"1000274","status":"","submitted":2114,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5247058823529411,"acs":223,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"1000277","status":"","submitted":425,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5169230769230769,"acs":168,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"1000280","status":"","submitted":325,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7290322580645161,"acs":452,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"1000345","status":"","submitted":620,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6644612476370511,"acs":703,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":1.0214188978,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"1000285","status":"","submitted":1058,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7698412698412699,"acs":388,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"1000286","status":"","submitted":504,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.46422628951747086,"acs":558,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"1000287","status":"","submitted":1202,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.563894523326572,"acs":278,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"1000288","status":"","submitted":493,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5096227867590454,"acs":662,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"1000289","status":"","submitted":1299,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5464135021097046,"acs":259,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"1000290","status":"","submitted":474,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.691699604743083,"acs":875,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":0.4506979845,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"1000291","status":"","submitted":1265,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5778443113772455,"acs":193,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"1000294","status":"","submitted":334,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.532394366197183,"acs":189,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"1000296","status":"","submitted":355,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5245901639344263,"acs":96,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"1000300","status":"","submitted":183,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5327868852459017,"acs":195,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"1000302","status":"","submitted":366,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8406708595387841,"acs":401,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"1000303","status":"","submitted":477,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7034482758620689,"acs":102,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"1000305","status":"","submitted":145,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5817120622568094,"acs":299,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"1000308","status":"","submitted":514,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6533333333333333,"acs":294,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":1.0613762707,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"1000310","status":"","submitted":450,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.40082644628099173,"acs":97,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"1000312","status":"","submitted":242,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2480252764612954,"acs":157,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"1000314","status":"","submitted":633,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6341743119266054,"acs":1106,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"1000346","status":"","submitted":1744,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.5875,"acs":141,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"1000317","status":"","submitted":240,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6713286713286714,"acs":192,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"1000318","status":"","submitted":286,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4658018867924528,"acs":790,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":0.4869864364,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"1000320","status":"","submitted":1696,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7214565047362475,"acs":83018,"articleLive":2,"columnArticles":1465,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":3.6946373623,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"100158","status":"","submitted":115070,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6509265379060488,"acs":53182,"articleLive":2,"columnArticles":1037,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":2.3074599989,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"100159","status":"","submitted":81702,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5800159462383963,"acs":40738,"articleLive":2,"columnArticles":445,"formTitle":"[面试题 01.03]URL化","frequency":1.8714992541,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"100160","status":"","submitted":70236,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5512361291831752,"acs":37704,"articleLive":2,"columnArticles":735,"formTitle":"[面试题 01.04]回文排列","frequency":2.1754418474,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"100184","status":"","submitted":68399,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33372562952435936,"acs":30058,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 01.05]一次编辑","frequency":2.0833522823,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000006","status":"","submitted":90068,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47367665652872226,"acs":69306,"articleLive":2,"columnArticles":1126,"formTitle":"[面试题 01.06]字符串压缩","frequency":3.2905663792,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"100161","status":"","submitted":146315,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7553614952172156,"acs":61673,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":2.7327508293,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"100185","status":"","submitted":81647,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6220022545825161,"acs":40279,"articleLive":2,"columnArticles":467,"formTitle":"[面试题 01.08]零矩阵","frequency":1.9018808982,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"100186","status":"","submitted":64757,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5518430461532877,"acs":30406,"articleLive":2,"columnArticles":393,"formTitle":"[面试题 01.09]字符串轮转","frequency":1.4356157319,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"100162","status":"","submitted":55099,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846442800227661,"acs":60146,"articleLive":2,"columnArticles":661,"formTitle":"[面试题 02.01]移除重复节点","frequency":2.5011532569,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"100163","status":"ac","submitted":87850,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800882638940834,"acs":62574,"articleLive":2,"columnArticles":916,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":2.7698804216,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"1000007","status":"ac","submitted":80214,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540303400002465,"acs":69302,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.03]删除中间节点","frequency":2.9405345254,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"100187","status":"ac","submitted":81147,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6577004219409283,"acs":23693,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":2.3921128842,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"1000008","status":"ac","submitted":36024,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4670668397144711,"acs":34548,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":3.6417789162,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"100188","status":"ac","submitted":73968,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4822453724990476,"acs":36709,"articleLive":2,"columnArticles":485,"formTitle":"[面试题 02.06]回文链表","frequency":1.754773301,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"100164","status":"ac","submitted":76121,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6876637411579775,"acs":41997,"articleLive":2,"columnArticles":379,"formTitle":"[面试题 02.07]链表相交","frequency":1.1095858138,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"100167","status":"ac","submitted":61072,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5302960991433087,"acs":25503,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":2.3105015488,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"100168","status":"ac","submitted":48092,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5428726581591095,"acs":9997,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"100172","status":"","submitted":18415,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6123507782199163,"acs":24314,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":2.0943789681,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"100169","status":"ac","submitted":39706,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.387639009890842,"acs":7564,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 03.03]堆盘子","frequency":1.4356157319,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"100195","status":"","submitted":19513,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7114386414610702,"acs":22204,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":1.9333017954,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"100170","status":"ac","submitted":31210,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5465072997229,"acs":13214,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 03.05]栈排序","frequency":0.7903397577,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"100173","status":"","submitted":24179,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5895320051868442,"acs":10002,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 03.06]动物收容所","frequency":1.4683733283,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"100228","status":"","submitted":16966,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5345284438483431,"acs":16340,"articleLive":2,"columnArticles":228,"formTitle":"[面试题 04.01]节点间通路","frequency":1.6783464165,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"100171","status":"","submitted":30569,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.789380910411853,"acs":33139,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 04.02]最小高度树","frequency":2.4881149225,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"100174","status":"","submitted":41981,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8059135442637918,"acs":22950,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":1.9018808982,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"100175","status":"","submitted":28477,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5832462652369169,"acs":31819,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 04.04]检查平衡性","frequency":1.1095858138,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"100176","status":"","submitted":54555,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35090590298071306,"acs":24016,"articleLive":2,"columnArticles":301,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":1.9018808982,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"100177","status":"","submitted":68440,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5910048087500392,"acs":18804,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":0.7903397577,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"100178","status":"","submitted":31817,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7168997936253153,"acs":15632,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":1.40404247,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"100179","status":"","submitted":21805,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4781257108196224,"acs":6306,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":1.2022637412,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"1000010","status":"","submitted":13189,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7178187620254353,"acs":15296,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":0.241088682,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"100229","status":"","submitted":21309,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48851201887627194,"acs":16563,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":1.40404247,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"1000009","status":"","submitted":33905,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5067306025766942,"acs":8771,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"100180","status":"","submitted":17309,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6841504045692527,"acs":7187,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":1.1702165637,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"100203","status":"","submitted":10505,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.39141763057123685,"acs":9915,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.03]翻转数位","frequency":1.8517902992,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"100230","status":"","submitted":25331,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3951696194486375,"acs":4974,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"100183","status":"","submitted":12587,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5275339955636995,"acs":10940,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 05.06]整数转换","frequency":0.2672681876,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"100181","status":"","submitted":20738,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7038993218570684,"acs":10795,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":0.7903397577,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"100182","status":"","submitted":15336,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5536466228735052,"acs":3287,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":1.1393499157,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"100196","status":"","submitted":5937,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36378768759900126,"acs":40650,"articleLive":2,"columnArticles":449,"formTitle":"[面试题 08.01]三步问题","frequency":2.2149726862,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"100197","status":"","submitted":111741,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3611494179147558,"acs":11261,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":1.754773301,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000011","status":"","submitted":31181,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6769130671482254,"acs":50979,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 08.03]魔术索引","frequency":0.2672681876,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"100240","status":"","submitted":75311,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8226314916210387,"acs":19832,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":2.0616829621,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"100198","status":"","submitted":24108,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6791431182104302,"acs":20068,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":0.241088682,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"100199","status":"","submitted":29549,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6550432191639378,"acs":22204,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":2.8639700821,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"1000015","status":"","submitted":33897,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8133333333333334,"acs":20435,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":2.0616829621,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"100241","status":"","submitted":25125,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7185021819717516,"acs":15312,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":2.0616829621,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"100348","status":"ac","submitted":21311,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8113348540863683,"acs":20629,"articleLive":2,"columnArticles":332,"formTitle":"[面试题 08.09]括号","frequency":3.0615200775,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"100200","status":"","submitted":25426,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5596450013051423,"acs":12864,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":0.7344592993,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"100201","status":"","submitted":22986,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946820412607963,"acs":33162,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 08.11]硬币","frequency":2.4374515648,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"100231","status":"","submitted":67037,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7583200116262171,"acs":15654,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 08.12]八皇后","frequency":2.4032463771,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"100233","status":"","submitted":20643,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5016603415559773,"acs":6345,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":0.8505989493,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"100202","status":"","submitted":12648,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5328621908127208,"acs":3770,"articleLive":2,"columnArticles":71,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000031","status":"ac","submitted":7075,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5536459662193193,"acs":54249,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":3.4768038344,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000012","status":"","submitted":97985,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7393777546190755,"acs":34055,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":2.9389158259,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"1000040","status":"ac","submitted":46059,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39703178355660623,"acs":12092,"articleLive":2,"columnArticles":200,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":2.8856834613,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"100232","status":"","submitted":30456,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5527212422734811,"acs":18331,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":1.1702165637,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"100242","status":"","submitted":33165,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.45624399970460083,"acs":12356,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":2.1437267157,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000016","status":"","submitted":27082,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6302545885139136,"acs":4258,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.3231018337,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"1000041","status":"","submitted":6756,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6664494507540495,"acs":7159,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":1.9333017954,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000013","status":"","submitted":10742,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8325620959510037,"acs":24469,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 16.01]交换数字","frequency":1.4683733283,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"100258","status":"","submitted":29390,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7654505251520177,"acs":13847,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":0.2672681876,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"100259","status":"","submitted":18090,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4432222430256506,"acs":9469,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":0.3529369822,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"100260","status":"","submitted":21364,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4612909712447215,"acs":6882,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"100261","status":"","submitted":14919,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4640528793915248,"acs":10250,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":1.4356157319,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"1000017","status":"","submitted":22088,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4238827062356474,"acs":11998,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":1.6451472448,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"100262","status":"","submitted":28305,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7337842592954608,"acs":18768,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":1.965832545,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"100349","status":"","submitted":25577,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.377023768515329,"acs":2189,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.3529369822,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"1000018","status":"","submitted":5806,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5469700979094999,"acs":2067,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"100350","status":"","submitted":3779,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6849488896721889,"acs":9716,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.10]生存人数","frequency":1.1702165637,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"100351","status":"","submitted":14185,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4411258921331896,"acs":49508,"articleLive":2,"columnArticles":571,"formTitle":"[面试题 16.11]跳水板","frequency":1.1393499157,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"100352","status":"","submitted":112231,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4322916666666667,"acs":1826,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"100353","status":"","submitted":4224,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5493255322606858,"acs":3380,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"100354","status":"","submitted":6153,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5025765562992359,"acs":8485,"articleLive":2,"columnArticles":210,"formTitle":"[面试题 16.15]珠玑妙算","frequency":0.2672681876,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"100355","status":"","submitted":16883,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45084495277260167,"acs":14033,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.16]部分排序","frequency":1.9333017954,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"100356","status":"","submitted":31126,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6013056572469387,"acs":33343,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":2.0943789681,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"1000003","status":"","submitted":55451,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443092340730136,"acs":14911,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 16.18]模式匹配","frequency":1.4683733283,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000004","status":"","submitted":43307,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6089197039257941,"acs":19497,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 16.19]水域大小","frequency":2.4550267096,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"1000005","status":"","submitted":32019,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7198901193235471,"acs":8386,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.20]T9键盘","frequency":1.4356157319,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"1000047","status":"","submitted":11649,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.4649674902470741,"acs":8939,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.21]交换和","frequency":0.2672681876,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"1000048","status":"","submitted":19225,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5816122584943371,"acs":2619,"articleLive":2,"columnArticles":54,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":0.3529369822,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000050","status":"","submitted":4503,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47026977427050837,"acs":10250,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.24]数对和","frequency":1.1393499157,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"1000042","status":"","submitted":21796,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.543562412342216,"acs":29067,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":4.2321104725,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"1000026","status":"","submitted":53475,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38636884963872004,"acs":13475,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 16.26]计算器","frequency":2.9055325432,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"1000027","status":"","submitted":34876,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5989401111339782,"acs":11641,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":1.1702165637,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"1000025","status":"","submitted":19436,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6457008705859337,"acs":26404,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":1.965832545,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"1000032","status":"","submitted":40892,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.3858409739966932,"acs":5134,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":0.882570982,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"1000033","status":"","submitted":13306,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4472137791286728,"acs":4414,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.2672681876,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"1000034","status":"","submitted":9870,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4116948061593306,"acs":8315,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 17.07]婴儿名字","frequency":1.6783464165,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"1000035","status":"","submitted":20197,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2717071501881628,"acs":7942,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 17.08]马戏团人塔","frequency":1.8865643176,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"1000036","status":"","submitted":29230,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5493839878033706,"acs":13333,"articleLive":2,"columnArticles":134,"formTitle":"[面试题 17.09]第 k 个数","frequency":2.6388889909,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"1000037","status":"","submitted":24269,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713579604578564,"acs":65889,"articleLive":2,"columnArticles":911,"formTitle":"[面试题 17.10]主要元素","frequency":2.923751,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"1000038","status":"ac","submitted":115320,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6863228478453801,"acs":13920,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 17.11]单词距离","frequency":1.6783464165,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"1000039","status":"","submitted":20282,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6315589112365967,"acs":19908,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":0.819884004,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"1000019","status":"","submitted":31522,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530157422661541,"acs":24169,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 17.13]恢复空格","frequency":1.4356157319,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"1000020","status":"","submitted":43704,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.54734159312895,"acs":37153,"articleLive":2,"columnArticles":416,"formTitle":"[面试题 17.14]最小K个数","frequency":3.5047308099,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"1000021","status":"","submitted":67879,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40307600861876813,"acs":5425,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.15]最长单词","frequency":1.4683733283,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"1000022","status":"","submitted":13459,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195130276481966,"acs":59358,"articleLive":2,"columnArticles":1119,"formTitle":"[面试题 17.16]按摩师","frequency":2.6732802757,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"1000023","status":"","submitted":114257,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44231570179092045,"acs":7434,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":0.819884004,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"1000024","status":"","submitted":16807,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4468336174118264,"acs":6816,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.18]最短超串","frequency":0.8505989493,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"1000043","status":"","submitted":15254,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5818220459053556,"acs":8213,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":1.5822294597,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"1000044","status":"","submitted":14116,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5684340320591862,"acs":3688,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":0.819884004,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"1000028","status":"","submitted":6488,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6350873604861801,"acs":43473,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":4.1757223491,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"1000029","status":"","submitted":68452,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3708066466609934,"acs":8279,"articleLive":2,"columnArticles":148,"formTitle":"[面试题 17.22]单词转换","frequency":1.9333017954,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"1000030","status":"","submitted":22327,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3799765279407782,"acs":4209,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":0.3529369822,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"1000045","status":"","submitted":11077,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.514022233451238,"acs":8138,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.24]最大子矩阵","frequency":2.9734886079,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"1000046","status":"","submitted":15832,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.4933481152993348,"acs":1335,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":1.3064040004,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"1000049","status":"","submitted":2706,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3402550859070307,"acs":3228,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":0.882570982,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"1000051","status":"","submitted":9487,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file +[{"acceptance":0.7519643580396922,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[797]所有可能的路径","frequency":23.91757750582751,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","questionId":"797","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.5187848415948348,"acs":0,"articleLive":2,"columnArticles":13770,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","questionId":"1","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.407380278672412,"acs":0,"articleLive":2,"columnArticles":6862,"formTitle":"[2]两数相加","frequency":99.27537460455528,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","questionId":"2","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37843444338086746,"acs":0,"articleLive":2,"columnArticles":7048,"formTitle":"[3]无重复字符的最长子串","frequency":97.82612381366587,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","questionId":"3","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4069059501573628,"acs":0,"articleLive":2,"columnArticles":3599,"formTitle":"[4]寻找两个正序数组的中位数","frequency":94.45497194012434,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","questionId":"4","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35198903661868586,"acs":0,"articleLive":2,"columnArticles":3793,"formTitle":"[5]最长回文子串","frequency":95.31082685458541,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","questionId":"5","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5059526096813747,"acs":0,"articleLive":2,"columnArticles":2337,"formTitle":"[6]Z 字形变换","frequency":76.0625114834956,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","questionId":"6","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3538473445163345,"acs":0,"articleLive":2,"columnArticles":5063,"formTitle":"[7]整数反转","frequency":98.55074920911059,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","questionId":"7","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2167813786095683,"acs":0,"articleLive":2,"columnArticles":2587,"formTitle":"[8]字符串转换整数 (atoi)","frequency":75.48332823272096,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","questionId":"8","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5854999817406119,"acs":0,"articleLive":2,"columnArticles":4732,"formTitle":"[9]回文数","frequency":79.7032004075649,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","questionId":"9","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3163453844475158,"acs":0,"articleLive":2,"columnArticles":1192,"formTitle":"[10]正则表达式匹配","frequency":86.82222307411082,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","questionId":"10","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6322487235205668,"acs":0,"articleLive":2,"columnArticles":2884,"formTitle":"[11]盛最多水的容器","frequency":85.6420112689735,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","questionId":"11","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6656549104886752,"acs":0,"articleLive":2,"columnArticles":1707,"formTitle":"[12]整数转罗马数字","frequency":75.46246908050799,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","questionId":"12","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6330723987404978,"acs":0,"articleLive":2,"columnArticles":3734,"formTitle":"[13]罗马数字转整数","frequency":82.19452397328315,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","questionId":"13","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.40629935447587506,"acs":0,"articleLive":2,"columnArticles":3718,"formTitle":"[14]最长公共前缀","frequency":90.35558987216743,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","questionId":"14","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33230475125178277,"acs":0,"articleLive":2,"columnArticles":2904,"formTitle":"[15]三数之和","frequency":93.35151792056973,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","questionId":"15","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45976728242945286,"acs":0,"articleLive":2,"columnArticles":1362,"formTitle":"[16]最接近的三数之和","frequency":85.16328265107386,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","questionId":"16","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5714140616786558,"acs":0,"articleLive":2,"columnArticles":2906,"formTitle":"[17]电话号码的字母组合","frequency":78.72885596002745,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","questionId":"17","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40220397794874346,"acs":0,"articleLive":2,"columnArticles":1445,"formTitle":"[18]四数之和","frequency":69.42519111018896,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","questionId":"18","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42735127195032385,"acs":0,"articleLive":2,"columnArticles":3607,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":76.51168520572526,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","questionId":"19","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44458792088253596,"acs":0,"articleLive":2,"columnArticles":5306,"formTitle":"[20]有效的括号","frequency":93.9084678564217,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","questionId":"20","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6662585050188031,"acs":0,"articleLive":2,"columnArticles":3273,"formTitle":"[21]合并两个有序链表","frequency":84.85598432508887,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","questionId":"21","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725558714827081,"acs":0,"articleLive":2,"columnArticles":2503,"formTitle":"[22]括号生成","frequency":91.08124489562083,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","questionId":"22","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5582933273043199,"acs":0,"articleLive":2,"columnArticles":2001,"formTitle":"[23]合并K个升序链表","frequency":83.07898566696191,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","questionId":"23","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7022001525738649,"acs":0,"articleLive":2,"columnArticles":2405,"formTitle":"[24]两两交换链表中的节点","frequency":60.803067072500326,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","questionId":"24","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6562103570653454,"acs":0,"articleLive":2,"columnArticles":2058,"formTitle":"[25]K 个一组翻转链表","frequency":91.61431276733094,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","questionId":"25","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5403567057177828,"acs":0,"articleLive":2,"columnArticles":4323,"formTitle":"[26]删除有序数组中的重复项","frequency":80.54706667437614,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","questionId":"26","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5982770519377262,"acs":0,"articleLive":2,"columnArticles":3881,"formTitle":"[27]移除元素","frequency":74.4075905088205,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","questionId":"27","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40716545555666994,"acs":0,"articleLive":2,"columnArticles":3114,"formTitle":"[28]实现 strStr()","frequency":75.70109549731009,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","questionId":"28","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20729348380742166,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[29]两数相除","frequency":67.97910969371559,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","questionId":"29","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3554285768077606,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[30]串联所有单词的子串","frequency":59.51766998620225,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","questionId":"30","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37317291475574754,"acs":0,"articleLive":2,"columnArticles":1650,"formTitle":"[31]下一个排列","frequency":80.74779641212125,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","questionId":"31","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3551481661547948,"acs":0,"articleLive":2,"columnArticles":1248,"formTitle":"[32]最长有效括号","frequency":77.15915189795676,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","questionId":"32","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4252601561683513,"acs":0,"articleLive":2,"columnArticles":2278,"formTitle":"[33]搜索旋转排序数组","frequency":76.74227636109077,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","questionId":"33","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42478154397891044,"acs":0,"articleLive":2,"columnArticles":3072,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":70.00521894915825,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","questionId":"34","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.46681202177736963,"acs":0,"articleLive":2,"columnArticles":3696,"formTitle":"[35]搜索插入位置","frequency":72.4320303885159,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","questionId":"35","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6282899050259446,"acs":0,"articleLive":2,"columnArticles":1093,"formTitle":"[36]有效的数独","frequency":54.79936507884424,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","questionId":"36","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6705329087496573,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[37]解数独","frequency":65.58059903712025,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","questionId":"37","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5793237196802837,"acs":0,"articleLive":2,"columnArticles":2200,"formTitle":"[38]外观数列","frequency":64.09040638118935,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","questionId":"38","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7265858682279563,"acs":0,"articleLive":2,"columnArticles":1846,"formTitle":"[39]组合总和","frequency":72.4320303885159,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","questionId":"39","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6287587497123724,"acs":0,"articleLive":2,"columnArticles":1317,"formTitle":"[40]组合总和 II","frequency":70.55445737001378,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","questionId":"40","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41826071769242135,"acs":0,"articleLive":2,"columnArticles":1367,"formTitle":"[41]缺失的第一个正数","frequency":86.75659206245004,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","questionId":"41","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5736657000295291,"acs":0,"articleLive":2,"columnArticles":2325,"formTitle":"[42]接雨水","frequency":96.22726626216169,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","questionId":"42","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4487273776847738,"acs":0,"articleLive":2,"columnArticles":1085,"formTitle":"[43]字符串相乘","frequency":80.98934479000658,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","questionId":"43","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.327835093255654,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[44]通配符匹配","frequency":64.74217635325316,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","questionId":"44","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.42417039369635307,"acs":0,"articleLive":2,"columnArticles":1484,"formTitle":"[45]跳跃游戏 II","frequency":97.10149841822118,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","questionId":"45","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7821678766024368,"acs":0,"articleLive":2,"columnArticles":2536,"formTitle":"[46]全排列","frequency":94.79097062069026,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","questionId":"46","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6357641374655847,"acs":0,"articleLive":2,"columnArticles":1409,"formTitle":"[47]全排列 II","frequency":71.06174117311869,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","questionId":"47","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7348762772374738,"acs":0,"articleLive":2,"columnArticles":1782,"formTitle":"[48]旋转图像","frequency":72.27160548914449,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","questionId":"48","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6635915532905206,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[49]字母异位词分组","frequency":70.00521894915825,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","questionId":"49","status":"not_started","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767138918975704,"acs":0,"articleLive":2,"columnArticles":1234,"formTitle":"[50]Pow(x, n)","frequency":66.36515276244326,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","questionId":"50","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7388564760793466,"acs":0,"articleLive":2,"columnArticles":1472,"formTitle":"[51]N 皇后","frequency":66.68709712530368,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","questionId":"51","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8236563607196852,"acs":0,"articleLive":2,"columnArticles":585,"formTitle":"[52]N皇后 II","frequency":28.76189960150114,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","questionId":"52","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5505336003669378,"acs":0,"articleLive":2,"columnArticles":3557,"formTitle":"[53]最大子序和","frequency":77.6865242274927,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","questionId":"53","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47866481031393837,"acs":0,"articleLive":2,"columnArticles":1909,"formTitle":"[54]螺旋矩阵","frequency":87.93634394104973,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","questionId":"54","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43178000561357044,"acs":0,"articleLive":2,"columnArticles":2330,"formTitle":"[55]跳跃游戏","frequency":74.52064427599464,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","questionId":"55","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4657766598204602,"acs":0,"articleLive":2,"columnArticles":2190,"formTitle":"[56]合并区间","frequency":86.15139036261178,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","questionId":"56","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4104633530739557,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[57]插入区间","frequency":39.43127145300367,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","questionId":"57","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3519290392108099,"acs":0,"articleLive":2,"columnArticles":2292,"formTitle":"[58]最后一个单词的长度","frequency":54.245525973905714,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","questionId":"58","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.793389254378671,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[59]螺旋矩阵 II","frequency":75.7846671544822,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","questionId":"59","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5233402427481099,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[60]排列序列","frequency":36.06283381830449,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","questionId":"60","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4182870769788915,"acs":0,"articleLive":2,"columnArticles":1923,"formTitle":"[61]旋转链表","frequency":72.91232207610355,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","questionId":"61","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.659543212976894,"acs":0,"articleLive":2,"columnArticles":2310,"formTitle":"[62]不同路径","frequency":66.44035804816465,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","questionId":"62","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3894722952744083,"acs":0,"articleLive":2,"columnArticles":1623,"formTitle":"[63]不同路径 II","frequency":70.00521894915825,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","questionId":"63","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.687690698752574,"acs":0,"articleLive":2,"columnArticles":1990,"formTitle":"[64]最小路径和","frequency":72.29685215147019,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","questionId":"64","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26891923443028276,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[65]有效数字","frequency":46.122200192639085,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","questionId":"65","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4584906152994186,"acs":0,"articleLive":2,"columnArticles":3039,"formTitle":"[66]加一","frequency":63.528150561171046,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","questionId":"66","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5441909777239258,"acs":0,"articleLive":2,"columnArticles":1716,"formTitle":"[67]二进制求和","frequency":57.471948549896126,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","questionId":"67","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47032934790581676,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[68]文本左右对齐","frequency":43.5241561647619,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","questionId":"68","status":"not_started","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3929273274460653,"acs":0,"articleLive":2,"columnArticles":1847,"formTitle":"[69]x 的平方根","frequency":78.22246111332517,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","questionId":"69","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5274894497985223,"acs":0,"articleLive":2,"columnArticles":3386,"formTitle":"[70]爬楼梯","frequency":91.737947975524,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","questionId":"70","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42139720670651754,"acs":0,"articleLive":2,"columnArticles":795,"formTitle":"[71]简化路径","frequency":53.852181541011866,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","questionId":"71","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6124589406022914,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[72]编辑距离","frequency":93.28715427962405,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","questionId":"72","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6008547378339271,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[73]矩阵置零","frequency":53.39495384347113,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","questionId":"73","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4578831160659639,"acs":0,"articleLive":2,"columnArticles":1614,"formTitle":"[74]搜索二维矩阵","frequency":75.12747722365302,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","questionId":"74","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5938567596099813,"acs":0,"articleLive":2,"columnArticles":1764,"formTitle":"[75]颜色分类","frequency":46.686094850381835,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","questionId":"75","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4231982132389496,"acs":0,"articleLive":2,"columnArticles":1184,"formTitle":"[76]最小覆盖子串","frequency":83.22907224061521,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","questionId":"76","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.769971716437407,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[77]组合","frequency":70.45786903127292,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","questionId":"77","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8004022244477556,"acs":0,"articleLive":2,"columnArticles":1942,"formTitle":"[78]子集","frequency":77.83288409968553,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","questionId":"78","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45693220996473854,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[79]单词搜索","frequency":72.37608745754561,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","questionId":"79","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6159165237720735,"acs":0,"articleLive":2,"columnArticles":1290,"formTitle":"[80]删除有序数组中的重复项 II","frequency":66.62470999380436,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","questionId":"80","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41628533162197606,"acs":0,"articleLive":2,"columnArticles":956,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.23476254543085,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","questionId":"81","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5286279762185478,"acs":0,"articleLive":2,"columnArticles":1612,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":78.95991115288668,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","questionId":"82","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386323475957576,"acs":0,"articleLive":2,"columnArticles":1844,"formTitle":"[83]删除排序链表中的重复元素","frequency":70.00521894915825,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","questionId":"83","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4325238050156209,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[84]柱状图中最大的矩形","frequency":80.41744859103606,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","questionId":"84","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5162779533097389,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[85]最大矩形","frequency":59.72329153579145,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","questionId":"85","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.632010462803196,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[86]分隔链表","frequency":58.06409306443064,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","questionId":"86","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4893399427292634,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":70.00521894915825,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","questionId":"87","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.51494096173646,"acs":0,"articleLive":2,"columnArticles":3054,"formTitle":"[88]合并两个有序数组","frequency":94.42394401262459,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","questionId":"88","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7091106318033324,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[89]格雷编码","frequency":46.122200192639085,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","questionId":"89","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338216101447299,"acs":0,"articleLive":2,"columnArticles":1154,"formTitle":"[90]子集 II","frequency":75.11457479868268,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","questionId":"90","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3042588571394514,"acs":0,"articleLive":2,"columnArticles":1455,"formTitle":"[91]解码方法","frequency":66.56816016061238,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","questionId":"91","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5469064688574862,"acs":0,"articleLive":2,"columnArticles":1937,"formTitle":"[92]反转链表 II","frequency":90.73657761454184,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","questionId":"92","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5369234930796628,"acs":0,"articleLive":2,"columnArticles":1256,"formTitle":"[93]复原 IP 地址","frequency":82.66224467145838,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","questionId":"93","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7560297472803781,"acs":0,"articleLive":2,"columnArticles":2172,"formTitle":"[94]二叉树的中序遍历","frequency":62.277733795345135,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","questionId":"94","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6986961657940408,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[95]不同的二叉搜索树 II","frequency":59.95302759473573,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","questionId":"95","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993331160873696,"acs":0,"articleLive":2,"columnArticles":1220,"formTitle":"[96]不同的二叉搜索树","frequency":69.50904918015333,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","questionId":"96","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45726095959959384,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[97]交错字符串","frequency":44.77985081966752,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","questionId":"97","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34824986089703824,"acs":0,"articleLive":2,"columnArticles":1831,"formTitle":"[98]验证二叉搜索树","frequency":72.06717861046157,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","questionId":"98","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6156272704698665,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[99]恢复二叉搜索树","frequency":55.793744236538515,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","questionId":"99","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6040001934674198,"acs":0,"articleLive":2,"columnArticles":1799,"formTitle":"[100]相同的树","frequency":55.35531210096699,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","questionId":"100","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5605373183576536,"acs":0,"articleLive":2,"columnArticles":2145,"formTitle":"[101]对称二叉树","frequency":73.33635072783834,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","questionId":"101","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421861098252069,"acs":0,"articleLive":2,"columnArticles":2376,"formTitle":"[102]二叉树的层序遍历","frequency":87.21171854560504,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","questionId":"102","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5718384332586045,"acs":0,"articleLive":2,"columnArticles":1521,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":80.09269587905911,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","questionId":"103","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7657383229518159,"acs":0,"articleLive":2,"columnArticles":2424,"formTitle":"[104]二叉树的最大深度","frequency":75.0585716135269,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","questionId":"104","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7033522953882323,"acs":0,"articleLive":2,"columnArticles":1362,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.01723693811311,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","questionId":"105","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.721131405812235,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":68.40042964438481,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","questionId":"106","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6950447982752223,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[107]二叉树的层序遍历 II","frequency":62.58604137089979,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","questionId":"107","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7589272743121132,"acs":0,"articleLive":2,"columnArticles":1145,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.75351832324768,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","questionId":"108","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634981181116981,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.678951506101875,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","questionId":"109","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5623492926416735,"acs":0,"articleLive":2,"columnArticles":1396,"formTitle":"[110]平衡二叉树","frequency":63.58367877503519,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","questionId":"110","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4840888304345526,"acs":0,"articleLive":2,"columnArticles":1706,"formTitle":"[111]二叉树的最小深度","frequency":41.78122311997896,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","questionId":"111","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5258623217240151,"acs":0,"articleLive":2,"columnArticles":1579,"formTitle":"[112]路径总和","frequency":57.9442583797429,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","questionId":"112","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6258700283426124,"acs":0,"articleLive":2,"columnArticles":1174,"formTitle":"[113]路径总和 II","frequency":63.089325266726995,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","questionId":"113","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7253333217256555,"acs":0,"articleLive":2,"columnArticles":1237,"formTitle":"[114]二叉树展开为链表","frequency":45.7291531039922,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","questionId":"114","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5254096510630615,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[115]不同的子序列","frequency":66.50968165856388,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","questionId":"115","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.702311110256213,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":50.12760869911387,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","questionId":"116","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6094333883722951,"acs":0,"articleLive":2,"columnArticles":706,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":24.396825675980548,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","questionId":"117","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7248248237440753,"acs":0,"articleLive":2,"columnArticles":1649,"formTitle":"[118]杨辉三角","frequency":70.47868465623628,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","questionId":"118","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.662559739354864,"acs":0,"articleLive":2,"columnArticles":1155,"formTitle":"[119]杨辉三角 II","frequency":54.69187375303037,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","questionId":"119","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6789789946493154,"acs":0,"articleLive":2,"columnArticles":1496,"formTitle":"[120]三角形最小路径和","frequency":50.75351832324768,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","questionId":"120","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5729076986307297,"acs":0,"articleLive":2,"columnArticles":3236,"formTitle":"[121]买卖股票的最佳时机","frequency":84.4794421475838,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","questionId":"121","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6867334471948705,"acs":0,"articleLive":2,"columnArticles":2530,"formTitle":"[122]买卖股票的最佳时机 II","frequency":69.57172159042983,"frontendQuestionId":"122","leaf":true,"level":1,"nodeType":"def","questionId":"122","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5328999077333151,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[123]买卖股票的最佳时机 III","frequency":59.81206202560278,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","questionId":"123","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4427226392529831,"acs":0,"articleLive":2,"columnArticles":1040,"formTitle":"[124]二叉树中的最大路径和","frequency":82.82198931248747,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","questionId":"124","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4738822487826472,"acs":0,"articleLive":2,"columnArticles":1780,"formTitle":"[125]验证回文串","frequency":66.83341627910738,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","questionId":"125","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3936090391490489,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[126]单词接龙 II","frequency":41.07992774372667,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","questionId":"126","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4669340561204506,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[127]单词接龙","frequency":50.17745760809217,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","questionId":"127","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.542924072360523,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[128]最长连续序列","frequency":76.17568260498928,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","questionId":"128","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6795088119614495,"acs":0,"articleLive":2,"columnArticles":1072,"formTitle":"[129]求根节点到叶节点数字之和","frequency":64.09040638118935,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","questionId":"129","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4416590951385316,"acs":0,"articleLive":2,"columnArticles":1114,"formTitle":"[130]被围绕的区域","frequency":56.8967837410615,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","questionId":"130","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7238445882595074,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[131]分割回文串","frequency":84.02895301485705,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","questionId":"131","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4926209487058437,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[132]分割回文串 II","frequency":65.79256114413715,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","questionId":"132","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6754826535055887,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[133]克隆图","frequency":5.8641496499728465,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","questionId":"133","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5760778603872703,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[134]加油站","frequency":73.3912435796531,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","questionId":"134","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.485560358328635,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[135]分发糖果","frequency":85.46856063301921,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","questionId":"135","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190120161840694,"acs":0,"articleLive":2,"columnArticles":2150,"formTitle":"[136]只出现一次的数字","frequency":77.46133430844185,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","questionId":"136","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7195132815632006,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[137]只出现一次的数字 II","frequency":73.08662687961194,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","questionId":"137","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6586696081134908,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[138]复制带随机指针的链表","frequency":68.6766415437165,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","questionId":"138","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.512304570268957,"acs":0,"articleLive":2,"columnArticles":1138,"formTitle":"[139]单词拆分","frequency":78.0222819902068,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","questionId":"139","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48131990313674866,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[140]单词拆分 II","frequency":41.78122311997896,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","questionId":"140","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5121970556558878,"acs":0,"articleLive":2,"columnArticles":2592,"formTitle":"[141]环形链表","frequency":77.20692820439623,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","questionId":"141","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5513184769564561,"acs":0,"articleLive":2,"columnArticles":1631,"formTitle":"[142]环形链表 II","frequency":71.16055761518783,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","questionId":"142","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6165184004028367,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[143]重排链表","frequency":92.16851299487216,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","questionId":"143","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7024410384007479,"acs":0,"articleLive":2,"columnArticles":1746,"formTitle":"[144]二叉树的前序遍历","frequency":54.44970756404216,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","questionId":"144","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7492644942598574,"acs":0,"articleLive":2,"columnArticles":1477,"formTitle":"[145]二叉树的后序遍历","frequency":66.01115482016316,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","questionId":"145","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5265875340624293,"acs":0,"articleLive":2,"columnArticles":1316,"formTitle":"[146]LRU 缓存机制","frequency":92.56252888417933,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","questionId":"146","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6804717459959395,"acs":0,"articleLive":2,"columnArticles":759,"formTitle":"[147]对链表进行插入排序","frequency":47.563611642367825,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","questionId":"147","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6675405059764566,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[148]排序链表","frequency":79.01527554035454,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","questionId":"148","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3356614935348396,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[149]直线上最多的点数","frequency":64.74217635325316,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","questionId":"149","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5368344922093082,"acs":0,"articleLive":2,"columnArticles":1004,"formTitle":"[150]逆波兰表达式求值","frequency":69.35153691345818,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","questionId":"150","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.47947808233980477,"acs":0,"articleLive":2,"columnArticles":1361,"formTitle":"[151]翻转字符串里的单词","frequency":61.11356163615732,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","questionId":"151","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4200867795945383,"acs":0,"articleLive":2,"columnArticles":1168,"formTitle":"[152]乘积最大子数组","frequency":73.69535903457533,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","questionId":"152","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5653445030919666,"acs":0,"articleLive":2,"columnArticles":1417,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":55.793744236538515,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","questionId":"153","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319009653339587,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":63.8685304735485,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","questionId":"154","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5721398021919273,"acs":0,"articleLive":2,"columnArticles":1531,"formTitle":"[155]最小栈","frequency":69.48392724167601,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","questionId":"155","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7262933585888481,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[156]上下翻转二叉树","frequency":16.440824613492993,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","questionId":"156","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5303673047077082,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","questionId":"157","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5888210002262956,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":8.295932292890154,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","questionId":"158","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5401063511084482,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":43.753494141085035,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","questionId":"159","status":"not_started","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6115044693148342,"acs":0,"articleLive":2,"columnArticles":1872,"formTitle":"[160]相交链表","frequency":73.68800705697464,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","questionId":"160","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33640703988017223,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.432138260819202,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","questionId":"161","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49430799138777987,"acs":0,"articleLive":2,"columnArticles":691,"formTitle":"[162]寻找峰值","frequency":60.24211240961868,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","questionId":"162","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32254413761883205,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[163]缺失的区间","frequency":17.055299153038327,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","questionId":"163","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106935337704569,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[164]最大间距","frequency":59.26356236186536,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","questionId":"164","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.4852281988590057,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[165]比较版本号","frequency":80.6683266396934,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","questionId":"165","status":"not_started","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2981908702054554,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[166]分数到小数","frequency":51.94259183508164,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","questionId":"166","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.586414671390311,"acs":0,"articleLive":2,"columnArticles":1767,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":59.81206202560278,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","questionId":"167","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43266757573326914,"acs":0,"articleLive":2,"columnArticles":733,"formTitle":"[168]Excel表列名称","frequency":61.67488164036059,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","questionId":"168","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.664176991407444,"acs":0,"articleLive":2,"columnArticles":2087,"formTitle":"[169]多数元素","frequency":70.00521894915825,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","questionId":"169","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.4165162222107598,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.8641496499728465,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","questionId":"170","status":"not_started","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7172229214788586,"acs":0,"articleLive":2,"columnArticles":891,"formTitle":"[171]Excel 表列序号","frequency":21.98213443147007,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","questionId":"171","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4373817764720087,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[172]阶乘后的零","frequency":47.563611642367825,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","questionId":"172","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8029267215196864,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[173]二叉搜索树迭代器","frequency":49.322770406355914,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","questionId":"173","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4796355281708527,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[174]地下城游戏","frequency":63.835457732410816,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","questionId":"174","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7397918436811876,"acs":0,"articleLive":2,"columnArticles":1421,"formTitle":"[175]组合两个表","frequency":93.49642017631042,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","questionId":"175","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561326388157397,"acs":0,"articleLive":2,"columnArticles":974,"formTitle":"[176]第二高的薪水","frequency":94.70545758872063,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","questionId":"176","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4617654796902346,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[177]第N高的薪水","frequency":77.03638887870994,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","questionId":"177","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6014584823668842,"acs":0,"articleLive":2,"columnArticles":639,"formTitle":"[178]分数排名","frequency":70.00521894915825,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","questionId":"178","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097850417480903,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[179]最大数","frequency":82.20228673261897,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","questionId":"179","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.4871020726490677,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[180]连续出现的数字","frequency":73.54689802818154,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","questionId":"180","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7030992364331754,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[181]超过经理收入的员工","frequency":70.56950886097815,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","questionId":"181","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7971433461148859,"acs":0,"articleLive":2,"columnArticles":553,"formTitle":"[182]查找重复的电子邮箱","frequency":61.974058984495606,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","questionId":"182","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6776228293498499,"acs":0,"articleLive":2,"columnArticles":522,"formTitle":"[183]从不订购的客户","frequency":45.041026479170185,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","questionId":"183","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.4741156422611353,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[184]部门工资最高的员工","frequency":76.5723256660157,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","questionId":"184","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4921979130614078,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[185]部门工资前三高的所有员工","frequency":76.11422032884822,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","questionId":"185","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7532372598162071,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.432138260819202,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","questionId":"186","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48186547128200213,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[187]重复的DNA序列","frequency":34.410170454843225,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","questionId":"187","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.388291330922707,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":50.589333220570275,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","questionId":"188","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4531639458298993,"acs":0,"articleLive":2,"columnArticles":1575,"formTitle":"[189]旋转数组","frequency":62.73723339587786,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","questionId":"189","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6952514813283726,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[190]颠倒二进制位","frequency":51.254408282865896,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","questionId":"190","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7470220192571314,"acs":0,"articleLive":2,"columnArticles":1155,"formTitle":"[191]位1的个数","frequency":61.67488164036059,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","questionId":"191","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3552611464968153,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[192]统计词频","frequency":57.80287757337449,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","questionId":"192","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3236288818877387,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":39.74983259469025,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","questionId":"193","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3447377561653352,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[194]转置文件","frequency":30.052239689191424,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","questionId":"194","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.43589841173187194,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[195]第十行","frequency":53.07467572004116,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","questionId":"195","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6647579278124612,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[196]删除重复的电子邮箱","frequency":60.721968746490184,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","questionId":"196","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5334982711338977,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[197]上升的温度","frequency":57.678951506101875,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","questionId":"197","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.510598385734344,"acs":0,"articleLive":2,"columnArticles":2524,"formTitle":"[198]打家劫舍","frequency":81.12953124045997,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","questionId":"198","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6520451325943317,"acs":0,"articleLive":2,"columnArticles":1511,"formTitle":"[199]二叉树的右视图","frequency":82.29826907336545,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","questionId":"199","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5506982183394098,"acs":0,"articleLive":2,"columnArticles":2019,"formTitle":"[200]岛屿数量","frequency":90.03063338015193,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","questionId":"200","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5219968286948439,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[201]数字范围按位与","frequency":36.690222539998246,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","questionId":"201","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6178515991209061,"acs":0,"articleLive":2,"columnArticles":1320,"formTitle":"[202]快乐数","frequency":56.337667764760354,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","questionId":"202","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5126231729927626,"acs":0,"articleLive":2,"columnArticles":1557,"formTitle":"[203]移除链表元素","frequency":58.25622538561957,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","questionId":"203","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37945478956278095,"acs":0,"articleLive":2,"columnArticles":708,"formTitle":"[204]计数质数","frequency":54.47861277248689,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","questionId":"204","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010340977725717,"acs":0,"articleLive":2,"columnArticles":845,"formTitle":"[205]同构字符串","frequency":49.49077172641805,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","questionId":"205","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7219330822610455,"acs":0,"articleLive":2,"columnArticles":7156,"formTitle":"[206]反转链表","frequency":96.02708011910468,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","questionId":"206","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5451669221248657,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[207]课程表","frequency":69.40837884645184,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","questionId":"207","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7162342942580594,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[208]实现 Trie (前缀树)","frequency":64.99498669015729,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","questionId":"208","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.468748758505068,"acs":0,"articleLive":2,"columnArticles":1259,"formTitle":"[209]长度最小的子数组","frequency":57.38461501684371,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","questionId":"209","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.541009494346754,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[210]课程表 II","frequency":48.71873636563078,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","questionId":"210","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48136759264085055,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":34.410170454843225,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","questionId":"211","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45129943248356,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[212]单词搜索 II","frequency":41.78122311997896,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","questionId":"212","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4320349142023153,"acs":0,"articleLive":2,"columnArticles":1427,"formTitle":"[213]打家劫舍 II","frequency":73.69535903457533,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","questionId":"213","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3707357675312435,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[214]最短回文串","frequency":59.26356236186536,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","questionId":"214","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6470303190493497,"acs":0,"articleLive":2,"columnArticles":2177,"formTitle":"[215]数组中的第K个最大元素","frequency":90.43010775219258,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","questionId":"215","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7397835915509804,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[216]组合总和 III","frequency":62.84660515488667,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","questionId":"216","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5615141375271876,"acs":0,"articleLive":2,"columnArticles":1554,"formTitle":"[217]存在重复元素","frequency":65.87729035382061,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","questionId":"217","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422806008768778,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[218]天际线问题","frequency":61.67488164036059,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","questionId":"218","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4253804940686801,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[219]存在重复元素 II","frequency":47.563611642367825,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","questionId":"219","status":"not_started","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.28704865659978396,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[220]存在重复元素 III","frequency":63.21712737917474,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","questionId":"220","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4720096058273418,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[221]最大正方形","frequency":73.76287556955732,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","questionId":"221","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7797289842567577,"acs":0,"articleLive":2,"columnArticles":847,"formTitle":"[222]完全二叉树的节点个数","frequency":40.40333856496414,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","questionId":"222","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.45968670001644,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[223]矩形面积","frequency":48.958131853216656,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","questionId":"223","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41751780591552085,"acs":0,"articleLive":2,"columnArticles":633,"formTitle":"[224]基本计算器","frequency":90.81999934458324,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","questionId":"224","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6755570346423251,"acs":0,"articleLive":2,"columnArticles":4715,"formTitle":"[225]用队列实现栈","frequency":54.55831874240899,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","questionId":"225","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7873283351052989,"acs":0,"articleLive":2,"columnArticles":1768,"formTitle":"[226]翻转二叉树","frequency":76.23840352485959,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","questionId":"226","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4368047938792435,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[227]基本计算器 II","frequency":77.03638887870994,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","questionId":"227","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.581643983376162,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[228]汇总区间","frequency":15.849079142149241,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","questionId":"228","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46299961478687085,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[229]求众数 II","frequency":36.06283381830449,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","questionId":"229","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7402470092728216,"acs":0,"articleLive":2,"columnArticles":807,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":39.99228861804626,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","questionId":"230","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.503452260307057,"acs":0,"articleLive":2,"columnArticles":1158,"formTitle":"[231]2 的幂","frequency":46.37650200462187,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","questionId":"231","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6908306974116252,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[232]用栈实现队列","frequency":67.10218014570648,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","questionId":"232","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47590093003866774,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":43.07346788366307,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","questionId":"233","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4920572588900636,"acs":0,"articleLive":2,"columnArticles":1893,"formTitle":"[234]回文链表","frequency":76.12384278169591,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","questionId":"234","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6657229034485026,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":49.587418974383205,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","questionId":"235","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6792402354200107,"acs":0,"articleLive":2,"columnArticles":1313,"formTitle":"[236]二叉树的最近公共祖先","frequency":75.2816852134945,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","questionId":"236","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848007808063003,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[237]删除链表中的节点","frequency":54.245525973905714,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","questionId":"237","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7225348787411259,"acs":0,"articleLive":2,"columnArticles":830,"formTitle":"[238]除自身以外数组的乘积","frequency":54.748375962017334,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","questionId":"238","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.496152758676538,"acs":0,"articleLive":2,"columnArticles":1261,"formTitle":"[239]滑动窗口最大值","frequency":71.5705348998133,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","questionId":"239","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4736368463206775,"acs":0,"articleLive":2,"columnArticles":708,"formTitle":"[240]搜索二维矩阵 II","frequency":62.34694173711037,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","questionId":"240","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7368695522610444,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[241]为运算表达式设计优先级","frequency":52.2137689841257,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","questionId":"241","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.643561964493877,"acs":0,"articleLive":2,"columnArticles":1582,"formTitle":"[242]有效的字母异位词","frequency":55.793744236538515,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","questionId":"242","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6566298125931154,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","questionId":"243","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5476749647721936,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","questionId":"244","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6109377322038936,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","questionId":"245","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4740299553297714,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","questionId":"246","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5206620282521611,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","questionId":"247","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4648451730418944,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","questionId":"248","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.637725610475404,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","questionId":"249","status":"not_started","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6346010439970171,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[250]统计同值子树","frequency":6.432138260819202,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","questionId":"250","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5415673183913527,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[251]展开二维向量","frequency":16.440824613492993,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","questionId":"251","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5613681077536196,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[252]会议室","frequency":6.432138260819202,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","questionId":"252","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4964587578926269,"acs":0,"articleLive":2,"columnArticles":317,"formTitle":"[253]会议室 II","frequency":52.88011442905138,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","questionId":"253","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5688290204419236,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[254]因子的组合","frequency":17.055299153038327,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","questionId":"254","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4725516449885233,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","questionId":"255","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6302816901408451,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[256]粉刷房子","frequency":5.8641496499728465,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","questionId":"256","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6798578915541221,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[257]二叉树的所有路径","frequency":61.11356163615732,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","questionId":"257","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6912781639774415,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[258]各位相加","frequency":48.1852493781726,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","questionId":"258","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5676707679253288,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[259]较小的三数之和","frequency":5.319656503291312,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","questionId":"259","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7253698181605567,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[260]只出现一次的数字 III","frequency":50.589333220570275,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","questionId":"260","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49676335117639736,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[261]以图判树","frequency":25.918971452343403,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","questionId":"261","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4385156934000168,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[262]行程和用户","frequency":63.370332720976045,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","questionId":"262","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5155044337370921,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[263]丑数","frequency":54.55831874240899,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","questionId":"263","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5779022897797635,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[264]丑数 II","frequency":60.261879982590536,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","questionId":"264","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.579782711384034,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[265]粉刷房子 II","frequency":4.79705487999359,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","questionId":"265","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.669318061300244,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","questionId":"266","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4443226955211615,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[267]回文排列 II","frequency":6.432138260819202,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","questionId":"267","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6225454795556931,"acs":0,"articleLive":2,"columnArticles":1049,"formTitle":"[268]丢失的数字","frequency":33.74435014283262,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","questionId":"268","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.340202664237732,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","questionId":"269","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5496601094868555,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":17.055299153038327,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","questionId":"270","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5504467204183918,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","questionId":"271","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6455047318611987,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":11.143925187261475,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","questionId":"272","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30832568506621216,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":38.011272898476534,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","questionId":"273","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404830216701546,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[274]H 指数","frequency":57.11054153563997,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","questionId":"274","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46327283568739985,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[275]H 指数 II","frequency":32.48038592151521,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","questionId":"275","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48508803449514915,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[276]栅栏涂色","frequency":25.226087579120353,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","questionId":"276","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5686776859504132,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":7.025402965064536,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","questionId":"277","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4549819311155895,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[278]第一个错误的版本","frequency":66.0368894283496,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","questionId":"278","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6301281840050087,"acs":0,"articleLive":2,"columnArticles":1140,"formTitle":"[279]完全平方数","frequency":72.12016629650238,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","questionId":"279","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6864885692268173,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[280]摆动排序","frequency":17.69412241561324,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","questionId":"280","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7558028616852146,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","questionId":"281","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.38781257039873845,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","questionId":"282","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6390958497254338,"acs":0,"articleLive":2,"columnArticles":3154,"formTitle":"[283]移动零","frequency":72.10220345848266,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","questionId":"283","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7330593948449757,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[284]顶端迭代器","frequency":17.055299153038327,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","questionId":"284","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6356648082446359,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","questionId":"285","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5068847611126513,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[286]墙与门","frequency":8.295932292890154,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","questionId":"286","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6628874739549989,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[287]寻找重复数","frequency":60.98037803843527,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","questionId":"287","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42439150699119627,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","questionId":"288","status":"not_started","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7529650323126522,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[289]生命游戏","frequency":17.69412241561324,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","questionId":"289","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570261655318435,"acs":0,"articleLive":2,"columnArticles":1049,"formTitle":"[290]单词规律","frequency":26.45712438121682,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","questionId":"290","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.534660107334526,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","questionId":"291","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6966246643255526,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[292]Nim 游戏","frequency":43.07346788366307,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","questionId":"292","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7104427988514432,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[293]翻转游戏","frequency":5.8641496499728465,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","questionId":"293","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5863964273445551,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","questionId":"294","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5208132565518863,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[295]数据流的中位数","frequency":64.09040638118935,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","questionId":"295","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6186645213193885,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[296]最佳的碰头地点","frequency":25.918971452343403,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","questionId":"296","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5573165987246063,"acs":0,"articleLive":2,"columnArticles":718,"formTitle":"[297]二叉树的序列化与反序列化","frequency":58.348910255299835,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","questionId":"297","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5794865309219679,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","questionId":"298","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5038329093772171,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[299]猜数字游戏","frequency":23.91757750582751,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","questionId":"299","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5104313085515022,"acs":0,"articleLive":2,"columnArticles":1882,"formTitle":"[300]最长递增子序列","frequency":83.39856292795386,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","questionId":"300","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5221542771248975,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[301]删除无效的括号","frequency":51.254408282865896,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","questionId":"301","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6689432063263839,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","questionId":"302","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7235491551679624,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[303]区域和检索 - 数组不可变","frequency":62.36973331282459,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","questionId":"303","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5385245458964157,"acs":0,"articleLive":2,"columnArticles":544,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":58.348910255299835,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","questionId":"304","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3769390843738176,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":6.432138260819202,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","questionId":"305","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33689749879447345,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":39.43127145300367,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","questionId":"306","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5437404287901991,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[307]区域和检索 - 数组可修改","frequency":17.69412241561324,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","questionId":"307","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6043103448275862,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","questionId":"308","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6043662705049677,"acs":0,"articleLive":2,"columnArticles":881,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":72.7567083889124,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","questionId":"309","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3792129125191601,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[310]最小高度树","frequency":43.26533686741106,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","questionId":"310","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7631879424526148,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.69412241561324,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","questionId":"311","status":"not_started","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6823392738599806,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[312]戳气球","frequency":54.38790852782526,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","questionId":"312","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6560416597565425,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[313]超级丑数","frequency":32.74959043492901,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","questionId":"313","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5472564977684432,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","questionId":"314","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41862380127292376,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":57.030639592048736,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","questionId":"315","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47711772484807063,"acs":0,"articleLive":2,"columnArticles":499,"formTitle":"[316]去除重复字母","frequency":57.56943384829765,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","questionId":"316","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4853786859170439,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":6.432138260819202,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","questionId":"317","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6822164854743119,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[318]最大单词长度乘积","frequency":6.432138260819202,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","questionId":"318","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5158182072698427,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[319]灯泡开关","frequency":17.055299153038327,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","questionId":"319","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.670958512160229,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","questionId":"320","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.425964289237447,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[321]拼接最大数","frequency":33.74435014283262,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","questionId":"321","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4424769086121428,"acs":0,"articleLive":2,"columnArticles":1733,"formTitle":"[322]零钱兑换","frequency":80.80390434591138,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","questionId":"322","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6348877821615678,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[323]无向图中连通分量的数目","frequency":35.100661777816974,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","questionId":"323","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37688568292300456,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[324]摆动排序 II","frequency":38.70802575964364,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","questionId":"324","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5379487493119687,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":32.48038592151521,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","questionId":"325","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48932529549582754,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[326]3的幂","frequency":23.298530310509975,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","questionId":"326","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42473441926345606,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[327]区间和的个数","frequency":36.56306116114526,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","questionId":"327","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6567468557980043,"acs":0,"articleLive":2,"columnArticles":1028,"formTitle":"[328]奇偶链表","frequency":62.58604137089979,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","questionId":"328","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48220103224861816,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[329]矩阵中的最长递增路径","frequency":55.125356052925746,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","questionId":"329","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5344283006948831,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":33.74435014283262,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","questionId":"330","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4798818186792143,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[331]验证二叉树的前序序列化","frequency":57.9442583797429,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","questionId":"331","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4486572637179595,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[332]重新安排行程","frequency":46.261656597758154,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","questionId":"332","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.4650249442734317,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[333]最大 BST 子树","frequency":18.3590911498422,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","questionId":"333","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41341398499879023,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[334]递增的三元子序列","frequency":5.319656503291312,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","questionId":"334","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36856010568031705,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","questionId":"335","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4012020205744626,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[336]回文对","frequency":34.410170454843225,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","questionId":"336","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6091867172375647,"acs":0,"articleLive":2,"columnArticles":893,"formTitle":"[337]打家劫舍 III","frequency":71.21723967946585,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","questionId":"337","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7875501758098142,"acs":0,"articleLive":2,"columnArticles":1323,"formTitle":"[338]比特位计数","frequency":70.6389806682946,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","questionId":"338","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8097275388426031,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","questionId":"339","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4940346083788707,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":28.149776246328518,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","questionId":"340","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7271672565461942,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":72.03330545703744,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","questionId":"341","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5152683651207841,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[342]4的幂","frequency":47.563611642367825,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","questionId":"342","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6039419771111006,"acs":0,"articleLive":2,"columnArticles":992,"formTitle":"[343]整数拆分","frequency":63.089325266726995,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","questionId":"343","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7644085340281433,"acs":0,"articleLive":2,"columnArticles":1820,"formTitle":"[344]反转字符串","frequency":69.02467204681585,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","questionId":"344","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5384153507443921,"acs":0,"articleLive":2,"columnArticles":1009,"formTitle":"[345]反转字符串中的元音字母","frequency":29.39556476926235,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","questionId":"345","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7060534448282131,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","questionId":"346","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6224140862014855,"acs":0,"articleLive":2,"columnArticles":1405,"formTitle":"[347]前 K 个高频元素","frequency":77.96040021192715,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","questionId":"347","status":"not_started","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6003898635477583,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","questionId":"348","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7381852928295577,"acs":0,"articleLive":2,"columnArticles":1436,"formTitle":"[349]两个数组的交集","frequency":68.71817366809833,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","questionId":"349","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5493165193790752,"acs":0,"articleLive":2,"columnArticles":1296,"formTitle":"[350]两个数组的交集 II","frequency":63.58367877503519,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","questionId":"350","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5891316526610644,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":20.500328653379427,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","questionId":"351","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.593039573393208,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","questionId":"352","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42476586888657647,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":7.645927818924828,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","questionId":"353","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.450622502045702,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[354]俄罗斯套娃信封问题","frequency":76.63695330591264,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","questionId":"354","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4067887232663642,"acs":0,"articleLive":2,"columnArticles":415,"formTitle":"[355]设计推特","frequency":37.33921280172674,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","questionId":"355","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3522248243559719,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","questionId":"356","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5194134744696542,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[357]计算各个位数不同的数字个数","frequency":44.77985081966752,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","questionId":"357","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35175547294506404,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","questionId":"358","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7244245524296675,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","questionId":"359","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.606237379403186,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","questionId":"360","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5654839308935538,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","questionId":"361","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.695929042528997,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":7.645927818924828,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","questionId":"362","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4907107992678462,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":56.485245772670545,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","questionId":"363","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7168724279835391,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","questionId":"364","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.363567825267476,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[365]水壶问题","frequency":42.416533672737785,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","questionId":"365","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7642535633908477,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","questionId":"366","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4390941510834344,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[367]有效的完全平方数","frequency":4.294895037487166,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","questionId":"367","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4588316415346009,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[368]最大整除子集","frequency":70.72796193834019,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","questionId":"368","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6165082966955042,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","questionId":"369","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.717852684144819,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[370]区间加法","frequency":6.432138260819202,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","questionId":"370","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5793871866295265,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":48.24850890238516,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","questionId":"371","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5066390041493776,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[372]超级次方","frequency":7.025402965064536,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","questionId":"372","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4271200497615592,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[373]查找和最小的K对数字","frequency":43.07346788366307,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","questionId":"373","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5142324624827276,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[374]猜数字大小","frequency":34.410170454843225,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","questionId":"374","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4668793831222787,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":34.410170454843225,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","questionId":"375","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46153896636587366,"acs":0,"articleLive":2,"columnArticles":771,"formTitle":"[376]摆动序列","frequency":33.10157802583374,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","questionId":"376","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5067982141500755,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[377]组合总和 Ⅳ","frequency":59.72329153579145,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","questionId":"377","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6390531561461794,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":54.38790852782526,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","questionId":"378","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6454967913255145,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","questionId":"379","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021447264505938,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":34.410170454843225,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","questionId":"380","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4432208634782423,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":7.025402965064536,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","questionId":"381","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6263871240999577,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[382]链表随机节点","frequency":30.052239689191424,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","questionId":"382","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5942116664389844,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[383]赎金信","frequency":14.55397227933976,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","questionId":"383","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5749919440499349,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[384]打乱数组","frequency":55.793744236538515,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","questionId":"384","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41483083036288204,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[385]迷你语法分析器","frequency":5.8641496499728465,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","questionId":"385","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7458984305491299,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[386]字典序排数","frequency":55.078458808007355,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","questionId":"386","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5301473838228346,"acs":0,"articleLive":2,"columnArticles":1132,"formTitle":"[387]字符串中的第一个唯一字符","frequency":61.38007230557994,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","questionId":"387","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5233364573570759,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","questionId":"388","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6922397898528543,"acs":0,"articleLive":2,"columnArticles":960,"formTitle":"[389]找不同","frequency":23.298530310509975,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","questionId":"389","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.466211085801063,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":35.100661777816974,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","questionId":"390","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35477598638904645,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","questionId":"391","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5142716916797975,"acs":0,"articleLive":2,"columnArticles":1516,"formTitle":"[392]判断子序列","frequency":57.678951506101875,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","questionId":"392","status":"not_started","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39117399729443164,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[393]UTF-8 编码验证","frequency":35.100661777816974,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","questionId":"393","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5509729619998647,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[394]字符串解码","frequency":86.40504474473143,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","questionId":"394","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5202298199813377,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":64.32499549503582,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","questionId":"395","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.422879936964444,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","questionId":"396","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37796319401122896,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[397]整数替换","frequency":30.052239689191424,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","questionId":"397","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6523240754065334,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[398]随机数索引","frequency":41.07992774372667,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","questionId":"398","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5922081740664511,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[399]除法求值","frequency":30.052239689191424,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","questionId":"399","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4135725180412958,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[400]第 N 位数字","frequency":48.958131853216656,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","questionId":"400","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6135540309147457,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":49.945898209573045,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","questionId":"401","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32800391931326817,"acs":0,"articleLive":2,"columnArticles":563,"formTitle":"[402]移掉 K 位数字","frequency":69.28272705007022,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","questionId":"402","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4562878175135401,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[403]青蛙过河","frequency":68.28890953625057,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","questionId":"403","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5814203620048554,"acs":0,"articleLive":2,"columnArticles":1074,"formTitle":"[404]左叶子之和","frequency":56.44131990714526,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","questionId":"404","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229626655961461,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[405]数字转换为十六进制数","frequency":46.122200192639085,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","questionId":"405","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7351981594374326,"acs":0,"articleLive":2,"columnArticles":765,"formTitle":"[406]根据身高重建队列","frequency":57.471948549896126,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","questionId":"406","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4824102924917077,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":46.122200192639085,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","questionId":"407","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32486370716510904,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","questionId":"408","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5553368179071375,"acs":0,"articleLive":2,"columnArticles":1267,"formTitle":"[409]最长回文串","frequency":65.10200676933057,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","questionId":"409","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.561395566420692,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[410]分割数组的最大值","frequency":72.10220345848266,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","questionId":"410","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49510086455331415,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","questionId":"411","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6724786682123107,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[412]Fizz Buzz","frequency":24.559555950910564,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","questionId":"412","status":"not_started","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6859810574370733,"acs":0,"articleLive":2,"columnArticles":872,"formTitle":"[413]等差数列划分","frequency":36.418777194806474,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","questionId":"413","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.3645384782676236,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[414]第三大的数","frequency":38.011272898476534,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","questionId":"414","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5352720334334999,"acs":0,"articleLive":2,"columnArticles":1024,"formTitle":"[415]字符串相加","frequency":89.30600798470721,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","questionId":"415","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5059933393350667,"acs":0,"articleLive":2,"columnArticles":928,"formTitle":"[416]分割等和子集","frequency":67.99559991097944,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","questionId":"416","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4759916492693111,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[417]太平洋大西洋水流问题","frequency":59.0419842925638,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","questionId":"417","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35974116824064356,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","questionId":"418","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.756675392670157,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[419]甲板上的战舰","frequency":15.849079142149241,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","questionId":"419","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20561327337571716,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[420]强密码检验器","frequency":20.500328653379427,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","questionId":"420","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223643276875216,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[421]数组中两个数的最大异或值","frequency":60.504147722888156,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","questionId":"421","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4264168190127971,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","questionId":"422","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5693104426787742,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","questionId":"423","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5301041388518024,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":64.54158351652914,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","questionId":"424","status":"not_started","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6110183639398998,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","questionId":"425","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6686204731002722,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":28.76189960150114,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","questionId":"426","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6129032258064516,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","questionId":"427","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6486838676048997,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","questionId":"428","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6977990792709844,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[429]N 叉树的层序遍历","frequency":27.557862355706632,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","questionId":"429","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5409169305223055,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[430]扁平化多级双向链表","frequency":30.052239689191424,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","questionId":"430","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7244897959183674,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","questionId":"431","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.377393159860115,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":19.0522059501259,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","questionId":"432","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5333498373178668,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","questionId":"433","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3740373927237405,"acs":0,"articleLive":2,"columnArticles":512,"formTitle":"[434]字符串中的单词数","frequency":29.39556476926235,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","questionId":"434","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5099701734572728,"acs":0,"articleLive":2,"columnArticles":798,"formTitle":"[435]无重叠区间","frequency":62.25225252126235,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","questionId":"435","status":"not_started","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4861013370865588,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[436]寻找右区间","frequency":7.025402965064536,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","questionId":"436","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668852753571108,"acs":0,"articleLive":2,"columnArticles":787,"formTitle":"[437]路径总和 III","frequency":51.84280538287792,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","questionId":"437","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5159327337656909,"acs":0,"articleLive":2,"columnArticles":738,"formTitle":"[438]找到字符串中所有字母异位词","frequency":49.061627540188994,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","questionId":"438","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5885678391959799,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","questionId":"439","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37955826951961197,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[440]字典序的第K小数字","frequency":71.5318357774234,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","questionId":"440","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42592679824768004,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[441]排列硬币","frequency":23.91757750582751,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","questionId":"441","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6961337229054835,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[442]数组中重复的数据","frequency":64.92849117237174,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","questionId":"442","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4766944840219825,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[443]压缩字符串","frequency":41.78122311997896,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","questionId":"443","status":"not_started","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24817632755510236,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[444]序列重建","frequency":19.0522059501259,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","questionId":"444","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.587491821804556,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[445]两数相加 II","frequency":69.28272705007022,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","questionId":"445","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5515107069521854,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[446]等差数列划分 II - 子序列","frequency":29.13942298095397,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","questionId":"446","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6038166835333237,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","questionId":"447","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6471915697385426,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[448]找到所有数组中消失的数字","frequency":61.11356163615732,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","questionId":"448","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.554326262780406,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":6.432138260819202,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","questionId":"449","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4835021263536323,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.45823546827265,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","questionId":"450","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7109938418499882,"acs":0,"articleLive":2,"columnArticles":907,"formTitle":"[451]根据字符出现频率排序","frequency":59.30347190002874,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","questionId":"451","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5094026610880543,"acs":0,"articleLive":2,"columnArticles":795,"formTitle":"[452]用最少数量的箭引爆气球","frequency":48.8271917938307,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","questionId":"452","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5541971423711516,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":28.76189960150114,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","questionId":"453","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.5995424805234278,"acs":0,"articleLive":2,"columnArticles":465,"formTitle":"[454]四数相加 II","frequency":55.125356052925746,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","questionId":"454","status":"not_started","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5774841850520052,"acs":0,"articleLive":2,"columnArticles":1175,"formTitle":"[455]分发饼干","frequency":57.56943384829765,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","questionId":"455","status":"not_started","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3621585155784358,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[456]132 模式","frequency":72.58417774101899,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","questionId":"456","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4352048132676601,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":30.31127173612572,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","questionId":"457","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6078855744800978,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[458]可怜的小猪","frequency":16.440824613492993,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","questionId":"458","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115712381696038,"acs":0,"articleLive":2,"columnArticles":618,"formTitle":"[459]重复的子字符串","frequency":52.88011442905138,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","questionId":"459","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4398492056867819,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[460]LFU 缓存","frequency":63.089325266726995,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","questionId":"460","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.811597659005773,"acs":0,"articleLive":2,"columnArticles":1312,"formTitle":"[461]汉明距离","frequency":57.83644945943555,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","questionId":"461","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6021010866134632,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.011272898476534,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","questionId":"462","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7149863655197002,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[463]岛屿的周长","frequency":37.33921280172674,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","questionId":"463","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.358275335257172,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":38.70802575964364,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","questionId":"464","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5292264613230662,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","questionId":"465","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.37363749102539,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","questionId":"466","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.43996827914353687,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.055299153038327,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","questionId":"467","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24806327185504523,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[468]验证IP地址","frequency":51.94259183508164,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","questionId":"468","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4379930577469233,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.226087579120353,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","questionId":"469","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5561360376971932,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":64.74217635325316,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","questionId":"470","status":"not_started","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6175723717623159,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":13.542175004154641,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","questionId":"471","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4108761329305136,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","questionId":"472","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.4199377615623994,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[473]火柴拼正方形","frequency":40.40333856496414,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","questionId":"473","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6096666012441653,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[474]一和零","frequency":65.73410893789172,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","questionId":"474","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3295784091861537,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":30.052239689191424,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","questionId":"475","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012657261220672,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[476]数字的补数","frequency":5.319656503291312,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","questionId":"476","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6036540305970032,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":47.563611642367825,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","questionId":"477","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43642684830424294,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.733546932419063,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","questionId":"478","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41295489672614866,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":9.694674396372061,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","questionId":"479","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4484839977540708,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[480]滑动窗口中位数","frequency":45.94926787236362,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","questionId":"480","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5345450893753766,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[481]神奇字符串","frequency":5.8641496499728465,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","questionId":"481","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4250846988868146,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[482]密钥格式化","frequency":15.278597674784466,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","questionId":"482","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5893017622006017,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":31.879441241133854,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","questionId":"483","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6412037037037037,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","questionId":"484","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6060439164496237,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[485]最大连续 1 的个数","frequency":49.945898209573045,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","questionId":"485","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5880048380311317,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[486]预测赢家","frequency":41.07992774372667,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","questionId":"486","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5787571411915589,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[487]最大连续1的个数 II","frequency":37.33921280172674,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","questionId":"487","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3878028795505092,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","questionId":"488","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7188679245283018,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","questionId":"489","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.48290959367078884,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[490]迷宫","frequency":7.645927818924828,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","questionId":"490","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5477830925177823,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[491]递增子序列","frequency":51.254408282865896,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","questionId":"491","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5497144530677991,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[492]构造矩形","frequency":5.8641496499728465,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","questionId":"492","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3440053138492195,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":39.43127145300367,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","questionId":"493","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4997513834882864,"acs":0,"articleLive":2,"columnArticles":987,"formTitle":"[494]目标和","frequency":73.94302784650516,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","questionId":"494","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5410810262650847,"acs":0,"articleLive":2,"columnArticles":409,"formTitle":"[495]提莫攻击","frequency":24.559555950910564,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","questionId":"495","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6869957748004767,"acs":0,"articleLive":2,"columnArticles":986,"formTitle":"[496]下一个更大元素 I","frequency":54.283759835801014,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","questionId":"496","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40325628725105395,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","questionId":"497","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4594979325304472,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[498]对角线遍历","frequency":55.793744236538515,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","questionId":"498","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.36968549796156086,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","questionId":"499","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.707721344399545,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[500]键盘行","frequency":16.440824613492993,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","questionId":"500","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5104778490631136,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[501]二叉搜索树中的众数","frequency":45.641797562340564,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","questionId":"501","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4172029308697037,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":31.44128620556848,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","questionId":"502","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6334789144915891,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[503]下一个更大元素 II","frequency":66.38652901470955,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","questionId":"503","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5049172882421786,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[504]七进制数","frequency":23.91757750582751,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","questionId":"504","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48289353958143766,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[505]迷宫 II","frequency":18.3590911498422,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","questionId":"505","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5629401283972963,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[506]相对名次","frequency":15.278597674784466,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","questionId":"506","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4083969465648855,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[507]完美数","frequency":23.91757750582751,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","questionId":"507","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6736689954227897,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.69412241561324,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","questionId":"508","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6775600074427836,"acs":0,"articleLive":2,"columnArticles":1374,"formTitle":"[509]斐波那契数","frequency":67.19477305878992,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","questionId":"509","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6114263353551164,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":8.295932292890154,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","questionId":"510","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7338770075726054,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":38.011272898476534,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","questionId":"511","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5376202271045775,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":5.8641496499728465,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","questionId":"512","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7304233384514148,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[513]找树左下角的值","frequency":5.319656503291312,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","questionId":"513","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5016108331805442,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[514]自由之路","frequency":51.62681662693115,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","questionId":"514","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6429759837962963,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[515]在每个树行中找最大值","frequency":35.81762406528862,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","questionId":"515","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6512811755425988,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[516]最长回文子序列","frequency":36.947147462891664,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","questionId":"516","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.43952981095492,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":5.8641496499728465,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","questionId":"517","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6504988164236873,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[518]零钱兑换 II","frequency":71.69938033736386,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","questionId":"518","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3958462492250465,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":19.0522059501259,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","questionId":"519","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5625946859340403,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[520]检测大写字母","frequency":16.440824613492993,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","questionId":"520","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7120831528800347,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":17.055299153038327,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","questionId":"521","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3577380291078769,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[522]最长特殊序列 II","frequency":16.440824613492993,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","questionId":"522","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.274306799603003,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[523]连续的子数组和","frequency":59.0419842925638,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","questionId":"523","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4730568296092811,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":34.410170454843225,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","questionId":"524","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5363479120336051,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[525]连续数组","frequency":70.00521894915825,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","questionId":"525","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7341708542713568,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[526]优美的排列","frequency":34.18557267881456,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","questionId":"526","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5758661887694145,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","questionId":"527","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4694726417430057,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[528]按权重随机选择","frequency":16.440824613492993,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","questionId":"528","status":"not_started","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.646512021672875,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[529]扫雷游戏","frequency":36.56306116114526,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","questionId":"529","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6205227412364458,"acs":0,"articleLive":2,"columnArticles":621,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":17.055299153038327,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","questionId":"530","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.664,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","questionId":"531","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37212026552128075,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[532]数组中的 k-diff 数对","frequency":17.055299153038327,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","questionId":"532","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.523696682464455,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","questionId":"533","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6761523868122853,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[534]游戏玩法分析 III","frequency":16.440824613492993,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","questionId":"534","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8416662093189178,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[535]TinyURL 的加密与解密","frequency":30.052239689191424,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","questionId":"535","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.53449879114748,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":7.645927818924828,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","questionId":"536","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7116606884399975,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[537]复数乘法","frequency":5.8641496499728465,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","questionId":"537","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6949607101670824,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":36.06283381830449,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","questionId":"538","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5938114827401181,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[539]最小时间差","frequency":28.76189960150114,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","questionId":"539","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5810740354535975,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[540]有序数组中的单一元素","frequency":46.82964520860451,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","questionId":"540","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6082627194393793,"acs":0,"articleLive":2,"columnArticles":772,"formTitle":"[541]反转字符串 II","frequency":28.606903446173686,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","questionId":"541","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45936868429853,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[542]01 矩阵","frequency":43.07346788366307,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","questionId":"542","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5483359186318207,"acs":0,"articleLive":2,"columnArticles":1181,"formTitle":"[543]二叉树的直径","frequency":70.94161163092653,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","questionId":"543","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7102382485511912,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","questionId":"544","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4162552221800228,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","questionId":"545","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6307443778429622,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.226087579120353,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","questionId":"546","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6180496668685646,"acs":0,"articleLive":2,"columnArticles":1076,"formTitle":"[547]省份数量","frequency":56.8967837410615,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","questionId":"547","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35732410611303345,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","questionId":"548","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48421312284163787,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","questionId":"549","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4382795373799985,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[550]游戏玩法分析 IV","frequency":29.39556476926235,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","questionId":"550","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.566804897314376,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[551]学生出勤记录 I","frequency":20.694889944369198,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","questionId":"551","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5781455149007853,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":31.297530792672852,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","questionId":"552","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6020691126279863,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[553]最优除法","frequency":5.8641496499728465,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","questionId":"553","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5004770017035776,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[554]砖墙","frequency":60.62423148797962,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","questionId":"554","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.34170375079465987,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","questionId":"555","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3247994336951392,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[556]下一个更大元素 III","frequency":52.393294068742215,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","questionId":"556","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7451870805920636,"acs":0,"articleLive":2,"columnArticles":1194,"formTitle":"[557]反转字符串中的单词 III","frequency":60.87144260366247,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","questionId":"557","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5019510464703796,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","questionId":"558","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.726671647366455,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[559]N 叉树的最大深度","frequency":33.10157802583374,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","questionId":"559","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44708346989004777,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[560]和为K的子数组","frequency":81.1736677728155,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","questionId":"560","status":"not_started","submitted":0,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7733613014001735,"acs":0,"articleLive":2,"columnArticles":726,"formTitle":"[561]数组拆分 I","frequency":23.298530310509975,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","questionId":"561","status":"not_started","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.4598615029494742,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","questionId":"562","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6040876364480917,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[563]二叉树的坡度","frequency":29.39556476926235,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","questionId":"563","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17849660605044834,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":17.055299153038327,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","questionId":"564","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6099842590510457,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[565]数组嵌套","frequency":16.440824613492993,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","questionId":"565","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6967271197325007,"acs":0,"articleLive":2,"columnArticles":583,"formTitle":"[566]重塑矩阵","frequency":30.052239689191424,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","questionId":"566","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4300441175880244,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[567]字符串的排列","frequency":52.83780674494143,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","questionId":"567","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5020261143628996,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","questionId":"568","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.563823124138795,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":25.226087579120353,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","questionId":"569","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.664856302330844,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":17.055299153038327,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","questionId":"570","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4893104252507191,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[571]给定数字的频率查询中位数","frequency":17.055299153038327,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","questionId":"571","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4740232274281847,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[572]另一棵树的子树","frequency":52.65550695098638,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","questionId":"572","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6605814739688979,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":12.593175978150889,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","questionId":"573","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6473389821122002,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","questionId":"574","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6847440961567803,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[575]分糖果","frequency":30.052239689191424,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","questionId":"575","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4692916067509271,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[576]出界的路径数","frequency":25.918971452343403,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","questionId":"576","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7066570634838976,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":17.055299153038327,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","questionId":"577","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4982231698649609,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[578]查询回答率最高的问题","frequency":5.8641496499728465,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","questionId":"578","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4136809709076128,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[579]查询员工的累计薪水","frequency":17.69412241561324,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","questionId":"579","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5259926554969016,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[580]统计各专业学生人数","frequency":16.440824613492993,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","questionId":"580","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40369522703399746,"acs":0,"articleLive":2,"columnArticles":826,"formTitle":"[581]最短无序连续子数组","frequency":31.91425270163693,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","questionId":"581","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.4026897214217099,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","questionId":"582","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5812047772644059,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[583]两个字符串的删除操作","frequency":38.50633245737346,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","questionId":"583","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7725497375808618,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","questionId":"584","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5937955924134224,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","questionId":"585","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7492092182557614,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":24.559555950910564,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","questionId":"586","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37935656836461124,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":12.593175978150889,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","questionId":"587","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4333868378812199,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.977909794422963,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","questionId":"588","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7447929868109393,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[589]N 叉树的前序遍历","frequency":39.43127145300367,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","questionId":"589","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7595426095936126,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[590]N 叉树的后序遍历","frequency":16.440824613492993,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","questionId":"590","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33926805143422356,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","questionId":"591","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5206845604530904,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","questionId":"592","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44072727272727275,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[593]有效的正方形","frequency":24.559555950910564,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","questionId":"593","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5159040335097331,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[594]最长和谐子序列","frequency":4.79705487999359,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","questionId":"594","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796360094660077,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[595]大的国家","frequency":39.74983259469025,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","questionId":"595","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4202645614836321,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":23.91757750582751,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","questionId":"596","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4410397098484144,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":17.055299153038327,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","questionId":"597","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5168455625909999,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[598]范围求和 II","frequency":17.055299153038327,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","questionId":"598","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222013045049156,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[599]两个列表的最小索引总和","frequency":17.69412241561324,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","questionId":"599","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.34292777679675085,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[600]不含连续1的非负整数","frequency":16.440824613492993,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","questionId":"600","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49659040002654675,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[601]体育馆的人流量","frequency":55.078458808007355,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","questionId":"601","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6274922183898376,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":7.025402965064536,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","questionId":"602","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6731950399814579,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":25.918971452343403,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","questionId":"603","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37309562398703405,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[604]迭代压缩字符串","frequency":7.645927818924828,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","questionId":"604","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33507240068111693,"acs":0,"articleLive":2,"columnArticles":1216,"formTitle":"[605]种花问题","frequency":55.125356052925746,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","questionId":"605","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5674672307947569,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[606]根据二叉树创建字符串","frequency":23.298530310509975,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","questionId":"606","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6640213206988451,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.8641496499728465,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","questionId":"607","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6583955223880597,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","questionId":"608","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4805335815107802,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[609]在系统中查找重复文件","frequency":7.025402965064536,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","questionId":"609","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6672671840354767,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.8641496499728465,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","questionId":"610","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319962748619703,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[611]有效三角形的个数","frequency":50.57338789002088,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","questionId":"611","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6691471653774601,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":0.0,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","questionId":"612","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8165559915484455,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.8641496499728465,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","questionId":"613","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3466506180269432,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":17.055299153038327,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","questionId":"614","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4232031789910159,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[615]平均工资：部门与公司比较","frequency":7.645927818924828,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","questionId":"615","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4603125957707631,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":34.410170454843225,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","questionId":"616","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881570528706215,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[617]合并二叉树","frequency":62.997963598462135,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","questionId":"617","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6199417758369723,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":30.733546932419063,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","questionId":"618","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4656079975228911,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.8641496499728465,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","questionId":"619","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7724045986564166,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[620]有趣的电影","frequency":39.74983259469025,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","questionId":"620","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5683468603161043,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[621]任务调度器","frequency":61.67488164036059,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","questionId":"621","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4360931993304565,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[622]设计循环队列","frequency":52.65550695098638,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","questionId":"622","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.544933374651379,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[623]在二叉树中增加一行","frequency":5.319656503291312,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","questionId":"623","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41561014263074486,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","questionId":"624","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.33962264150943394,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","questionId":"625","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.682851845395623,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[626]换座位","frequency":42.416533672737785,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","questionId":"626","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.806544830510982,"acs":0,"articleLive":2,"columnArticles":317,"formTitle":"[627]变更性别","frequency":28.76189960150114,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","questionId":"627","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5250513874614594,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[628]三个数的最大乘积","frequency":33.10157802583374,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","questionId":"628","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.4012326656394453,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[629]K个逆序对数组","frequency":25.918971452343403,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","questionId":"629","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3646405430422709,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[630]课程表 III","frequency":7.025402965064536,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","questionId":"630","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28137092316196793,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","questionId":"631","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5966747376916869,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[632]最小区间","frequency":17.69412241561324,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","questionId":"632","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3996756804137266,"acs":0,"articleLive":2,"columnArticles":738,"formTitle":"[633]平方数之和","frequency":61.003147158161475,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","questionId":"633","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.4370838881491345,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","questionId":"634","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5549589858314691,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","questionId":"635","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5466266336983399,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[636]函数的独占时间","frequency":17.055299153038327,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","questionId":"636","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.689122176144767,"acs":0,"articleLive":2,"columnArticles":625,"formTitle":"[637]二叉树的层平均值","frequency":21.564964863382983,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","questionId":"637","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5939006554357835,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[638]大礼包","frequency":17.69412241561324,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","questionId":"638","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30975332068311195,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[639]解码方法 II","frequency":25.918971452343403,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","questionId":"639","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4235788271755974,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[640]求解方程","frequency":25.226087579120353,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","questionId":"640","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5334289439374185,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[641]设计循环双端队列","frequency":28.149776246328518,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","questionId":"641","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4908972691807542,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[642]设计搜索自动补全系统","frequency":9.694674396372061,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","questionId":"642","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45219872588922316,"acs":0,"articleLive":2,"columnArticles":559,"formTitle":"[643]子数组最大平均数 I","frequency":37.33921280172674,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","questionId":"643","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","questionId":"644","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43586417447932024,"acs":0,"articleLive":2,"columnArticles":681,"formTitle":"[645]错误的集合","frequency":42.416533672737785,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","questionId":"645","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5739959454276478,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[646]最长数对链","frequency":16.440824613492993,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","questionId":"646","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6556474924327179,"acs":0,"articleLive":2,"columnArticles":870,"formTitle":"[647]回文子串","frequency":60.87144260366247,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","questionId":"647","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5808562619975569,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[648]单词替换","frequency":5.319656503291312,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","questionId":"648","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48115015974440895,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[649]Dota2 参议院","frequency":5.319656503291312,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","questionId":"649","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5343588238992393,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[650]只有两个键的键盘","frequency":17.055299153038327,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","questionId":"650","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.579279133667367,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","questionId":"651","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5713145593432903,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[652]寻找重复的子树","frequency":55.793744236538515,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","questionId":"652","status":"not_started","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5940205181379711,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","questionId":"653","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8097106496789078,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[654]最大二叉树","frequency":45.041026479170185,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","questionId":"654","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5953485333507545,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[655]输出二叉树","frequency":17.055299153038327,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","questionId":"655","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30592734225621415,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","questionId":"656","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7831633642250572,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[657]机器人能否返回原点","frequency":17.69412241561324,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","questionId":"657","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45274320803192364,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[658]找到 K 个最接近的元素","frequency":34.410170454843225,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","questionId":"658","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5423080675056092,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","questionId":"659","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6467661691542289,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[660]移除 9","frequency":13.542175004154641,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","questionId":"660","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5594987363100252,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[661]图片平滑器","frequency":5.8641496499728465,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","questionId":"661","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40551315462894016,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[662]二叉树最大宽度","frequency":57.678951506101875,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","questionId":"662","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","questionId":"663","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6557822308063738,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[664]奇怪的打印机","frequency":56.53556503447537,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","questionId":"664","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.26988299763033174,"acs":0,"articleLive":2,"columnArticles":914,"formTitle":"[665]非递减数列","frequency":48.958131853216656,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","questionId":"665","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6191222570532915,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","questionId":"666","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235000402673754,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[667]优美的排列 II","frequency":15.849079142149241,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","questionId":"667","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5075810590156287,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[668]乘法表中第k小的数","frequency":34.410170454843225,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","questionId":"668","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6669622448175297,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[669]修剪二叉搜索树","frequency":17.055299153038327,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","questionId":"669","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44928887852646304,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[670]最大交换","frequency":64.3622854204651,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","questionId":"670","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.486755739801873,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[671]二叉树中第二小的节点","frequency":22.64231689302981,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","questionId":"671","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5522650872418761,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.319656503291312,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","questionId":"672","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3894383834953517,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[673]最长递增子序列的个数","frequency":50.17745760809217,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","questionId":"673","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4904134042865697,"acs":0,"articleLive":2,"columnArticles":734,"formTitle":"[674]最长连续递增序列","frequency":36.06283381830449,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","questionId":"674","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.40002876869965476,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","questionId":"675","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5855215171407732,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","questionId":"676","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6153711866625933,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","questionId":"677","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35085939481436684,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[678]有效的括号字符串","frequency":73.50665489357841,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","questionId":"678","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5409746978523606,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[679]24 点游戏","frequency":68.58497788570878,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","questionId":"679","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4014971309843976,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":58.19808689431388,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","questionId":"680","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","questionId":"681","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6953888420592551,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[682]棒球比赛","frequency":29.39556476926235,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","questionId":"682","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.42730276745146634,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","questionId":"683","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6664555774462895,"acs":0,"articleLive":2,"columnArticles":587,"formTitle":"[684]冗余连接","frequency":29.39556476926235,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","questionId":"684","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4341074924363766,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":30.052239689191424,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","questionId":"685","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3544327931363203,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":6.432138260819202,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","questionId":"686","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.43933728493621726,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[687]最长同值路径","frequency":48.24850890238516,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","questionId":"687","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5111258278145695,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[688]“马”在棋盘上的概率","frequency":5.8641496499728465,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","questionId":"688","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48542920494140007,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[689]三个无重叠子数组的最大和","frequency":35.81762406528862,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","questionId":"689","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6464122426740577,"acs":0,"articleLive":2,"columnArticles":555,"formTitle":"[690]员工的重要性","frequency":66.11213552656227,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","questionId":"690","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.4896712249054408,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[691]贴纸拼词","frequency":7.025402965064536,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","questionId":"691","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5810434876249618,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[692]前K个高频单词","frequency":64.09040638118935,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","questionId":"692","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6091608967220259,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[693]交替位二进制数","frequency":5.319656503291312,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","questionId":"693","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5291960507757405,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[694]不同岛屿的数量","frequency":5.8641496499728465,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","questionId":"694","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6623845867993026,"acs":0,"articleLive":2,"columnArticles":1159,"formTitle":"[695]岛屿的最大面积","frequency":65.41559658236051,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","questionId":"695","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.630169860137238,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[696]计数二进制子串","frequency":16.440824613492993,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","questionId":"696","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6059556077160235,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[697]数组的度","frequency":33.74435014283262,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","questionId":"697","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44059681915068044,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[698]划分为k个相等的子集","frequency":58.51995110688465,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","questionId":"698","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47238025325747846,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","questionId":"699","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7589661533444083,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[700]二叉搜索树中的搜索","frequency":26.45712438121682,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","questionId":"700","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7239498316011324,"acs":0,"articleLive":2,"columnArticles":521,"formTitle":"[701]二叉搜索树中的插入操作","frequency":29.13942298095397,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","questionId":"701","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7383571690502384,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","questionId":"702","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5118950103492315,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":31.297530792672852,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","questionId":"703","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5549519555296187,"acs":0,"articleLive":2,"columnArticles":1006,"formTitle":"[704]二分查找","frequency":79.41002736957508,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","questionId":"704","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6471599637810176,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[705]设计哈希集合","frequency":55.078458808007355,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","questionId":"705","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6448003431880742,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[706]设计哈希映射","frequency":43.5241561647619,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","questionId":"706","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31749291471083163,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[707]设计链表","frequency":58.348910255299835,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","questionId":"707","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3362352168199737,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":7.645927818924828,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","questionId":"708","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7596727980577853,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[709]转换成小写字母","frequency":5.8641496499728465,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","questionId":"709","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3506954720331459,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[710]黑名单中的随机数","frequency":25.226087579120353,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","questionId":"710","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5750421585160203,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","questionId":"711","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6714894840224213,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":37.33921280172674,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","questionId":"712","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.403546721629288,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[713]乘积小于K的子数组","frequency":41.78122311997896,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","questionId":"713","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7170991999876087,"acs":0,"articleLive":2,"columnArticles":629,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":43.34262013980839,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","questionId":"714","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4026302478502782,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":19.0522059501259,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","questionId":"715","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.45910123706134814,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":5.8641496499728465,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","questionId":"716","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5102734078691336,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[717]1比特与2比特字符","frequency":17.055299153038327,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","questionId":"717","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5639158635080218,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[718]最长重复子数组","frequency":68.71817366809833,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","questionId":"718","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36650177297202646,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":17.055299153038327,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","questionId":"719","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4862112311125933,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[720]词典中最长的单词","frequency":2.898501581778828,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","questionId":"720","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4696762349799733,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[721]账户合并","frequency":46.122200192639085,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","questionId":"721","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3215968762622863,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":33.74435014283262,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","questionId":"722","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7256061502069782,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","questionId":"723","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45632667048999176,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[724]寻找数组的中心下标","frequency":25.918971452343403,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","questionId":"724","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5624969895477097,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[725]分隔链表","frequency":24.559555950910564,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","questionId":"725","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5545911493419007,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[726]原子的数量","frequency":51.94259183508164,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","questionId":"726","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.41313526192337763,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":30.733546932419063,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","questionId":"727","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7589579524680073,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","questionId":"728","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5059318526693337,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[729]我的日程安排表 I","frequency":24.559555950910564,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","questionId":"729","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4880475513632252,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":41.78122311997896,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","questionId":"730","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5097664253517279,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":5.8641496499728465,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","questionId":"731","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.61162199178243,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[732]我的日程安排表 III","frequency":8.977909794422963,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","questionId":"732","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5806451612903226,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[733]图像渲染","frequency":37.91379216914398,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","questionId":"733","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4784892446223112,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","questionId":"734","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4101672174323552,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":30.052239689191424,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","questionId":"735","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.458128078817734,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","questionId":"736","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4616457461645746,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","questionId":"737","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5020454314462852,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[738]单调递增的数字","frequency":31.44128620556848,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","questionId":"738","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6775197575899,"acs":0,"articleLive":2,"columnArticles":1428,"formTitle":"[739]每日温度","frequency":88.57645072097893,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","questionId":"739","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6308969912302964,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[740]删除并获得点数","frequency":61.06329831307256,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","questionId":"740","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3654271163639858,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[741]摘樱桃","frequency":28.149776246328518,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","questionId":"741","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4925675675675676,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","questionId":"742","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5159591585968814,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[743]网络延迟时间","frequency":27.783209649225128,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","questionId":"743","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45919431779556724,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":30.052239689191424,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","questionId":"744","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39107116973474415,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","questionId":"745","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.579527022487547,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.061627540188994,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","questionId":"746","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4146703235195343,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.8641496499728465,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","questionId":"747","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5985193337001651,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[748]最短补全词","frequency":5.319656503291312,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","questionId":"748","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5058209554395825,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":19.0522059501259,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","questionId":"749","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7234615384615385,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":23.91757750582751,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","questionId":"750","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5083612040133779,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","questionId":"751","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5319064956824333,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[752]打开转盘锁","frequency":40.40333856496414,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","questionId":"752","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5872250096487842,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":19.775703257934723,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","questionId":"753","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42757165074427905,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":17.055299153038327,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","questionId":"754","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5006016847172082,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","questionId":"755","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.573794002607562,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":6.432138260819202,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","questionId":"756","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41616448068060974,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":9.694674396372061,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","questionId":"757","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45853397538790797,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[758]字符串中的加粗单词","frequency":14.55397227933976,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","questionId":"758","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6575342465753424,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":7.645927818924828,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","questionId":"759","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8383351588170865,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","questionId":"760","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5939783688979831,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":11.868550582706181,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","questionId":"761","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.697763449526496,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","questionId":"762","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7625640412256045,"acs":0,"articleLive":2,"columnArticles":926,"formTitle":"[763]划分字母区间","frequency":65.10200676933057,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","questionId":"763","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4906152889993785,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","questionId":"764","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6656859745333867,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[765]情侣牵手","frequency":57.80287757337449,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","questionId":"765","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7082177803359322,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[766]托普利茨矩阵","frequency":6.432138260819202,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","questionId":"766","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4774930239389044,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[767]重构字符串","frequency":43.26533686741106,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","questionId":"767","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4997349729672427,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":25.226087579120353,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","questionId":"768","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.590801765732471,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[769]最多能完成排序的块","frequency":5.8641496499728465,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","questionId":"769","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5517744287797763,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","questionId":"770","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514082080996673,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[771]宝石与石头","frequency":44.77985081966752,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","questionId":"771","status":"not_started","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4887974794328724,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":28.149776246328518,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","questionId":"772","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7142992513977068,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":51.62681662693115,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","questionId":"773","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5943728018757327,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","questionId":"774","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4612202688728025,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","questionId":"775","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5709560039695667,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","questionId":"776","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32403369376904234,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":17.69412241561324,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","questionId":"777","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5985441740684291,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[778]水位上升的泳池中游泳","frequency":7.025402965064536,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","questionId":"778","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4355529411764706,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.410170454843225,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","questionId":"779","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2841832963784183,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":19.0522059501259,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","questionId":"780","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6230650271008813,"acs":0,"articleLive":2,"columnArticles":637,"formTitle":"[781]森林中的兔子","frequency":90.50965317170699,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","questionId":"781","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42094081942336875,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.74435014283262,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","questionId":"782","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958131623707968,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":34.410170454843225,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","questionId":"783","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6840513337548488,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[784]字母大小写全排列","frequency":23.91757750582751,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","questionId":"784","status":"not_started","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5109965134622778,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[785]判断二分图","frequency":41.78122311997896,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","questionId":"785","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4606966345022358,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","questionId":"786","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.3934078562473882,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[787]K 站中转内最便宜的航班","frequency":19.25571491566279,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","questionId":"787","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6068716336020876,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[788]旋转数字","frequency":18.3590911498422,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","questionId":"788","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923654482782158,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[789]逃脱阻碍者","frequency":21.643639682331063,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","questionId":"789","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44790652385589097,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","questionId":"790","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6949465376782077,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[791]自定义字符串排序","frequency":35.100661777816974,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","questionId":"791","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4507150293134623,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":17.055299153038327,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","questionId":"792","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3944166666666667,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.319656503291312,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","questionId":"793","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34093746998367114,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.432138260819202,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","questionId":"794","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.534276774285308,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","questionId":"795","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.52303961196443,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[796]旋转字符串","frequency":44.45823546827265,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","questionId":"796","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.45693160813308686,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","questionId":"798","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.40659710535173343,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[799]香槟塔","frequency":51.62681662693115,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","questionId":"799","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7053388090349076,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","questionId":"800","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.417594385285576,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[801]使序列递增的最小交换次数","frequency":8.295932292890154,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","questionId":"801","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5771620230971529,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[802]找到最终的安全状态","frequency":25.226087579120353,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","questionId":"802","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4834394649365213,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","questionId":"803","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7694587705258166,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[804]唯一摩尔斯密码词","frequency":24.559555950910564,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","questionId":"804","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.289734905990891,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[805]数组的均值分割","frequency":17.69412241561324,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","questionId":"805","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6580628673651929,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[806]写字符串需要的行数","frequency":17.055299153038327,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","questionId":"806","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8439640979340379,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[807]保持城市天际线","frequency":5.8641496499728465,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","questionId":"807","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47832974991512955,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":26.640210513642216,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","questionId":"808","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41790503805726714,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[809]情感丰富的文字","frequency":17.69412241561324,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","questionId":"809","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7366596118341063,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[810]黑板异或游戏","frequency":41.07992774372667,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","questionId":"810","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7028271479878442,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[811]子域名访问计数","frequency":16.440824613492993,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","questionId":"811","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6294992412746586,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","questionId":"812","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5470642278459869,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[813]最大平均值和的分组","frequency":7.645927818924828,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","questionId":"813","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6998945316245326,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[814]二叉树剪枝","frequency":5.8641496499728465,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","questionId":"814","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43506625891946993,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[815]公交路线","frequency":84.31838783238656,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","questionId":"815","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.51171875,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":9.694674396372061,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","questionId":"816","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912326545323482,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","questionId":"817","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42923947821806546,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","questionId":"818","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42057758079857527,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":19.0522059501259,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","questionId":"819","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5057040370691049,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[820]单词的压缩编码","frequency":40.18301393748793,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","questionId":"820","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.691751512468644,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[821]字符的最短距离","frequency":30.052239689191424,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","questionId":"821","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.502029520295203,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","questionId":"822","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.42967396440384314,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":11.143925187261475,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","questionId":"823","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6143916299725264,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[824]山羊拉丁文","frequency":5.8641496499728465,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","questionId":"824","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.38940712452263193,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[825]适龄的朋友","frequency":5.8641496499728465,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","questionId":"825","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.37293162660006246,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[826]安排工作以达到最大收益","frequency":5.8641496499728465,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","questionId":"826","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3935568132346539,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[827]最大人工岛","frequency":30.733546932419063,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","questionId":"827","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4874551971326165,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","questionId":"828","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.3610172505779833,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[829]连续整数求和","frequency":30.052239689191424,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","questionId":"829","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431695721077654,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","questionId":"830","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.403462424821539,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","questionId":"831","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7954765326345252,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[832]翻转图像","frequency":48.8271917938307,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","questionId":"832","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4248496993987976,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[833]字符串中的查找与替换","frequency":5.8641496499728465,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","questionId":"833","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292404756127154,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":18.3590911498422,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","questionId":"834","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.572972972972973,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","questionId":"835","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4773268137898748,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[836]矩形重叠","frequency":17.055299153038327,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","questionId":"836","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39690742961094805,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[837]新21点","frequency":17.69412241561324,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","questionId":"837","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5010735174354038,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":4.79705487999359,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","questionId":"838","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5742901773408068,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","questionId":"839","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3586974175734936,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","questionId":"840","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6564250614250614,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[841]钥匙和房间","frequency":17.055299153038327,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","questionId":"841","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4894492508968137,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.416533672737785,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","questionId":"842","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3757142857142857,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":8.977909794422963,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","questionId":"843","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.516194748154378,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[844]比较含退格的字符串","frequency":27.557862355706632,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","questionId":"844","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4201953281169684,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[845]数组中的最长山脉","frequency":33.74435014283262,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","questionId":"845","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111534443556812,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","questionId":"846","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.683894820236164,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[847]访问所有节点的最短路径","frequency":32.61175052305031,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","questionId":"847","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44621513944223107,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","questionId":"848","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4257054492706024,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[849]到最近的人的最大距离","frequency":7.645927818924828,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","questionId":"849","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44130349430702787,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":29.830694663686618,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","questionId":"850","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.48241811175337185,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":25.226087579120353,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","questionId":"851","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7154309493211641,"acs":0,"articleLive":2,"columnArticles":702,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.211401345259894,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","questionId":"852","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38156169282733954,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[853]车队","frequency":36.56306116114526,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","questionId":"853","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.36095732901797123,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":8.295932292890154,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","questionId":"854","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4084507042253521,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[855]考场就座","frequency":17.055299153038327,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","questionId":"855","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6249652156628901,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":38.011272898476534,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","questionId":"856","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46574675324675324,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.36483590908692,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","questionId":"857","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5574677320221266,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":25.918971452343403,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","questionId":"858","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30149306829425565,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[859]亲密字符串","frequency":17.055299153038327,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","questionId":"859","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5865482094418719,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[860]柠檬水找零","frequency":33.74435014283262,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","questionId":"860","status":"not_started","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090325598316139,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[861]翻转矩阵后的得分","frequency":5.8641496499728465,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","questionId":"861","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18752676594026454,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[862]和至少为 K 的最短子数组","frequency":47.563611642367825,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","questionId":"862","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6035308998271961,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":30.007713863839403,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","questionId":"863","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45279444269024316,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","questionId":"864","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.653987167736022,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","questionId":"865","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.22309743464002207,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":17.69412241561324,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","questionId":"866","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6709778513899715,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[867]转置矩阵","frequency":64.54158351652914,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","questionId":"867","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6237592687041469,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","questionId":"868","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5502921905436515,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.8641496499728465,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","questionId":"869","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42324962066082433,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","questionId":"870","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3387183012526734,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[871]最低加油次数","frequency":37.33921280172674,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","questionId":"871","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6521010978906926,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[872]叶子相似的树","frequency":55.125356052925746,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","questionId":"872","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5087288888888889,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":34.410170454843225,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","questionId":"873","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41308434640932445,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[874]模拟行走机器人","frequency":38.011272898476534,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","questionId":"874","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4771858034665954,"acs":0,"articleLive":2,"columnArticles":317,"formTitle":"[875]爱吃香蕉的珂珂","frequency":43.5241561647619,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","questionId":"875","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7061965587512342,"acs":0,"articleLive":2,"columnArticles":1518,"formTitle":"[876]链表的中间结点","frequency":43.806805759582126,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","questionId":"876","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7566985370349039,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[877]石子游戏","frequency":59.30347190002874,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","questionId":"877","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2797457458783023,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","questionId":"878","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5561345960531189,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[879]盈利计划","frequency":72.10220345848266,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","questionId":"879","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25226514067715783,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":8.295932292890154,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","questionId":"880","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.4792275441494092,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[881]救生艇","frequency":33.74435014283262,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","questionId":"881","status":"not_started","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.482434887946699,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","questionId":"882","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.685097730552276,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","questionId":"883","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6609013569570414,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[884]两句话中的不常见单词","frequency":5.319656503291312,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","questionId":"884","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6894869373622915,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[885]螺旋矩阵 III","frequency":30.733546932419063,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","questionId":"885","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.422685871637365,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","questionId":"886","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29172959833860385,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[887]鸡蛋掉落","frequency":68.42101605637603,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","questionId":"887","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6394586315008496,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[888]公平的糖果棒交换","frequency":4.79705487999359,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","questionId":"888","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.679888951628082,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":46.901817015137595,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","questionId":"889","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7256982765939384,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","questionId":"890","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.32609217474795965,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","questionId":"891","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387077997671712,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","questionId":"892","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7236743329011124,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":7.025402965064536,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","questionId":"893","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7737467826939576,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","questionId":"894","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5393469178958138,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[895]最大频率栈","frequency":24.559555950910564,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","questionId":"895","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5867232519082434,"acs":0,"articleLive":2,"columnArticles":707,"formTitle":"[896]单调数列","frequency":40.40333856496414,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","questionId":"896","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7454356083813258,"acs":0,"articleLive":2,"columnArticles":697,"formTitle":"[897]递增顺序搜索树","frequency":59.0419842925638,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","questionId":"897","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.33423371277895686,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.226087579120353,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","questionId":"898","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5348396698687593,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":7.025402965064536,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","questionId":"899","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.49289465554525796,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","questionId":"900","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5405739350693479,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","questionId":"901","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32549989692846837,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":0.0,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","questionId":"902","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5308092056421678,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[903]DI 序列的有效排列","frequency":14.55397227933976,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","questionId":"903","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45265553084759785,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[904]水果成篮","frequency":34.410170454843225,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","questionId":"904","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7014615078179465,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[905]按奇偶排序数组","frequency":30.052239689191424,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","questionId":"905","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2719033232628399,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[906]超级回文数","frequency":39.87875967711606,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","questionId":"906","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31512392513909965,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":34.410170454843225,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","questionId":"907","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6979057955889515,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[908]最小差值 I","frequency":5.8641496499728465,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","questionId":"908","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.46159181550199413,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":40.96549306529091,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","questionId":"909","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3171387326397531,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","questionId":"910","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.4312831389183457,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","questionId":"911","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5669509084225418,"acs":0,"articleLive":2,"columnArticles":987,"formTitle":"[912]排序数组","frequency":83.76652605018326,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","questionId":"912","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.401910686514108,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.694674396372061,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","questionId":"913","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888786166201735,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[914]卡牌分组","frequency":17.055299153038327,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","questionId":"914","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4680033680665193,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":16.440824613492993,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","questionId":"915","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4386688473298727,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","questionId":"916","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.56931574839394,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[917]仅仅反转字母","frequency":35.81762406528862,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","questionId":"917","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3585772174696083,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[918]环形子数组的最大和","frequency":28.76189960150114,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","questionId":"918","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.625536751704976,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","questionId":"919","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.47953374898346435,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","questionId":"920","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.735107591920525,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[921]使括号有效的最少添加","frequency":7.025402965064536,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","questionId":"921","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7144699302051936,"acs":0,"articleLive":2,"columnArticles":815,"formTitle":"[922]按奇偶排序数组 II","frequency":17.055299153038327,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","questionId":"922","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3373730572855299,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[923]三数之和的多种可能","frequency":17.69412241561324,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","questionId":"923","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3595308627047942,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","questionId":"924","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38827658057794595,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","questionId":"925","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5147083402975096,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.69412241561324,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","questionId":"926","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33765575929490427,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":38.14859315392716,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","questionId":"927","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42049050632911394,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","questionId":"928","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6423352010121615,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","questionId":"929","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5449972698843424,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":53.56957035346025,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","questionId":"930","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6593979882900466,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[931]下降路径最小和","frequency":23.298530310509975,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","questionId":"931","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6265507704464639,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[932]漂亮数组","frequency":17.055299153038327,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","questionId":"932","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7234457468681773,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[933]最近的请求次数","frequency":34.410170454843225,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","questionId":"933","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47505610986422525,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[934]最短的桥","frequency":45.18949202740749,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","questionId":"934","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47493917274939174,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","questionId":"935","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3781044095286366,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","questionId":"936","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5878831664774486,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[937]重新排列日志文件","frequency":17.055299153038327,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","questionId":"937","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8181865088920229,"acs":0,"articleLive":2,"columnArticles":781,"formTitle":"[938]二叉搜索树的范围和","frequency":50.888872506135655,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","questionId":"938","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4501188694197411,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","questionId":"939","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.411814825333712,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[940]不同的子序列 II","frequency":5.8641496499728465,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","questionId":"940","status":"not_started","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925709467505133,"acs":0,"articleLive":2,"columnArticles":602,"formTitle":"[941]有效的山脉数组","frequency":5.319656503291312,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","questionId":"941","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7289082504738785,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","questionId":"942","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47385272145144075,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","questionId":"943","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6900009962474679,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","questionId":"944","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.4870029624066425,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":30.052239689191424,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","questionId":"945","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6215638216070742,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[946]验证栈序列","frequency":49.49077172641805,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","questionId":"946","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6127908094597193,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","questionId":"947","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3912035661218425,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","questionId":"948","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3696003696003696,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":34.410170454843225,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","questionId":"949","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7743388192909195,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.055299153038327,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","questionId":"950","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6618891274150777,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":29.39556476926235,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","questionId":"951","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3486493005306319,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","questionId":"952","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5525582573454914,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[953]验证外星语词典","frequency":24.559555950910564,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","questionId":"953","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2989514324573334,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[954]二倍数对数组","frequency":30.052239689191424,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","questionId":"954","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3296,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":6.432138260819202,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","questionId":"955","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43533513270355373,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":25.918971452343403,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","questionId":"956","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3595245608499001,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[957]N 天后的牢房","frequency":25.918971452343403,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","questionId":"957","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.53690464689402,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[958]二叉树的完全性检验","frequency":33.74435014283262,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","questionId":"958","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7436873054306469,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[959]由斜杠划分区域","frequency":24.559555950910564,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","questionId":"959","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5525021695111368,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":8.977909794422963,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","questionId":"960","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768397033656589,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[961]重复 N 次的元素","frequency":17.055299153038327,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","questionId":"961","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4407910914392103,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[962]最大宽度坡","frequency":0.0,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","questionId":"962","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5016319869441045,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","questionId":"963","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.425869432580842,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":17.69412241561324,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","questionId":"964","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839872518196305,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[965]单值二叉树","frequency":5.8641496499728465,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","questionId":"965","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4023812745230686,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[966]元音拼写检查器","frequency":10.419299791816767,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","questionId":"966","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4579263711495116,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","questionId":"967","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4961575609960946,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[968]监控二叉树","frequency":36.690222539998246,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","questionId":"968","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6518916498768749,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":6.432138260819202,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","questionId":"969","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4144268320698369,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","questionId":"970","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.4428706326723324,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":8.295932292890154,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","questionId":"971","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4104180491041805,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":17.69412241561324,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","questionId":"972","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6384579127224165,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[973]最接近原点的 K 个点","frequency":5.319656503291312,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","questionId":"973","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.4654880400229298,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":55.793744236538515,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","questionId":"974","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44243792325056436,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[975]奇偶跳","frequency":7.645927818924828,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","questionId":"975","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5970513737917561,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[976]三角形的最大周长","frequency":24.559555950910564,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","questionId":"976","status":"not_started","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7176761152439356,"acs":0,"articleLive":2,"columnArticles":1143,"formTitle":"[977]有序数组的平方","frequency":47.98886567853306,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","questionId":"977","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4735916472801345,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[978]最长湍流子数组","frequency":16.440824613492993,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","questionId":"978","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122295882763433,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[979]在二叉树中分配硬币","frequency":17.69412241561324,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","questionId":"979","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7334660711402895,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[980]不同路径 III","frequency":26.640210513642216,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","questionId":"980","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.535617394000465,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[981]基于时间的键值存储","frequency":53.39495384347113,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","questionId":"981","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5419541509014022,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","questionId":"982","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6336009634684866,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[983]最低票价","frequency":47.563611642367825,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","questionId":"983","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4163006111535523,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","questionId":"984","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5991472810232628,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[985]查询后的偶数和","frequency":5.8641496499728465,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","questionId":"985","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6763062565236078,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[986]区间列表的交集","frequency":45.641797562340564,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","questionId":"986","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.531948162714113,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":29.49505527390967,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","questionId":"987","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4953905322097166,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","questionId":"988","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47299581978634464,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[989]数组形式的整数加法","frequency":16.440824613492993,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","questionId":"989","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49884530162594015,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[990]等式方程的可满足性","frequency":5.8641496499728465,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","questionId":"990","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5177587262706674,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":17.69412241561324,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","questionId":"991","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4512295081967213,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[992]K 个不同整数的子数组","frequency":17.69412241561324,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","questionId":"992","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5575607138065208,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[993]二叉树的堂兄弟节点","frequency":50.17745760809217,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","questionId":"993","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090476533775503,"acs":0,"articleLive":2,"columnArticles":1335,"formTitle":"[994]腐烂的橘子","frequency":38.011272898476534,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","questionId":"994","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5402439646812637,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[995]K 连续位的最小翻转次数","frequency":25.226087579120353,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","questionId":"995","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.4965202783777298,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[996]正方形数组的数目","frequency":21.292444581631205,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","questionId":"996","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5122753311308459,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[997]找到小镇的法官","frequency":15.278597674784466,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","questionId":"997","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6144151565074135,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","questionId":"998","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913741984417017,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.8641496499728465,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","questionId":"999","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4067919075144509,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":31.44128620556848,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","questionId":"1000","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2912214842622004,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":14.55397227933976,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","questionId":"1001","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.73780642745376,"acs":0,"articleLive":2,"columnArticles":587,"formTitle":"[1002]查找常用字符","frequency":40.40333856496414,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","questionId":"1002","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5759093561563898,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","questionId":"1003","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5986525143029208,"acs":0,"articleLive":2,"columnArticles":679,"formTitle":"[1004]最大连续1的个数 III","frequency":51.56906557539619,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","questionId":"1004","status":"not_started","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5376237165849598,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.564964863382983,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","questionId":"1005","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6277281675273173,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[1006]笨阶乘","frequency":51.62681662693115,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","questionId":"1006","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4639089184060721,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","questionId":"1007","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7266238721551376,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":41.07992774372667,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","questionId":"1008","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5924848581447243,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1009]十进制整数的反码","frequency":5.8641496499728465,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","questionId":"1009","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4495857043026854,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","questionId":"1010","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6271728099155708,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":67.58123907241801,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","questionId":"1011","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3293641878229611,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":22.123496019202573,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","questionId":"1012","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3983548359165296,"acs":0,"articleLive":2,"columnArticles":909,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":35.81762406528862,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","questionId":"1013","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5454959482379547,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[1014]最佳观光组合","frequency":15.278597674784466,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","questionId":"1014","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3536135970519666,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":18.3590911498422,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","questionId":"1015","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5833237227540076,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","questionId":"1016","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.561486818405109,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","questionId":"1017","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5166674580939266,"acs":0,"articleLive":2,"columnArticles":371,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","questionId":"1018","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5974971697824557,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.8641496499728465,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","questionId":"1019","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5366697559468644,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1020]飞地的数量","frequency":24.559555950910564,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","questionId":"1020","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834965848792586,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[1021]删除最外层的括号","frequency":30.052239689191424,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","questionId":"1021","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.701819394523289,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.8641496499728465,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","questionId":"1022","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5643157010915197,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.432138260819202,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","questionId":"1023","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5604281767955801,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1024]视频拼接","frequency":16.440824613492993,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","questionId":"1024","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.709700037459299,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[1025]除数博弈","frequency":42.416533672737785,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","questionId":"1025","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6680812578266314,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","questionId":"1026","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.43307113779065753,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1027]最长等差数列","frequency":31.44128620556848,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","questionId":"1027","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7320386210947538,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[1028]从先序遍历还原二叉树","frequency":17.69412241561324,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","questionId":"1028","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6526281948239833,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","questionId":"1029","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7121212121212122,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":7.025402965064536,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","questionId":"1030","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5669031311154599,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.432138260819202,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","questionId":"1031","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453317964762064,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","questionId":"1032","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3891899703735819,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1033]移动石子直到连续","frequency":5.8641496499728465,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","questionId":"1033","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4322329300799672,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","questionId":"1034","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6276453908699979,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1035]不相交的线","frequency":61.318552034926824,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","questionId":"1035","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2998750120180752,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":6.432138260819202,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","questionId":"1036","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43860232945091515,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","questionId":"1037","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.793815110585297,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":5.319656503291312,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","questionId":"1038","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5527862985685071,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","questionId":"1039","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5225280326197758,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","questionId":"1040","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48126071082631694,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1041]困于环中的机器人","frequency":24.559555950910564,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","questionId":"1041","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5268064142194745,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1042]不邻接植花","frequency":16.440824613492993,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","questionId":"1042","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6903667573398368,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","questionId":"1043","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20958839299794985,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":52.88011442905138,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","questionId":"1044","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6442590775269872,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1045]买下所有产品的客户","frequency":5.8641496499728465,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","questionId":"1045","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.65948178437134,"acs":0,"articleLive":2,"columnArticles":894,"formTitle":"[1046]最后一块石头的重量","frequency":30.733546932419063,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","questionId":"1046","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259628284058853,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":76.6824522091135,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","questionId":"1047","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4507403043188688,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1048]最长字符串链","frequency":30.733546932419063,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","questionId":"1048","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.641896397495324,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.0419842925638,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","questionId":"1049","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7568093385214008,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.8641496499728465,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","questionId":"1050","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7518852763011498,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1051]高度检查器","frequency":5.8641496499728465,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","questionId":"1051","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5808640214330898,"acs":0,"articleLive":2,"columnArticles":735,"formTitle":"[1052]爱生气的书店老板","frequency":30.052239689191424,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","questionId":"1052","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.459085153529598,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":17.055299153038327,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","questionId":"1053","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37545796492599287,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1054]距离相等的条形码","frequency":17.055299153038327,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","questionId":"1054","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5852585258525853,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","questionId":"1055","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.4063519959829274,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","questionId":"1056","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.4610749960361503,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","questionId":"1057","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.3382663847780127,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","questionId":"1058","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3593696471394313,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","questionId":"1059","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5291357059053579,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":30.052239689191424,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","questionId":"1060","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5992705721449738,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","questionId":"1061","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.535829239369812,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","questionId":"1062","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6978330658105939,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","questionId":"1063","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.651097748566634,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","questionId":"1064","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5378787878787878,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","questionId":"1065","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47205272150353916,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","questionId":"1066","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","questionId":"1067","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8639389056260072,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","questionId":"1068","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8202521670606777,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.8641496499728465,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","questionId":"1069","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48316329932653196,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1070]产品销售分析 III","frequency":5.8641496499728465,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","questionId":"1070","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5866313654024687,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1071]字符串的最大公因子","frequency":5.8641496499728465,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","questionId":"1071","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5782979495554346,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":9.694674396372061,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","questionId":"1072","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33731300345224396,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":10.419299791816767,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","questionId":"1073","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6699336772291821,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.82964520860451,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","questionId":"1074","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6953235710911667,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","questionId":"1075","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49727377582048865,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","questionId":"1076","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7204687981906035,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","questionId":"1077","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6217503147063653,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","questionId":"1078","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7350596252129472,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1079]活字印刷","frequency":5.319656503291312,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","questionId":"1079","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4895205974463985,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","questionId":"1080","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5708799603584259,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":41.78122311997896,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","questionId":"1081","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.759389421370252,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1082]销售分析 I ","frequency":7.025402965064536,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","questionId":"1082","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5273861171366594,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.69412241561324,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","questionId":"1083","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.538616295965128,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","questionId":"1084","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.773356781710266,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","questionId":"1085","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6897953462293244,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","questionId":"1086","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5306936771025169,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","questionId":"1087","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44483985765124556,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","questionId":"1088","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5852306723350653,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":5.8641496499728465,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","questionId":"1089","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.54131462122297,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","questionId":"1090","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3773746258628062,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":39.74983259469025,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","questionId":"1091","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4883210221601118,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1092]最短公共超序列","frequency":19.775703257934723,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","questionId":"1092","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.386685552407932,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1093]大样本统计","frequency":9.694674396372061,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","questionId":"1093","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6182699210337401,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[1094]拼车","frequency":15.849079142149241,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","questionId":"1094","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3732060230570151,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","questionId":"1095","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5582608695652174,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","questionId":"1096","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5187170718180978,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":32.17746110350195,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","questionId":"1097","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4734494773519164,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1098]小众书籍","frequency":17.69412241561324,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","questionId":"1098","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5796443435489973,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","questionId":"1099","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.6979045401629802,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","questionId":"1100","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6669565217391304,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","questionId":"1101","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.3654470011316484,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","questionId":"1102","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6365558857309537,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":17.055299153038327,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","questionId":"1103","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7613838443713963,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[1104]二叉树寻路","frequency":20.84778829349273,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","questionId":"1104","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.555703358829398,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","questionId":"1105","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5733408482457376,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1106]解析布尔表达式","frequency":18.3590911498422,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","questionId":"1106","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4105199516324063,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1107]每日新用户统计","frequency":6.432138260819202,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","questionId":"1107","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.839111427409516,"acs":0,"articleLive":2,"columnArticles":672,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","questionId":"1108","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5081493850997583,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[1109]航班预订统计","frequency":39.74983259469025,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","questionId":"1109","status":"not_started","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6267090429359559,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1110]删点成林","frequency":18.3590911498422,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","questionId":"1110","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7724920768384969,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":25.226087579120353,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","questionId":"1111","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.64197306152166,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1112]每位学生的最高成绩","frequency":17.055299153038327,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","questionId":"1112","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5428229869353599,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","questionId":"1113","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6525572410859857,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[1114]按序打印","frequency":81.75194698501215,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","questionId":"1114","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5608918911497378,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[1115]交替打印FooBar","frequency":57.9442583797429,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","questionId":"1115","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5148905286077174,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1116]打印零与奇偶数","frequency":57.80287757337449,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","questionId":"1116","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5213322759714513,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1117]H2O 生成","frequency":43.5241561647619,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","questionId":"1117","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6411428571428571,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","questionId":"1118","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8662649328681679,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","questionId":"1119","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6039007946063087,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":7.645927818924828,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","questionId":"1120","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","questionId":"1121","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7070277628994822,"acs":0,"articleLive":2,"columnArticles":858,"formTitle":"[1122]数组的相对排序","frequency":51.254408282865896,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","questionId":"1122","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.704406532250707,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","questionId":"1123","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31517357950851643,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":7.025402965064536,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","questionId":"1124","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49030190588632144,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","questionId":"1125","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6964308235590869,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1126]查询活跃业务","frequency":5.8641496499728465,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","questionId":"1126","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41693327239488115,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","questionId":"1127","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448117061576172,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.440824613492993,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","questionId":"1128","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37886467308667005,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":7.025402965064536,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","questionId":"1129","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6266814897165092,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","questionId":"1130","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45277820296953925,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","questionId":"1131","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3939785740672331,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1132]报告的记录 II","frequency":17.055299153038327,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","questionId":"1132","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6436597110754414,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","questionId":"1133","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7742504409171076,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","questionId":"1134","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5341087418074403,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":23.91757750582751,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","questionId":"1135","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5671406003159558,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","questionId":"1136","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6055972223487921,"acs":0,"articleLive":2,"columnArticles":792,"formTitle":"[1137]第 N 个泰波那契数","frequency":13.219211211340701,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","questionId":"1137","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43141657010428736,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1138]字母板上的路径","frequency":6.432138260819202,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","questionId":"1138","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4762634806513005,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.3590911498422,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","questionId":"1139","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6540398952246625,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":7.025402965064536,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","questionId":"1140","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5122984647554064,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":5.8641496499728465,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","questionId":"1141","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3715177436134551,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","questionId":"1142","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.632322628953147,"acs":0,"articleLive":2,"columnArticles":1041,"formTitle":"[1143]最长公共子序列","frequency":83.78086081330434,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","questionId":"1143","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417646027012805,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":23.91757750582751,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","questionId":"1144","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46877504918749546,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":35.100661777816974,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","questionId":"1145","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2863058481656375,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","questionId":"1146","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5547233261999388,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","questionId":"1147","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.717925925925926,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","questionId":"1148","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4439429499909731,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","questionId":"1149","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6075949367088608,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.3590911498422,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","questionId":"1150","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48348878245525584,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":15.849079142149241,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","questionId":"1151","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3834087481146305,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1152]用户网站访问行为分析","frequency":14.55397227933976,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","questionId":"1152","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3716018872163559,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","questionId":"1153","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5655617483132883,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1154]一年中的第几天","frequency":5.319656503291312,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","questionId":"1154","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4795442501324854,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1155]掷骰子的N种方法","frequency":6.432138260819202,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","questionId":"1155","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4339519151659201,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","questionId":"1156","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31284363316472397,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":9.694674396372061,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","questionId":"1157","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5513590219408362,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","questionId":"1158","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4947006588370095,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1159]市场分析 II","frequency":19.775703257934723,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","questionId":"1159","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.687800963081862,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[1160]拼写单词","frequency":17.055299153038327,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","questionId":"1160","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6338518979464841,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1161]最大层内元素和","frequency":0.0,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","questionId":"1161","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4689239156497268,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[1162]地图分析","frequency":32.17746110350195,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","questionId":"1162","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26721196541247955,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1163]按字典序排在最后的子串","frequency":7.645927818924828,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","questionId":"1163","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6174425456688274,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1164]指定日期的产品价格","frequency":17.69412241561324,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","questionId":"1164","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.837981257762222,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","questionId":"1165","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4817024661893397,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","questionId":"1166","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4207352655125462,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","questionId":"1167","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5693815987933635,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":10.419299791816767,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","questionId":"1168","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3225279619914877,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1169]查询无效交易","frequency":18.3590911498422,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","questionId":"1169","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6172533920058673,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":7.025402965064536,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","questionId":"1170","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47187063135225,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":6.432138260819202,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","questionId":"1171","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2711864406779661,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","questionId":"1172","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7571457326892109,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","questionId":"1173","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6195532266960838,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","questionId":"1174","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48757237678294024,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","questionId":"1175","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.44470613424686867,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":7.645927818924828,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","questionId":"1176","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2637922630389507,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1177]构建回文串检测","frequency":7.025402965064536,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","questionId":"1177","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4621470058081314,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":45.18949202740749,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","questionId":"1178","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6339862056768945,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":53.07467572004116,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","questionId":"1179","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7733674775928298,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":7.645927818924828,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","questionId":"1180","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3694380879735571,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","questionId":"1181","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3824027072758037,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","questionId":"1182","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6001908396946565,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","questionId":"1183","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5850444514644163,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[1184]公交站间的距离","frequency":17.055299153038327,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","questionId":"1184","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.610020197486535,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":16.440824613492993,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","questionId":"1185","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.391713955153986,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":27.36483590908692,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","questionId":"1186","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4370186335403727,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","questionId":"1187","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6924113156713066,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","questionId":"1188","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.644492702711334,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[1189]“气球” 的最大数量","frequency":5.319656503291312,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","questionId":"1189","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508363247536851,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[1190]反转每对括号间的子串","frequency":96.43736661056786,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","questionId":"1190","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2676393427532563,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","questionId":"1191","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49904543718976707,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","questionId":"1192","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.611368771554287,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.8641496499728465,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","questionId":"1193","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5135177617101541,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1194]锦标赛优胜者","frequency":6.432138260819202,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","questionId":"1194","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6353456669912366,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1195]交替打印字符串","frequency":30.052239689191424,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","questionId":"1195","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6916683980885103,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","questionId":"1196","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36604948386039654,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":19.0522059501259,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","questionId":"1197","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.747641035936559,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","questionId":"1198","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","questionId":"1199","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6858953914846116,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1200]最小绝对差","frequency":17.055299153038327,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","questionId":"1200","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24689308818522301,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","questionId":"1201","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5025338159649457,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[1202]交换字符串中的元素","frequency":6.432138260819202,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","questionId":"1202","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6248697102355639,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1203]项目管理","frequency":9.694674396372061,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","questionId":"1203","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7274881516587678,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1204]最后一个能进入电梯的人","frequency":18.3590911498422,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","questionId":"1204","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46789079023264757,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1205]每月交易II","frequency":25.226087579120353,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","questionId":"1205","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6186482486433152,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1206]设计跳表","frequency":17.69412241561324,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","questionId":"1206","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7302640537763527,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","questionId":"1207","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4962570009974024,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[1208]尽可能使字符串相等","frequency":25.226087579120353,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","questionId":"1208","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5329441201000834,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":35.100661777816974,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","questionId":"1209","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44832426741533604,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":0.0,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","questionId":"1210","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6592606966139517,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":17.055299153038327,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","questionId":"1211","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5155238617663193,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.8641496499728465,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","questionId":"1212","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7728200244864645,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1213]三个有序数组的交集","frequency":18.3590911498422,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","questionId":"1213","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6320235756385069,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":9.694674396372061,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","questionId":"1214","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40878597706124215,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":12.593175978150889,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","questionId":"1215","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5325877362128808,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","questionId":"1216","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6943720085822743,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[1217]玩筹码","frequency":35.100661777816974,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","questionId":"1217","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42147148729840833,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","questionId":"1218","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6306635407011614,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1219]黄金矿工","frequency":35.100661777816974,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","questionId":"1219","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5262935883014623,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","questionId":"1220","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8041652603784073,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[1221]分割平衡字符串","frequency":16.440824613492993,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","questionId":"1221","status":"not_started","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6718408925539655,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","questionId":"1222","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.47363038714390066,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1223]掷骰子模拟","frequency":10.419299791816767,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","questionId":"1223","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.32476735862562633,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":25.918971452343403,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","questionId":"1224","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5454872348076232,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1225]报告系统状态的连续日期","frequency":19.775703257934723,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","questionId":"1225","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6006218505414388,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1226]哲学家进餐","frequency":52.65550695098638,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","questionId":"1226","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6618926882752004,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":5.319656503291312,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","questionId":"1227","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5389340560072268,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","questionId":"1228","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.4124335228314689,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","questionId":"1229","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.4870083002526164,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","questionId":"1230","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.5552631578947368,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":21.292444581631205,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","questionId":"1231","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4690710752188068,"acs":0,"articleLive":2,"columnArticles":410,"formTitle":"[1232]缀点成线","frequency":16.440824613492993,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","questionId":"1232","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4814698096558679,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.432138260819202,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","questionId":"1233","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34139897928549984,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1234]替换子串得到平衡字符串","frequency":17.055299153038327,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","questionId":"1234","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4505298924035272,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1235]规划兼职工作","frequency":40.18301393748793,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","questionId":"1235","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.5593390085127692,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","questionId":"1236","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7114961300859192,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","questionId":"1237","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.655118809682434,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1238]循环码排列","frequency":8.295932292890154,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","questionId":"1238","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49067043211388556,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[1239]串联字符串的最大长度","frequency":41.07992774372667,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","questionId":"1239","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4948432760364004,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":33.74435014283262,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","questionId":"1240","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5968081903041252,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","questionId":"1241","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4637048790162634,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":19.0522059501259,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","questionId":"1242","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393330483112441,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","questionId":"1243","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6220961642355484,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1244]力扣排行榜","frequency":8.977909794422963,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","questionId":"1244","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5059461086858347,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":7.025402965064536,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","questionId":"1245","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4791352438411262,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1246]删除回文子数组","frequency":16.440824613492993,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","questionId":"1246","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6152103315459557,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1247]交换字符使得字符串相同","frequency":31.44128620556848,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","questionId":"1247","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5584678758886453,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1248]统计「优美子数组」","frequency":16.440824613492993,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","questionId":"1248","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5718645186121956,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1249]移除无效的括号","frequency":37.33921280172674,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","questionId":"1249","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5603615235635894,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":18.3590911498422,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","questionId":"1250","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7722579985689462,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":5.8641496499728465,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","questionId":"1251","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.74985130427394,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","questionId":"1252","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3935693306538878,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":20.500328653379427,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","questionId":"1253","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5994465430905737,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.79705487999359,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","questionId":"1254","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6766337111164697,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","questionId":"1255","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","questionId":"1256","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","questionId":"1257","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","questionId":"1258","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47622603933283547,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1259]不相交的握手","frequency":15.278597674784466,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","questionId":"1259","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6034300126103405,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","questionId":"1260","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7299569808369183,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","questionId":"1261","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5264790887453247,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1262]可被三整除的最大和","frequency":43.07346788366307,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","questionId":"1262","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4171542742971314,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1263]推箱子","frequency":11.143925187261475,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","questionId":"1263","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5735518292682927,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":7.025402965064536,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","questionId":"1264","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9192680301399354,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1265]逆序打印不可变链表","frequency":7.025402965064536,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","questionId":"1265","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8235458769523596,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1266]访问所有点的最小时间","frequency":23.91757750582751,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","questionId":"1266","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6090423734540785,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","questionId":"1267","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5807054426535856,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1268]搜索推荐系统","frequency":6.432138260819202,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","questionId":"1268","status":"not_started","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4917699854234568,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.563611642367825,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","questionId":"1269","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8046518264840182,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":15.849079142149241,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","questionId":"1270","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.504870817450233,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","questionId":"1271","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5191661062542031,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","questionId":"1272","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5409367179120487,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","questionId":"1273","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5970719287078294,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","questionId":"1274","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5399041752224504,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":17.055299153038327,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","questionId":"1275","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5007910140800507,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","questionId":"1276","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7237358762721372,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":24.559555950910564,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","questionId":"1277","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5947082530226038,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":59.26356236186536,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","questionId":"1278","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6211745244003308,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":21.292444581631205,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","questionId":"1279","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5066449245821443,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.440824613492993,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","questionId":"1280","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8314280394712344,"acs":0,"articleLive":2,"columnArticles":604,"formTitle":"[1281]整数的各位积和之差","frequency":24.559555950910564,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","questionId":"1281","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113065498596947,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":5.8641496499728465,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","questionId":"1282","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4156656346749226,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.055299153038327,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","questionId":"1283","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6587490102929533,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":20.500328653379427,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","questionId":"1284","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8121019108280255,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","questionId":"1285","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.644559730790802,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1286]字母组合迭代器","frequency":17.055299153038327,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","questionId":"1286","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6056406713536798,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":17.055299153038327,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","questionId":"1287","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5635600785574004,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1288]删除被覆盖区间","frequency":29.39556476926235,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","questionId":"1288","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.630176876617774,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","questionId":"1289","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8089529990838936,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","questionId":"1290","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5175283149703367,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","questionId":"1291","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4689358889623265,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.432138260819202,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","questionId":"1292","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35566076334093166,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1293]网格中的最短路径","frequency":55.793744236538515,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","questionId":"1293","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.660266774454325,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","questionId":"1294","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8094207007956556,"acs":0,"articleLive":2,"columnArticles":625,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.8641496499728465,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","questionId":"1295","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4520315342631898,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","questionId":"1296","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45992057655537577,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1297]子串的最大出现次数","frequency":25.918971452343403,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","questionId":"1297","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5947757743874249,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","questionId":"1298","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7855200992424842,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","questionId":"1299","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.46750305274353016,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":5.8641496499728465,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","questionId":"1300","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35873131607728764,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","questionId":"1301","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.816508983595174,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1302]层数最深叶子节点的和","frequency":25.226087579120353,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","questionId":"1302","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.821720705627279,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","questionId":"1303","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7258861891238035,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.319656503291312,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","questionId":"1304","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7473259959696171,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.319656503291312,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","questionId":"1305","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5774533657745337,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":17.69412241561324,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","questionId":"1306","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3313587560162903,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","questionId":"1307","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7513979144627475,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":6.432138260819202,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","questionId":"1308","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552656104380242,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","questionId":"1309","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7122740321204127,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[1310]子数组异或查询","frequency":52.88011442905138,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","questionId":"1310","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37568478718921194,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1311]获取你好友已观看的视频","frequency":7.025402965064536,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","questionId":"1311","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6658703071672355,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":33.74435014283262,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","questionId":"1312","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8310263335584065,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[1313]解压缩编码列表","frequency":5.8641496499728465,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","questionId":"1313","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7337911095048789,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1314]矩阵区域和","frequency":35.100661777816974,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","questionId":"1314","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8096165076893128,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","questionId":"1315","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.4375,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","questionId":"1316","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6141859885315383,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","questionId":"1317","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6483938164674926,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.23775496577838,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","questionId":"1318","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6176888394787228,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[1319]连通网络的操作次数","frequency":6.432138260819202,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","questionId":"1319","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5874108679616424,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","questionId":"1320","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6180942345325907,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","questionId":"1321","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5927385644332975,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","questionId":"1322","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7554314688232086,"acs":0,"articleLive":2,"columnArticles":465,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.559555950910564,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","questionId":"1323","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5922693266832918,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","questionId":"1324","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7281050656660413,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.8641496499728465,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","questionId":"1325","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4756246723746287,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":8.295932292890154,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","questionId":"1326","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6937786156746566,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","questionId":"1327","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.4565815006468305,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1328]破坏回文串","frequency":17.69412241561324,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","questionId":"1328","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7743383199079401,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1329]将矩阵按对角线排序","frequency":7.025402965064536,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","questionId":"1329","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3760826115922718,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":17.69412241561324,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","questionId":"1330","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5346726542188608,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1331]数组序号转换","frequency":5.319656503291312,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","questionId":"1331","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6830862789813759,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.8641496499728465,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","questionId":"1332","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5422605902429231,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","questionId":"1333","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4870937790157846,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.69428069195494,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","questionId":"1334","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5814651368049426,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","questionId":"1335","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.42247474747474745,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","questionId":"1336","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7073239278286774,"acs":0,"articleLive":2,"columnArticles":605,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":14.209276780639735,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","questionId":"1337","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6400205158264948,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1338]数组大小减半","frequency":5.319656503291312,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","questionId":"1338","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39606825666101186,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":7.645927818924828,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","questionId":"1339","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5711770283082758,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","questionId":"1340","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4838610513372272,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","questionId":"1341","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8202215901179559,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","questionId":"1342","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5418316293234718,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","questionId":"1343","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.5928837401737691,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1344]时钟指针的夹角","frequency":7.025402965064536,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","questionId":"1344","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3675089297526128,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1345]跳跃游戏 IV","frequency":7.645927818924828,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","questionId":"1345","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4361009361009361,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","questionId":"1346","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7377786468517794,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","questionId":"1347","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30283531067765934,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":8.295932292890154,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","questionId":"1348","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5004220834036806,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1349]参加考试的最大学生数","frequency":7.025402965064536,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","questionId":"1349","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8477659574468085,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.8641496499728465,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","questionId":"1350","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7544229917402746,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.319656503291312,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","questionId":"1351","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4411230618801509,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":7.025402965064536,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","questionId":"1352","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28266183079713003,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1353]最多可以参加的会议数目","frequency":52.65550695098638,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","questionId":"1353","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.2850715746421268,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","questionId":"1354","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6624511809559234,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","questionId":"1355","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.73178191704562,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.440824613492993,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","questionId":"1356","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5268996117581808,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","questionId":"1357","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48497735046685775,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.8641496499728465,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","questionId":"1358","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5441688870670219,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","questionId":"1359","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5035837864557587,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":34.410170454843225,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","questionId":"1360","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40109858995413106,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[1361]验证二叉树","frequency":5.319656503291312,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","questionId":"1361","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5233548916948979,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","questionId":"1362","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.35998442973919814,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":35.100661777816974,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","questionId":"1363","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6755353666450357,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.8641496499728465,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","questionId":"1364","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.825009865824783,"acs":0,"articleLive":2,"columnArticles":1074,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.559555950910564,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","questionId":"1365","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5362022930736611,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":17.69412241561324,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","questionId":"1366","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41674241563458697,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1367]二叉树中的列表","frequency":16.440824613492993,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","questionId":"1367","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5175531113454874,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","questionId":"1368","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6070201276386843,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1369]获取最近第二次的活动","frequency":7.025402965064536,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","questionId":"1369","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905560165975104,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":0.0,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","questionId":"1370","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5798591706717335,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.07992774372667,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","questionId":"1371","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5148123765635286,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":7.025402965064536,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","questionId":"1372","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39635280982508375,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":24.559555950910564,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","questionId":"1373","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7387190359294801,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","questionId":"1374","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.570872327344764,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","questionId":"1375","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5038873712964909,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":5.8641496499728465,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","questionId":"1376","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.32538659793814434,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","questionId":"1377","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8622814740284241,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","questionId":"1378","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8363409563409563,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","questionId":"1379","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7274649154372076,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","questionId":"1380","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7322425914974703,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","questionId":"1381","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6886557377049181,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1382]将二叉搜索树变平衡","frequency":7.025402965064536,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","questionId":"1382","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32276092321091593,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":9.694674396372061,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","questionId":"1383","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5419892793329363,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","questionId":"1384","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7035055149066288,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1385]两个数组间的距离值","frequency":5.8641496499728465,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","questionId":"1385","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3098211972013475,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":20.500328653379427,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","questionId":"1386","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6945769428340794,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.0522059501259,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","questionId":"1387","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.535680174648656,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":56.53556503447537,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","questionId":"1388","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8306235912847483,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1389]按既定顺序创建目标数组","frequency":17.055299153038327,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","questionId":"1389","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3504117108874657,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","questionId":"1390","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.39916827012600087,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":20.500328653379427,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","questionId":"1391","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.3983807464093606,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1392]最长快乐前缀","frequency":5.8641496499728465,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","questionId":"1392","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8567567567567568,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","questionId":"1393","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6642276751424991,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","questionId":"1394","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7545901639344262,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.8641496499728465,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","questionId":"1395","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41488958392569425,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1396]设计地铁系统","frequency":20.500328653379427,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","questionId":"1396","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3655146506386176,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","questionId":"1397","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7727015291674533,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","questionId":"1398","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6667658877809198,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","questionId":"1399","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6036606033216586,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.319656503291312,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","questionId":"1400","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.414768350390668,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1401]圆和矩形是否有重叠","frequency":7.025402965064536,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","questionId":"1401","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7509145597918868,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":6.432138260819202,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","questionId":"1402","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6913658929290218,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.440824613492993,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","questionId":"1403","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4914269717964868,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.645927818924828,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","questionId":"1404","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5057525462089777,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1405]最长快乐字符串","frequency":17.69412241561324,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","questionId":"1405","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568015602145295,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":5.8641496499728465,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","questionId":"1406","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6675069019325411,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":16.440824613492993,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","questionId":"1407","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6136777532828525,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","questionId":"1408","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8053513071895425,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","questionId":"1409","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.47681425203039035,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":8.977909794422963,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","questionId":"1410","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5494937723067959,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":81.24803112138042,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","questionId":"1411","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5495592345732101,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","questionId":"1412","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6914800618653756,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":17.055299153038327,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","questionId":"1413","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6020787561264154,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","questionId":"1414","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6841766723842195,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":5.319656503291312,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","questionId":"1415","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40784726398075766,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":25.918971452343403,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","questionId":"1416","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5188749688874139,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1417]重新格式化字符串","frequency":5.319656503291312,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","questionId":"1417","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7332837826248535,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":50.4589595075389,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","questionId":"1418","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41794203842396616,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":25.918971452343403,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","questionId":"1419","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5922649140546006,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.91757750582751,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","questionId":"1420","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7497086247086248,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","questionId":"1421","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5403703506056887,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[1422]分割字符串的最大得分","frequency":30.052239689191424,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","questionId":"1422","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5545499181669394,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[1423]可获得的最大点数","frequency":16.440824613492993,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","questionId":"1423","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3960937985942651,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1424]对角线遍历 II","frequency":17.69412241561324,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","questionId":"1424","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4336435218324982,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":7.025402965064536,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","questionId":"1425","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7037617554858934,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":0.0,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","questionId":"1426","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6588785046728972,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","questionId":"1427","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5906382978723405,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","questionId":"1428","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5077294685990338,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","questionId":"1429","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5766423357664233,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","questionId":"1430","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.8461227830832196,"acs":0,"articleLive":2,"columnArticles":1021,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.8641496499728465,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","questionId":"1431","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39224834021173516,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","questionId":"1432","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6409232134931203,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","questionId":"1433","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4464772284935773,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","questionId":"1434","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6215434083601287,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","questionId":"1435","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7831019555157486,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","questionId":"1436","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5892487123320111,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":5.8641496499728465,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","questionId":"1437","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4819212088505127,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":32.17746110350195,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","questionId":"1438","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5605437875434713,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","questionId":"1439","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6954215522054717,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","questionId":"1440","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6466039004707465,"acs":0,"articleLive":2,"columnArticles":356,"formTitle":"[1441]用栈操作构建数组","frequency":7.025402965064536,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","questionId":"1441","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7916609076249712,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":54.283759835801014,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","questionId":"1442","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41064981949458484,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","questionId":"1443","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5237798546209761,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","questionId":"1444","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8569434752267969,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","questionId":"1445","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5729383886255924,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","questionId":"1446","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.617032788659236,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","questionId":"1447","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7136438874438401,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.79705487999359,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","questionId":"1448","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276064838098185,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.56306116114526,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","questionId":"1449","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8022445162387349,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":16.440824613492993,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","questionId":"1450","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5211780455153949,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":7.025402965064536,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","questionId":"1451","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4972038200120451,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":8.295932292890154,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","questionId":"1452","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","questionId":"1453","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.4028845323430348,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":19.0522059501259,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","questionId":"1454","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6340285400658617,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","questionId":"1455","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5181745261113692,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","questionId":"1456","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6369840486762046,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","questionId":"1457","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.4401736892891605,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","questionId":"1458","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5948761261261262,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","questionId":"1459","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7438753906643815,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","questionId":"1460","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.49888542131074454,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","questionId":"1461","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4253653444676409,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1462]课程表 IV","frequency":5.8641496499728465,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","questionId":"1462","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5883155262559673,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1463]摘樱桃 II","frequency":10.419299791816767,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","questionId":"1463","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.767610528542504,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1464]数组中两元素的最大乘积","frequency":5.8641496499728465,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","questionId":"1464","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3075263421976919,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","questionId":"1465","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.4841143764892772,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1466]重新规划路线","frequency":18.3590911498422,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","questionId":"1466","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6112828438948995,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","questionId":"1467","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7148033126293996,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","questionId":"1468","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8029480217222653,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","questionId":"1469","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.84339265064885,"acs":0,"articleLive":2,"columnArticles":718,"formTitle":"[1470]重新排列数组","frequency":41.78122311997896,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","questionId":"1470","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5411401925391095,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","questionId":"1471","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6163355784806889,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","questionId":"1472","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6751651254953764,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.739802950818955,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","questionId":"1473","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7179384738314023,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","questionId":"1474","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7241689128481581,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","questionId":"1475","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8657436542899098,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":18.3590911498422,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","questionId":"1476","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2898235586481113,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":19.775703257934723,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","questionId":"1477","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5698949291914116,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":28.149776246328518,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","questionId":"1478","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5755141388174807,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1479]周内每天的销售情况","frequency":8.977909794422963,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","questionId":"1479","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8544776119402985,"acs":0,"articleLive":2,"columnArticles":1071,"formTitle":"[1480]一维数组的动态和","frequency":62.03761232593633,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","questionId":"1480","status":"not_started","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5137015859316,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1481]不同整数的最少数目","frequency":17.055299153038327,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","questionId":"1481","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5869861829083153,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":50.4589595075389,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","questionId":"1482","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3007139457401238,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","questionId":"1483","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8030467899891186,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","questionId":"1484","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6626231993934799,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","questionId":"1485","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585633737356442,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":48.24850890238516,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","questionId":"1486","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30743173462221673,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1487]保证文件名唯一","frequency":25.226087579120353,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","questionId":"1487","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23461839997273068,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1488]避免洪水泛滥","frequency":59.51766998620225,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","questionId":"1488","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6932336312237826,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","questionId":"1489","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.8556782334384858,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","questionId":"1490","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6711078727316887,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","questionId":"1491","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6665226781857452,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","questionId":"1492","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5666959367765626,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":23.298530310509975,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","questionId":"1493","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3594080338266385,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":28.149776246328518,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","questionId":"1494","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5423929098966026,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","questionId":"1495","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5383024914711051,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1496]判断路径是否相交","frequency":4.79705487999359,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","questionId":"1496","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3920720537349888,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","questionId":"1497","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.33202396804260986,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":17.69412241561324,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","questionId":"1498","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37801047120418846,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","questionId":"1499","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2894736842105263,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","questionId":"1500","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5916353383458647,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":23.91757750582751,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","questionId":"1501","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7180422600980622,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[1502]判断能否形成等差数列","frequency":29.39556476926235,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","questionId":"1502","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.51169409726519,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.3590911498422,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","questionId":"1503","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5930339907679396,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1504]统计全 1 子矩形","frequency":33.74435014283262,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","questionId":"1504","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.35749010740531373,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":34.580413284191515,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","questionId":"1505","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8388704318936877,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":32.17746110350195,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","questionId":"1506","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5904419321685509,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1507]转变日期格式","frequency":30.052239689191424,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","questionId":"1507","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5516265912305516,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.432138260819202,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","questionId":"1508","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5444483280904113,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","questionId":"1509","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5753012048192772,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":16.440824613492993,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","questionId":"1510","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.681728527882374,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":5.8641496499728465,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","questionId":"1511","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.848475006643243,"acs":0,"articleLive":2,"columnArticles":732,"formTitle":"[1512]好数对的数目","frequency":5.319656503291312,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","questionId":"1512","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37795551813653266,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1513]仅含 1 的子串数","frequency":6.432138260819202,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","questionId":"1513","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31465365682137836,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","questionId":"1514","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.3406423034330011,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":12.593175978150889,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","questionId":"1515","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5337078651685393,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","questionId":"1516","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7280459770114942,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","questionId":"1517","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6751493192175956,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":23.91757750582751,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","questionId":"1518","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.29517309703340855,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","questionId":"1519","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.32927159490928787,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","questionId":"1520","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39589442815249265,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":16.440824613492993,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","questionId":"1521","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7003444316877153,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","questionId":"1522","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5771591806965295,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","questionId":"1523","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42251299183370455,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.440824613492993,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","questionId":"1524","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6598648297374577,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.432138260819202,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","questionId":"1525","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6121025641025641,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","questionId":"1526","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5083499310556151,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","questionId":"1527","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7841116478797638,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1528]重新排列字符串","frequency":15.849079142149241,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","questionId":"1528","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6886635506614909,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1529]灯泡开关 IV","frequency":5.8641496499728465,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","questionId":"1529","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5658105939004815,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1530]好叶子节点对的数量","frequency":19.0522059501259,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","questionId":"1530","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3220864490242568,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":22.99714189890724,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","questionId":"1531","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6211242752709857,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":5.8641496499728465,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","questionId":"1532","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6093023255813953,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","questionId":"1533","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7883457398890522,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1534]统计好三元组","frequency":5.319656503291312,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","questionId":"1534","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.4524546814655022,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.645927818924828,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","questionId":"1535","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4380002192742024,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","questionId":"1536","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3651680636694607,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","questionId":"1537","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5956284153005464,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","questionId":"1538","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5369523477046605,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[1539]第 k 个缺失的正整数","frequency":57.11054153563997,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","questionId":"1539","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3155241935483871,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","questionId":"1540","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4571099597006333,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","questionId":"1541","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.3784694368682817,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","questionId":"1542","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5476817169467504,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","questionId":"1543","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5430393820586342,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[1544]整理字符串","frequency":23.91757750582751,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","questionId":"1544","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522354014598541,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":7.025402965064536,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","questionId":"1545","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.40849401595744683,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","questionId":"1546","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5317133443163097,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":28.149776246328518,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","questionId":"1547","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7114967462039046,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","questionId":"1548","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6659751037344398,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":6.432138260819202,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","questionId":"1549","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6601192002050756,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.8641496499728465,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","questionId":"1550","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8171467350324234,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.8641496499728465,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","questionId":"1551","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5060409735597969,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":6.432138260819202,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","questionId":"1552","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29329652996845423,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":58.348910255299835,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","questionId":"1553","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.6992481203007519,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","questionId":"1554","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.43631894300199725,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","questionId":"1555","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5795193192272309,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1556]千位分隔数","frequency":45.43947641111062,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","questionId":"1556","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.761632916846187,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","questionId":"1557","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6209619526202441,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":9.694674396372061,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","questionId":"1558","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36522127849798836,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1559]二维网格图中探测环","frequency":11.143925187261475,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","questionId":"1559","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5734265734265734,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":7.025402965064536,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","questionId":"1560","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7792198778456413,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":17.055299153038327,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","questionId":"1561","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3090733733956525,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":10.419299791816767,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","questionId":"1562","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3762866191607284,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1563]石子游戏 V","frequency":44.05239917071445,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","questionId":"1563","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5853174603174603,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","questionId":"1564","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.725258493353028,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.432138260819202,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","questionId":"1565","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44557125271117887,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.8641496499728465,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","questionId":"1566","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39009111617312076,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":15.278597674784466,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","questionId":"1567","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4538123167155425,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","questionId":"1568","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4722748815165877,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","questionId":"1569","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.8996699669966997,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","questionId":"1570","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.757546717776713,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","questionId":"1571","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8048344168593743,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1572]矩阵对角线元素的和","frequency":3.8118624045174347,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","questionId":"1572","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955858085808581,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1573]分割字符串的方案数","frequency":6.432138260819202,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","questionId":"1573","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.32549754831266225,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":35.100661777816974,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","questionId":"1574","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6020560437738351,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","questionId":"1575","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4763744998081456,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1576]替换所有的问号","frequency":6.432138260819202,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","questionId":"1576","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.32328286438365067,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.694674396372061,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","questionId":"1577","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5792790800530738,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","questionId":"1578","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.619641192917055,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":23.91757750582751,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","questionId":"1579","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6282722513089005,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","questionId":"1580","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8149556400506971,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","questionId":"1581","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6710353866317169,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.432138260819202,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","questionId":"1582","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6849474474474474,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1583]统计不开心的朋友","frequency":26.56674882969418,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","questionId":"1583","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6666488007503685,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[1584]连接所有点的最小费用","frequency":0.0,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","questionId":"1584","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4296022201665125,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","questionId":"1585","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6268115942028986,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","questionId":"1586","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8250910983862572,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","questionId":"1587","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8017550702028081,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1588]所有奇数长度子数组的和","frequency":17.055299153038327,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","questionId":"1588","status":"not_started","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2949236483697895,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","questionId":"1589","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2638813808016063,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":8.295932292890154,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","questionId":"1590","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5766703176341731,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","questionId":"1591","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44554276414923755,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","questionId":"1592","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5270060931529484,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.8641496499728465,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","questionId":"1593","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3125678820791311,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":7.025402965064536,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","questionId":"1594","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46190837762591747,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","questionId":"1595","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7631669535283994,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","questionId":"1596","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6548223350253807,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","questionId":"1597","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6704711178745799,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.8641496499728465,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","questionId":"1598","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4189894503053859,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","questionId":"1599","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.683235706624866,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[1600]皇位继承顺序","frequency":17.69412241561324,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","questionId":"1600","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48057210965435043,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","questionId":"1601","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7802746566791511,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","questionId":"1602","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.84488683672697,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[1603]设计停车系统","frequency":62.36973331282459,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","questionId":"1603","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4143189755529686,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","questionId":"1604","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7350857142857142,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","questionId":"1605","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34024179620034545,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","questionId":"1606","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5507672903090183,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","questionId":"1607","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6390714872637634,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","questionId":"1608","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5118636431896681,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1609]奇偶树","frequency":5.8641496499728465,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","questionId":"1609","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27030862007804185,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","questionId":"1610","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6082535885167464,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","questionId":"1611","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.7335701598579041,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","questionId":"1612","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7271428571428571,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","questionId":"1613","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.8203507340946167,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.319656503291312,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","questionId":"1614","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49486135350009697,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","questionId":"1615","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27504944899689177,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":7.645927818924828,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","questionId":"1616","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6181885125184094,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","questionId":"1617","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5894308943089431,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","questionId":"1618","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6784459195626709,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","questionId":"1619","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3677024482109228,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1620]网络信号最好的坐标","frequency":10.419299791816767,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","questionId":"1620","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43517561983471076,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","questionId":"1621","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14516954574536148,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1622]奇妙序列","frequency":19.775703257934723,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","questionId":"1622","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7832427088482452,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":6.432138260819202,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","questionId":"1623","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6277961768636338,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":17.055299153038327,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","questionId":"1624","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5395765782948694,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","questionId":"1625","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3831996709849887,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":7.025402965064536,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","questionId":"1626","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3791323980003225,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","questionId":"1627","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8416075650118203,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","questionId":"1628","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5223910435825669,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","questionId":"1629","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7694850197249173,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":6.432138260819202,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","questionId":"1630","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4921781475093842,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1631]最小体力消耗路径","frequency":25.226087579120353,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","questionId":"1631","status":"not_started","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3159884367356015,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","questionId":"1632","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6584779706275034,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.432138260819202,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","questionId":"1633","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5203804347826086,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","questionId":"1634","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5455026455026455,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1635]Hopper 公司查询 I","frequency":7.025402965064536,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","questionId":"1635","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7070021519615958,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.8641496499728465,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","questionId":"1636","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.805848137085364,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","questionId":"1637","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.71005291005291,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":0.0,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","questionId":"1638","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.4018629407850965,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","questionId":"1639","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6634847428540784,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1640]能否连接形成数组","frequency":5.8641496499728465,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","questionId":"1640","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.769436822161244,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.011272898476534,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","questionId":"1641","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45420270569971166,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":17.055299153038327,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","questionId":"1642","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4493960849645981,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","questionId":"1643","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.537122969837587,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":17.69412241561324,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","questionId":"1644","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4095022624434389,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1645]","frequency":7.645927818924828,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","questionId":"1645","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5379550798670234,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[1646]获取生成数组中的最大值","frequency":18.876170617936413,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","questionId":"1646","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5121068114958135,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.559555950910564,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","questionId":"1647","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.2770417575046118,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.0522059501259,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","questionId":"1648","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.474527209571594,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","questionId":"1649","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7954898911353032,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.432138260819202,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","questionId":"1650","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6829268292682927,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","questionId":"1651","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6597761419784209,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1652]拆炸弹","frequency":17.055299153038327,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","questionId":"1652","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5013317549570879,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":6.432138260819202,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","questionId":"1653","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27373772186799933,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1654]到家的最少跳跃次数","frequency":24.559555950910564,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","questionId":"1654","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3814931650893796,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","questionId":"1655","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7804751530241726,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1656]设计有序流","frequency":5.8641496499728465,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","questionId":"1656","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4648331435578523,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.432138260819202,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","questionId":"1657","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2955870707652437,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","questionId":"1658","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.40582462804685027,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":29.39556476926235,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","questionId":"1659","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7414141414141414,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","questionId":"1660","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7321965897693079,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.3590911498422,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","questionId":"1661","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8133596091472677,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.440824613492993,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","questionId":"1662","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5714728441930735,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.226087579120353,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","questionId":"1663","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5446048395472012,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","questionId":"1664","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6674190122145512,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":7.025402965064536,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","questionId":"1665","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6813880126182965,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","questionId":"1666","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6056556867619639,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","questionId":"1667","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44120360513803136,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","questionId":"1668","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7687404554810437,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1669]合并两个链表","frequency":17.69412241561324,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","questionId":"1669","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5282220753469927,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":7.025402965064536,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","questionId":"1670","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46487403100775193,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":12.593175978150889,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","questionId":"1671","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8502607400049664,"acs":0,"articleLive":2,"columnArticles":433,"formTitle":"[1672]最富有客户的资产总量","frequency":5.8641496499728465,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","questionId":"1672","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35109170305676857,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1673]找出最具竞争力的子序列","frequency":6.432138260819202,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","questionId":"1673","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.35905583295506127,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":20.500328653379427,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","questionId":"1674","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.43574332685168815,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","questionId":"1675","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7658371040723982,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":11.143925187261475,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","questionId":"1676","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.40342465753424656,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","questionId":"1677","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8298258523424087,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[1678]设计 Goal 解析器","frequency":5.8641496499728465,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","questionId":"1678","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4943702930430244,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1679]K 和数对的最大数目","frequency":6.432138260819202,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","questionId":"1679","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4612046058458813,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.432138260819202,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","questionId":"1680","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3803339517625232,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":13.542175004154641,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","questionId":"1681","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5232774674115456,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","questionId":"1682","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8949745906267645,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","questionId":"1683","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8270836574866449,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1684]统计一致字符串的数目","frequency":23.91757750582751,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","questionId":"1684","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5939164804949304,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","questionId":"1685","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4683085147002673,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":7.025402965064536,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","questionId":"1686","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.39848282016956715,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","questionId":"1687","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8038251366120218,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1688]比赛中的配对次数","frequency":16.440824613492993,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","questionId":"1688","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8691408678353848,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":23.298530310509975,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","questionId":"1689","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5092627129180654,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1690]石子游戏 VII","frequency":6.432138260819202,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","questionId":"1690","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4849052675411201,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","questionId":"1691","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6455696202531646,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","questionId":"1692","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.805433479824211,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","questionId":"1693","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6356731272917758,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","questionId":"1694","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4529921322419137,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1695]删除子数组的最大得分","frequency":6.432138260819202,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","questionId":"1695","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.399518238128011,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1696]跳跃游戏 VI","frequency":23.91757750582751,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","questionId":"1696","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.52453300124533,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","questionId":"1697","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5424164524421594,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","questionId":"1698","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.8002070393374742,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","questionId":"1699","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7194057760232703,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.8641496499728465,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","questionId":"1700","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6106564222482045,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1701]平均等待时间","frequency":17.69412241561324,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","questionId":"1701","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47466712778834513,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1702]修改后的最大二进制字符串","frequency":19.0522059501259,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","questionId":"1702","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3889240506329114,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","questionId":"1703","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814956661963314,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","questionId":"1704","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34583202264863167,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1705]吃苹果的最大数目","frequency":17.69412241561324,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","questionId":"1705","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5847903340440654,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1706]球会落何处","frequency":18.3590911498422,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","questionId":"1706","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5033940308156448,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1707]与数组中元素的最大异或值","frequency":41.78122311997896,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","questionId":"1707","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6608695652173913,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","questionId":"1708","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7165178571428571,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","questionId":"1709","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6925263225889801,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1710]卡车上的最大单元数","frequency":24.559555950910564,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","questionId":"1710","status":"not_started","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3592207259882578,"acs":0,"articleLive":2,"columnArticles":357,"formTitle":"[1711]大餐计数","frequency":51.62681662693115,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","questionId":"1711","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2654565306400983,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","questionId":"1712","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.4974044817024021,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1713]得到子序列的最少操作次数","frequency":44.77985081966752,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","questionId":"1713","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6335227272727273,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","questionId":"1714","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7376636455186304,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":17.69412241561324,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","questionId":"1715","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6747293049249039,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","questionId":"1716","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4309518850239533,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","questionId":"1717","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4858712715855573,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","questionId":"1718","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3614013521819299,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","questionId":"1719","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8693257359924027,"acs":0,"articleLive":2,"columnArticles":481,"formTitle":"[1720]解码异或后的数组","frequency":57.11054153563997,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","questionId":"1720","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6494972429451833,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1721]交换链表中的节点","frequency":6.432138260819202,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","questionId":"1721","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5133938454726589,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","questionId":"1722","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5077938996451192,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.3912435796531,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","questionId":"1723","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5526770293609672,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","questionId":"1724","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.786974116209819,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.8641496499728465,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","questionId":"1725","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.4751804651991801,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","questionId":"1726","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5728842832469776,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":9.694674396372061,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","questionId":"1727","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.34772344013490725,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","questionId":"1728","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6249584026622296,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.432138260819202,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","questionId":"1729","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5352112676056338,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","questionId":"1730","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47756315007429423,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","questionId":"1731","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.79301247771836,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1732]找到最高海拔","frequency":31.44128620556848,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","questionId":"1732","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45766954938552573,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":11.143925187261475,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","questionId":"1733","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7233200551953969,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[1734]解码异或后的排列","frequency":55.078458808007355,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","questionId":"1734","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48428927680798006,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","questionId":"1735","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.449102656137832,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.43947641111062,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","questionId":"1736","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30810045985143264,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":21.292444581631205,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","questionId":"1737","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.653934051583415,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":43.26533686741106,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","questionId":"1738","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47110141766630315,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","questionId":"1739","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7011019283746557,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":11.868550582706181,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","questionId":"1740","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.84375,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","questionId":"1741","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7059287844237853,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.8641496499728465,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","questionId":"1742","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974265169673268,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[1743]从相邻元素对还原数组","frequency":40.40333856496414,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","questionId":"1743","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3631359272229186,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":55.793744236538515,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","questionId":"1744","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4843820733363513,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","questionId":"1745","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.6035437430786268,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","questionId":"1746","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7035206917850525,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","questionId":"1747","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7496350364963503,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":24.559555950910564,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","questionId":"1748","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5302202092769015,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.559555950910564,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","questionId":"1749","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4589386302994367,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","questionId":"1750","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.46843463975592586,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":22.99714189890724,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","questionId":"1751","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6866686593932148,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","questionId":"1752","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6274118429807053,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","questionId":"1753","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4205079962370649,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":7.025402965064536,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","questionId":"1754","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.39684898929845425,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":7.025402965064536,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","questionId":"1755","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8025078369905956,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","questionId":"1756","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9224254742547425,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","questionId":"1757","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6350781908418391,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","questionId":"1758","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42760290556900726,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.8641496499728465,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","questionId":"1759","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5362556329373208,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","questionId":"1760","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4283015627683325,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":8.977909794422963,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","questionId":"1761","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.67,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","questionId":"1762","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6104135275405994,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":7.025402965064536,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","questionId":"1763","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4766681203663323,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","questionId":"1764","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5649082189515462,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.432138260819202,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","questionId":"1765","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37527716186252774,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.278597674784466,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","questionId":"1766","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7993311036789298,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","questionId":"1767","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7691308114351718,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1768]交替合并字符串","frequency":23.298530310509975,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","questionId":"1768","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8547249647390691,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.8641496499728465,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","questionId":"1769","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36841621472561814,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":11.143925187261475,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","questionId":"1770","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36366585563665854,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","questionId":"1771","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5357833655705996,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","questionId":"1772","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8410700664705242,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":29.39556476926235,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","questionId":"1773","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5552882301992108,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":17.69412241561324,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","questionId":"1774","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47234730400646574,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":18.3590911498422,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","questionId":"1775","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4631637475674173,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":28.149776246328518,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","questionId":"1776","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7785414920368818,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":70.00521894915825,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","questionId":"1777","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5571955719557196,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","questionId":"1778","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.647184783977831,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.432138260819202,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","questionId":"1779","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.661734693877551,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","questionId":"1780","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5164233576642335,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":5.319656503291312,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","questionId":"1781","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2851085058618109,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","questionId":"1782","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7893915756630265,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","questionId":"1783","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4206447767125329,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1784]检查二进制字符串字段","frequency":5.8641496499728465,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","questionId":"1784","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.34721364835288177,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","questionId":"1785","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3395334174022699,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","questionId":"1786","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.654073991281994,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":56.84016463292983,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","questionId":"1787","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6810344827586207,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","questionId":"1788","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7172452407614781,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","questionId":"1789","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6517829457364341,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.8641496499728465,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","questionId":"1790","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8091400230271898,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1791]找出星型图的中心节点","frequency":5.319656503291312,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","questionId":"1791","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5135961383748995,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1792]最大平均通过率","frequency":35.81762406528862,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","questionId":"1792","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41120982779423054,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1793]好子数组的最大分数","frequency":19.0522059501259,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","questionId":"1793","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6871794871794872,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","questionId":"1794","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7910608508346796,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.918971452343403,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","questionId":"1795","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48633303593154353,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1796]字符串中第二大的数字","frequency":5.8641496499728465,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","questionId":"1796","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.573170731707317,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1797]设计一个验证系统","frequency":17.69412241561324,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","questionId":"1797","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5179688896835329,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","questionId":"1798","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5111745126010461,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":8.295932292890154,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","questionId":"1799","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.683765752409192,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1800]最大升序子数组和","frequency":17.055299153038327,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","questionId":"1800","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37637362637362637,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","questionId":"1801","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26196765672314926,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","questionId":"1802","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.41053478086047446,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":21.292444581631205,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","questionId":"1803","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5766773162939297,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":11.868550582706181,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","questionId":"1804","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.49509960340976433,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.319656503291312,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","questionId":"1805","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.663372859025033,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":25.918971452343403,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","questionId":"1806","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5845272206303725,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","questionId":"1807","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2657451789098205,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":13.542175004154641,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","questionId":"1808","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6396879570941004,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":17.055299153038327,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","questionId":"1809","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6567164179104478,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":30.733546932419063,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","questionId":"1810","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6653225806451613,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":5.8641496499728465,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","questionId":"1811","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7946220622485708,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","questionId":"1812","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5218358269308532,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1813]句子相似性 III","frequency":25.226087579120353,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","questionId":"1813","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.341361363404429,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":7.025402965064536,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","questionId":"1814","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.3004059539918809,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","questionId":"1815","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7540780827212988,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1816]截断句子","frequency":5.8641496499728465,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","questionId":"1816","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6953883495145631,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":7.025402965064536,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","questionId":"1817","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37421954567595095,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[1818]绝对差值和","frequency":46.82964520860451,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","questionId":"1818","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36442197945540517,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","questionId":"1819","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.46496815286624205,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","questionId":"1820","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.901173285198556,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.918971452343403,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","questionId":"1821","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.813280291167633,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[1822]数组元素积的符号","frequency":16.440824613492993,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","questionId":"1822","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7057623165873093,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1823]找出游戏的获胜者","frequency":16.440824613492993,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","questionId":"1823","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6618730270080674,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","questionId":"1824","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28679413072476656,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":12.593175978150889,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","questionId":"1825","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.43863636363636366,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","questionId":"1826","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7963353183692167,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","questionId":"1827","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8708446195518346,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.440824613492993,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","questionId":"1828","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6764705882352942,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","questionId":"1829","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4818075117370892,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","questionId":"1830","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.738045738045738,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","questionId":"1831","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8219767134162477,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.559555950910564,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","questionId":"1832","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6852302166277278,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1833]雪糕的最大数量","frequency":30.052239689191424,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","questionId":"1833","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35028002489110144,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.44128620556848,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","questionId":"1834","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5077877127199307,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":13.542175004154641,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","questionId":"1835","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.711217183770883,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.419299791816767,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","questionId":"1836","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7939942592183705,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","questionId":"1837","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43093232601708986,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":58.51995110688465,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","questionId":"1838","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5801921655580192,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","questionId":"1839","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3900961136648558,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1840]最高建筑高度","frequency":10.419299791816767,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","questionId":"1840","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5071482317531979,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":25.226087579120353,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","questionId":"1841","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7086614173228346,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","questionId":"1842","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.523109243697479,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":7.025402965064536,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","questionId":"1843","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8022900763358779,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","questionId":"1844","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5813653928724775,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","questionId":"1845","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6335309847692129,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.07992774372667,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","questionId":"1846","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3595829991980754,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":10.419299791816767,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","questionId":"1847","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6853630426431041,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","questionId":"1848","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3291431347543572,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":8.295932292890154,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","questionId":"1849","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.604974592136935,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":10.419299791816767,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","questionId":"1850","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.3973607038123167,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","questionId":"1851","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7081339712918661,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","questionId":"1852","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.649792531120332,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.025402965064536,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","questionId":"1853","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7944333142530051,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1854]人口最多的年份","frequency":24.559555950910564,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","questionId":"1854","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6916966528617015,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1855]下标对中的最大距离","frequency":24.559555950910564,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","questionId":"1855","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35660297239915073,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1856]子数组最小乘积的最大值","frequency":19.775703257934723,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","questionId":"1856","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4480231008440693,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","questionId":"1857","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.7063953488372093,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1858]包含所有前缀的最长单词","frequency":12.593175978150889,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","questionId":"1858","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7731102850061958,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","questionId":"1859","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7719695410578308,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1860]增长的内存泄露","frequency":5.8641496499728465,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","questionId":"1860","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6184288245717661,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1861]旋转盒子","frequency":5.8641496499728465,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","questionId":"1861","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3094163877164896,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","questionId":"1862","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9232938964193371,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":40.40333856496414,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","questionId":"1863","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3859957450744612,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":8.295932292890154,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","questionId":"1864","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5170489141465395,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","questionId":"1865","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5944584382871536,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.292444581631205,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","questionId":"1866","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7741273100616016,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","questionId":"1867","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5561797752808989,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":19.0522059501259,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","questionId":"1868","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.802347820352173,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1869]哪种连续子字符串更长","frequency":23.91757750582751,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","questionId":"1869","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.46106986483913953,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1870]准时到达的列车最小时速","frequency":7.025402965064536,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","questionId":"1870","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2756845989512527,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","questionId":"1871","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6235527621567979,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","questionId":"1872","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.7988624612202688,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":35.81762406528862,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","questionId":"1873","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8701298701298701,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","questionId":"1874","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7372093023255814,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","questionId":"1875","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7310287839140615,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","questionId":"1876","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.819452437720957,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.283759835801014,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","questionId":"1877","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42744118259421193,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","questionId":"1878","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40404040404040403,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":8.977909794422963,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","questionId":"1879","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7726006019395831,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.8641496499728465,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","questionId":"1880","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35152851804202656,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","questionId":"1881","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2764925669767072,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","questionId":"1882","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37037856984724377,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","questionId":"1883","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6982931726907631,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":35.100661777816974,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","questionId":"1884","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5365853658536586,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","questionId":"1885","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5724254361283061,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":6.432138260819202,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","questionId":"1886","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6402116402116402,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":0.0,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","questionId":"1887","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.3140369455230027,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":8.977909794422963,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","questionId":"1888","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2745923913043478,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":21.292444581631205,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","questionId":"1889","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7009155645981688,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","questionId":"1890","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5135135135135135,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","questionId":"1891","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.34854771784232363,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1892]页面推荐Ⅱ","frequency":7.645927818924828,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","questionId":"1892","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5917179219372558,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":44.14185500899297,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","questionId":"1893","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4294986880265157,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","questionId":"1894","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5309510410804728,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","questionId":"1895","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5012391573729864,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","questionId":"1896","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5277251825804706,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.440824613492993,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","questionId":"1897","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3069701947899554,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.295932292890154,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","questionId":"1898","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.626711719722568,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","questionId":"1899","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4239457831325301,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":25.918971452343403,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","questionId":"1900","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6587202007528231,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","questionId":"1901","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.4263565891472868,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","questionId":"1902","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6441889672495411,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","questionId":"1903","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27518385496835984,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","questionId":"1904","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5736655773420479,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","questionId":"1905","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4216803132787469,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1906]查询差绝对值的最小值","frequency":21.292444581631205,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","questionId":"1906","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6296992481203008,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","questionId":"1907","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6507936507936508,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","questionId":"1908","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32860804100592667,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":5.319656503291312,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","questionId":"1909","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6786731786731787,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","questionId":"1910","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5643968871595331,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1911]最大子序列交替和","frequency":5.319656503291312,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","questionId":"1911","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.30421473981634095,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","questionId":"1912","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8466087376297369,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":4.79705487999359,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","questionId":"1913","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.43932758864246363,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.69412241561324,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","questionId":"1914","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.38874570446735396,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","questionId":"1915","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.554989816700611,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.775703257934723,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","questionId":"1916","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2850539291217257,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","questionId":"1917","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.46153846153846156,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","questionId":"1918","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.4012251148545176,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","questionId":"1919","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.94049008168028,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","questionId":"1920","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34233000847512873,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1921]消灭怪物的最大数量","frequency":19.0522059501259,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","questionId":"1921","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3622666229937766,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":6.432138260819202,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","questionId":"1922","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2354417670682731,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.226087579120353,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","questionId":"1923","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.5223880597014925,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","questionId":"1924","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6974803937927582,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.052239689191424,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","questionId":"1925","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3463250461404842,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","questionId":"1926","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41041614752055816,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1927]求和游戏","frequency":5.8641496499728465,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","questionId":"1927","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.381826030649687,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":26.640210513642216,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","questionId":"1928","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9415223097112861,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1929]数组串联","frequency":3.8118624045174347,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","questionId":"1929","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4750615482812073,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.440824613492993,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","questionId":"1930","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.551844321812373,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":5.8641496499728465,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","questionId":"1931","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3241132443865929,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":9.694674396372061,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","questionId":"1932","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5732484076433121,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","questionId":"1933","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7327586206896551,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","questionId":"1934","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7436720582787999,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","questionId":"1935","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44892992026856904,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","questionId":"1936","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23858438327582057,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.69412241561324,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","questionId":"1937","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3339652448657188,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":17.69412241561324,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","questionId":"1938","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6658031088082902,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","questionId":"1939","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8270440251572327,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","questionId":"1940","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7782823297137216,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","questionId":"1941","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38817089858598147,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","questionId":"1942","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40076063703351555,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","questionId":"1943","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5724932249322493,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":7.025402965064536,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","questionId":"1944","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6620582004682797,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":4.79705487999359,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","questionId":"1945","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30255308995466473,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.055299153038327,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","questionId":"1946","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5366379310344828,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","questionId":"1947","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5183673469387755,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":7.025402965064536,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","questionId":"1948","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.537117903930131,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","questionId":"1949","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5572916666666666,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","questionId":"1950","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7292817679558011,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","questionId":"1951","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5409792677547419,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1952]三除数","frequency":0.724625395444707,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","questionId":"1952","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31836899475171576,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","questionId":"1953","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.4806899137607799,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":2.1738761863341214,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","questionId":"1954","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.49356749030018376,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","questionId":"1955","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.43014705882352944,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":20.500328653379427,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","questionId":"1956","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6074594413781569,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","questionId":"1957","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41707097933513027,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","questionId":"1958","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.409627032196366,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","questionId":"1959","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2772845953002611,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","questionId":"1960","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5346380325597506,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":1.449250790889414,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","questionId":"1961","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42335339351387496,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1962]移除石子使总数最小","frequency":9.694674396372061,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","questionId":"1962","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6116207951070336,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":3.3467613969931103,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","questionId":"1963","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.38193531422561133,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","questionId":"1964","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7364016736401674,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","questionId":"1965","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.6785714285714286,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","questionId":"1966","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.770016042000875,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","questionId":"1967","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.3474548440065681,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","questionId":"1968","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2715888599479062,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":25.918971452343403,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","questionId":"1969","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4719431511884342,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":28.149776246328518,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","questionId":"1970","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5673758865248227,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","questionId":"1971","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.47761194029850745,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1972]","frequency":28.149776246328518,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","questionId":"1972","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.41975308641975306,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","questionId":"1973","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7456601788532351,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":10.419299791816767,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","questionId":"1974","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3676084099868594,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1975]最大方阵和","frequency":12.593175978150889,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","questionId":"1975","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.260250569476082,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","questionId":"1976","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.2060475161987041,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","questionId":"1977","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.8463663041601933,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","questionId":"1979","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5362946912242686,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1980]找出不同的二进制字符串","frequency":0.0,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","questionId":"1980","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.2699967352269017,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":28.149776246328518,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","questionId":"1981","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.4335511982570806,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1982]从子集的和还原数组","frequency":0.0,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","questionId":"1982","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.844374365052489,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[LCP 01]猜数字","frequency":43.753494141085035,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 01","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6879548570825862,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":30.052239689191424,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 02","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21757050331959474,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":30.733546932419063,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 03","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37307455329636474,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":40.96549306529091,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 04","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19523568170299038,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 05","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8390528073803085,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[LCP 06]拿硬币","frequency":34.410170454843225,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 06","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703207020997376,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[LCP 07]传递信息","frequency":67.06059986329151,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 07","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2811143695014663,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 08","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2649062653070312,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":62.03761232593633,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 09","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5807365439093485,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":25.226087579120353,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 10","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6830743560329544,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[LCP 11]期望个数统计","frequency":7.645927818924828,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 11","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4053439845740651,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":38.011272898476534,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 12","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6154661016949152,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":11.868550582706181,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 13","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.19940139136062127,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":40.96549306529091,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 14","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5717375630857967,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":15.278597674784466,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 15","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.29363336992316136,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 16","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7974963181148749,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[LCP 17]速算机器人","frequency":33.74435014283262,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 17","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2832000546784225,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[LCP 18]早餐组合","frequency":33.74435014283262,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 18","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5158457731300391,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[LCP 19]秋叶收藏集","frequency":33.10157802583374,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 19","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.2967280932681459,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 20]快速公交","frequency":22.99714189890724,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 20","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.317453250222618,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":25.918971452343403,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 21","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33159039731307965,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[LCP 22]黑白方格画","frequency":51.94259183508164,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 22","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.331832446445627,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":21.292444581631205,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 23","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.26651480637813213,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 24","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.3195718654434251,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 25","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.327027027027027,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 26","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3254228041462084,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":32.17746110350195,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 27","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2653015301530153,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[LCP 28]采购方案","frequency":30.052239689191424,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 28","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.16884811245317957,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[LCP 29]乐团站位","frequency":48.958131853216656,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 29","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3310928013876843,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[LCP 30]魔塔游戏","frequency":7.025402965064536,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 30","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.22173058013765978,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":11.143925187261475,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 31","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.35392475615420343,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[LCP 32]批量处理任务","frequency":22.123496019202573,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 32","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.19647021411914353,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[LCP 33]蓄水","frequency":24.559555950910564,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","questionId":"LCP 33","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4552656104380242,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[LCP 34]二叉树染色","frequency":30.052239689191424,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","questionId":"LCP 34","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.35977786592621974,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":21.292444581631205,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 35","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.22391469916222392,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":40.8064219240224,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 36","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.17384059983337963,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 37]最小矩形面积","frequency":35.455713936029625,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 37","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.516320474777448,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":29.39556476926235,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","questionId":"LCP 38","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5349062702003878,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[LCS 01]下载插件","frequency":25.226087579120353,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","questionId":"LCS 01","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.705792293952539,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 02]完成一半题目","frequency":17.69412241561324,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","questionId":"LCS 02","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4164622512946307,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCS 03]主题空间","frequency":6.432138260819202,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","questionId":"LCS 03","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786541736403967,"acs":0,"articleLive":2,"columnArticles":2658,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":97.09711337183452,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 03","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4031247435268265,"acs":0,"articleLive":2,"columnArticles":1965,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":79.12098043517933,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 04","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7619942947962784,"acs":0,"articleLive":2,"columnArticles":1830,"formTitle":"[剑指 Offer 05]替换空格","frequency":66.4006405661015,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 05","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523608132358734,"acs":0,"articleLive":2,"columnArticles":1960,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":76.60307532467681,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 06","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6955345753476433,"acs":0,"articleLive":2,"columnArticles":1380,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":86.06865892033187,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 07","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7176480649466872,"acs":0,"articleLive":2,"columnArticles":1530,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":89.2633025682083,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 09","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3479314051045126,"acs":0,"articleLive":2,"columnArticles":1593,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":78.20872918249685,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 10- I","status":"not_started","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.441022912851982,"acs":0,"articleLive":2,"columnArticles":1243,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":75.41441348995914,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 10- II","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.4937075049289676,"acs":0,"articleLive":2,"columnArticles":1540,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":83.5658292410558,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 11","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45314550984472546,"acs":0,"articleLive":2,"columnArticles":1054,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":64.24188884497887,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 12","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5246679378211551,"acs":0,"articleLive":2,"columnArticles":1629,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":74.90481420453737,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 13","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5680165506167884,"acs":0,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":67.42945812925974,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 14- I","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31083122624556714,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":38.70802575964364,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 14- II","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7458102773065276,"acs":0,"articleLive":2,"columnArticles":1208,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":53.39495384347113,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 15","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3378945259796499,"acs":0,"articleLive":2,"columnArticles":718,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":33.74435014283262,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 16","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773346244959816,"acs":0,"articleLive":2,"columnArticles":1084,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":64.09040638118935,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 17","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.594681127330381,"acs":0,"articleLive":2,"columnArticles":1392,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":59.01262411837932,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 18","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3741252434889258,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":57.030639592048736,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 19","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.2388209791653486,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":73.54689802818154,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 20","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423769129674484,"acs":0,"articleLive":2,"columnArticles":1514,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":54.44970756404216,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 21","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.7895523990389777,"acs":0,"articleLive":2,"columnArticles":2071,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":86.29128293868476,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 22","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.742589338019918,"acs":0,"articleLive":2,"columnArticles":1735,"formTitle":"[剑指 Offer 24]反转链表","frequency":96.47631824031973,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 24","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7288789820428854,"acs":0,"articleLive":2,"columnArticles":1114,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":77.76185754057336,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 25","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4653660985076104,"acs":0,"articleLive":2,"columnArticles":1106,"formTitle":"[剑指 Offer 26]树的子结构","frequency":66.6385572571716,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 26","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7906083503292872,"acs":0,"articleLive":2,"columnArticles":1323,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":65.29855378424779,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 27","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5798492234200066,"acs":0,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":48.48221757017876,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 28","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43962656004347744,"acs":0,"articleLive":2,"columnArticles":1408,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":80.19960703426283,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 29","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.574071803770311,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":55.373389379826335,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 30","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6135412121283597,"acs":0,"articleLive":2,"columnArticles":868,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":39.99228861804626,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 31","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6461815524351412,"acs":0,"articleLive":2,"columnArticles":883,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":63.76203754060431,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 32 - I","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6864301866860341,"acs":0,"articleLive":2,"columnArticles":1012,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.26262005218856,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 32 - II","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5887090169528542,"acs":0,"articleLive":2,"columnArticles":1053,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":55.793744236538515,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 32 - III","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5487502051664893,"acs":0,"articleLive":2,"columnArticles":887,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":62.51161758026983,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 33","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5776156296049817,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":65.29855378424779,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 34","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7219359993387792,"acs":0,"articleLive":2,"columnArticles":758,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":58.19808689431388,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 35","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6538237617998087,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":70.00521894915825,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 36","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5585079476999955,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.58540860209091,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 37","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5795492002699776,"acs":0,"articleLive":2,"columnArticles":1063,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":94.41453784357627,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 38","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6890107074704926,"acs":0,"articleLive":2,"columnArticles":970,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":60.44805769459255,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 39","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5690337925572457,"acs":0,"articleLive":2,"columnArticles":1726,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":77.6316368804698,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 40","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5790482404273539,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":45.25735221464884,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 41","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6053961801255119,"acs":0,"articleLive":2,"columnArticles":1456,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":92.33591131483345,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 42","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.48174380649481086,"acs":0,"articleLive":2,"columnArticles":481,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":52.44919189409137,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 43","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41286398260716656,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":48.1852493781726,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 44","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5618693482377726,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":69.4703874649224,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 45","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5392625033196872,"acs":0,"articleLive":2,"columnArticles":1351,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":71.25400035632107,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 46","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6890800188264421,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":56.78907531631309,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 47","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4644217728799929,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":73.02624433683921,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 48","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6511545834436183,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[剑指 Offer 49]丑数","frequency":64.66871380438683,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 49","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6141135633705794,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":65.69135070907296,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 50","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.48057858204495657,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":92.22748227264228,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 51","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6468903846076938,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":69.4703874649224,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 52","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5402912210666826,"acs":0,"articleLive":2,"columnArticles":1489,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":59.26356236186536,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 53 - I","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.4474592179166679,"acs":0,"articleLive":2,"columnArticles":1373,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":58.022689916751624,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 53 - II","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.754533721371631,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":47.563611642367825,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 54","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7888163687172224,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":63.76203754060431,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 55 - I","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5863657322236143,"acs":0,"articleLive":2,"columnArticles":875,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":53.00005968845528,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 55 - II","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6998951919297786,"acs":0,"articleLive":2,"columnArticles":972,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":64.27449724790608,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 56 - I","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7991308546595848,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":48.8271917938307,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 56 - II","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6624109005563282,"acs":0,"articleLive":2,"columnArticles":772,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.41367136466883,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 57","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7059306058811706,"acs":0,"articleLive":2,"columnArticles":1792,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":65.26400370763471,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 57 - II","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44081856331028685,"acs":0,"articleLive":2,"columnArticles":890,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.03906845565474,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 58 - I","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8563304013320849,"acs":0,"articleLive":2,"columnArticles":1685,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":57.36418431742412,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 58 - II","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44412185795320686,"acs":0,"articleLive":2,"columnArticles":1131,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":76.08394931912123,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer 59 - I","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.474174269313587,"acs":0,"articleLive":2,"columnArticles":1031,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":52.083141432905066,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 59 - II","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5587894624672208,"acs":0,"articleLive":2,"columnArticles":545,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":60.353061410247996,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 60","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4603354679484309,"acs":0,"articleLive":2,"columnArticles":895,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":64.99498669015729,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 61","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6546035673780802,"acs":0,"articleLive":2,"columnArticles":719,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":74.97684229452257,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 62","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.633979766199246,"acs":0,"articleLive":2,"columnArticles":888,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":63.93068780840622,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 63","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8566664888224937,"acs":0,"articleLive":2,"columnArticles":1239,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":56.95988205514737,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 64","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5813089479777086,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.45823546827265,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 65","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5974753927266838,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":56.31011759007153,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 66","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28444017062855476,"acs":0,"articleLive":2,"columnArticles":521,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":52.88011442905138,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer 67","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6930331023864511,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":45.25735221464884,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 68 - I","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.699142654715399,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":60.87144260366247,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer 68 - II","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.21293876686206653,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 001]整数除法","frequency":7.645927818924828,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 001","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5932307692307692,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 002","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7940854326396495,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":7.025402965064536,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 003","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7008058227190018,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 004","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7255725190839695,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 005","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6777747917226552,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 006","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.4828235294117647,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 007","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5278001611603546,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 008","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5695604794769342,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 009","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44126149802890935,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 010","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.579119850187266,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 011","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6740331491712708,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":8.295932292890154,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 012","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6650280898876404,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 013","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5286225402504472,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 014","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6505338078291815,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 015","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5082254112705635,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 016","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5450704225352113,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 017","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5578284815106216,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 018","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4928971157985364,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":21.292444581631205,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 019","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7019230769230769,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 020","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5300095268339156,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 021","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5204813108038915,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":7.025402965064536,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 022","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7064796905222437,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":7.645927818924828,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 023","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7781746031746032,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 024]反转链表","frequency":19.0522059501259,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 024","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6059085841694537,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":21.292444581631205,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 025","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6790058170280275,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 026]重排链表","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 026","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6441525953721076,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 027]回文链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 027","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.5884353741496599,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 028","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3035175879396985,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 029","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5617715617715617,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 030","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.6075313807531381,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 031","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5963182117028271,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 032","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7857142857142857,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 033","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5659340659340659,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 034","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.718865598027127,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 035","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.5823255813953488,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 036","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4777292576419214,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 037","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7850133809099019,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 038","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5266331658291458,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 039","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5653543307086614,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 040","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7953216374269005,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 041","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8703071672354948,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 042","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6598360655737705,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 043","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6607142857142857,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 044","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7907725321888412,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 045","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7186311787072244,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 046","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7126436781609196,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":0.0,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 047","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.7,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 048","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.758659217877095,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 049","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6227810650887574,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 050","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.4095860566448802,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 051","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7592936802973977,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":8.295932292890154,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 052","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6441774491682071,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 053","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8688524590163934,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 054","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8849557522123894,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 055","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7437619961612284,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 056","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3558282208588957,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 057","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5930521091811415,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 058","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6199740596627756,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 059","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.638148667601683,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 060","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.513671875,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":0.0,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 061","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7054945054945055,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 062","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7708333333333334,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 063","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.6443514644351465,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 064","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5681818181818182,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 065","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6387959866220736,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 066","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.672,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 067","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5334742776603242,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 068","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7300103842159917,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 069","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6951934349355217,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 070","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 071","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.437374749498998,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 072","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.55810147299509,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 073","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5317693059628543,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 074]合并区间","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 074","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7288941736028538,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 075","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6662804171494786,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 076","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5336728919071874,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 077","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6308370044052863,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 078","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8719912472647703,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 079","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7480916030534351,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 080","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7946768060836502,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 081","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6467391304347826,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":8.295932292890154,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 082","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8739205526770294,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":10.419299791816767,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 083","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.7006937561942518,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 084","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8679775280898876,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":8.295932292890154,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 085","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7454798331015299,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 086","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.618421052631579,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":0.0,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 087","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7351190476190477,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 088","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6086956521739131,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 089","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5056360708534622,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 090","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7597292724196277,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 091","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6340508806262231,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 092","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5352697095435685,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 093","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6016483516483516,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 094","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6962895098488319,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":34.580413284191515,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 095","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5334821428571429,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 096","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5177514792899408,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 097","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7283950617283951,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 098","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6669675090252708,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":20.500328653379427,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 099","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7571942446043165,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 100","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4585326953748006,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","questionId":"剑指 Offer II 101","status":"not_started","submitted":0,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.560377358490566,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 102","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5113553113553113,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 103","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5481927710843374,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 104","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6970387243735763,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":8.977909794422963,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 105","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5821325648414986,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 106]二分图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 106","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5361930294906166,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 107","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5319148936170213,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 108","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5279187817258884,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 109","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8423153692614771,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 110","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6907894736842105,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 111","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5735294117647058,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 112","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6369168356997972,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":21.292444581631205,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 113","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.39622641509433965,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 114","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.24651162790697675,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 115]重建序列","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 115","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6380741560597676,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 116","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.5875,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","questionId":"剑指 Offer II 117","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6700680272108843,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 118","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.46613545816733065,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":9.694674396372061,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","questionId":"剑指 Offer II 119","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7213724894807617,"acs":0,"articleLive":2,"columnArticles":1466,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":77.03638887870994,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.01","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.650785698575234,"acs":0,"articleLive":2,"columnArticles":1038,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":48.8271917938307,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.02","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5799062100326844,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[面试题 01.03]URL化","frequency":39.74983259469025,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.03","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510898287516242,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[面试题 01.04]回文排列","frequency":46.122200192639085,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.04","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33380626711152,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[面试题 01.05]一次编辑","frequency":44.14185500899297,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 01.05","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47363858513876944,"acs":0,"articleLive":2,"columnArticles":1127,"formTitle":"[面试题 01.06]字符串压缩","frequency":69.30721886912357,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.06","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7552854575023539,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[面试题 01.07]旋转矩阵","frequency":57.678951506101875,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 01.07","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6220055839207762,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[面试题 01.08]零矩阵","frequency":39.74983259469025,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 01.08","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.551786005545588,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[面试题 01.09]字符串轮转","frequency":30.052239689191424,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 01.09","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846607065674833,"acs":0,"articleLive":2,"columnArticles":662,"formTitle":"[面试题 02.01]移除重复节点","frequency":52.2137689841257,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 02.01","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7801535087719298,"acs":0,"articleLive":2,"columnArticles":917,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":57.80287757337449,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 02.02","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540437326763166,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.6749998056482,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 02.03","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6576034181394446,"acs":0,"articleLive":2,"columnArticles":341,"formTitle":"[面试题 02.04]分割链表","frequency":49.945898209573045,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 02.04","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46702502667441015,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[面试题 02.05]链表求和","frequency":75.93701511325686,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 02.05","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4823246903212261,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[面试题 02.06]回文链表","frequency":36.690222539998246,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 02.06","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6878453038674033,"acs":0,"articleLive":2,"columnArticles":380,"formTitle":"[面试题 02.07]链表相交","frequency":23.298530310509975,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 02.07","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5304723526234888,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[面试题 02.08]环路检测","frequency":48.24850890238516,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 02.08","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.542866438913291,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 03.01","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6124924501711294,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.753494141085035,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 03.02","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3869485294117647,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[面试题 03.03]堆盘子","frequency":29.39556476926235,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 03.03","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7114652331125404,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[面试题 03.04]化栈为队","frequency":40.40333856496414,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 03.04","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5464876033057852,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[面试题 03.05]栈排序","frequency":16.440824613492993,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 03.05","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5894024138946129,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.06]动物收容所","frequency":30.733546932419063,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 03.06","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5345334553058024,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[面试题 04.01]节点间通路","frequency":35.100661777816974,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.01","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894436111706307,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[面试题 04.02]最小高度树","frequency":51.94259183508164,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 04.02","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8058266058266058,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":39.74983259469025,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.03","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5833012697191228,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[面试题 04.04]检查平衡性","frequency":23.298530310509975,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 04.04","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35095452157160373,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":39.74983259469025,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.05","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908891121436645,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":16.440824613492993,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.06","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7169828613326001,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.39556476926235,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.08","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47812902736714424,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":25.226087579120353,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 04.09","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.717989591635801,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":5.319656503291312,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.10","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48854894331948007,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 04.12]求和路径","frequency":30.052239689191424,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 04.12","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5068137198290795,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 05.01","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6841955116013694,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":24.559555950910564,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 05.02","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3912974932997005,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[面试题 05.03]翻转数位","frequency":38.70802575964364,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 05.03","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3952029227225796,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 05.04","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5274926509565804,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[面试题 05.06]整数转换","frequency":5.8641496499728465,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 05.06","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7040078201368524,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[面试题 05.07]配对交换","frequency":17.055299153038327,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 05.07","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5536856277347695,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":23.91757750582751,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 05.08","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3638436977345294,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[面试题 08.01]三步问题","frequency":46.261656597758154,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 08.01","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3611832195622216,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":37.33921280172674,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.02","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768875438037592,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 08.03]魔术索引","frequency":5.8641496499728465,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 08.03","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8224210046796704,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":43.07346788366307,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.04","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6790315490481182,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":5.319656503291312,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.05","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6551581802635846,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":59.75979670600267,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 08.06","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8132755329303214,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":43.07346788366307,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.07","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7177374040082413,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":43.753494141085035,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.08","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8110273327049953,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 08.09]括号","frequency":63.8685304735485,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.09","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5594803614876608,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":15.278597674784466,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 08.10","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4947257069638547,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[面试题 08.11]硬币","frequency":50.888872506135655,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.11","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.758512284774618,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[面试题 08.12]八皇后","frequency":50.17745760809217,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 08.12","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.501777110812732,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":17.69412241561324,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 08.13","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5333709609143502,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 08.14","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5536834375350597,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.50578906691348,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 10.01","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394191952077094,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.318552034926824,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 10.02","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3968399659083459,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":60.211401345259894,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 10.03","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.552415953729365,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.559555950910564,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 10.05","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4561888950378159,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":45.43947641111062,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 10.09","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6306146572104019,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":7.025402965064536,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 10.10","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6667905248490479,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":40.40333856496414,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 10.11","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8326022646128736,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 16.01]交换数字","frequency":30.733546932419063,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.01","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7651080723423026,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":5.8641496499728465,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.02","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4432222430256506,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":8.295932292890154,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 16.03","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46136850562399573,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.04","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.4641289096093785,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.052239689191424,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 16.05","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4239429660478577,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[面试题 16.06]最小差","frequency":34.410170454843225,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.06","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7337449202875899,"acs":0,"articleLive":2,"columnArticles":277,"formTitle":"[面试题 16.07]最大数值","frequency":41.07992774372667,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 16.07","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.377023768515329,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":7.645927818924828,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 16.08","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5469452525786829,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.09","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6848668451458363,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.10]生存人数","frequency":24.559555950910564,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.10","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4411324519830382,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[面试题 16.11]跳水板","frequency":23.91757750582751,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 16.11","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4324260355029586,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.13","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5494559038492772,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.14","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5026927857016038,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 16.15]珠玑妙算","frequency":5.8641496499728465,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 16.15","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45078468500272795,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 16.16]部分排序","frequency":40.40333856496414,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.16","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6012111818034352,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":43.753494141085035,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 16.17","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443674976915974,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 16.18]模式匹配","frequency":30.733546932419063,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.18","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6089657540661193,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[面试题 16.19]水域大小","frequency":51.254408282865896,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.19","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7198593723203567,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 16.20]T9键盘","frequency":30.052239689191424,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.20","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46510419373278594,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[面试题 16.21]交换和","frequency":5.8641496499728465,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.21","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.581354051054384,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.645927818924828,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.22","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47010819732257475,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[面试题 16.24]数对和","frequency":23.91757750582751,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.24","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5435090861599313,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.6545513247124,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.25","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3863180802932249,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[面试题 16.26]计算器","frequency":60.62423148797962,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 16.26","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5987565512280342,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":24.559555950910564,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 17.01","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6457508674192445,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":41.07992774372667,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 17.04","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38585160708921595,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":18.3590911498422,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.05","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44718987341772154,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.8641496499728465,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.06","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41176179641903254,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[面试题 17.07]婴儿名字","frequency":35.81762406528862,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.07","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2717105038136608,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[面试题 17.08]马戏团人塔","frequency":39.43127145300367,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.08","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5496871397991108,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[面试题 17.09]第 k 个数","frequency":55.078458808007355,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.09","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713678881346822,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[面试题 17.10]主要元素","frequency":61.67488164036059,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 17.10","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6862223535786415,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 17.11]单词距离","frequency":35.100661777816974,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.11","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6316623360162241,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":17.055299153038327,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 17.12","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530114143239472,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[面试题 17.13]恢复空格","frequency":30.733546932419063,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.13","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5473519974094027,"acs":0,"articleLive":2,"columnArticles":417,"formTitle":"[面试题 17.14]最小K个数","frequency":73.76287556955732,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.14","status":"not_started","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40331081582659045,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.15]最长单词","frequency":30.733546932419063,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.15","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195065400936174,"acs":0,"articleLive":2,"columnArticles":1119,"formTitle":"[面试题 17.16]按摩师","frequency":55.793744236538515,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","questionId":"面试题 17.16","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.442272268108622,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":17.055299153038327,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.17","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.44701487646634774,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.18]最短超串","frequency":17.69412241561324,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.18","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816174909785609,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":33.10157802583374,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.19","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5689655172413793,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":17.055299153038327,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.20","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6350982253706273,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[面试题 17.21]直方图的水量","frequency":88.35523721486068,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.21","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3709157640318682,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.40333856496414,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.22","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.38005415162454875,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":7.645927818924828,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","questionId":"面试题 17.23","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5139791732407699,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.24]最大子矩阵","frequency":62.03761232593633,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.24","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49283878075651855,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":27.36483590908692,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.25","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34025071105024757,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":18.3590911498422,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","questionId":"面试题 17.26","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}] \ No newline at end of file