diff --git a/src/main/java/leetcode/editor/cn/CompareVersionNumbers.java b/src/main/java/leetcode/editor/cn/CompareVersionNumbers.java
new file mode 100644
index 0000000..e2a525e
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/CompareVersionNumbers.java
@@ -0,0 +1,114 @@
+//给你两个版本号 version1 和 version2 ，请你比较它们。
+//
+// 版本号由一个或多个修订号组成，各修订号由一个 '.' 连接。每个修订号由 多位数字 组成，可能包含 前导零 。每个版本号至少包含一个字符。修订号从左到右编
+//号，下标从 0 开始，最左边的修订号下标为 0 ，下一个修订号下标为 1 ，以此类推。例如，2.5.33 和 0.1 都是有效的版本号。
+//
+// 比较版本号时，请按从左到右的顺序依次比较它们的修订号。比较修订号时，只需比较 忽略任何前导零后的整数值 。也就是说，修订号 1 和修订号 001 相等 。
+//如果版本号没有指定某个下标处的修订号，则该修订号视为 0 。例如，版本 1.0 小于版本 1.1 ，因为它们下标为 0 的修订号相同，而下标为 1 的修订号分别
+//为 0 和 1 ，0 < 1 。
+//
+// 返回规则如下：
+//
+//
+// 如果 version1 > version2 返回 1，
+// 如果 version1 < version2 返回 -1，
+// 除此之外返回 0。
+//
+//
+//
+//
+// 示例 1：
+//
+//
+//输入：version1 = "1.01", version2 = "1.001"
+//输出：0
+//解释：忽略前导零，"01" 和 "001" 都表示相同的整数 "1"
+//
+//
+// 示例 2：
+//
+//
+//输入：version1 = "1.0", version2 = "1.0.0"
+//输出：0
+//解释：version1 没有指定下标为 2 的修订号，即视为 "0"
+//
+//
+// 示例 3：
+//
+//
+//输入：version1 = "0.1", version2 = "1.1"
+//输出：-1
+//解释：version1 中下标为 0 的修订号是 "0"，version2 中下标为 0 的修订号是 "1" 。0 < 1，所以 version1 <
+//version2
+//
+//
+// 示例 4：
+//
+//
+//输入：version1 = "1.0.1", version2 = "1"
+//输出：1
+//
+//
+// 示例 5：
+//
+//
+//输入：version1 = "7.5.2.4", version2 = "7.5.3"
+//输出：-1
+//
+//
+//
+//
+// 提示：
+//
+//
+// 1 <= version1.length, version2.length <= 500
+// version1 和 version2 仅包含数字和 '.'
+// version1 和 version2 都是 有效版本号
+// version1 和 version2 的所有修订号都可以存储在 32 位整数 中
+//
+// Related Topics 双指针 字符串 👍 215 👎 0
+
+package leetcode.editor.cn;
+
+//165:比较版本号
+class CompareVersionNumbers {
+ public static void main(String[] args) {
+ //测试代码
+ Solution solution = new CompareVersionNumbers().new Solution();
+ solution.compareVersion("0.1","1.1");
+ }
+
+ //力扣代码
+ //leetcode submit region begin(Prohibit modification and deletion)
+ class Solution {
+ public int compareVersion(String version1, String version2) {
+ String[] v1 = version1.split("\\.");
+ String[] v2 = version2.split("\\.");
+ int i = 0;
+ int j = 0;
+ while (i < v1.length || j < v2.length) {
+ if (i < v1.length && j < v2.length) {
+ if (Integer.parseInt(v1[i]) != Integer.parseInt(v2[j])) {
+ return Integer.parseInt(v1[i]) > Integer.parseInt(v2[j]) ? 1 : -1;
+ } else {
+ i++;
+ j++;
+ }
+ } else if (i == v1.length) {
+ while (j < v2.length && Integer.parseInt(v2[j]) == 0) {
+ j++;
+ }
+ return j == v2.length ? 0 : -1;
+ } else {
+ while (i < v1.length && Integer.parseInt(v1[i]) == 0) {
+ i++;
+ }
+ return i == v1.length ? 0 : 1;
+ }
+ }
+ return 0;
+ }
+ }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/all.json b/src/main/java/leetcode/editor/cn/doc/all.json
index b4910f1..d779c9c 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.5168143943166351,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1109]航班预订统计","frequency":37.608459643499685,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.5191548294326243,"acs":0,"articleLive":2,"columnArticles":13846,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4077955727502869,"acs":0,"articleLive":2,"columnArticles":6911,"formTitle":"[2]两数相加","frequency":99.23448247845415,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37885210017584237,"acs":0,"articleLive":2,"columnArticles":7114,"formTitle":"[3]无重复字符的最长子串","frequency":97.70344743536248,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40723739805689313,"acs":0,"articleLive":2,"columnArticles":3639,"formTitle":"[4]寻找两个正序数组的中位数","frequency":96.68445317245373,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3525896174616785,"acs":0,"articleLive":2,"columnArticles":3825,"formTitle":"[5]最长回文子串","frequency":96.75264793020199,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5061773123534112,"acs":0,"articleLive":2,"columnArticles":2355,"formTitle":"[6]Z 字形变换","frequency":79.41241329642565,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.3537570088373107,"acs":0,"articleLive":2,"columnArticles":5098,"formTitle":"[7]整数反转","frequency":98.46896495690832,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.2168445339548307,"acs":0,"articleLive":2,"columnArticles":2608,"formTitle":"[8]字符串转换整数 (atoi)","frequency":74.33300918581818,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5854286560729166,"acs":0,"articleLive":2,"columnArticles":4770,"formTitle":"[9]回文数","frequency":80.63804764850595,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31638948777340525,"acs":0,"articleLive":2,"columnArticles":1202,"formTitle":"[10]正则表达式匹配","frequency":86.82416867278232,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6316117614427134,"acs":0,"articleLive":2,"columnArticles":2905,"formTitle":"[11]盛最多水的容器","frequency":87.80281441806308,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6654904642504369,"acs":0,"articleLive":2,"columnArticles":1714,"formTitle":"[12]整数转罗马数字","frequency":76.75724516648944,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.633099474484488,"acs":0,"articleLive":2,"columnArticles":3755,"formTitle":"[13]罗马数字转整数","frequency":84.38966047876517,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4069719764121756,"acs":0,"articleLive":2,"columnArticles":3746,"formTitle":"[14]最长公共前缀","frequency":93.57510440353074,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3329962328352251,"acs":0,"articleLive":2,"columnArticles":2935,"formTitle":"[15]三数之和","frequency":95.29825578442092,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4596881035024503,"acs":0,"articleLive":2,"columnArticles":1377,"formTitle":"[16]最接近的三数之和","frequency":83.93788681330669,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.571745078082141,"acs":0,"articleLive":2,"columnArticles":2934,"formTitle":"[17]电话号码的字母组合","frequency":80.14790169960288,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40159450629739135,"acs":0,"articleLive":2,"columnArticles":1456,"formTitle":"[18]四数之和","frequency":69.54727863575958,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42781478727014116,"acs":0,"articleLive":2,"columnArticles":3649,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":76.75724516648944,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4447736899323357,"acs":0,"articleLive":2,"columnArticles":5355,"formTitle":"[20]有效的括号","frequency":93.41272056090999,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6666754961170039,"acs":0,"articleLive":2,"columnArticles":3311,"formTitle":"[21]合并两个有序链表","frequency":87.93319022070803,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724557550285478,"acs":0,"articleLive":2,"columnArticles":2534,"formTitle":"[22]括号生成","frequency":90.86768484148173,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5586460582423485,"acs":0,"articleLive":2,"columnArticles":2023,"formTitle":"[23]合并K个升序链表","frequency":83.55904085546184,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7025863668410701,"acs":0,"articleLive":2,"columnArticles":2422,"formTitle":"[24]两两交换链表中的节点","frequency":63.21568641804045,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6562099736900001,"acs":0,"articleLive":2,"columnArticles":2077,"formTitle":"[25]K 个一组翻转链表","frequency":92.40203975657697,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5402994825077637,"acs":0,"articleLive":2,"columnArticles":4356,"formTitle":"[26]删除有序数组中的重复项","frequency":81.66482265175314,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5983691862582867,"acs":0,"articleLive":2,"columnArticles":3908,"formTitle":"[27]移除元素","frequency":74.63116756469292,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40713760077820027,"acs":0,"articleLive":2,"columnArticles":3130,"formTitle":"[28]实现 strStr()","frequency":74.93598118218877,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2073549202164181,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[29]两数相除","frequency":70.03280865251818,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.3555166538290969,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[30]串联所有单词的子串","frequency":59.423325706048544,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3732752758461842,"acs":0,"articleLive":2,"columnArticles":1667,"formTitle":"[31]下一个排列","frequency":81.53041309043815,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3555248083573233,"acs":0,"articleLive":2,"columnArticles":1259,"formTitle":"[32]最长有效括号","frequency":78.54848933512945,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4257542158479724,"acs":0,"articleLive":2,"columnArticles":2297,"formTitle":"[33]搜索旋转排序数组","frequency":78.54848933512945,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42448310324204935,"acs":0,"articleLive":2,"columnArticles":3105,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.52409795126938,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4662196968284635,"acs":0,"articleLive":2,"columnArticles":3743,"formTitle":"[35]搜索插入位置","frequency":75.75219571495887,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6286816477180084,"acs":0,"articleLive":2,"columnArticles":1111,"formTitle":"[36]有效的数独","frequency":53.64028443815957,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6708612313645791,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[37]解数独","frequency":67.31200699195271,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5796130747213597,"acs":0,"articleLive":2,"columnArticles":2215,"formTitle":"[38]外观数列","frequency":65.7675671953822,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7268732839993873,"acs":0,"articleLive":2,"columnArticles":1862,"formTitle":"[39]组合总和","frequency":74.40316960610653,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6280986836255134,"acs":0,"articleLive":2,"columnArticles":1334,"formTitle":"[40]组合总和 II","frequency":71.87034377266323,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41886909643974807,"acs":0,"articleLive":2,"columnArticles":1372,"formTitle":"[41]缺失的第一个正数","frequency":89.89728320783688,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.574972811183261,"acs":0,"articleLive":2,"columnArticles":2335,"formTitle":"[42]接雨水","frequency":95.52104053846632,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.44882039103150845,"acs":0,"articleLive":2,"columnArticles":1103,"formTitle":"[43]字符串相乘","frequency":83.43226554608573,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3280011881919412,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[44]通配符匹配","frequency":63.855781172273005,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4250999359119181,"acs":0,"articleLive":2,"columnArticles":1508,"formTitle":"[45]跳跃游戏 II","frequency":96.93792991381663,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7821792069200574,"acs":0,"articleLive":2,"columnArticles":2560,"formTitle":"[46]全排列","frequency":94.32062128602703,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6361964891724032,"acs":0,"articleLive":2,"columnArticles":1419,"formTitle":"[47]全排列 II","frequency":67.2958131845505,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7347954223600107,"acs":0,"articleLive":2,"columnArticles":1798,"formTitle":"[48]旋转图像","frequency":72.11884294725726,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6638950228816017,"acs":0,"articleLive":2,"columnArticles":1254,"formTitle":"[49]字母异位词分组","frequency":69.61180624018627,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.37675624552735015,"acs":0,"articleLive":2,"columnArticles":1240,"formTitle":"[50]Pow(x, n)","frequency":67.15465755382628,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7389849078034144,"acs":0,"articleLive":2,"columnArticles":1488,"formTitle":"[51]N 皇后","frequency":69.33264232323295,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8234349919743178,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[52]N皇后 II","frequency":28.908705389905005,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5510388999557326,"acs":0,"articleLive":2,"columnArticles":3597,"formTitle":"[53]最大子序和","frequency":79.31269912684127,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4791970071128559,"acs":0,"articleLive":2,"columnArticles":1928,"formTitle":"[54]螺旋矩阵","frequency":89.73224639446113,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43209244548308695,"acs":0,"articleLive":2,"columnArticles":2351,"formTitle":"[55]跳跃游戏","frequency":76.19289317555544,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4664535908063362,"acs":0,"articleLive":2,"columnArticles":2205,"formTitle":"[56]合并区间","frequency":87.88797361319874,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.4104522268000785,"acs":0,"articleLive":2,"columnArticles":901,"formTitle":"[57]插入区间","frequency":38.191241125186096,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3528698157555539,"acs":0,"articleLive":2,"columnArticles":2312,"formTitle":"[58]最后一个单词的长度","frequency":54.75611025376297,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7931370483514169,"acs":0,"articleLive":2,"columnArticles":1495,"formTitle":"[59]螺旋矩阵 II","frequency":78.33272682754604,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.523431029654478,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[60]排列序列","frequency":38.79223991963551,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.418100240800943,"acs":0,"articleLive":2,"columnArticles":1938,"formTitle":"[61]旋转链表","frequency":72.50759841426239,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.660061847325961,"acs":0,"articleLive":2,"columnArticles":2327,"formTitle":"[62]不同路径","frequency":68.7024663479012,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3899055118110236,"acs":0,"articleLive":2,"columnArticles":1642,"formTitle":"[63]不同路径 II","frequency":70.7407726761627,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6878596517450116,"acs":0,"articleLive":2,"columnArticles":2009,"formTitle":"[64]最小路径和","frequency":72.69508052270957,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2691326378539493,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[65]有效数字","frequency":45.82435442849157,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4584578169337695,"acs":0,"articleLive":2,"columnArticles":3061,"formTitle":"[66]加一","frequency":63.95605395347733,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.543814693879912,"acs":0,"articleLive":2,"columnArticles":1724,"formTitle":"[67]二进制求和","frequency":57.44521469693321,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.4703671371065522,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[68]文本左右对齐","frequency":43.881693006295876,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3928404484068638,"acs":0,"articleLive":2,"columnArticles":1864,"formTitle":"[69]x 的平方根","frequency":79.82329301446264,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5279036198844658,"acs":0,"articleLive":2,"columnArticles":3428,"formTitle":"[70]爬楼梯","frequency":94.02230830656542,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.42149783084281955,"acs":0,"articleLive":2,"columnArticles":801,"formTitle":"[71]简化路径","frequency":54.35715083333442,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6126763154215751,"acs":0,"articleLive":2,"columnArticles":1188,"formTitle":"[72]编辑距离","frequency":93.41558370346394,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6014397531851683,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[73]矩阵置零","frequency":54.47477225871845,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45853583844203866,"acs":0,"articleLive":2,"columnArticles":1628,"formTitle":"[74]搜索二维矩阵","frequency":76.05699008742646,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5941122004103871,"acs":0,"articleLive":2,"columnArticles":1778,"formTitle":"[75]颜色分类","frequency":46.2369232756011,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4239381598756561,"acs":0,"articleLive":2,"columnArticles":1197,"formTitle":"[76]最小覆盖子串","frequency":82.88014431647288,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700818311062685,"acs":0,"articleLive":2,"columnArticles":1211,"formTitle":"[77]组合","frequency":73.039511859549,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8006884200973561,"acs":0,"articleLive":2,"columnArticles":1959,"formTitle":"[78]子集","frequency":75.20598804232989,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45724155925931514,"acs":0,"articleLive":2,"columnArticles":1342,"formTitle":"[79]单词搜索","frequency":71.24414535401729,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.615996683916568,"acs":0,"articleLive":2,"columnArticles":1296,"formTitle":"[80]删除有序数组中的重复项 II","frequency":67.95369823229376,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.41603961424589225,"acs":0,"articleLive":2,"columnArticles":962,"formTitle":"[81]搜索旋转排序数组 II","frequency":73.20222682262767,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5289809875784686,"acs":0,"articleLive":2,"columnArticles":1625,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":82.3131833440334,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386645722132282,"acs":0,"articleLive":2,"columnArticles":1859,"formTitle":"[83]删除排序链表中的重复元素","frequency":70.30108714731664,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4326716208747829,"acs":0,"articleLive":2,"columnArticles":1113,"formTitle":"[84]柱状图中最大的矩形","frequency":80.90224302910805,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5162609262594897,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[85]最大矩形","frequency":60.950830692548095,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6322229924079098,"acs":0,"articleLive":2,"columnArticles":1066,"formTitle":"[86]分隔链表","frequency":58.02858997720691,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.4887769508722391,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":69.92175102307259,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5151519425326263,"acs":0,"articleLive":2,"columnArticles":3085,"formTitle":"[88]合并两个有序数组","frequency":95.36926585658625,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7093920713677141,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[89]格雷编码","frequency":45.15531268884913,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338287993218249,"acs":0,"articleLive":2,"columnArticles":1164,"formTitle":"[90]子集 II","frequency":75.92306452530025,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3048210159386115,"acs":0,"articleLive":2,"columnArticles":1466,"formTitle":"[91]解码方法","frequency":68.41898723104599,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5469753571896709,"acs":0,"articleLive":2,"columnArticles":1955,"formTitle":"[92]反转链表 II","frequency":88.76132384044054,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5375563056790289,"acs":0,"articleLive":2,"columnArticles":1272,"formTitle":"[93]复原 IP 地址","frequency":82.02388440537207,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7558706373023601,"acs":0,"articleLive":2,"columnArticles":2195,"formTitle":"[94]二叉树的中序遍历","frequency":65.06940581024723,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.699237558739836,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.61019640749748,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6993648777389647,"acs":0,"articleLive":2,"columnArticles":1230,"formTitle":"[96]不同的二叉搜索树","frequency":67.82375234898987,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4577749515218603,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[97]交错字符串","frequency":43.881693006295876,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34856362851919714,"acs":0,"articleLive":2,"columnArticles":1848,"formTitle":"[98]验证二叉搜索树","frequency":74.41753269015642,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6153748284667885,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[99]恢复二叉搜索树","frequency":56.983249121703075,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6038470172500334,"acs":0,"articleLive":2,"columnArticles":1813,"formTitle":"[100]相同的树","frequency":56.32642931538688,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.561224913961032,"acs":0,"articleLive":2,"columnArticles":2163,"formTitle":"[101]对称二叉树","frequency":76.54681601025717,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.642132091972328,"acs":0,"articleLive":2,"columnArticles":2397,"formTitle":"[102]二叉树的层序遍历","frequency":88.69870774225384,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5719247239202806,"acs":0,"articleLive":2,"columnArticles":1531,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":83.10407989796317,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7659146201086382,"acs":0,"articleLive":2,"columnArticles":2448,"formTitle":"[104]二叉树的最大深度","frequency":78.77381942686436,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7036231647586189,"acs":0,"articleLive":2,"columnArticles":1376,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.18217544589193,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7211361350615303,"acs":0,"articleLive":2,"columnArticles":845,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":71.84059681642438,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6954255655472812,"acs":0,"articleLive":2,"columnArticles":1276,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.855781172273005,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7593359970342299,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.718759258551415,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7636380398434423,"acs":0,"articleLive":2,"columnArticles":701,"formTitle":"[109]有序链表转换二叉搜索树","frequency":58.23854789837858,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.562452548868948,"acs":0,"articleLive":2,"columnArticles":1408,"formTitle":"[110]平衡二叉树","frequency":65.80969303159637,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48432158169665424,"acs":0,"articleLive":2,"columnArticles":1720,"formTitle":"[111]二叉树的最小深度","frequency":43.881693006295876,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257375831804351,"acs":0,"articleLive":2,"columnArticles":1593,"formTitle":"[112]路径总和","frequency":61.83479393385283,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6260904308450422,"acs":0,"articleLive":2,"columnArticles":1184,"formTitle":"[113]路径总和 II","frequency":64.91010110074404,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7258562285055117,"acs":0,"articleLive":2,"columnArticles":1257,"formTitle":"[114]二叉树展开为链表","frequency":46.11816625303793,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5242718446601942,"acs":0,"articleLive":2,"columnArticles":658,"formTitle":"[115]不同的子序列","frequency":66.40869261557806,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7026745364799954,"acs":0,"articleLive":2,"columnArticles":1113,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":50.031508827091365,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6102386732260628,"acs":0,"articleLive":2,"columnArticles":715,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":28.78283027455357,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7257459162178634,"acs":0,"articleLive":2,"columnArticles":1660,"formTitle":"[118]杨辉三角","frequency":71.69053235335792,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6631566671363943,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[119]杨辉三角 II","frequency":57.50921373877173,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6791378932914088,"acs":0,"articleLive":2,"columnArticles":1510,"formTitle":"[120]三角形最小路径和","frequency":54.47477225871845,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5731915116650961,"acs":0,"articleLive":2,"columnArticles":3262,"formTitle":"[121]买卖股票的最佳时机","frequency":85.51799282508956,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6872910691635269,"acs":0,"articleLive":2,"columnArticles":2548,"formTitle":"[122]买卖股票的最佳时机 II","frequency":68.54135038149754,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5337451345405314,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[123]买卖股票的最佳时机 III","frequency":62.2915198921808,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.4431717776233168,"acs":0,"articleLive":2,"columnArticles":1053,"formTitle":"[124]二叉树中的最大路径和","frequency":84.03058551583862,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47389030935434084,"acs":0,"articleLive":2,"columnArticles":1788,"formTitle":"[125]验证回文串","frequency":67.43875727322087,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3942904109589041,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[126]单词接龙 II","frequency":38.996812391618974,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4670457110389863,"acs":0,"articleLive":2,"columnArticles":634,"formTitle":"[127]单词接龙","frequency":49.26042941174064,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5431582803854987,"acs":0,"articleLive":2,"columnArticles":1051,"formTitle":"[128]最长连续序列","frequency":76.40535463864403,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6798807112177793,"acs":0,"articleLive":2,"columnArticles":1077,"formTitle":"[129]求根节点到叶节点数字之和","frequency":64.74152622261718,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.442328596450046,"acs":0,"articleLive":2,"columnArticles":1123,"formTitle":"[130]被围绕的区域","frequency":58.50764202477772,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7235878143297598,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[131]分割回文串","frequency":83.79006496450087,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49252924558129096,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[132]分割回文串 II","frequency":64.74152622261718,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6751413785488656,"acs":0,"articleLive":2,"columnArticles":512,"formTitle":"[133]克隆图","frequency":4.5163267526124375,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5761565614717391,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[134]加油站","frequency":75.56070400400881,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4859526963298166,"acs":0,"articleLive":2,"columnArticles":756,"formTitle":"[135]分发糖果","frequency":86.32245802883727,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7190916102079903,"acs":0,"articleLive":2,"columnArticles":2169,"formTitle":"[136]只出现一次的数字","frequency":78.6439913506025,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194563461921373,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[137]只出现一次的数字 II","frequency":74.55206980426632,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6590560759031748,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[138]复制带随机指针的链表","frequency":70.7407726761627,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5129294057267256,"acs":0,"articleLive":2,"columnArticles":1152,"formTitle":"[139]单词拆分","frequency":77.99682794060193,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4826470312353438,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[140]单词拆分 II","frequency":41.40257325092784,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5125117490175632,"acs":0,"articleLive":2,"columnArticles":2620,"formTitle":"[141]环形链表","frequency":77.91458604687057,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5515412811255151,"acs":0,"articleLive":2,"columnArticles":1644,"formTitle":"[142]环形链表 II","frequency":71.93494251248275,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6171134116624502,"acs":0,"articleLive":2,"columnArticles":1033,"formTitle":"[143]重排链表","frequency":91.95753318702285,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7027000777000777,"acs":0,"articleLive":2,"columnArticles":1764,"formTitle":"[144]二叉树的前序遍历","frequency":58.29939405533238,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7493779145853685,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[145]二叉树的后序遍历","frequency":67.89020770103899,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5269191789716301,"acs":0,"articleLive":2,"columnArticles":1321,"formTitle":"[146]LRU 缓存机制","frequency":95.17663188344763,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6810211810913172,"acs":0,"articleLive":2,"columnArticles":763,"formTitle":"[147]对链表进行插入排序","frequency":47.97881166725187,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6674346571763401,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[148]排序链表","frequency":79.70626002933994,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.3364034267330066,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[149]直线上最多的点数","frequency":66.40869261557806,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5367585315061131,"acs":0,"articleLive":2,"columnArticles":1015,"formTitle":"[150]逆波兰表达式求值","frequency":70.7407726761627,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48011098904697685,"acs":0,"articleLive":2,"columnArticles":1373,"formTitle":"[151]翻转字符串里的单词","frequency":59.915748268205995,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.42042497779262306,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[152]乘积最大子数组","frequency":75.66096546655783,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5656457257497345,"acs":0,"articleLive":2,"columnArticles":1430,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.32642931538688,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319380213615695,"acs":0,"articleLive":2,"columnArticles":867,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":66.63645716880443,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5725303073662557,"acs":0,"articleLive":2,"columnArticles":1538,"formTitle":"[155]最小栈","frequency":71.31311782038416,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7255085340191724,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[156]上下翻转二叉树","frequency":16.35360301351877,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5305429864253394,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5892255892255892,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.776484482550018,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5419041978233509,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":44.11430477975606,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6122593472116711,"acs":0,"articleLive":2,"columnArticles":1892,"formTitle":"[160]相交链表","frequency":73.30299776036242,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33687729235340547,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.17475093105394,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4945901565130071,"acs":0,"articleLive":2,"columnArticles":699,"formTitle":"[162]寻找峰值","frequency":59.519118023910536,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3235283138601665,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[163]缺失的区间","frequency":17.62479162823902,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6111623078797123,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[164]最大间距","frequency":59.62103796315776,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.48640298357389006,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[165]比较版本号","frequency":81.18495093200423,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29851612079867273,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[166]分数到小数","frequency":52.420301754959844,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.586476057020053,"acs":0,"articleLive":2,"columnArticles":1792,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":64.37310351591734,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.4325762443643161,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[168]Excel表列名称","frequency":63.591505936377104,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6645072874552178,"acs":0,"articleLive":2,"columnArticles":2100,"formTitle":"[169]多数元素","frequency":69.85204192523767,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.416704910509408,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.046388508442953,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7173616751793164,"acs":0,"articleLive":2,"columnArticles":892,"formTitle":"[171]Excel 表列序号","frequency":49.763082403611506,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4378256850940521,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[172]阶乘后的零","frequency":47.97881166725187,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8032124101865483,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[173]二叉搜索树迭代器","frequency":48.55601177839275,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47939827411956776,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[174]地下城游戏","frequency":66.46797922643685,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399287885191099,"acs":0,"articleLive":2,"columnArticles":1431,"formTitle":"[175]组合两个表","frequency":94.35350826437806,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561199055930945,"acs":0,"articleLive":2,"columnArticles":980,"formTitle":"[176]第二高的薪水","frequency":95.61457049565297,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.46221678171081415,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[177]第N高的薪水","frequency":77.87231248058019,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6021907080114298,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[178]分数排名","frequency":69.43535483760512,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4099179086072649,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[179]最大数","frequency":82.85745333675433,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.487171533914672,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[180]连续出现的数字","frequency":72.55889536588572,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7029867480784038,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[181]超过经理收入的员工","frequency":71.84059681642438,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7973302864275029,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[182]查找重复的电子邮箱","frequency":61.06914478838773,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6775249670246843,"acs":0,"articleLive":2,"columnArticles":523,"formTitle":"[183]从不订购的客户","frequency":47.36766382772175,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47453709324177984,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[184]部门工资最高的员工","frequency":74.87645366373727,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49305357625718943,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[185]部门工资前三高的所有员工","frequency":74.67196411955581,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7536081403800229,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.17475093105394,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4826765499928954,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[187]重复的DNA序列","frequency":33.31033267691227,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38899187612452973,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":52.041443411948386,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4528912560403513,"acs":0,"articleLive":2,"columnArticles":1597,"formTitle":"[189]旋转数组","frequency":64.593363315544,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6958021473820226,"acs":0,"articleLive":2,"columnArticles":800,"formTitle":"[190]颠倒二进制位","frequency":51.14271540830024,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7472645389955614,"acs":0,"articleLive":2,"columnArticles":1163,"formTitle":"[191]位1的个数","frequency":65.5915746651493,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35587579402621977,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[192]统计词频","frequency":57.027802028484686,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3238923342497283,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":36.95020505278875,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34560701221616397,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[194]转置文件","frequency":30.21746506842205,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4360400585237879,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[195]第十行","frequency":54.22355943006205,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6652700504422239,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[196]删除重复的电子邮箱","frequency":61.9642507161281,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339207569485511,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[197]上升的温度","frequency":58.91807030149132,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5115713345563937,"acs":0,"articleLive":2,"columnArticles":2545,"formTitle":"[198]打家劫舍","frequency":81.80427646757289,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.652575886870657,"acs":0,"articleLive":2,"columnArticles":1529,"formTitle":"[199]二叉树的右视图","frequency":84.43508495985778,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5516009408271141,"acs":0,"articleLive":2,"columnArticles":2038,"formTitle":"[200]岛屿数量","frequency":92.0810941473268,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5224268665484492,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[201]数字范围按位与","frequency":36.95020505278875,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6180369332033154,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[202]快乐数","frequency":60.103514064939425,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5132882777907247,"acs":0,"articleLive":2,"columnArticles":1572,"formTitle":"[203]移除链表元素","frequency":57.33596873558389,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37935377036861806,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[204]计数质数","frequency":54.35715083333442,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010685801071308,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[205]同构字符串","frequency":51.72229438996292,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7224171397258858,"acs":0,"articleLive":2,"columnArticles":7181,"formTitle":"[206]反转链表","frequency":96.0541751752776,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5448903148120462,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[207]课程表","frequency":72.55889536588572,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7163953797063125,"acs":0,"articleLive":2,"columnArticles":931,"formTitle":"[208]实现 Trie (前缀树)","frequency":70.00796721301215,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4694005897549646,"acs":0,"articleLive":2,"columnArticles":1291,"formTitle":"[209]长度最小的子数组","frequency":56.82492481696669,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5415036940460669,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[210]课程表 II","frequency":51.408135970483926,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4813748642545636,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":34.63760524872387,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.45069494836728996,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[212]单词搜索 II","frequency":42.11387961110793,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.43246473622332005,"acs":0,"articleLive":2,"columnArticles":1437,"formTitle":"[213]打家劫舍 II","frequency":73.62813461079527,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37076392527692137,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[214]最短回文串","frequency":59.845779057007384,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6471082868162453,"acs":0,"articleLive":2,"columnArticles":2199,"formTitle":"[215]数组中的第K个最大元素","frequency":90.36346799757663,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7395304868441783,"acs":0,"articleLive":2,"columnArticles":984,"formTitle":"[216]组合总和 III","frequency":64.95076566856004,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614459064399886,"acs":0,"articleLive":2,"columnArticles":1576,"formTitle":"[217]存在重复元素","frequency":69.9053695940401,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5427816083741203,"acs":0,"articleLive":2,"columnArticles":268,"formTitle":"[218]天际线问题","frequency":64.48293818462867,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42550949541394256,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[219]存在重复元素 II","frequency":47.30756992885984,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2871210217277068,"acs":0,"articleLive":2,"columnArticles":413,"formTitle":"[220]存在重复元素 III","frequency":64.51648303878919,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.472827842667107,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[221]最大正方形","frequency":74.13781303656366,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7800398194105606,"acs":0,"articleLive":2,"columnArticles":854,"formTitle":"[222]完全二叉树的节点个数","frequency":40.05349100799297,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.46065160567587754,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[223]矩形面积","frequency":47.234367870567354,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4177542809479417,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[224]基本计算器","frequency":91.06880130195864,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6757949607220458,"acs":0,"articleLive":2,"columnArticles":4723,"formTitle":"[225]用队列实现栈","frequency":51.449740882973416,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7876275475497265,"acs":0,"articleLive":2,"columnArticles":1787,"formTitle":"[226]翻转二叉树","frequency":73.70802273878235,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4369086427605947,"acs":0,"articleLive":2,"columnArticles":688,"formTitle":"[227]基本计算器 II","frequency":78.53740705153065,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.581768478603722,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[228]汇总区间","frequency":16.35360301351877,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46304393636076285,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[229]求众数 II","frequency":40.05349100799297,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7405248635930192,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":40.88563123622685,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5034736898131189,"acs":0,"articleLive":2,"columnArticles":1164,"formTitle":"[231]2 的幂","frequency":48.609323275026696,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.690992346857088,"acs":0,"articleLive":2,"columnArticles":1212,"formTitle":"[232]用栈实现队列","frequency":66.72687885885547,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47610210141617176,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":41.658238831321846,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.4929343585016481,"acs":0,"articleLive":2,"columnArticles":1906,"formTitle":"[234]回文链表","frequency":80.79904671730095,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6659918533604888,"acs":0,"articleLive":2,"columnArticles":930,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":49.88789992644683,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6797564958508759,"acs":0,"articleLive":2,"columnArticles":1322,"formTitle":"[236]二叉树的最近公共祖先","frequency":75.13737797269233,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8480698583251742,"acs":0,"articleLive":2,"columnArticles":995,"formTitle":"[237]删除链表中的节点","frequency":55.266138420028255,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.722588643419915,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[238]除自身以外数组的乘积","frequency":57.44521469693321,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49620544311419473,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[239]滑动窗口最大值","frequency":70.7407726761627,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4742844935525793,"acs":0,"articleLive":2,"columnArticles":716,"formTitle":"[240]搜索二维矩阵 II","frequency":64.40846992037646,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.736637655504745,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[241]为运算表达式设计优先级","frequency":51.72229438996292,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6439516466356209,"acs":0,"articleLive":2,"columnArticles":1598,"formTitle":"[242]有效的字母异位词","frequency":59.69268612492655,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6571072319201995,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.5491154562383612,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6106181603076013,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.47418738049713194,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5212553794478849,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.4647453326083016,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6390124034636087,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6343703703703704,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[250]统计同值子树","frequency":6.17475093105394,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5419100236779795,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[251]展开二维向量","frequency":16.35360301351877,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5611725994615615,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[252]会议室","frequency":6.17475093105394,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49682182347877907,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[253]会议室 II","frequency":56.32642931538688,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5690781796966161,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[254]因子的组合","frequency":17.62479162823902,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4719462579241177,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6317926114945195,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[256]粉刷房子","frequency":5.046388508442953,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6803472770323599,"acs":0,"articleLive":2,"columnArticles":1015,"formTitle":"[257]二叉树的所有路径","frequency":63.1402002286024,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6914955320730094,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[258]各位相加","frequency":49.26042941174064,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5667700561656468,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.046388508442953,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.725379967834944,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[260]只出现一次的数字 III","frequency":52.695349954880044,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.4974112426035503,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[261]以图判树","frequency":24.618777259563856,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4381708274828054,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[262]行程和用户","frequency":64.01117351867516,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154852064282504,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[263]丑数","frequency":55.69021258005422,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5784518639432836,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[264]丑数 II","frequency":59.95583864219262,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5812546537602383,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[265]粉刷房子 II","frequency":4.5163267526124375,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6706328314204486,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44485244118047057,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.776484482550018,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6230233381536795,"acs":0,"articleLive":2,"columnArticles":1056,"formTitle":"[268]丢失的数字","frequency":32.070749902799776,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33990536277602523,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5495173400071505,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.97684917048487,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.550412863972186,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.6450538687561215,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":10.249377256279203,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30875636173822263,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":34.63760524872387,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4402420701869245,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[274]H 指数","frequency":57.662023881722476,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.4631204950044992,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[275]H 指数 II","frequency":33.31033267691227,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.48610514252972353,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[276]栅栏涂色","frequency":25.294823619573307,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5682674971316177,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.776484482550018,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45519878444582235,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[278]第一个错误的版本","frequency":69.87055863726586,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6306620322668997,"acs":0,"articleLive":2,"columnArticles":1152,"formTitle":"[279]完全平方数","frequency":72.832166789379,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6866453674121406,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.97684917048487,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7567909033480733,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.38868429862738535,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6392102557646713,"acs":0,"articleLive":2,"columnArticles":3188,"formTitle":"[283]移动零","frequency":75.2381578510664,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7333927113486232,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[284]顶端迭代器","frequency":16.97684917048487,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6359535544231893,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5062431142122659,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[286]墙与门","frequency":6.776484482550018,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.662430469864188,"acs":0,"articleLive":2,"columnArticles":1193,"formTitle":"[287]寻找重复数","frequency":63.02103062013561,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.4259449730007714,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.753291098776554,"acs":0,"articleLive":2,"columnArticles":813,"formTitle":"[289]生命游戏","frequency":5.598654288917338,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.457008454716721,"acs":0,"articleLive":2,"columnArticles":1057,"formTitle":"[290]单词规律","frequency":27.687480525420437,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5341710758377425,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6967061512030316,"acs":0,"articleLive":2,"columnArticles":555,"formTitle":"[292]Nim 游戏","frequency":41.40257325092784,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7106842737094838,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[293]翻转游戏","frequency":5.598654288917338,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5848928206873086,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5233264684356543,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[295]数据流的中位数","frequency":40.18425852312906,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.619872136387853,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":25.99759840260919,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5577580962904675,"acs":0,"articleLive":2,"columnArticles":724,"formTitle":"[297]二叉树的序列化与反序列化","frequency":59.423325706048544,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5782787395690622,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.5037613355317395,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[299]猜数字游戏","frequency":23.33975049175521,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5113366706140424,"acs":0,"articleLive":2,"columnArticles":1901,"formTitle":"[300]最长递增子序列","frequency":81.59077507827584,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5220647773279352,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[301]删除无效的括号","frequency":54.0705053741304,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6651376146788991,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7239983997256673,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[303]区域和检索 - 数组不可变","frequency":48.67348582826471,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5401439645625692,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":42.75825921515129,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3766087364960075,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[305]岛屿数量 II","frequency":5.598654288917338,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33736295802242694,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[306]累加数","frequency":40.4928560097843,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5432482444486619,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[307]区域和检索 - 数组可修改","frequency":18.299252783972932,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6054363376251788,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.604982556677129,"acs":0,"articleLive":2,"columnArticles":885,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":70.7407726761627,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.37885679837781555,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[310]最小高度树","frequency":45.249513738439475,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7630567488130229,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.62479162823902,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6824468825531808,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[312]戳气球","frequency":54.90052531710315,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6503912004452156,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[313]超级丑数","frequency":32.95332046694593,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5465765882811485,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.4185324761693638,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":57.58098133874877,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47696874171405,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[316]去除重复字母","frequency":58.76509393865494,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48625972762645914,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.682659478885894,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[318]最大单词长度乘积","frequency":6.776484482550018,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5163297045101088,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[319]灯泡开关","frequency":16.97684917048487,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.671863926293409,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4256370808032865,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[321]拼接最大数","frequency":35.33795332788147,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4428329133029512,"acs":0,"articleLive":2,"columnArticles":1746,"formTitle":"[322]零钱兑换","frequency":82.78670268605852,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6347770700636942,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[323]无向图中连通分量的数目","frequency":35.33795332788147,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.37763857369353687,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[324]摆动排序 II","frequency":40.4928560097843,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5383266835932777,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":33.31033267691227,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.48974445981571874,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[326]3的幂","frequency":29.551416121097656,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42433318064902575,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":38.42939389149314,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6569401672380368,"acs":0,"articleLive":2,"columnArticles":1034,"formTitle":"[328]奇偶链表","frequency":62.8771327361766,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4827642379431116,"acs":0,"articleLive":2,"columnArticles":470,"formTitle":"[329]矩阵中的最长递增路径","frequency":57.662023881722476,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5340493601462523,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":33.96228035894468,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47999869627569425,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[331]验证二叉树的前序序列化","frequency":57.75426429099772,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44873879755475105,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[332]重新安排行程","frequency":51.351540593964614,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46616936331162007,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[333]最大 BST 子树","frequency":17.62479162823902,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41325536062378165,"acs":0,"articleLive":2,"columnArticles":282,"formTitle":"[334]递增的三元子序列","frequency":16.35360301351877,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.36887721602101115,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40097727648474385,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[336]回文对","frequency":36.0651502442695,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6087285989459583,"acs":0,"articleLive":2,"columnArticles":897,"formTitle":"[337]打家劫舍 III","frequency":71.93494251248275,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7873568832290536,"acs":0,"articleLive":2,"columnArticles":1330,"formTitle":"[338]比特位计数","frequency":71.38358133700032,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8101976639712489,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.4947472389332854,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":29.551416121097656,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7268627966027493,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":72.79781009705529,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5155205450287418,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[342]4的幂","frequency":49.26042941174064,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6044275804273942,"acs":0,"articleLive":2,"columnArticles":1004,"formTitle":"[343]整数拆分","frequency":64.54232410037876,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7650531521487156,"acs":0,"articleLive":2,"columnArticles":1841,"formTitle":"[344]反转字符串","frequency":67.82375234898987,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5387854259277217,"acs":0,"articleLive":2,"columnArticles":1013,"formTitle":"[345]反转字符串中的元音字母","frequency":29.181393953128154,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7067940169399892,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6221468129706789,"acs":0,"articleLive":2,"columnArticles":1423,"formTitle":"[347]前 K 个高频元素","frequency":80.2571357814806,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6003621314019658,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738256793405054,"acs":0,"articleLive":2,"columnArticles":1442,"formTitle":"[349]两个数组的交集","frequency":69.43535483760512,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5495996311129108,"acs":0,"articleLive":2,"columnArticles":1309,"formTitle":"[350]两个数组的交集 II","frequency":63.5222052269153,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.589221824686941,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":21.305027910745853,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.591953222887373,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.42422360248447205,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":8.756863325826588,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4509297000382758,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[354]俄罗斯套娃信封问题","frequency":77.98437047445186,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40690775192551976,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[355]设计推特","frequency":38.29011339087789,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3515843429636533,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5198288344751573,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.75825921515129,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3519796287169377,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.724960254372019,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6073345259391771,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5670103092783505,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.695045045045045,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":5.598654288917338,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4907476280834915,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":56.32642931538688,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7175071750717508,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.3638902688083016,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[365]水壶问题","frequency":49.26042941174064,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7622585438335809,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.43937654010861504,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[367]有效的完全平方数","frequency":15.753410381957552,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4589739257757504,"acs":0,"articleLive":2,"columnArticles":443,"formTitle":"[368]最大整除子集","frequency":70.7407726761627,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6169280768687296,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7185185185185186,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":17.62479162823902,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.579638326585695,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":47.97881166725187,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5074952098283052,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":6.776484482550018,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4253465970471732,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[373]查找和最小的K对数字","frequency":44.11430477975606,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.514318573893042,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":34.63760524872387,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4674675668519989,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[375]猜数字大小 II","frequency":35.33795332788147,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.4619608606756888,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[376]摆动序列","frequency":32.68027306200834,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.506968292601607,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[377]组合总和 Ⅳ","frequency":60.950830692548095,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6387811680060727,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":57.027802028484686,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6462555066079295,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021131936787946,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":30.908497965194275,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.4430161534041331,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.627982190860215,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.618777259563856,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5954005366040629,"acs":0,"articleLive":2,"columnArticles":684,"formTitle":"[383]赎金信","frequency":15.174785297802634,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5757672257212275,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[384]打乱数组","frequency":55.648499897666106,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41469084146908414,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.598654288917338,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.746493268485233,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[386]字典序排数","frequency":57.662023881722476,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5307888630505929,"acs":0,"articleLive":2,"columnArticles":1139,"formTitle":"[387]字符串中的第一个唯一字符","frequency":63.855781172273005,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5245841035120148,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6922842740222593,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[389]找不同","frequency":23.33975049175521,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.46656116691894867,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":36.82122844662493,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.356053307642903,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5146366120418733,"acs":0,"articleLive":2,"columnArticles":1528,"formTitle":"[392]判断子序列","frequency":58.76509393865494,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3916545718432511,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":34.63760524872387,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5512667767171463,"acs":0,"articleLive":2,"columnArticles":1249,"formTitle":"[394]字符串解码","frequency":90.04927448444973,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5204304429195259,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.32642931538688,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.42334051302134323,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.37783038287361054,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[397]整数替换","frequency":23.33975049175521,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6537001897533207,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[398]随机数索引","frequency":38.29011339087789,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.592576922515793,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[399]除法求值","frequency":29.551416121097656,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4139967984127342,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[400]第 N 位数字","frequency":47.234367870567354,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138563245767931,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":48.609323275026696,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3278222364940805,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[402]移掉 K 位数字","frequency":70.00796721301215,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4562458590285918,"acs":0,"articleLive":2,"columnArticles":453,"formTitle":"[403]青蛙过河","frequency":69.85204192523767,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5817308571393743,"acs":0,"articleLive":2,"columnArticles":1084,"formTitle":"[404]左叶子之和","frequency":56.32642931538688,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5229085845021386,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[405]数字转换为十六进制数","frequency":44.8291062817839,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7356896607275187,"acs":0,"articleLive":2,"columnArticles":766,"formTitle":"[406]根据身高重建队列","frequency":58.62918734829614,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4830821439265396,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":48.67348582826471,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.325336171036084,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.5556283167252531,"acs":0,"articleLive":2,"columnArticles":1279,"formTitle":"[409]最长回文串","frequency":64.54232410037876,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5617287648256859,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[410]分割数组的最大值","frequency":74.41753269015642,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49628359062321326,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.6728735458528479,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[412]Fizz Buzz","frequency":30.21746506842205,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6864164059075945,"acs":0,"articleLive":2,"columnArticles":881,"formTitle":"[413]等差数列划分","frequency":34.85598177474415,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36465625173462274,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[414]第三大的数","frequency":37.608459643499685,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5362348101024723,"acs":0,"articleLive":2,"columnArticles":1032,"formTitle":"[415]字符串相加","frequency":90.84342150867909,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5062412884279279,"acs":0,"articleLive":2,"columnArticles":939,"formTitle":"[416]分割等和子集","frequency":72.832166789379,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47659912154431033,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[417]太平洋大西洋水流问题","frequency":60.34909714105202,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35924187097896015,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7563777994157741,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[419]甲板上的战舰","frequency":15.753410381957552,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20546254147056553,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":19.73608701462076,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6225559594413621,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[421]数组中两个数的最大异或值","frequency":62.2915198921808,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42637412350147025,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5692340215629624,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.5306534371580636,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":66.46797922643685,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6112033195020747,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6680145152928979,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":28.908705389905005,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6127149877149877,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6495193556767992,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6978931198561277,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[429]N 叉树的层序遍历","frequency":27.687480525420437,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5412646825498375,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[430]扁平化多级双向链表","frequency":30.21746506842205,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7237569060773481,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.37749985251607576,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":19.00226179055076,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.532989401277462,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":0.0,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37386169324372687,"acs":0,"articleLive":2,"columnArticles":516,"formTitle":"[434]字符串中的单词数","frequency":29.551416121097656,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5096434900032477,"acs":0,"articleLive":2,"columnArticles":807,"formTitle":"[435]无重叠区间","frequency":63.21568641804045,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48657639780553286,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":5.598654288917338,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668456169042794,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[437]路径总和 III","frequency":53.143393726450526,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5165597599011358,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[438]找到字符串中所有字母异位词","frequency":49.62002375152238,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5884197324414716,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.38000243575691145,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[440]字典序的第K小数字","frequency":71.52918087503748,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4261179338145683,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[441]排列硬币","frequency":23.967634579105308,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6968695740125757,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[442]数组中重复的数据","frequency":62.931209535824664,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4766732507123005,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[443]压缩字符串","frequency":43.42457115484806,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24984467225846535,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.299252783972932,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.587717417819206,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[445]两数相加 II","frequency":69.98131888326297,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.552177341627968,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":29.291617911525393,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6039780916690689,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6474043412915466,"acs":0,"articleLive":2,"columnArticles":1036,"formTitle":"[448]找到所有数组中消失的数字","frequency":61.32500417703398,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5549458866268069,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":6.17475093105394,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.48450546129603245,"acs":0,"articleLive":2,"columnArticles":584,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.255203967671804,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7112791726079816,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[451]根据字符出现频率排序","frequency":59.69268612492655,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.509276035703567,"acs":0,"articleLive":2,"columnArticles":805,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.26042941174064,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5542659379154621,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.967634579105308,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.599938032779071,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[454]四数相加 II","frequency":56.32642931538688,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5775093196180452,"acs":0,"articleLive":2,"columnArticles":1183,"formTitle":"[455]分发饼干","frequency":58.62918734829614,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3624718486793288,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[456]132 模式","frequency":73.35654607694582,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43520513337156497,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":30.269712340995568,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6085898755497333,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":16.97684917048487,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5117445289150101,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[459]重复的子字符串","frequency":54.0705053741304,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.439250027451411,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[460]LFU 缓存","frequency":63.726154686049284,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8117812615726454,"acs":0,"articleLive":2,"columnArticles":1318,"formTitle":"[461]汉明距离","frequency":56.878117346104204,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6020622238093113,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.29011339087789,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7147156615455171,"acs":0,"articleLive":2,"columnArticles":896,"formTitle":"[463]岛屿的周长","frequency":41.40257325092784,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.35845131852647116,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":38.996812391618974,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5291042174973859,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3735186873290793,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44042319174566597,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.62479162823902,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24910136208974645,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[468]验证IP地址","frequency":54.0705053741304,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4351593933766636,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":24.618777259563856,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5565964090554254,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":64.95076566856004,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6160804020100502,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":15.174785297802634,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40880421353794133,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42038297872340424,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":40.05349100799297,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6097367130561239,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[474]一和零","frequency":66.40869261557806,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.32986423830014344,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":30.21746506842205,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012540376211286,"acs":0,"articleLive":2,"columnArticles":465,"formTitle":"[476]数字的补数","frequency":5.046388508442953,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038138585890293,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":47.30756992885984,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43625148945118103,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.21746506842205,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41343053413710923,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[479]最大回文数乘积","frequency":11.014894777825033,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44825289635090765,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[480]滑动窗口中位数","frequency":42.85207067402047,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5350885974572029,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.598654288917338,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4253220750097252,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[482]密钥格式化","frequency":15.174785297802634,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5896457765667575,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[483]最小好进制","frequency":33.31033267691227,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6408256880733945,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6064453724743598,"acs":0,"articleLive":2,"columnArticles":957,"formTitle":"[485]最大连续 1 的个数","frequency":48.609323275026696,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5874915094832541,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[486]预测赢家","frequency":38.29011339087789,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.579700272479564,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[487]最大连续1的个数 II","frequency":37.608459643499685,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3873632767046777,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7160205511443251,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4817810704566072,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[490]迷宫","frequency":19.00226179055076,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5478909830641406,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[491]递增子序列","frequency":52.695349954880044,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5506046918257322,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.17475093105394,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3439808000848615,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":39.730382409446634,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4980593627390608,"acs":0,"articleLive":2,"columnArticles":998,"formTitle":"[494]目标和","frequency":75.86626189528076,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5416758921921861,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[495]提莫攻击","frequency":30.21746506842205,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874456653412573,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[496]下一个更大元素 I","frequency":54.794889903624224,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40332129963898916,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4609469578083666,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[498]对角线遍历","frequency":57.58098133874877,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3696881798404641,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7084034017200788,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[500]键盘行","frequency":16.35360301351877,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5108654026350741,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[501]二叉搜索树中的众数","frequency":50.39510534949492,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4167615433270082,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":31.62634020883016,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6339026851893518,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[503]下一个更大元素 II","frequency":67.85736347728759,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5043398733412711,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[504]七进制数","frequency":23.967634579105308,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4830097087378641,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[505]迷宫 II","frequency":17.62479162823902,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5632405544377376,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[506]相对名次","frequency":16.35360301351877,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.4092185645212658,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[507]完美数","frequency":16.35360301351877,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6745556460499209,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.62479162823902,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6774573422050564,"acs":0,"articleLive":2,"columnArticles":1390,"formTitle":"[509]斐波那契数","frequency":65.01728633224454,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.609277950310559,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":8.065150602819122,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337003409884557,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":38.29011339087789,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5377616593497487,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":5.598654288917338,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310193212781768,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[513]找树左下角的值","frequency":5.046388508442953,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5016840291376204,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[514]自由之路","frequency":50.62997025592897,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6427142857142857,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[515]在每个树行中找最大值","frequency":35.33795332788147,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6516021292140695,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[516]最长回文子序列","frequency":37.800761321467746,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4392848572114231,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[517]超级洗衣机","frequency":5.046388508442953,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6513080015089824,"acs":0,"articleLive":2,"columnArticles":654,"formTitle":"[518]零钱兑换 II","frequency":71.87034377266323,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39444188545984954,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":19.73608701462076,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5630459029216217,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[520]检测大写字母","frequency":5.598654288917338,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7119807068416066,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.35360301351877,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.35916074673715515,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.35360301351877,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27443053114926,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[523]连续的子数组和","frequency":59.62103796315776,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4732134175984443,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":35.33795332788147,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5364859055456611,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[525]连续数组","frequency":69.43535483760512,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7343307265102573,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[526]优美的排列","frequency":35.69807385182098,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5744047619047619,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.4774767369217111,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[528]按权重随机选择","frequency":2.2965525646374942,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464095834174575,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":36.82122844662493,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206680876628453,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":16.97684917048487,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6630414746543779,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.3725287562904385,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.97684917048487,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5228187919463088,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6757262880858387,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[534]游戏玩法分析 III","frequency":16.35360301351877,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8417745724744577,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[535]TinyURL 的加密与解密","frequency":30.21746506842205,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5338623362243956,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7118973074514715,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[537]复数乘法","frequency":5.046388508442953,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6960204006897883,"acs":0,"articleLive":2,"columnArticles":797,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":30.908497965194275,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5944319036869827,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[539]最小时间差","frequency":29.551416121097656,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5806394544694264,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[540]有序数组中的单一元素","frequency":47.234367870567354,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6084815587538456,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[541]反转字符串 II","frequency":28.751496666132937,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4591647514516256,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[542]01 矩阵","frequency":45.82435442849157,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5491004468622499,"acs":0,"articleLive":2,"columnArticles":1189,"formTitle":"[543]二叉树的直径","frequency":72.14984394428967,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7089862488007675,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4162776025236593,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6308841631648202,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.294823619573307,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6180382476993865,"acs":0,"articleLive":2,"columnArticles":1086,"formTitle":"[547]省份数量","frequency":52.97090422912428,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35773480662983426,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48177842565597667,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.4382043436077319,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[550]游戏玩法分析 IV","frequency":29.551416121097656,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5672358905832416,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[551]学生出勤记录 I","frequency":20.698943187485582,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5784585902759011,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":29.12044407399787,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6018665818220383,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[553]最优除法","frequency":5.598654288917338,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5010070835313554,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[554]砖墙","frequency":61.93010368547489,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.341796255157093,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3252741599831646,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":53.68606925915065,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455959221131594,"acs":0,"articleLive":2,"columnArticles":1213,"formTitle":"[557]反转字符串中的单词 III","frequency":60.26375295154056,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5029188041747744,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7272828466476198,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[559]N 叉树的最大深度","frequency":32.68027306200834,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44681127419145344,"acs":0,"articleLive":2,"columnArticles":872,"formTitle":"[560]和为K的子数组","frequency":83.23052978288501,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.773603694108109,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[561]数组拆分 I","frequency":23.33975049175521,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46026910383346026,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.604769524397062,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[563]二叉树的坡度","frequency":23.967634579105308,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.178692291623146,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":16.97684917048487,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6101869242464896,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[565]数组嵌套","frequency":16.35360301351877,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6961289196325311,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[566]重塑矩阵","frequency":30.21746506842205,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.43049111320836675,"acs":0,"articleLive":2,"columnArticles":982,"formTitle":"[567]字符串的排列","frequency":52.77860255115622,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5031222123104371,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5623381428042915,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":30.21746506842205,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6641566265060241,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.97684917048487,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.4892717065292625,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":16.97684917048487,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.474218544471815,"acs":0,"articleLive":2,"columnArticles":695,"formTitle":"[572]另一棵树的子树","frequency":52.420301754959844,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6586345381526104,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.647658175842235,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845808156464074,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[575]分糖果","frequency":30.21746506842205,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.4694883180634403,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[576]出界的路径数","frequency":26.268437249192385,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.706058453419931,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":16.97684917048487,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4983517968116725,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[578]查询回答率最高的问题","frequency":5.598654288917338,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4135866436384571,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[579]查询员工的累计薪水","frequency":17.62479162823902,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.525172141325206,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[580]统计各专业学生人数","frequency":25.294823619573307,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4040840377457672,"acs":0,"articleLive":2,"columnArticles":831,"formTitle":"[581]最短无序连续子数组","frequency":32.64386284207021,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40300507225571824,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5830746992049658,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[583]两个字符串的删除操作","frequency":42.11387961110793,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7733180197062202,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5944980621627783,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7496792905348876,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":24.618777259563856,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3792510508215514,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":13.311447342462529,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4295663184552073,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.756863325826588,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7449986964456418,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[589]N 叉树的前序遍历","frequency":42.85207067402047,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7597900433442738,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[590]N 叉树的后序遍历","frequency":16.35360301351877,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3394964594807238,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5210288918688285,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.44105070250458156,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.618777259563856,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5160674927302699,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[594]最长和谐子序列","frequency":5.046388508442953,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7963242880107488,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[595]大的国家","frequency":42.75825921515129,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4204051004653473,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":22.733636743015374,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44160147261849975,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.97684917048487,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5175456253354804,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[598]范围求和 II","frequency":16.97684917048487,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222878270547622,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[599]两个列表的最小索引总和","frequency":16.97684917048487,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.343140699104163,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[600]不含连续1的非负整数","frequency":16.35360301351877,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.4968383612172309,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[601]体育馆的人流量","frequency":54.90052531710315,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6289166666666667,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":16.97684917048487,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6733630952380952,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":25.99759840260919,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3732111271908667,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":5.598654288917338,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3350397220569567,"acs":0,"articleLive":2,"columnArticles":1224,"formTitle":"[605]种花问题","frequency":56.32642931538688,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5678090246972166,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[606]根据二叉树创建字符串","frequency":23.33975049175521,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6651001586089409,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.598654288917338,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6593721144967682,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4827029520295203,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[609]在系统中查找重复文件","frequency":6.776484482550018,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6671457905544148,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.598654288917338,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318138338226078,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[611]有效三角形的个数","frequency":51.52723661566385,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.669383794274624,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":5.598654288917338,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8167027390103739,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.598654288917338,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.3464052287581699,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":16.97684917048487,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42367228256221673,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.4609078487930773,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":34.63760524872387,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881194903903062,"acs":0,"articleLive":2,"columnArticles":1156,"formTitle":"[617]合并二叉树","frequency":64.5795276689312,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6206748025843504,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":25.99759840260919,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659623898654276,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.598654288917338,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7727092799118821,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[620]有趣的电影","frequency":36.95020505278875,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5688724858662867,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[621]任务调度器","frequency":64.97946409353219,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43625514749138583,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[622]设计循环队列","frequency":53.143393726450526,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5455059646236117,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[623]在二叉树中增加一行","frequency":5.598654288917338,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41581230283911674,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3400475590991747,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6830258767235409,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[626]换座位","frequency":43.42457115484806,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8068438082164918,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[627]变更性别","frequency":30.21746506842205,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5252143828332189,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[628]三个数的最大乘积","frequency":33.96228035894468,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40169197839160126,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[629]K个逆序对数组","frequency":25.294823619573307,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.365618320610687,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[630]课程表 III","frequency":7.405867322002621,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2833149779735683,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5965788286837188,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[632]最小区间","frequency":16.97684917048487,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.399729541092305,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[633]平方数之和","frequency":61.61019640749748,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43764472378432023,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5552428909952607,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5488423630955852,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":16.97684917048487,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6892751898175256,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[637]二叉树的层平均值","frequency":22.147942598620062,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.594058344058344,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":16.97684917048487,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30982615268329555,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[639]解码方法 II","frequency":25.294823619573307,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42381800518134716,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[640]求解方程","frequency":25.294823619573307,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5331061720746535,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[641]设计循环双端队列","frequency":28.28784398044317,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49149256945940123,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[642]设计搜索自动补全系统","frequency":10.249377256279203,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45171900983861163,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[643]子数组最大平均数 I","frequency":38.29011339087789,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.4000730727073438,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.43557570026412756,"acs":0,"articleLive":2,"columnArticles":682,"formTitle":"[645]错误的集合","frequency":44.11430477975606,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5745003931776892,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[646]最长数对链","frequency":4.5163267526124375,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6559921932397494,"acs":0,"articleLive":2,"columnArticles":882,"formTitle":"[647]回文子串","frequency":61.47661177190433,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5816490583371612,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[648]单词替换","frequency":5.598654288917338,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.4814137925252762,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[649]Dota2 参议院","frequency":5.046388508442953,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5352332252432028,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[650]只有两个键的键盘","frequency":16.35360301351877,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5792692741026879,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5706874918066558,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[652]寻找重复的子树","frequency":54.22355943006205,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.594779943341022,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8098002316155183,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[654]最大二叉树","frequency":44.508209494862285,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5960153157245766,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.97684917048487,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3071075636640061,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832930250556254,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[657]机器人能否返回原点","frequency":6.17475093105394,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45268053502541733,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[658]找到 K 个最接近的元素","frequency":34.63760524872387,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5417403298816855,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.647175421209118,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[660]移除 9","frequency":14.07696486400836,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5595529165211317,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[661]图片平滑器","frequency":5.598654288917338,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4058267236119585,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[662]二叉树最大宽度","frequency":56.983249121703075,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46364390378766934,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6556389165084817,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":56.32642931538688,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2700242942483921,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[665]非递减数列","frequency":48.67348582826471,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6210329807093964,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6234493797519007,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.753410381957552,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5076530612244898,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[668]乘法表中第k小的数","frequency":34.63760524872387,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6665303180817702,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[669]修剪二叉搜索树","frequency":16.97684917048487,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4496469143383482,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[670]最大交换","frequency":63.4156722547082,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48667267875902975,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[671]二叉树中第二小的节点","frequency":50.91549059195242,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.552397586535408,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.046388508442953,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.39016772862261756,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[673]最长递增子序列的个数","frequency":51.351540593964614,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.4916731596029126,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[674]最长连续递增序列","frequency":35.69807385182098,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3994269340974212,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":0.0,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5861512243250516,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6153180066675326,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.3514418175172653,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[678]有效的括号字符串","frequency":72.13417097315275,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5408670470262794,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[679]24 点游戏","frequency":68.54135038149754,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015669824739037,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":58.76509393865494,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4988855116514691,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6954203457281433,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[682]棒球比赛","frequency":29.551416121097656,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.42742763292958325,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.66579713169397,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[684]冗余连接","frequency":30.908497965194275,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4337800420866098,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[685]冗余连接 II","frequency":30.908497965194275,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3549591746313058,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[686]重复叠加字符串匹配","frequency":6.17475093105394,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4397788867929034,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[687]最长同值路径","frequency":50.62997025592897,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.511251480457955,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.97684917048487,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48584831899921815,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.0651502442695,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6463780084945729,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[690]员工的重要性","frequency":66.79211552972232,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49008826508464765,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.17475093105394,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5803694513371933,"acs":0,"articleLive":2,"columnArticles":713,"formTitle":"[692]前K个高频单词","frequency":64.10105966596502,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6093366093366094,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[693]交替位二进制数","frequency":5.598654288917338,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5269761606022585,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[694]不同岛屿的数量","frequency":6.17475093105394,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6626085002387707,"acs":0,"articleLive":2,"columnArticles":1176,"formTitle":"[695]岛屿的最大面积","frequency":66.08563349960896,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6305108816164837,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[696]计数二进制子串","frequency":16.97684917048487,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.605818262880709,"acs":0,"articleLive":2,"columnArticles":828,"formTitle":"[697]数组的度","frequency":30.21746506842205,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4411269157243301,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[698]划分为k个相等的子集","frequency":60.628954628179045,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47546561604584525,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7589890176019257,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[700]二叉搜索树中的搜索","frequency":28.908705389905005,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7240304391675071,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[701]二叉搜索树中的插入操作","frequency":27.687480525420437,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7392253136933988,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5121164864817508,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.31033267691227,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5546123328751719,"acs":0,"articleLive":2,"columnArticles":1038,"formTitle":"[704]二分查找","frequency":83.57847730405734,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6468712795366951,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[705]设计哈希集合","frequency":54.0705053741304,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6444310755656215,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[706]设计哈希映射","frequency":45.15531268884913,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.318089569874239,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[707]设计链表","frequency":59.62103796315776,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3353430014665146,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":7.405867322002621,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7596496777078539,"acs":0,"articleLive":2,"columnArticles":499,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3492489659676366,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[710]黑名单中的随机数","frequency":25.99759840260919,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5725062866722548,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6715802445729453,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.63760524872387,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4049133581925861,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[713]乘积小于K的子数组","frequency":37.04286683750732,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7175974388165988,"acs":0,"articleLive":2,"columnArticles":637,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":43.69756555654523,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.40376290376290375,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":19.73608701462076,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4601219360457882,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":5.598654288917338,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5106407492140823,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[717]1比特与2比特字符","frequency":16.97684917048487,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5643979960755281,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[718]最长重复子数组","frequency":70.7407726761627,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3671381936887922,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":16.97684917048487,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48625451240754297,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[720]词典中最长的单词","frequency":4.006998583773413,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4694243707949165,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[721]账户合并","frequency":41.40257325092784,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3214954521134296,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":34.63760524872387,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7239370995923122,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45720743432376515,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[724]寻找数组的中心下标","frequency":30.908497965194275,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5627168944307493,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[725]分隔链表","frequency":16.35360301351877,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5546450912474797,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[726]原子的数量","frequency":52.100018859120766,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4107115295570304,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[727]最小窗口子序列","frequency":30.21746506842205,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7592807821152663,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5075891042146632,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[729]我的日程安排表 I","frequency":24.618777259563856,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.48836614676553314,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":42.11387961110793,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5093445287107259,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":5.598654288917338,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6119922630560929,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[732]我的日程安排表 III","frequency":6.776484482550018,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805479802703475,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[733]图像渲染","frequency":40.29940808846586,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47848793832380004,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.41106807135279166,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":34.63760524872387,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.458295142071494,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.46210790464240903,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5021778378173646,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[738]单调递增的数字","frequency":30.908497965194275,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6779019986623527,"acs":0,"articleLive":2,"columnArticles":1442,"formTitle":"[739]每日温度","frequency":87.66042526212915,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6306566718300509,"acs":0,"articleLive":2,"columnArticles":532,"formTitle":"[740]删除并获得点数","frequency":63.21568641804045,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3655482267469649,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[741]摘樱桃","frequency":27.491698628358318,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.492436974789916,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5171225293398415,"acs":0,"articleLive":2,"columnArticles":506,"formTitle":"[743]网络延迟时间","frequency":26.729133143724614,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590780480421038,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":24.618777259563856,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.3915731952832902,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5808704132403555,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[746]使用最小花费爬楼梯","frequency":50.91549059195242,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4149374889453645,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.598654288917338,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5986547085201793,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5059665871121718,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":16.35360301351877,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7237547892720306,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":24.953577938598713,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5073909830007391,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5317810144372046,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[752]打开转盘锁","frequency":41.40257325092784,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5898608728797408,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":18.299252783972932,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4278131047829693,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":16.97684917048487,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5017978425888934,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.574025974025974,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":6.776484482550018,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4163286898254276,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":10.249377256279203,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45884553714591125,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":14.07696486400836,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6568405139833712,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":6.776484482550018,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8386041439476554,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5911730545876888,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":11.014894777825033,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6982775926446381,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.7630886946893907,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[763]划分字母区间","frequency":64.74152622261718,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4913803795113481,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6658155496732179,"acs":0,"articleLive":2,"columnArticles":427,"formTitle":"[765]情侣牵手","frequency":57.662023881722476,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081385936969634,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47782872752993977,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[767]重构字符串","frequency":43.61917906626845,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5004754358161648,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":25.99759840260919,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5901830535976877,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[769]最多能完成排序的块","frequency":5.598654288917338,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5518913676042677,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514649422986937,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[771]宝石与石头","frequency":45.15531268884913,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4893708580772872,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":28.28784398044317,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7142722384680691,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":52.100018859120766,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5852534562211982,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46090457908043825,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5712401055408971,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3241908614945264,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.97684917048487,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5977467139578552,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[778]水位上升的泳池中游泳","frequency":5.598654288917338,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4357788472825449,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.63760524872387,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2841338618972988,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":20.50160453616659,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6212860244475508,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[781]森林中的兔子","frequency":91.83431882350447,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42116370214048837,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":32.887946997445084,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958720545751975,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":34.63760524872387,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6841928100175036,"acs":0,"articleLive":2,"columnArticles":438,"formTitle":"[784]字母大小写全排列","frequency":23.967634579105308,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5114348123585452,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[785]判断二分图","frequency":39.41257965310674,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4620238373451741,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39253464113342673,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[787]K 站中转内最便宜的航班","frequency":33.264619290894046,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6070654168195616,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[788]旋转数字","frequency":18.299252783972932,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6925092374874035,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[789]逃脱阻碍者","frequency":21.422945199275254,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4481103779244151,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6947714900620332,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[791]自定义字符串排序","frequency":35.33795332788147,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4505851755526658,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.174785297802634,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3950811526995694,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.046388508442953,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407831900668577,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.17475093105394,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5345119030849416,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[795]区间子数组个数","frequency":0.0,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5242150456464816,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[796]旋转字符串","frequency":44.8291062817839,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7954463172291726,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[797]所有可能的路径","frequency":25.99759840260919,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.45791988239617787,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.407468469211112,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":52.100018859120766,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7048929663608563,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4177169607490097,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[801]使序列递增的最小交换次数","frequency":6.17475093105394,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5767555488220589,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[802]找到最终的安全状态","frequency":25.52601627466619,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4828988280315714,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.7697387875800887,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[804]唯一摩尔斯密码词","frequency":24.618777259563856,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.28929068150208626,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":8.065150602819122,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6583977226514843,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[806]写字符串需要的行数","frequency":16.97684917048487,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8443132707916096,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[807]保持城市天际线","frequency":5.598654288917338,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4788288288288288,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":27.491698628358318,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4198582832541035,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[809]情感丰富的文字","frequency":17.62479162823902,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7367379967631721,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":41.40257325092784,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7029185022026432,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[811]子域名访问计数","frequency":16.35360301351877,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6292365215293692,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5477133894667328,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.17475093105394,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.699787712683375,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[814]二叉树剪枝","frequency":5.046388508442953,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43485749020667297,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[815]公交路线","frequency":85.53438647527021,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5108484213676493,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.756863325826588,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5915802701853597,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42928737318176263,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.42077305378377833,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[819]最常见的单词","frequency":25.99759840260919,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.505764970938488,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[820]单词的压缩编码","frequency":38.996812391618974,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.692020901831846,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[821]字符的最短距离","frequency":30.21746506842205,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5022982165839309,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.43053602125332086,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":10.249377256279203,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6148595431871883,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.598654288917338,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39020605759682225,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[825]适龄的朋友","frequency":6.17475093105394,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3722042264383773,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.598654288917338,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3930112370205301,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[827]最大人工岛","frequency":25.294823619573307,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4896674200839522,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36103735174367146,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[829]连续整数求和","frequency":30.21746506842205,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.54303706672855,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.40316537106425815,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7955916146883647,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[832]翻转图像","frequency":47.30756992885984,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4252125629012667,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.598654288917338,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292906455650208,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":26.729133143724614,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5727699530516432,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47761523098072783,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[836]矩形重叠","frequency":18.299252783972932,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39686667905133444,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[837]新21点","frequency":16.97684917048487,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5015452538631346,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":15.753410381957552,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5745901889557068,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.3587207652709659,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6565757794263227,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[841]钥匙和房间","frequency":17.62479162823902,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48954957164631474,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":43.42457115484806,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3754415712872686,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[843]猜猜这个单词","frequency":6.776484482550018,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5155907003056035,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[844]比较含退格的字符串","frequency":27.687480525420437,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42044729162867045,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[845]数组中的最长山脉","frequency":37.608459643499685,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111002683581362,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6839108447274771,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[847]访问所有节点的最短路径","frequency":34.18471333488373,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4461065360158449,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42567824715924535,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[849]到最近的人的最大距离","frequency":6.776484482550018,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4446171783909833,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":25.294823619573307,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4773126978543792,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":5.598654288917338,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7153883638768513,"acs":0,"articleLive":2,"columnArticles":707,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.80714843166105,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38139095524855354,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[853]车队","frequency":36.82122844662493,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3611134685563948,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.4097870750840493,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[855]考场就座","frequency":16.97684917048487,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6253013476662846,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":43.42457115484806,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4644236960721185,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.491698628358318,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5569311954536229,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":25.99759840260919,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3015450776972357,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":5.598654288917338,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5868708555277747,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[860]柠檬水找零","frequency":33.96228035894468,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8089415063478465,"acs":0,"articleLive":2,"columnArticles":436,"formTitle":"[861]翻转矩阵后的得分","frequency":5.598654288917338,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18823228820673796,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[862]和至少为 K 的最短子数组","frequency":48.67348582826471,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6030353415643683,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":57.027802028484686,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45334174022698615,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6537849511252557,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2235833206048572,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.299252783972932,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.670893974263395,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[867]转置矩阵","frequency":45.82435442849157,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6245108780716857,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5504627589246364,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.598654288917338,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4240974203245299,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3392823310977227,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":40.4928560097843,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520318986235526,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[872]叶子相似的树","frequency":53.74114852801482,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5091461261388516,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":34.63760524872387,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41383893342193795,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[874]模拟行走机器人","frequency":38.29011339087789,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4778162474491551,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[875]爱吃香蕉的珂珂","frequency":43.881693006295876,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7066345192832783,"acs":0,"articleLive":2,"columnArticles":1538,"formTitle":"[876]链表的中间结点","frequency":43.881693006295876,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567527286068054,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[877]石子游戏","frequency":62.2915198921808,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.27903766515480183,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5557661927330174,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":74.29219158090288,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.252352585685919,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":7.405867322002621,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.538576690032078,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[881]救生艇","frequency":43.51514814239613,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48348082595870207,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6861342351716961,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6610258382574036,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[884]两句话中的不常见单词","frequency":5.046388508442953,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6894069785636051,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[885]螺旋矩阵 III","frequency":35.33795332788147,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42299440054424614,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[886]可能的二分法","frequency":0.0,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2919297298565963,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[887]鸡蛋掉落","frequency":68.46126164448563,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6395287770642859,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[888]公平的糖果棒交换","frequency":5.046388508442953,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6797166293810589,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":45.82435442849157,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7258732978093546,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.32648919660976483,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.638738791083222,"acs":0,"articleLive":2,"columnArticles":677,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7238653400572441,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":6.776484482550018,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7741523102209776,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5406810937762121,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[895]最大频率栈","frequency":24.618777259563856,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5868742913903298,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[896]单调数列","frequency":16.35360301351877,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.745642428758138,"acs":0,"articleLive":2,"columnArticles":696,"formTitle":"[897]递增顺序搜索树","frequency":58.36424300892414,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3347202662911279,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.294823619573307,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5348837209302325,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":6.776484482550018,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4929317762753534,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5414172266340868,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3252962811606048,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.776484482550018,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5303478904515174,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[903]DI 序列的有效排列","frequency":15.174785297802634,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.45246724282129913,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[904]水果成篮","frequency":35.33795332788147,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7016122036754774,"acs":0,"articleLive":2,"columnArticles":584,"formTitle":"[905]按奇偶排序数组","frequency":29.551416121097656,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2724065847922655,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[906]超级回文数","frequency":39.28690700696975,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.31566343424787136,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":38.29011339087789,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6980367715799315,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[908]最小差值 I","frequency":5.598654288917338,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4611506438881046,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":42.11387961110793,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3174264596458158,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42565597667638483,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5657638124707189,"acs":0,"articleLive":2,"columnArticles":991,"formTitle":"[912]排序数组","frequency":85.7625698573599,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40304434149569823,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":8.065150602819122,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888835372314806,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[914]卡牌分组","frequency":16.35360301351877,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4684265551489807,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":16.35360301351877,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4391575663026521,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5698135779084837,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[917]仅仅反转字母","frequency":36.0651502442695,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.35825926403022884,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[918]环形子数组的最大和","frequency":30.21746506842205,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6266934269944807,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.48008611410118407,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7352855371599446,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[921]使括号有效的最少添加","frequency":6.776484482550018,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7142960515207796,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[922]按奇偶排序数组 II","frequency":17.62479162823902,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.337489516354487,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.62479162823902,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.35968852949985025,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.3882904347146819,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5160407858741607,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[926]将字符串翻转到单调递增","frequency":16.97684917048487,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3385406168111268,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":38.42939389149314,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.4215782259643626,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6427873991469243,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5450097202543741,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":54.794889903624224,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6589272002632638,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[931]下降路径最小和","frequency":23.967634579105308,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.627224966674508,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[932]漂亮数组","frequency":16.97684917048487,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7237735056203383,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[933]最近的请求次数","frequency":34.63760524872387,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4749769726742401,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[934]最短的桥","frequency":44.8291062817839,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4744778646883316,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3788835564536499,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5880362909426419,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.35360301351877,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8182613018806466,"acs":0,"articleLive":2,"columnArticles":783,"formTitle":"[938]二叉搜索树的范围和","frequency":49.39323863906126,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4501489398983704,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4176717591351738,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[940]不同的子序列 II","frequency":4.5163267526124375,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925446204849466,"acs":0,"articleLive":2,"columnArticles":603,"formTitle":"[941]有效的山脉数组","frequency":5.046388508442953,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7292045943530502,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47435556736646295,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":0.0,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6902523011721078,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48682785997834715,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":24.618777259563856,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6217319676240957,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[946]验证栈序列","frequency":50.62997025592897,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125511596180082,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.39132493046925854,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3692879427417875,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":34.63760524872387,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.774630642396539,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[950]按递增顺序显示卡牌","frequency":18.299252783972932,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.662046908315565,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":23.967634579105308,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.3482420473570916,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5528455284552846,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[953]验证外星语词典","frequency":24.618777259563856,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2991210040669961,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":30.21746506842205,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3273608768971332,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":6.776484482550018,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43522040724994404,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[956]最高的广告牌","frequency":25.294823619573307,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35937663424328,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[957]N 天后的牢房","frequency":26.729133143724614,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.537171803652968,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[958]二叉树的完全性检验","frequency":32.68027306200834,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7437488033697109,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.99759840260919,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.552927603115085,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":9.483859734733372,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6769719788848315,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[961]重复 N 次的元素","frequency":16.97684917048487,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.4405001736714137,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[962]最大宽度坡","frequency":17.62479162823902,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5007089325501317,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.4257966616084977,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":15.174785297802634,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6838973436931441,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[965]单值二叉树","frequency":5.598654288917338,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4028582985034381,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":8.756863325826588,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4594729300355118,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4966546149690396,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[968]监控二叉树","frequency":36.31386036386344,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6519164848862574,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":5.598654288917338,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41462296584918634,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.44188845793767556,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":8.065150602819122,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.408316961362148,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":14.07696486400836,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6388867164587652,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[973]最接近原点的 K 个点","frequency":5.046388508442953,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46550609172508345,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":56.32642931538688,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4445937873357228,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":7.405867322002621,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.597136157148845,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[976]三角形的最大周长","frequency":25.294823619573307,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7173248167599978,"acs":0,"articleLive":2,"columnArticles":1174,"formTitle":"[977]有序数组的平方","frequency":47.026693935130595,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.4734329021153739,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[978]最长湍流子数组","frequency":16.35360301351877,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7121185852981969,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[979]在二叉树中分配硬币","frequency":25.294823619573307,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7326943556975506,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[980]不同路径 III","frequency":30.908497965194275,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5353384619342887,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[981]基于时间的键值存储","frequency":54.67234193501347,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5419712070874861,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6331979918795128,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[983]最低票价","frequency":47.30756992885984,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4163462907589349,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.5991038088125467,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[985]查询后的偶数和","frequency":5.598654288917338,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6760171242104003,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[986]区间列表的交集","frequency":46.658271228430756,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5320555188367482,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":53.37120747384102,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49632621010712885,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4727454483186316,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[989]数组形式的整数加法","frequency":16.97684917048487,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.49897531439217513,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[990]等式方程的可满足性","frequency":5.598654288917338,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5174180952961991,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":17.62479162823902,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4513410409124528,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[992]K 个不同整数的子数组","frequency":18.299252783972932,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5573083311965574,"acs":0,"articleLive":2,"columnArticles":787,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.351540593964614,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5094625206976768,"acs":0,"articleLive":2,"columnArticles":1348,"formTitle":"[994]腐烂的橘子","frequency":37.608459643499685,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5400667566947792,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":26.729133143724614,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49642601858470337,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":19.00226179055076,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5123157151230069,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[997]找到小镇的法官","frequency":15.174785297802634,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6147157739315888,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.6913452708907254,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.598654288917338,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4069377990430622,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":32.373023995487024,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29133180252583235,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":13.311447342462529,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7378215872509112,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[1002]查找常用字符","frequency":40.05349100799297,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5761290947858112,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5986737796347764,"acs":0,"articleLive":2,"columnArticles":683,"formTitle":"[1004]最大连续1的个数 III","frequency":52.695349954880044,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5364352703408497,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.58143841657867,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6277316075323232,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[1006]笨阶乘","frequency":52.100018859120766,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46397280966767374,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7265093962415033,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.716325768940045,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5930001589067218,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.598654288917338,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4499389651478538,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6269184980211718,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":69.51216653046501,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.329822989020838,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":20.50160453616659,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.3982571182053494,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.96228035894468,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5464968744197561,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[1014]最佳观光组合","frequency":14.616379269378092,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35390730463476827,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":19.00226179055076,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5837557603686636,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5618270799347471,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167099382342829,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5971181380612929,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.598654288917338,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5364777947932619,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.618777259563856,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.783502022893912,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[1021]删除最外层的括号","frequency":30.21746506842205,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7023502541810949,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.598654288917338,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5650761928553585,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.776484482550018,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.55937993545286,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[1024]视频拼接","frequency":16.35360301351877,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7096900895722565,"acs":0,"articleLive":2,"columnArticles":638,"formTitle":"[1025]除数博弈","frequency":39.41257965310674,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6687222838137472,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4329016163756279,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1027]最长等差数列","frequency":31.62634020883016,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318010467371812,"acs":0,"articleLive":2,"columnArticles":418,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.967634579105308,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6533146404966954,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114635010630759,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":5.598654288917338,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5669176584891912,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.17475093105394,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39465101108936723,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.38954012623985573,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.17475093105394,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4313209076175041,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6290085702069119,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1035]不相交的线","frequency":61.22587172021294,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2990093351114498,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":6.17475093105394,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.43834774800321374,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.793317033414833,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":5.598654288917338,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.553037055902203,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5228013029315961,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.48136943850070096,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.618777259563856,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5277870853477574,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":15.753410381957552,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6907158836689038,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20890745150083923,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":54.90052531710315,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6445021083360364,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1045]买下所有产品的客户","frequency":5.598654288917338,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6594637773180673,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[1046]最后一块石头的重量","frequency":29.551416121097656,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7259792626728111,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":77.06293589441529,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4513705583756345,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":32.373023995487024,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6425316130688747,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[1049]最后一块石头的重量 II","frequency":60.34909714105202,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7573293387545474,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.598654288917338,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7521637282702502,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1051]高度检查器","frequency":5.598654288917338,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811595994560514,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1052]爱生气的书店老板","frequency":25.99759840260919,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.45886524822695035,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":16.97684917048487,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3760050679791433,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.97684917048487,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5853889943074004,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40734265734265734,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46146542174394684,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.33816552451238796,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.3584873664575208,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5294193548387097,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1060]有序数组中的缺失元素","frequency":30.21746506842205,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5999546690843155,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5353938185443669,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.696656050955414,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6506544138123086,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5388660265203475,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.47247929858743304,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42024377318494965,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8640244325675019,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8200046812826715,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.598654288917338,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48363900250692704,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1070]产品销售分析 III","frequency":5.598654288917338,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865571014393303,"acs":0,"articleLive":2,"columnArticles":660,"formTitle":"[1071]字符串的最大公因子","frequency":16.97684917048487,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5783001808318264,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":10.249377256279203,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33763625932300634,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":10.249377256279203,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.670024262921844,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":47.234367870567354,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6954796545553568,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49679055802878147,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7221202854230377,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6217983651226158,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.7353339655873188,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1079]活字印刷","frequency":5.598654288917338,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4895096511209687,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.57132322818517,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":42.11387961110793,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.760061919504644,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1082]销售分析 I ","frequency":6.17475093105394,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527767344529699,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.62479162823902,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5384444814014081,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7724694589877836,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6893854748603352,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5300579798596277,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44395214887018164,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5850557434548416,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":5.598654288917338,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5418445772843723,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3775638342402679,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":40.716325768940045,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4882943143812709,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1092]最短公共超序列","frequency":19.73608701462076,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3847479534683326,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":8.756863325826588,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6170325111261975,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1094]拼车","frequency":23.33975049175521,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3736246586031994,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5549810410203379,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.5192061459667093,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":33.15082077897072,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4735533766054412,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1098]小众书籍","frequency":16.97684917048487,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5800676098660323,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.699812382739212,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6671490593342981,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36563481381785556,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6363834660268295,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":16.97684917048487,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610326744655103,"acs":0,"articleLive":2,"columnArticles":660,"formTitle":"[1104]二叉树寻路","frequency":45.15531268884913,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5560587650502595,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5729942391457075,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1106]解析布尔表达式","frequency":19.73608701462076,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4102478899448395,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1107]每日新用户统计","frequency":6.17475093105394,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391174792366702,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.6275907120375319,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1110]删点成林","frequency":18.299252783972932,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7720844633862843,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.618777259563856,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.642741208295762,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1112]每位学生的最高成绩","frequency":18.299252783972932,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5413717559824739,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6526382406455186,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[1114]按序打印","frequency":82.14407587081384,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5612917279311659,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1115]交替打印FooBar","frequency":57.027802028484686,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5156062424969988,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[1116]打印零与奇偶数","frequency":59.62103796315776,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5209223422970596,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1117]H2O 生成","frequency":43.881693006295876,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6411347517730497,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8664416077645322,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.604326923076923,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":8.756863325826588,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5717367853290184,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7071499293573185,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[1122]数组的相对排序","frequency":52.420301754959844,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.704928429063236,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.3157989737242464,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":6.776484482550018,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4902782433791485,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6948035803083044,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1126]查询活跃业务","frequency":16.97684917048487,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.41701502655067224,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448462097719483,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.35360301351877,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37853996224040276,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":7.405867322002621,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6279531905497903,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.45271813613522155,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.3891394551686812,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1132]报告的记录 II","frequency":16.97684917048487,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6448960949988581,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7740070387129211,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.534374716192898,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":24.618777259563856,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5680604982206405,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6066951579661138,"acs":0,"articleLive":2,"columnArticles":800,"formTitle":"[1137]第 N 个泰波那契数","frequency":15.337987009133391,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4313881265347393,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1138]字母板上的路径","frequency":6.17475093105394,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4763760863839874,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.299252783972932,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6546,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.776484482550018,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5114291934254925,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":5.598654288917338,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.3713485394157663,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6329430431008345,"acs":0,"articleLive":2,"columnArticles":1048,"formTitle":"[1143]最长公共子序列","frequency":83.62214394765736,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4417832167832168,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":23.33975049175521,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46924978191334693,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":36.82122844662493,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2862474877978754,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5559945297067315,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7179462102689487,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.4433558959743498,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.6072393300918423,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.299252783972932,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.48403990024937654,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":16.35360301351877,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3839259037944428,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":14.07696486400836,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3707186030893217,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5660119909034526,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1154]一年中的第几天","frequency":5.598654288917338,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47986401673640167,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1155]掷骰子的N种方法","frequency":6.17475093105394,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.4335912608101957,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.31542461005199307,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5508620689655173,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.4921370401572592,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1159]市场分析 II","frequency":19.00226179055076,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6878224001884348,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[1160]拼写单词","frequency":16.35360301351877,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6333684275716851,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1161]最大层内元素和","frequency":6.17475093105394,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46907469062127016,"acs":0,"articleLive":2,"columnArticles":489,"formTitle":"[1162]地图分析","frequency":32.373023995487024,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26714079858690093,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1163]按字典序排在最后的子串","frequency":7.405867322002621,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6158763365876336,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1164]指定日期的产品价格","frequency":17.62479162823902,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8382154123479044,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4828949970338145,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.4216237163340438,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5709459459459459,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":11.780412299370866,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.322567940133911,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.299252783972932,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171099006728613,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.776484482550018,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.4722358167375673,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":5.598654288917338,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.27120938628158847,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7565494571172428,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6204409363091998,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.4884047786366831,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4459128210593627,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":7.405867322002621,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26301466069704155,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1177]构建回文串检测","frequency":6.17475093105394,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46213903208047646,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.6339754816112084,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1179]重新格式化部门表","frequency":54.22355943006205,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7733537519142419,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":8.756863325826588,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.36912922061436915,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.3854492391077757,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6013320647002854,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854677810730655,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1184]公交站间的距离","frequency":16.97684917048487,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.610502180964098,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":16.35360301351877,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39103580213173,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":31.62634020883016,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.43784051510648836,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6934763181411975,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6444564595127537,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1189]“气球” 的最大数量","frequency":5.046388508442953,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6512661106899166,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[1190]反转每对括号间的子串","frequency":95.27211030332954,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2680530689069458,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.49968446295595104,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6099964801126364,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.598654288917338,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5145962732919255,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.776484482550018,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6353332690267194,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1195]交替打印字符串","frequency":30.908497965194275,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6911157024793388,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36642216788916054,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.299252783972932,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7474144789180589,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4329083181542198,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6860645007735333,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1200]最小绝对差","frequency":23.967634579105308,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.247097703584442,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5029349746395395,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[1202]交换字符串中的元素","frequency":6.776484482550018,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6239285157670529,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1203]项目管理","frequency":8.065150602819122,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.728626585769443,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":18.299252783972932,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4675943576057949,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1205]每月交易II","frequency":25.294823619573307,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6193693693693694,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1206]设计跳表","frequency":17.62479162823902,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7302691746792891,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.4961655442102976,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1208]尽可能使字符串相等","frequency":16.97684917048487,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5330082348070111,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":35.33795332788147,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44825174825174824,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":14.07696486400836,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6590450571620713,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":17.62479162823902,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5153028000868244,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.598654288917338,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.771832884097035,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1213]三个有序数组的交集","frequency":19.00226179055076,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6326490713587488,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":8.065150602819122,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.409041747782825,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":15.174785297802634,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5329479768786127,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6949729818241362,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[1217]玩筹码","frequency":35.33795332788147,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42119066351953843,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6303876976391596,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.63760524872387,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5263820853743877,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8045547179517619,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[1221]分割平衡字符串","frequency":16.35360301351877,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6720280565969283,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4740061162079511,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3252461823890395,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":25.99759840260919,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5446996466431095,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1225]报告系统状态的连续日期","frequency":20.50160453616659,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6001061852933369,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1226]哲学家进餐","frequency":51.351540593964614,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.662025662025662,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":4.5163267526124375,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5391962515768607,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41405680990531685,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.48843827819281393,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.555823777911889,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":19.73608701462076,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.4692345540170099,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1232]缀点成线","frequency":16.35360301351877,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48157464469878003,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.776484482550018,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3414546757434611,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.046388508442953,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4518206392113214,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1235]规划兼职工作","frequency":39.730382409446634,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.559322033898305,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7116433987669194,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6552486187845303,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":6.776484482550018,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49066877379498597,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[1239]串联字符串的最大长度","frequency":41.40257325092784,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.49416733708769106,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":33.15082077897072,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5970342356687898,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4669275929549902,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":20.50160453616659,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393641988478771,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6203480589022757,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":11.014894777825033,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5065110013471037,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.776484482550018,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4798864964112836,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1246]删除回文子数组","frequency":13.311447342462529,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6156495694496443,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1247]交换字符使得字符串相同","frequency":25.294823619573307,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5589310225074005,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1248]统计「优美子数组」","frequency":23.967634579105308,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5718400956599723,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1249]移除无效的括号","frequency":36.95020505278875,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5604041272570938,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":21.305027910745853,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7718515514094504,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":5.046388508442953,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7495449735449735,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.39368258859784283,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":18.299252783972932,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5984818911299068,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.5163267526124375,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6769858411327094,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6628216503992902,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5644699140401146,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5640417457305503,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.4757425742574257,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":13.311447342462529,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.603505423865006,"acs":0,"articleLive":2,"columnArticles":242,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.7287613176651897,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.526424564511367,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":44.11430477975606,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41660772386476164,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":10.249377256279203,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5725765946760422,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":6.776484482550018,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9192458199928851,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1265]逆序打印不可变链表","frequency":8.065150602819122,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8237790746377014,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1266]访问所有点的最小时间","frequency":24.618777259563856,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6085555033241555,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.5809369202226345,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1268]搜索推荐系统","frequency":6.17475093105394,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49173195505323936,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":47.234367870567354,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8049298767530811,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":4.5163267526124375,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.505380882042625,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5178869943162822,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5410128388017118,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5983554712207464,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5400585392417127,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.97684917048487,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5012614317250079,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7243546398313512,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":24.618777259563856,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5957299080020829,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":59.845779057007384,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6223862238622386,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":9.483859734733372,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5056822761344403,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.35360301351877,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831514362740541,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[1281]整数的各位积和之差","frequency":16.97684917048487,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8114032092864459,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":6.17475093105394,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.41597982531676714,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.62479162823902,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6588514225500527,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":20.50160453616659,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8127709893575089,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6446027091188381,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":16.97684917048487,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6052822873758178,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.97684917048487,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5635561438341055,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1288]删除被覆盖区间","frequency":30.21746506842205,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.627965833596963,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8091444834573325,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5180445942839629,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4683585755218993,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.17475093105394,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.3560266890037838,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.32642931538688,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6605872331896984,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.8094683474924637,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.598654288917338,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45269779820953304,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45889310747663553,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1297]子串的最大出现次数","frequency":27.491698628358318,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5954304177244404,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7853911305171235,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4673133947332247,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":5.598654288917338,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.35875402792696026,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.81643386790826,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[1302]层数最深叶子节点的和","frequency":25.294823619573307,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.821383155629463,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7254970352284618,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.046388508442953,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7468705109788631,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.598654288917338,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5770356943669828,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":17.62479162823902,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.3315488277644453,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7511237638597543,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":6.17475093105394,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7552301255230126,"acs":0,"articleLive":2,"columnArticles":282,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7125004843647073,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":53.37120747384102,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37688055419494787,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.776484482550018,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6659927213910231,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":33.96228035894468,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8310984857603698,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[1313]解压缩编码列表","frequency":5.598654288917338,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.734950838225932,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1314]矩阵区域和","frequency":35.33795332788147,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8097516813243663,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43761213505137825,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6143397630713887,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.6496753246753246,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.90525319586934,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6176229676045378,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[1319]连通网络的操作次数","frequency":6.17475093105394,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5879188065541697,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6172270157691163,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5923031379514505,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.755486694566016,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.618777259563856,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5923901835429985,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.7283996437054632,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.598654288917338,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.4760578095072262,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":8.065150602819122,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6918565906970545,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.457873984066951,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.35360301351877,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7712686993262533,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.776484482550018,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3772017281488867,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":16.35360301351877,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5353123241418121,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1331]数组序号转换","frequency":16.35360301351877,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6834716981132075,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.598654288917338,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5428457154284572,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4891941391941392,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":50.62997025592897,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.5832603747154614,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4226546906187625,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7065418828762046,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":34.523359922158484,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.640251021599533,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":5.046388508442953,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3965671197539438,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":7.405867322002621,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5716988782267874,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.480592055580728,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204156163785404,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5424853610930384,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5937275064267352,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1344]时钟指针的夹角","frequency":6.776484482550018,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3674607862440113,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1345]跳跃游戏 IV","frequency":6.776484482550018,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4360263522884882,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7382713646096943,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.3028917817748186,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":8.065150602819122,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5017608586282073,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1349]参加考试的最大学生数","frequency":6.776484482550018,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.847529361972278,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.598654288917338,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7547468765422478,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.046388508442953,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44149711825567667,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.776484482550018,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28258320085481226,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.794889903624224,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28549587198043014,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6624930951942553,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316427071555484,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":15.753410381957552,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5279657505869355,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.4867938371239912,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.598654288917338,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5450652528548124,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5039312039312039,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":34.63760524872387,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4015659325184476,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1361]验证二叉树","frequency":5.598654288917338,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5228317499233834,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3612878200155159,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":35.33795332788147,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6751497005988024,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.598654288917338,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250280561516804,"acs":0,"articleLive":2,"columnArticles":1075,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.618777259563856,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5368618559924947,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":18.299252783972932,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41720636895839813,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1367]二叉树中的列表","frequency":16.35360301351877,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5196166516921233,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.606874848704914,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":6.17475093105394,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7906383119789163,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":5.046388508442953,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5798309984434067,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.40257325092784,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.5128238510610598,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.598654288917338,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39646587320864707,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":30.908497965194275,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7392155989849976,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5714383001906838,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5036410291975865,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3252325954443375,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.862056028014007,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8365964477488641,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.72740289958833,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7322082679225537,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6898124022928609,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1382]将二叉搜索树变平衡","frequency":6.17475093105394,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32325715938675154,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":10.249377256279203,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5415565345080764,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7039570102589154,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1385]两个数组间的距离值","frequency":5.598654288917338,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3100522530912101,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":21.305027910745853,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6947329919531822,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":19.00226179055076,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5371420853592652,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":56.32642931538688,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8309504540958547,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.35360301351877,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35093025910284215,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3993940143457828,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":21.305027910745853,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.39991227589231865,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1392]最长快乐前缀","frequency":5.598654288917338,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8574620196604111,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6639581657280772,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7542571133235406,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.598654288917338,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4149574438398214,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1396]设计地铁系统","frequency":19.00226179055076,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.36724008975317873,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7710865906115579,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6677250239976371,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6042930995729378,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.046388508442953,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4167031523642732,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":8.065150602819122,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7511337868480725,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":5.598654288917338,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.691112076745663,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.35360301351877,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4917952656937365,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.405867322002621,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5058966679146387,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1405]最长快乐字符串","frequency":17.62479162823902,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568679656299165,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1406]石子游戏 III","frequency":7.405867322002621,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6678997613365155,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6142925202477371,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8050813008130081,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4766074228959749,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":8.756863325826588,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5495547672482444,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":82.14407587081384,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5505093378607809,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.691850764199426,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.35360301351877,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.6014778738768998,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":0.0,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6848407098567457,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.17475093105394,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40815714499925027,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":24.953577938598713,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5184114927344782,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.17475093105394,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7331354868165735,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1418]点菜展示表","frequency":50.1398959945282,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4179719256408867,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":30.908497965194275,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5930964978584026,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.967634579105308,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7477684998560322,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.540249403024675,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1422]分割字符串的最大得分","frequency":30.21746506842205,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5544939613919724,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1423]可获得的最大点数","frequency":16.35360301351877,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39578960365477217,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1424]对角线遍历 II","frequency":17.62479162823902,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43357041251778095,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.776484482550018,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7047817047817048,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":10.249377256279203,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6591661151555261,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.591326105087573,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.5059157595835305,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5746402877697842,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462628023534539,"acs":0,"articleLive":2,"columnArticles":1023,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.598654288917338,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39197282560114416,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6414677276746242,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4508039816232772,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6210526315789474,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7831616525975234,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.588394538606403,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.17475093105394,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.4820748659907724,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":34.81027829262389,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5617820552623409,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6958448753462604,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6469997769350881,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1441]用栈操作构建数组","frequency":7.405867322002621,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7918334483551874,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":54.0705053741304,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41059900915778413,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5242637909581087,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8576036866359447,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5727935984937632,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.616650532429816,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7131365198375508,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":5.046388508442953,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275654156843041,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.82122844662493,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8021359552466519,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":4.5163267526124375,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.521132758437134,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":7.405867322002621,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49772629772629773,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.405867322002621,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3627674101046882,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40310739286324054,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":17.62479162823902,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6336444517220676,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5192219584322546,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.6365424006554691,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44009290405253887,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5942714126807565,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7441114563496041,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5003971405877681,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.42545268691588783,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1462]课程表 IV","frequency":5.598654288917338,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5906840684068407,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.483859734733372,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7681368136813681,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1464]数组中两元素的最大乘积","frequency":5.598654288917338,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.3076500274821366,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.485225750531873,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":18.299252783972932,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6130769230769231,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7123916369199388,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.803921568627451,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8433744592212786,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[1470]重新排列数组","frequency":42.11387961110793,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5414634146341464,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.6168563000421408,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6751855267202389,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":47.143243115521464,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7201581027667984,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7245292887029289,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8652867795665203,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":19.00226179055076,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28907356109572174,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":19.73608701462076,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.574635241301908,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":27.491698628358318,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5737189563030494,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":7.405867322002621,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8693366587664664,"acs":0,"articleLive":2,"columnArticles":1266,"formTitle":"[1480]一维数组的动态和","frequency":32.68027306200834,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5116389298504318,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1481]不同整数的最少数目","frequency":30.21746506842205,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5871249067645877,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":50.91549059195242,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.3010570026425066,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8032432432432433,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.661604799400075,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8586079333878667,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":48.67348582826471,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30791993752825614,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1487]保证文件名唯一","frequency":25.294823619573307,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2350174274982234,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1488]避免洪水泛滥","frequency":60.80714843166105,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6927462396894711,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.85546875,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6714354827562374,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.666523512991196,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5665639567038002,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":23.967634579105308,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3606500691562932,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1494]并行课程 II","frequency":28.28784398044317,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428152492668622,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5387873838930285,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1496]判断路径是否相交","frequency":4.5163267526124375,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3920190167914222,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3327151089620454,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1498]满足条件的子序列数目","frequency":20.50160453616659,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37676678445229683,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2915057915057915,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5911482513153823,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":23.967634579105308,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7176371650620578,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1502]判断能否形成等差数列","frequency":33.96228035894468,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5117506289501135,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.299252783972932,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5937447873227689,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1504]统计全 1 子矩形","frequency":33.96228035894468,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.35947492426792327,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":34.81027829262389,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8417618270799347,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":29.551416121097656,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5901075816410974,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1507]转变日期格式","frequency":30.21746506842205,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526414387411015,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1508]子数组和排序后的区间和","frequency":7.405867322002621,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5439668088048865,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.576718324855081,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1510]石子游戏 IV","frequency":29.551416121097656,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6813751550593656,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.17475093105394,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8485673500022075,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[1512]好数对的数目","frequency":4.5163267526124375,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.3784577723378213,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":5.598654288917338,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31513799588855357,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34120763881223093,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":11.014894777825033,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5804020100502513,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7290909090909091,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6752899448260331,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":25.294823619573307,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2956650408286294,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3304148706896552,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39557251908396945,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":15.174785297802634,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7041156840934372,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5777336223506744,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.4236679856446121,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.35360301351877,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6596541042849767,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.17475093105394,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6118675066043487,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5083207261724659,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7842282597069206,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[1528]重新排列字符串","frequency":15.753410381957552,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6885750355057598,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1529]灯泡开关 IV","frequency":5.598654288917338,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5658429361220276,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":17.62479162823902,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32375409239723535,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.305027910745853,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6201338953632531,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":5.598654288917338,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6129032258064516,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7889648667767036,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.598654288917338,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45261330092029867,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.405867322002621,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43857346023411004,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.3654835174099992,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5978260869565217,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.5378418559623829,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[1539]第 k 个缺失的正整数","frequency":58.36424300892414,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3160569785327359,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.4573542564436133,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38067910090865614,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5479561316051844,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5437243546838169,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1544]整理字符串","frequency":23.967634579105308,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.552394643262465,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.62479162823902,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4102712060011541,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5329145042338159,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1547]切棍子的最小成本","frequency":26.729133143724614,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7130620985010707,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6671528588098017,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":5.598654288917338,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6602124469680054,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.598654288917338,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8175878642234905,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.598654288917338,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5067162877246031,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":17.62479162823902,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2935516808042727,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":60.103514064939425,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7008928571428571,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4345914809762013,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5795345149781981,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1556]千位分隔数","frequency":45.82435442849157,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7610563156220171,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6209954233409611,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":8.756863325826588,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36680396304130025,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1559]二维网格图中探测环","frequency":11.014894777825033,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5738791689447785,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.776484482550018,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7795123299026041,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.97684917048487,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3092806394316163,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":10.249377256279203,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3781123905127448,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":43.61917906626845,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5857284440039643,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.7257281553398058,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":5.598654288917338,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.44609101516919486,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.598654288917338,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.39217977178019237,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":22.733636743015374,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45456204379562043,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4725559481743227,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9012345679012346,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7581218875978184,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8052201858768349,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":14.616379269378092,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955557077312881,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1573]分割字符串的方案数","frequency":6.17475093105394,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.3260822743915572,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":35.33795332788147,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6008077544426494,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.4760657883970215,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1576]替换所有的问号","frequency":6.17475093105394,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3237811203319502,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.483859734733372,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5793677021370346,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6198363135642527,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":22.147942598620062,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6302083333333334,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8112549800796812,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.671285548461985,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.17475093105394,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.685557791191594,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":26.432928502058562,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6665603487228557,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[1584]连接所有点的最小费用","frequency":18.299252783972932,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42999263080324246,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6274864376130199,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8250706396095556,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8399516026658204,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[1588]所有奇数长度子数组的和","frequency":24.182020042027546,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2937747915486117,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.2636063560297843,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":7.405867322002621,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5800325556158438,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.44502930972604376,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5278776055036452,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.598654288917338,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.3130347645109073,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":7.405867322002621,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46159657516998237,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7613559322033898,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6609336609336609,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6709188506473003,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.598654288917338,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4187665782493369,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.681917032538673,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":18.299252783972932,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48200757575757575,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7816377171215881,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8449361830677441,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1603]设计停车系统","frequency":61.93010368547489,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4141929499072356,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7356009070294784,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.341227125941873,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5483804415102125,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6393197278911564,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5118932219819551,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1609]奇偶树","frequency":5.598654288917338,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.2700635443633796,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6090068595287802,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.734982332155477,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.7274427302477794,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.820834386852086,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.046388508442953,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49497778636275835,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.2752158943387707,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.776484482550018,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.619831686791072,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5915492957746479,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6785714285714286,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.36906419180201083,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":10.249377256279203,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.43690567977383704,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14577777777777778,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1622]奇妙序列","frequency":18.299252783972932,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7835001220405174,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.598654288917338,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.627974127974128,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.97684917048487,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5397640791476408,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.38355742584419583,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.17475093105394,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3780156574532673,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8348837209302326,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.522994226557834,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.769287991498406,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":6.17475093105394,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4921538927597698,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":25.294823619573307,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3166999334664005,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6585173501577287,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.776484482550018,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5216216216216216,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5459263103269331,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1635]Hopper 公司查询 I","frequency":6.776484482550018,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7064611347982945,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.598654288917338,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.806507117159393,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7118465983714211,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":9.483859734733372,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40092776673293573,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6634738869863014,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1640]能否连接形成数组","frequency":5.598654288917338,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7698159828337343,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":39.730382409446634,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45306422018348624,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":18.299252783972932,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.44990665836963284,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5404011461318051,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":19.73608701462076,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4116331096196868,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":6.776484482550018,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5379914604530087,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.85402415889282,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5120179707974541,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":29.551416121097656,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27744942978440024,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.00226179055076,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4746251441753172,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7938697318007663,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.776484482550018,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.685427135678392,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6604511278195488,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1652]拆炸弹","frequency":16.97684917048487,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5027859237536657,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.598654288917338,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27350427350427353,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1654]到家的最少跳跃次数","frequency":18.299252783972932,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3828287017834923,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.7807370703004026,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1656]设计有序流","frequency":5.598654288917338,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46489082969432316,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.17475093105394,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29657754010695186,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4061712846347607,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":28.28784398044317,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.744,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7335958005249343,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":17.62479162823902,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.812984575206072,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":15.753410381957552,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5721991061796887,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.294823619573307,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5442789157872957,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6670194470168012,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.776484482550018,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6823899371069182,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6027355623100304,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44152643807646275,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7699934340118187,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1669]合并两个链表","frequency":17.62479162823902,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5287521189203286,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":6.17475093105394,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46396935599712713,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":11.780412299370866,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8503183996759749,"acs":0,"articleLive":2,"columnArticles":436,"formTitle":"[1672]最富有客户的资产总量","frequency":5.598654288917338,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35111859514072646,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1673]找出最具竞争力的子序列","frequency":6.17475093105394,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3602288122836068,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":20.50160453616659,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4360056258790436,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7665929203539823,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":11.014894777825033,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.39991113085980895,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8299379549562753,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":5.598654288917338,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.49464763603925066,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1679]K 和数对的最大数目","frequency":6.17475093105394,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4618034089905502,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.17475093105394,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.3810162669797082,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":13.311447342462529,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5246800731261426,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8945757997218359,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8274831194268336,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[1684]统计一致字符串的数目","frequency":23.967634579105308,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5945899965974821,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.4696941264777632,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.776484482550018,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3985828166519043,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8040707150917373,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[1688]比赛中的配对次数","frequency":16.35360301351877,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8693420727182785,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":23.33975049175521,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.511909169443416,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1690]石子游戏 VII","frequency":6.17475093105394,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48522421988014053,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6473029045643154,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8032018742678642,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6355293913946845,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.4544096840119478,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1695]删除子数组的最大得分","frequency":5.598654288917338,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3992517006802721,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1696]跳跃游戏 VI","frequency":23.33975049175521,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5257015147752669,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5420918367346939,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7986848760748609,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.71946623204645,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.598654288917338,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6112857852060235,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1701]平均等待时间","frequency":17.62479162823902,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4765986627807303,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1702]修改后的最大二进制字符串","frequency":19.73608701462076,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38920454545454547,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7814963259853039,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.34617073323715736,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1705]吃苹果的最大数目","frequency":17.62479162823902,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5849724069619358,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1706]球会落何处","frequency":17.62479162823902,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032098411218305,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":42.11387961110793,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7030603804797353,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7145993413830956,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.692652329749104,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1710]卡车上的最大单元数","frequency":24.618777259563856,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.35935788979675337,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1711]大餐计数","frequency":52.100018859120766,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26501909683217256,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49727972185558383,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":46.516824084633576,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.635593220338983,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7384007897334649,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":17.62479162823902,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6755103798776811,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4299794661190965,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.48711943793911006,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.3629675045984059,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.869373127536122,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":57.662023881722476,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6474195196729688,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1721]交换链表中的节点","frequency":6.17475093105394,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5136714443219405,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.507664119408321,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":74.17513277171678,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5568760611205433,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7873955960516325,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.598654288917338,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47582290834885993,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5735647988999656,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":9.483859734733372,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3546146212371816,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.625122030589001,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.776484482550018,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5365853658536586,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.4785276073619632,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7926579597599718,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1732]找到最高海拔","frequency":31.62634020883016,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45808790212958767,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":11.014894777825033,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232918769839205,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":55.600933195082625,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48444444444444446,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.4491530820173204,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":46.516824084633576,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3088894750725402,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":20.50160453616659,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540431078627624,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":43.61917906626845,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4707786369358029,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7009472259810555,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":11.780412299370866,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8449791763072652,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7065842187772166,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.046388508442953,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974363819601915,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":42.11387961110793,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3629187250893237,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":57.07883959720874,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.48410317936412717,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5933952528379773,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7033898305084746,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7503618992472496,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":24.618777259563856,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5296027206678002,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.618777259563856,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4573108008817046,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.4694736842105263,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":21.305027910745853,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6863575568435132,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":0.0,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6281009879253567,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.42080033347228013,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":7.405867322002621,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.3981659517822807,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.065150602819122,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8289473684210527,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9234625668449198,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6351703593371811,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42763348459978756,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":6.17475093105394,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5362045760430686,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.42832735349393475,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":10.249377256279203,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6650641025641025,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6095065192275954,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1763]最长的美好子字符串","frequency":6.776484482550018,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4771000651182982,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5594850065189049,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.17475093105394,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.37603533959138596,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":16.35360301351877,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7974137931034483,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7690873897770449,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1768]交替合并字符串","frequency":15.753410381957552,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.855101683029453,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.598654288917338,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.36871098053617335,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":12.545929820916696,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3645782742431601,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.5359848484848485,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8414118412491868,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":28.908705389905005,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5541535226077813,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":6.17475093105394,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47316400413745546,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":19.00226179055076,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4605046626439934,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":29.12044407399787,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7788304475661548,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1777]每家商店的产品价格","frequency":71.44897439601172,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5699300699300699,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6470074812967581,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.17475093105394,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6616846105129829,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5170439760603694,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.17475093105394,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2864246643460965,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7893129770992366,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.42127344521224086,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1784]检查二进制字符串字段","frequency":5.598654288917338,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3475486903962391,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3404943164042132,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541210632119723,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":57.38778735164398,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6861924686192469,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.713589604764483,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6515618577887382,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.598654288917338,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8097364503983889,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1791]找出星型图的中心节点","frequency":5.598654288917338,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5136043533930857,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":35.33795332788147,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41215034965034963,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1793]好子数组的最大分数","frequency":18.299252783972932,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6887755102040817,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7925117004680188,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.294823619573307,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4867988122943584,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1796]字符串中第二大的数字","frequency":5.598654288917338,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.572284003421728,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1797]设计一个验证系统","frequency":17.62479162823902,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5196599362380446,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5141653008663076,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":8.756863325826588,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.683291770573566,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1800]最大升序子数组和","frequency":16.97684917048487,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.3766319772942289,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.26170144462279293,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.4105788423153693,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.147942598620062,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5740458015267176,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":11.014894777825033,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4946114834269154,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.046388508442953,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6632974533998425,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.729133143724614,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5842661034846884,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.2663255089553899,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":12.545929820916696,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6392609699769053,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":25.99759840260919,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.684931506849315,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":33.96228035894468,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6631067961165048,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":5.598654288917338,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7949843260188088,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5202086049543677,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.294823619573307,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34128272782626345,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.17475093105394,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30279114533205004,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.753041083314207,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1816]截断句子","frequency":5.598654288917338,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6963508941517641,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.598654288917338,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.3740831295843521,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":47.97881166725187,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.36470014627011216,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4970414201183432,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.8994315697420201,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.294823619573307,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8128967169700282,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1822]数组元素积的符号","frequency":16.35360301351877,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7078157844448691,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1823]找出游戏的获胜者","frequency":16.97684917048487,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6621491649908192,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28754700287547,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":12.545929820916696,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4381338742393509,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7960752396455055,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.8698138459666626,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1828]统计一个圆中点的数目","frequency":15.753410381957552,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6773564847625797,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4827586206896552,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.7334669338677354,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8223416808705913,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.618777259563856,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6850071394574012,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[1833]雪糕的最大数量","frequency":29.551416121097656,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3502332433095998,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.62634020883016,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5089889256436071,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":13.311447342462529,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7117117117117117,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.249377256279203,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7946058091286307,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.4308264400091068,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":58.36424300892414,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.578773714599945,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.38804748260335653,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":10.249377256279203,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5126171593366979,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":25.294823619573307,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7076923076923077,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5117647058823529,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":5.598654288917338,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8037009252313079,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.5752462796059526,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336955512213244,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.40257325092784,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.35973860376155564,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":8.065150602819122,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.686824644549763,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.32942314669246586,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.405867322002621,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6048858204992034,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":9.483859734733372,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.4,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7040358744394619,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6509803921568628,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.405867322002621,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.793846590103502,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1854]人口最多的年份","frequency":24.618777259563856,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6911744830382485,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.967634579105308,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35572659583368194,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":19.73608701462076,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4498798864380869,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.6423357664233577,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":13.311447342462529,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7727438357828252,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7731895850284785,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1860]增长的内存泄露","frequency":5.598654288917338,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6178244794707142,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":5.598654288917338,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.31105324074074076,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.921353522867738,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.40257325092784,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.3862088013257227,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":8.065150602819122,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5166532095276544,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5952115812917594,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":20.50160453616659,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.765625,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5454545454545454,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":17.62479162823902,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7992192582953807,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1869]哪种连续子字符串更长","frequency":23.967634579105308,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4610721727599924,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.776484482550018,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27585874179853337,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6243918261433669,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8011869436201781,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1873]计算特殊奖金","frequency":34.63760524872387,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8775510204081632,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.7350993377483444,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7304488040849234,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8194653048963653,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.794889903624224,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.42818819645068096,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.40625,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":8.065150602819122,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7742822571774283,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.598654288917338,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3521675596687774,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.2769997626394493,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37217467632214174,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6948267679164689,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.63760524872387,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5276967930029155,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5736572320035659,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":17.62479162823902,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.6406106066587709,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.776484482550018,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.31446983011130636,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.405867322002621,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.27498985526849723,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":20.50160453616659,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.6995215311004784,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5295950155763239,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3552758954501452,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.776484482550018,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5917404697728148,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.82435442849157,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.43161754719543666,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5297071129707113,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.503388786198398,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.528884908195253,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.97684917048487,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.30766226665625246,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.065150602819122,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6271426047004771,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4261682242990654,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":24.953577938598713,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6577992744860943,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.45588235294117646,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6442061307772611,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27580056060477365,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5737222370885737,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42203449489616335,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":21.305027910745853,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6224137931034482,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6716417910447762,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.32704353272784215,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.17475093105394,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.6753479125248509,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5688634192932187,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1911]最大子序列交替和","frequency":16.35360301351877,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2978049332428151,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8470421871317464,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.598654288917338,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4409946614217477,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":16.97684917048487,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3899245766329871,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5534370296036126,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.73608701462076,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.2922173274596182,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.4644808743169399,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3899018232819074,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9378336298932385,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.3431385253336789,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.97684917048487,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.36258022585100336,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.598654288917338,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23599066044029354,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.99759840260919,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.4935064935064935,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6970737289521007,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.21746506842205,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3467304625199362,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.41015528715799854,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.598654288917338,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39364398518229676,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":33.15082077897072,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9385668916236601,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1929]数组串联","frequency":3.5170706651808015,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4749887336638125,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.35360301351877,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5528290993071594,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":6.17475093105394,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3243330118932819,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":11.014894777825033,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5716463414634146,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.7322834645669292,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7420366795366795,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.44861053504769804,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23952286282306162,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":18.299252783972932,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3365716076465058,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":17.62479162823902,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6329670329670329,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8307692307692308,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7724346838318819,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.38911381016644175,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.4036847014925373,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5664911125740619,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.776484482550018,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6615973741794311,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.046388508442953,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30281898232964954,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.62479162823902,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5377170509536009,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5195402298850574,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.065150602819122,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5169811320754717,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.55,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7168949771689498,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5415507649513213,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1952]三除数","frequency":4.006998583773413,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.3196832760137567,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.48064795350562634,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":3.5170706651808015,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4933387161889382,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4357142857142857,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":16.35360301351877,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6078973025674358,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41888274138854187,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.4079773869346734,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.27991782229070367,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5362845315536031,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.7655175215458314,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.4240661861074705,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1962]移除石子使总数最小","frequency":7.405867322002621,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6121958546109942,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":1.5310350430916628,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3818741187027304,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.7481751824817519,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.71875,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7722617354196302,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35107157298827335,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.2753910116808553,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":20.50160453616659,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.47354623450905625,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":23.034059763829354,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5644699140401146,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4816753926701571,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":19.00226179055076,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4891304347826087,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.7439624853458382,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":6.17475093105394,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3719457013574661,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1975]最大方阵和","frequency":7.405867322002621,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2744532971690117,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.23864482501861503,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.6141732283464567,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.835072463768116,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5776593430498151,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1980]找出不同的二进制字符串","frequency":5.046388508442953,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29047722815428195,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":29.12044407399787,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.44797507788161994,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":20.50160453616659,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1983]","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.5906153413880303,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4013663535439795,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2515512656357727,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1986]完成任务的最少工作时间段","frequency":13.311447342462529,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.434957532409477,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6153846153846154,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1988]","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.8445031154292956,"acs":0,"articleLive":2,"columnArticles":618,"formTitle":"[LCP 01]猜数字","frequency":44.11430477975606,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6879361914257228,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":30.21746506842205,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21805909219514166,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":24.618777259563856,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3750572431689818,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":41.28650501869236,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19591959195919592,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8392956184137549,"acs":0,"articleLive":2,"columnArticles":641,"formTitle":"[LCP 06]拿硬币","frequency":34.63760524872387,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.770244628975986,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[LCP 07]传递信息","frequency":67.75411918462278,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.282130564144449,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.26652527394839165,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":63.726154686049284,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5806451612903226,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":25.99759840260919,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6838823651667879,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":7.405867322002621,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.40661744599398414,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":38.29011339087789,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.615771035759138,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":10.249377256279203,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2007715801318116,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":35.33795332788147,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5734767025089605,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":11.780412299370866,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2962561041779707,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7978433835845896,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[LCP 17]速算机器人","frequency":33.96228035894468,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28356024506466987,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[LCP 18]早餐组合","frequency":33.96228035894468,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5160133843212237,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":32.68027306200834,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29903057419835943,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 20]快速公交","frequency":22.147942598620062,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.32354230600613765,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":22.147942598620062,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33192541856925417,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[LCP 22]黑白方格画","frequency":50.62997025592897,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3336045565500407,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":19.00226179055076,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.27079303675048355,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.324455205811138,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3315614617940199,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3264920334863624,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":28.28784398044317,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.26852114674992905,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[LCP 28]采购方案","frequency":29.551416121097656,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.172471933215446,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 29]乐团站位","frequency":50.62997025592897,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.33548753639656276,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[LCP 30]魔塔游戏","frequency":5.046388508442953,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.22981666130588613,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":19.73608701462076,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.37372843874391865,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":19.73608701462076,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2013646544090838,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[LCP 33]蓄水","frequency":30.21746506842205,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.45870307167235497,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCP 34]二叉树染色","frequency":30.21746506842205,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.37171561051004637,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 35]电动车游城市","frequency":19.73608701462076,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.23340790454884414,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":41.1251631385989,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.17784496976360636,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 37]最小矩形面积","frequency":35.69807385182098,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5289017341040463,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":25.99759840260919,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5367864364597915,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[LCS 01]下载插件","frequency":25.99759840260919,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.700735294117647,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 02]完成一半题目","frequency":17.62479162823902,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41733979536887456,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 03]主题空间","frequency":7.405867322002621,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786332070593079,"acs":0,"articleLive":2,"columnArticles":2684,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.81594203890477,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.4030680081760632,"acs":0,"articleLive":2,"columnArticles":1980,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":78.7535656228115,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7622429679149806,"acs":0,"articleLive":2,"columnArticles":1842,"formTitle":"[剑指 Offer 05]替换空格","frequency":64.01117351867516,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7522863037527475,"acs":0,"articleLive":2,"columnArticles":1974,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":76.67125740633364,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6958689597413474,"acs":0,"articleLive":2,"columnArticles":1395,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":83.83004009166008,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7173032737220366,"acs":0,"articleLive":2,"columnArticles":1555,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":90.36346799757663,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3482577851220833,"acs":0,"articleLive":2,"columnArticles":1605,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":78.8891838847609,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4417143596921266,"acs":0,"articleLive":2,"columnArticles":1252,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":76.89454940017808,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49363892356608124,"acs":0,"articleLive":2,"columnArticles":1548,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":84.75247530354373,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.45346748010579674,"acs":0,"articleLive":2,"columnArticles":1067,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":64.5795276689312,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5252094415952601,"acs":0,"articleLive":2,"columnArticles":1642,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":77.61211691797865,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5682100428354713,"acs":0,"articleLive":2,"columnArticles":1248,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":66.81691462502619,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31102239632389744,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":39.730382409446634,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7461114667064584,"acs":0,"articleLive":2,"columnArticles":1215,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":54.47477225871845,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.3384598359247362,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.1016148936587,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.7773849287169042,"acs":0,"articleLive":2,"columnArticles":1088,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":64.37310351591734,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5952909203711696,"acs":0,"articleLive":2,"columnArticles":1400,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":59.59125867280364,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.3744906955133551,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":57.662023881722476,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23906950302100824,"acs":0,"articleLive":2,"columnArticles":803,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":74.55206980426632,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6423038792642307,"acs":0,"articleLive":2,"columnArticles":1544,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":54.963206533895125,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7898811805289383,"acs":0,"articleLive":2,"columnArticles":2088,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":87.23181750761022,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428759364352435,"acs":0,"articleLive":2,"columnArticles":1744,"formTitle":"[剑指 Offer 24]反转链表","frequency":95.0330889817607,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.729065104409533,"acs":0,"articleLive":2,"columnArticles":1131,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.85011277497964,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.465752805236906,"acs":0,"articleLive":2,"columnArticles":1122,"formTitle":"[剑指 Offer 26]树的子结构","frequency":69.39322984259594,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7909032501052352,"acs":0,"articleLive":2,"columnArticles":1335,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":67.43875727322087,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5802141943466738,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":50.39510534949492,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.43971263041862135,"acs":0,"articleLive":2,"columnArticles":1419,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":82.63189079256507,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5736640325483139,"acs":0,"articleLive":2,"columnArticles":847,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":54.27911520263682,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.6139959988101418,"acs":0,"articleLive":2,"columnArticles":877,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":39.41257965310674,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.6459554332987776,"acs":0,"articleLive":2,"columnArticles":893,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":66.08563349960896,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6863742490479363,"acs":0,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.801998328245354,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5889944886580124,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.82492481696669,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5494266312432472,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.47661177190433,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.5777551516057317,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":64.593363315544,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7213649411732995,"acs":0,"articleLive":2,"columnArticles":767,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":58.76509393865494,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.6541786351198661,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":69.5804390864868,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5586044211087015,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":71.93494251248275,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5791832011866026,"acs":0,"articleLive":2,"columnArticles":1065,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":93.60085933663999,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6891174750586982,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":60.43823505780307,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.5693633679005563,"acs":0,"articleLive":2,"columnArticles":1740,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":75.60462703976269,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5798731314910052,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":46.19905962615179,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6054618201585822,"acs":0,"articleLive":2,"columnArticles":1465,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":90.36951264849559,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4821865792422293,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":54.22355943006205,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.4131644567583614,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":49.26042941174064,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5619743211717589,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.09510744923661,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5385914607800778,"acs":0,"articleLive":2,"columnArticles":1367,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":70.1838409639588,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.6891069440226744,"acs":0,"articleLive":2,"columnArticles":927,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":54.00285190630053,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.46474485527856785,"acs":0,"articleLive":2,"columnArticles":967,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":71.69053235335792,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.6513506229986367,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[剑指 Offer 49]丑数","frequency":68.68574073296385,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140155240236022,"acs":0,"articleLive":2,"columnArticles":987,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":65.65901940573363,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4806122500492203,"acs":0,"articleLive":2,"columnArticles":807,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":92.64720303936414,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6473911139688914,"acs":0,"articleLive":2,"columnArticles":1011,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":69.11307502138212,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5396890948987895,"acs":0,"articleLive":2,"columnArticles":1501,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":59.09155275938669,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44729468809430484,"acs":0,"articleLive":2,"columnArticles":1384,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":55.12202989051103,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7551401216366567,"acs":0,"articleLive":2,"columnArticles":1090,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":48.472523599801306,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7891838230080128,"acs":0,"articleLive":2,"columnArticles":1219,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":63.23670421211612,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5868065278766038,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.97090422912428,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.6995811085109959,"acs":0,"articleLive":2,"columnArticles":979,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":64.54232410037876,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7989557377361003,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":50.39510534949492,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.6631713404629437,"acs":0,"articleLive":2,"columnArticles":787,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.5795276689312,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.7060512379365037,"acs":0,"articleLive":2,"columnArticles":1804,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":64.92824498446963,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.4410616389115215,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":57.72213319149253,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8565653262108844,"acs":0,"articleLive":2,"columnArticles":1697,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":57.465763850100906,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44417481827156063,"acs":0,"articleLive":2,"columnArticles":1137,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":77.95429569640727,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4740270114820101,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":53.143393726450526,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5592967081320414,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":60.54508639863645,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.45983785970916147,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":63.5222052269153,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6548259549080907,"acs":0,"articleLive":2,"columnArticles":726,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":73.80492316865069,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6338151764630799,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":62.2915198921808,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.8568943362656914,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":55.72708934495731,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5816854408700872,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":42.75825921515129,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5975900623320891,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":54.258629507281974,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.2845202816380473,"acs":0,"articleLive":2,"columnArticles":526,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":51.408135970483926,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.693159493894774,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":46.19905962615179,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6995984398716545,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.47661177190433,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.21181596966781732,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 001]整数除法","frequency":15.174785297802634,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5983537712077944,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.793023669692116,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":3.0453303457933165,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7063265306122449,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7350061199510404,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6814236111111112,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":15.753410381957552,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.47545787545787543,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5210979106923392,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5583982202447163,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.4405339805825243,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5735400144196107,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6661090665774506,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6651162790697674,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5200816882232812,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.652292576419214,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5132767588283602,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5321447866018368,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5586164677073768,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.4824186657903385,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":16.97684917048487,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7147147147147147,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5356277266117305,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5257004636162064,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":3.0453303457933165,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7154716981132075,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":4.006998583773413,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7754784502878481,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 024]反转链表","frequency":15.174785297802634,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6237362637362638,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":16.97684917048487,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.682936507936508,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 026]重排链表","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6380997851515875,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 027]回文链表","frequency":3.0453303457933165,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6067796610169491,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.30260137719969393,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5449438202247191,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.610126582278481,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.5986124876114965,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.7889908256880734,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5698401667824878,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6960950764006791,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.6057494866529775,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.46033653846153844,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.7869897959183674,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5212620027434842,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5780022446689114,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7875080489375402,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8600508905852418,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6363636363636364,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6578153289076645,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7988958990536278,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7244973938942666,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.7034976152623211,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":6.17475093105394,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.7004555808656037,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7627388535031847,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6356589147286822,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.43919442292796285,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":16.97684917048487,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7597222222222222,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":4.006998583773413,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6514360313315927,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8725490196078431,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8994334277620396,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7431069266980498,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3553875236294896,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.5924242424242424,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6419098143236074,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.6543095458758109,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5311004784688995,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":4.006998583773413,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.6813031161473088,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7248576850094877,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.5769230769230769,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5936794582392777,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6651480637813212,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.6576354679802956,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5350215517241379,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7438837920489296,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.7,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5059523809523809,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4295676429567643,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5580865603644647,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5447272727272727,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 074]合并区间","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7172593235039029,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6721955477957224,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5536480686695279,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.6486486486486487,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8598993288590604,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7895348837209303,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7960877296976882,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6509368494101319,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8699242945629732,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":6.17475093105394,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6879219804951238,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.86002886002886,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":4.5163267526124375,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7494929006085193,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6276948590381426,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7445678416224046,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6285081240768094,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5246085011185683,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7468643101482326,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6445623342175066,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5396383866481224,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6283924843423799,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6858377659574468,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":34.63760524872387,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5115942028985507,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5228136882129277,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.75,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.665389527458493,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":23.33975049175521,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7438118811881188,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.46176821983273597,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.562753036437247,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5062305295950156,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":25.294823619573307,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5555555555555556,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6811352253756261,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5652173913043478,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.046388508442953,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5494505494505495,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5666666666666667,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.56,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.8421052631578947,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.7180616740088106,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5838926174496645,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6025459688826026,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.97684917048487,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.42670157068062825,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.2717391304347826,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 115]重建序列","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6476270474590509,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6128133704735376,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6934306569343066,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.45848977889027953,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.598654288917338,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7211602129178168,"acs":0,"articleLive":2,"columnArticles":1473,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":77.87231248058019,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6506705073586367,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":48.609323275026696,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5798240056318198,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 01.03]URL化","frequency":40.05349100799297,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510966882044447,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[面试题 01.04]回文排列","frequency":41.40257325092784,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3339332748024583,"acs":0,"articleLive":2,"columnArticles":526,"formTitle":"[面试题 01.05]一次编辑","frequency":42.11387961110793,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47342654497619985,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[面试题 01.06]字符串压缩","frequency":68.68574073296385,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7552278657685539,"acs":0,"articleLive":2,"columnArticles":939,"formTitle":"[面试题 01.07]旋转矩阵","frequency":55.648499897666106,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6220154896659181,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[面试题 01.08]零矩阵","frequency":41.40257325092784,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5515798171399832,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[面试题 01.09]字符串轮转","frequency":30.21746506842205,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6846510051953919,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.01]移除重复节点","frequency":52.041443411948386,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7802956031818915,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":57.027802028484686,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540022340334124,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.624103605585645,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6576437510336843,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 02.04]分割链表","frequency":49.933481940704496,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4667926095636213,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[面试题 02.05]链表求和","frequency":75.68345877571117,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4825638890334669,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[面试题 02.06]回文链表","frequency":35.69807385182098,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6876117167748272,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[面试题 02.07]链表相交","frequency":22.733636743015374,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5306071973288264,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 02.08]环路检测","frequency":48.67348582826471,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5425639929460803,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6123744315058224,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 03.02]栈的最小值","frequency":44.11430477975606,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.38727475197408384,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 03.03]堆盘子","frequency":29.551416121097656,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7120412187519878,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":37.608459643499685,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5459404324765402,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[面试题 03.05]栈排序","frequency":16.97684917048487,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5894651257332016,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.06]动物收容所","frequency":30.908497965194275,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5343197565239914,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.01]节点间通路","frequency":34.63760524872387,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7896332078331084,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 04.02]最小高度树","frequency":52.420301754959844,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8058089545978819,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":40.05349100799297,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5838958006494217,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[面试题 04.04]检查平衡性","frequency":16.97684917048487,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35108078349559574,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":41.40257325092784,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5910987915784228,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":16.35360301351877,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.716972539733139,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.551416121097656,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4784048156508653,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":24.618777259563856,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7176426706452816,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[面试题 04.10]检查子树","frequency":5.598654288917338,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48850490554986087,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 04.12]求和路径","frequency":33.96228035894468,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5065744340269838,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6856496322836131,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":24.618777259563856,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3909511408248144,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 05.03]翻转数位","frequency":38.996812391618974,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3941853135833596,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5279078658128644,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 05.06]整数转换","frequency":5.598654288917338,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7041898357687831,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 05.07]配对交换","frequency":16.97684917048487,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5518444666001994,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":23.967634579105308,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36407542470870763,"acs":0,"articleLive":2,"columnArticles":453,"formTitle":"[面试题 08.01]三步问题","frequency":46.02956371197193,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3614255897792676,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":38.29011339087789,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768189285146521,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[面试题 08.03]魔术索引","frequency":5.598654288917338,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8226862720869887,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":43.42457115484806,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6797166168619683,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":5.598654288917338,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6557017543859649,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":60.34909714105202,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8128433115984983,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":40.716325768940045,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7177771582566675,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":44.11430477975606,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8114290175260549,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 08.09]括号","frequency":63.591505936377104,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5594050894085282,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":16.35360301351877,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49476513655196996,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":50.62997025592897,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7595064336470136,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 08.12]八皇后","frequency":49.933481940704496,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5015683814303639,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":17.62479162823902,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5336504827200224,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.554132369807261,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.00738042443625,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7396076903091712,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.93010368547489,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3964129907901115,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":61.22587172021294,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5528569717297557,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.618777259563856,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4560862865947612,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":45.82435442849157,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6299824150058617,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":8.065150602819122,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670350925670074,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":40.05349100799297,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8329213369002065,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[面试题 16.01]交换数字","frequency":30.908497965194275,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7654199475065617,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.02]单词频率","frequency":6.17475093105394,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4433177570093458,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":7.405867322002621,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46162025652954075,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.46438208310847273,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.21746506842205,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4235396991955229,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.06]最小差","frequency":30.908497965194275,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7335845831066905,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 16.07]最大数值","frequency":41.40257325092784,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.37617340843147296,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":8.065150602819122,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5482767692712444,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6844677137870855,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.10]生存人数","frequency":24.618777259563856,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4411056303603964,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[面试题 16.11]跳水板","frequency":23.967634579105308,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43337250293772034,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.5506451612903226,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5031693860781782,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.17475093105394,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45158828579605076,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 16.16]部分排序","frequency":40.716325768940045,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6010657384814124,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":44.11430477975606,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3442028153489333,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":35.33795332788147,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.609301315462894,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[面试题 16.19]水域大小","frequency":49.933481940704496,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7205957446808511,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.20]T9键盘","frequency":30.21746506842205,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46458923512747874,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 16.21]交换和","frequency":5.598654288917338,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5820631764965761,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.405867322002621,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47092864303289894,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 16.24]数对和","frequency":23.967634579105308,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5440822697640253,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 16.25]LRU 缓存","frequency":89.61897642735583,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38665569771070324,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.26]计算器","frequency":60.103514064939425,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5981746800591444,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 17.01]不用加号的加法","frequency":24.618777259563856,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6452582341678582,"acs":0,"articleLive":2,"columnArticles":430,"formTitle":"[面试题 17.04]消失的数字","frequency":38.29011339087789,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38680860567259734,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.62479162823902,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4480473848007228,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.06]2出现的次数","frequency":0.0,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.4106994273408056,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":35.33795332788147,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27164270419088404,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.08]马戏团人塔","frequency":39.730382409446634,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5501594309541329,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 17.09]第 k 个数","frequency":56.32642931538688,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5713210094506179,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[面试题 17.10]主要元素","frequency":60.80714843166105,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6865013233996667,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 17.11]单词距离","frequency":35.33795332788147,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6318193272017135,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.598654288917338,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5534097904648989,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":30.908497965194275,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5477866028149273,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 17.14]最小K个数","frequency":72.6709827048027,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4029455081001473,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.15]最长单词","frequency":30.908497965194275,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5195354393185049,"acs":0,"articleLive":2,"columnArticles":1121,"formTitle":"[面试题 17.16]按摩师","frequency":56.32642931538688,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44235085646780864,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":16.97684917048487,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4459512068518038,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.18]最短超串","frequency":25.294823619573307,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5821609454136185,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":33.31033267691227,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5710791806786916,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":16.97684917048487,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6352738977817266,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[面试题 17.21]直方图的水量","frequency":89.4735709165248,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37101359154303987,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":41.40257325092784,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3798518782903542,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":6.776484482550018,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.516205442255474,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[面试题 17.24]最大子矩阵","frequency":69.98131888326297,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49167270094134685,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":27.491698628358318,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3405917899562409,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.35360301351877,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
+[{"acceptance":0.4901087899022947,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[165]比较版本号","frequency":75.48765802613015,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.5192258148037489,"acs":0,"articleLive":2,"columnArticles":13858,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4078807093775263,"acs":0,"articleLive":2,"columnArticles":6930,"formTitle":"[2]两数相加","frequency":99.23868298648503,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.3789275041240646,"acs":0,"articleLive":2,"columnArticles":7124,"formTitle":"[3]无重复字符的最长子串","frequency":97.7160489594551,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.407258248936218,"acs":0,"articleLive":2,"columnArticles":3647,"formTitle":"[4]寻找两个正序数组的中位数","frequency":96.31321009177124,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3526533541457204,"acs":0,"articleLive":2,"columnArticles":3836,"formTitle":"[5]最长回文子串","frequency":96.02764043248322,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5062827052936054,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[6]Z 字形变换","frequency":80.15170161048452,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35375936572216876,"acs":0,"articleLive":2,"columnArticles":5107,"formTitle":"[7]整数反转","frequency":98.47736597297005,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21684863756643746,"acs":0,"articleLive":2,"columnArticles":2608,"formTitle":"[8]字符串转换整数 (atoi)","frequency":73.09265046116886,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5854250324139928,"acs":0,"articleLive":2,"columnArticles":4781,"formTitle":"[9]回文数","frequency":80.21222262372757,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3164020808430903,"acs":0,"articleLive":2,"columnArticles":1204,"formTitle":"[10]正则表达式匹配","frequency":86.33892953630536,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6315059683850144,"acs":0,"articleLive":2,"columnArticles":2911,"formTitle":"[11]盛最多水的容器","frequency":85.90451854479302,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6653713141609028,"acs":0,"articleLive":2,"columnArticles":1715,"formTitle":"[12]整数转罗马数字","frequency":76.35271467976294,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6330716101094976,"acs":0,"articleLive":2,"columnArticles":3764,"formTitle":"[13]罗马数字转整数","frequency":83.09070771205182,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4070561726285732,"acs":0,"articleLive":2,"columnArticles":3753,"formTitle":"[14]最长公共前缀","frequency":92.83031267375469,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3331548517164071,"acs":0,"articleLive":2,"columnArticles":2939,"formTitle":"[15]三数之和","frequency":95.90293915775361,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4596724920875189,"acs":0,"articleLive":2,"columnArticles":1379,"formTitle":"[16]最接近的三数之和","frequency":84.2786038554476,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5717731400462678,"acs":0,"articleLive":2,"columnArticles":2936,"formTitle":"[17]电话号码的字母组合","frequency":80.43157362408914,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.40153295204708406,"acs":0,"articleLive":2,"columnArticles":1456,"formTitle":"[18]四数之和","frequency":69.76721717635768,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42789668401580894,"acs":0,"articleLive":2,"columnArticles":3663,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":76.67065362595629,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.4448278786376416,"acs":0,"articleLive":2,"columnArticles":5363,"formTitle":"[20]有效的括号","frequency":92.97864745609836,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6667786079272036,"acs":0,"articleLive":2,"columnArticles":3315,"formTitle":"[21]合并两个有序链表","frequency":87.46255273618155,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724485624744516,"acs":0,"articleLive":2,"columnArticles":2538,"formTitle":"[22]括号生成","frequency":91.45019890186661,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.558691703088185,"acs":0,"articleLive":2,"columnArticles":2025,"formTitle":"[23]合并K个升序链表","frequency":82.65859323466643,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.70257491460152,"acs":0,"articleLive":2,"columnArticles":2425,"formTitle":"[24]两两交换链表中的节点","frequency":62.548764482308194,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6562479329897837,"acs":0,"articleLive":2,"columnArticles":2084,"formTitle":"[25]K 个一组翻转链表","frequency":92.05877980095337,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5402163257846379,"acs":0,"articleLive":2,"columnArticles":4364,"formTitle":"[26]删除有序数组中的重复项","frequency":81.23336356044378,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5983730039168424,"acs":0,"articleLive":2,"columnArticles":3916,"formTitle":"[27]移除元素","frequency":74.71668776548091,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4071598420755781,"acs":0,"articleLive":2,"columnArticles":3137,"formTitle":"[28]实现 strStr()","frequency":74.54144424071379,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20738444900709999,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[29]两数相除","frequency":69.66517614498227,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35564297733300393,"acs":0,"articleLive":2,"columnArticles":563,"formTitle":"[30]串联所有单词的子串","frequency":57.82516074342195,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.3732952037730756,"acs":0,"articleLive":2,"columnArticles":1671,"formTitle":"[31]下一个排列","frequency":80.62027708370623,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3555256064690027,"acs":0,"articleLive":2,"columnArticles":1260,"formTitle":"[32]最长有效括号","frequency":77.1649893601832,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42579873380447586,"acs":0,"articleLive":2,"columnArticles":2302,"formTitle":"[33]搜索旋转排序数组","frequency":78.13413002632657,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.424435322059962,"acs":0,"articleLive":2,"columnArticles":3114,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":71.65490952760865,"frontendQuestionId":"34","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找元素的第一个和最后一个位置","titleSlug":"find-first-and-last-position-of-element-in-sorted-array"},{"acceptance":0.4660526586092375,"acs":0,"articleLive":2,"columnArticles":3748,"formTitle":"[35]搜索插入位置","frequency":75.35318008344308,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6286715639337354,"acs":0,"articleLive":2,"columnArticles":1113,"formTitle":"[36]有效的数独","frequency":53.36260013908477,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6707745745050365,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[37]解数独","frequency":67.50166795965991,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5796333574750849,"acs":0,"articleLive":2,"columnArticles":2219,"formTitle":"[38]外观数列","frequency":64.61101908364054,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7269543353366098,"acs":0,"articleLive":2,"columnArticles":1862,"formTitle":"[39]组合总和","frequency":74.37982262062765,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6279461721937853,"acs":0,"articleLive":2,"columnArticles":1335,"formTitle":"[40]组合总和 II","frequency":71.49262843774332,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41898704333106396,"acs":0,"articleLive":2,"columnArticles":1373,"formTitle":"[41]缺失的第一个正数","frequency":89.45387444202815,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5752479372035635,"acs":0,"articleLive":2,"columnArticles":2338,"formTitle":"[42]接雨水","frequency":94.36124487701717,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4488262215198209,"acs":0,"articleLive":2,"columnArticles":1104,"formTitle":"[43]字符串相乘","frequency":82.41945010422128,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32800590214153114,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[44]通配符匹配","frequency":62.88546046997233,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4253920383234414,"acs":0,"articleLive":2,"columnArticles":1511,"formTitle":"[45]跳跃游戏 II","frequency":96.95473194594014,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7822756213577434,"acs":0,"articleLive":2,"columnArticles":2568,"formTitle":"[46]全排列","frequency":93.16575388649838,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.636238680465718,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[47]全排列 II","frequency":66.94319897655714,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7348876144956633,"acs":0,"articleLive":2,"columnArticles":1805,"formTitle":"[48]旋转图像","frequency":72.70688858292132,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6638050008717984,"acs":0,"articleLive":2,"columnArticles":1260,"formTitle":"[49]字母异位词分组","frequency":69.78417586670935,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767832002068728,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[50]Pow(x, n)","frequency":66.802817887687,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7391792916624862,"acs":0,"articleLive":2,"columnArticles":1492,"formTitle":"[51]N 皇后","frequency":69.42513239706075,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8233886662850601,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[52]N皇后 II","frequency":28.76672692836418,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5510931214594733,"acs":0,"articleLive":2,"columnArticles":3605,"formTitle":"[53]最大子序和","frequency":78.71827493275818,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.47928170973317036,"acs":0,"articleLive":2,"columnArticles":1932,"formTitle":"[54]螺旋矩阵","frequency":88.73250100585035,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43207368163572324,"acs":0,"articleLive":2,"columnArticles":2357,"formTitle":"[55]跳跃游戏","frequency":76.69693232256142,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.4666510522643323,"acs":0,"articleLive":2,"columnArticles":2209,"formTitle":"[56]合并区间","frequency":87.92131593943031,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41054931274675965,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[57]插入区间","frequency":37.418744341742546,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3530749871199988,"acs":0,"articleLive":2,"columnArticles":2321,"formTitle":"[58]最后一个单词的长度","frequency":54.47230325315938,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7930850924003049,"acs":0,"articleLive":2,"columnArticles":1499,"formTitle":"[59]螺旋矩阵 II","frequency":78.58109649976281,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5234175030060597,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[60]排列序列","frequency":38.59602904015906,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.41812776387996675,"acs":0,"articleLive":2,"columnArticles":1940,"formTitle":"[61]旋转链表","frequency":72.17740184638399,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6601829859906839,"acs":0,"articleLive":2,"columnArticles":2336,"formTitle":"[62]不同路径","frequency":68.34213362564395,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3899607227022781,"acs":0,"articleLive":2,"columnArticles":1646,"formTitle":"[63]不同路径 II","frequency":69.76721717635768,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6879382366104729,"acs":0,"articleLive":2,"columnArticles":2015,"formTitle":"[64]最小路径和","frequency":73.14470903550257,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.2692106078295885,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[65]有效数字","frequency":44.92418668657559,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4584836513040566,"acs":0,"articleLive":2,"columnArticles":3065,"formTitle":"[66]加一","frequency":63.6217654990774,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5437966217211375,"acs":0,"articleLive":2,"columnArticles":1727,"formTitle":"[67]二进制求和","frequency":56.03400574149302,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.47031200832667686,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[68]文本左右对齐","frequency":43.657555543871865,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39283177904928274,"acs":0,"articleLive":2,"columnArticles":1871,"formTitle":"[69]x 的平方根","frequency":79.98104236120831,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5280076627981416,"acs":0,"articleLive":2,"columnArticles":3433,"formTitle":"[70]爬楼梯","frequency":93.48505859148835,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4215138077560429,"acs":0,"articleLive":2,"columnArticles":801,"formTitle":"[71]简化路径","frequency":54.07553298216548,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6127577106740026,"acs":0,"articleLive":2,"columnArticles":1189,"formTitle":"[72]编辑距离","frequency":93.38474955654368,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6015627227878062,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[73]矩阵置零","frequency":54.78782029406655,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.45866551911578185,"acs":0,"articleLive":2,"columnArticles":1633,"formTitle":"[74]搜索二维矩阵","frequency":75.65630200404212,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5940511558815338,"acs":0,"articleLive":2,"columnArticles":1781,"formTitle":"[75]颜色分类","frequency":46.41889827002898,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4241201213474727,"acs":0,"articleLive":2,"columnArticles":1197,"formTitle":"[76]最小覆盖子串","frequency":81.19165212317608,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7701786378861184,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[77]组合","frequency":72.65538112615656,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.8007461166557679,"acs":0,"articleLive":2,"columnArticles":1960,"formTitle":"[78]子集","frequency":75.31152380473331,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45734927624188115,"acs":0,"articleLive":2,"columnArticles":1345,"formTitle":"[79]单词搜索","frequency":72.39833940386949,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6160641095703259,"acs":0,"articleLive":2,"columnArticles":1297,"formTitle":"[80]删除有序数组中的重复项 II","frequency":67.59747411159604,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4160037063543925,"acs":0,"articleLive":2,"columnArticles":963,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.17740184638399,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.529008347369464,"acs":0,"articleLive":2,"columnArticles":1629,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":83.42434763850642,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5386134214829033,"acs":0,"articleLive":2,"columnArticles":1862,"formTitle":"[83]删除排序链表中的重复元素","frequency":70.80661953648307,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.4326352208227139,"acs":0,"articleLive":2,"columnArticles":1116,"formTitle":"[84]柱状图中最大的矩形","frequency":79.21110652140838,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5161331230770927,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[85]最大矩形","frequency":59.997777480519176,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.632264255880653,"acs":0,"articleLive":2,"columnArticles":1067,"formTitle":"[86]分隔链表","frequency":57.72682639563384,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48879057810725174,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[87]扰乱字符串","frequency":68.77125493810888,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5151959749489832,"acs":0,"articleLive":2,"columnArticles":3090,"formTitle":"[88]合并两个有序数组","frequency":94.92445689792942,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7095179697667434,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[89]格雷编码","frequency":44.92418668657559,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.6338939384471928,"acs":0,"articleLive":2,"columnArticles":1166,"formTitle":"[90]子集 II","frequency":75.52311131131265,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3049249809941348,"acs":0,"articleLive":2,"columnArticles":1471,"formTitle":"[91]解码方法","frequency":67.5213562039484,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.547079428759618,"acs":0,"articleLive":2,"columnArticles":1958,"formTitle":"[92]反转链表 II","frequency":88.32414825194154,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5376136115217738,"acs":0,"articleLive":2,"columnArticles":1273,"formTitle":"[93]复原 IP 地址","frequency":81.59045508903559,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559182945574052,"acs":0,"articleLive":2,"columnArticles":2200,"formTitle":"[94]二叉树的中序遍历","frequency":64.29309820524682,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.6994439905427781,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[95]不同的二叉搜索树 II","frequency":59.57430142055653,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6992932318579586,"acs":0,"articleLive":2,"columnArticles":1234,"formTitle":"[96]不同的二叉搜索树","frequency":67.98046384001083,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.45779386078279327,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[97]交错字符串","frequency":44.92418668657559,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3487093876297292,"acs":0,"articleLive":2,"columnArticles":1854,"formTitle":"[98]验证二叉搜索树","frequency":74.02584055235096,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6151907455758631,"acs":0,"articleLive":2,"columnArticles":559,"formTitle":"[99]恢复二叉搜索树","frequency":56.03400574149302,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6039170274896788,"acs":0,"articleLive":2,"columnArticles":1814,"formTitle":"[100]相同的树","frequency":55.57188144711232,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5613182110116021,"acs":0,"articleLive":2,"columnArticles":2168,"formTitle":"[101]对称二叉树","frequency":75.09059339340213,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6421114624331512,"acs":0,"articleLive":2,"columnArticles":2403,"formTitle":"[102]二叉树的层序遍历","frequency":87.73562173108132,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5719223201300367,"acs":0,"articleLive":2,"columnArticles":1533,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":82.60825829043551,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7659526234721256,"acs":0,"articleLive":2,"columnArticles":2451,"formTitle":"[104]二叉树的最大深度","frequency":78.05403401838666,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7037958119058404,"acs":0,"articleLive":2,"columnArticles":1379,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.13063927383122,"frontendQuestionId":"105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从前序与中序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-inorder-traversal"},{"acceptance":0.7212090100355956,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":70.9088838435997,"frontendQuestionId":"106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从中序与后序遍历序列构造二叉树","titleSlug":"construct-binary-tree-from-inorder-and-postorder-traversal"},{"acceptance":0.6955163913573641,"acs":0,"articleLive":2,"columnArticles":1276,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.522042929476164,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.75937885643768,"acs":0,"articleLive":2,"columnArticles":1150,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.4571058008799,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7634446397188049,"acs":0,"articleLive":2,"columnArticles":701,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.93563224659262,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5625284012413198,"acs":0,"articleLive":2,"columnArticles":1410,"formTitle":"[110]平衡二叉树","frequency":65.46523338500967,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4844616065774061,"acs":0,"articleLive":2,"columnArticles":1724,"formTitle":"[111]二叉树的最小深度","frequency":42.75867774919997,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257261736212299,"acs":0,"articleLive":2,"columnArticles":1597,"formTitle":"[112]路径总和","frequency":61.730158989615255,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6261577363923291,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[113]路径总和 II","frequency":64.57057764833148,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7257428718653384,"acs":0,"articleLive":2,"columnArticles":1260,"formTitle":"[114]二叉树展开为链表","frequency":45.017870841053565,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5240518038852914,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[115]不同的子序列","frequency":65.42333869949857,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7027980782403711,"acs":0,"articleLive":2,"columnArticles":1116,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":49.77362641433432,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6102745159699541,"acs":0,"articleLive":2,"columnArticles":717,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":29.147538352260582,"frontendQuestionId":"117","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针 II","titleSlug":"populating-next-right-pointers-in-each-node-ii"},{"acceptance":0.7258589704809523,"acs":0,"articleLive":2,"columnArticles":1665,"formTitle":"[118]杨辉三角","frequency":71.33578265120049,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6632757508283246,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[119]杨辉三角 II","frequency":56.64820635975819,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6791032323681785,"acs":0,"articleLive":2,"columnArticles":1510,"formTitle":"[120]三角形最小路径和","frequency":54.78782029406655,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5732137080803628,"acs":0,"articleLive":2,"columnArticles":3264,"formTitle":"[121]买卖股票的最佳时机","frequency":85.03992086896255,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6873423169161009,"acs":0,"articleLive":2,"columnArticles":2551,"formTitle":"[122]买卖股票的最佳时机 II","frequency":67.77106102522275,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5337686307138061,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[123]买卖股票的最佳时机 III","frequency":62.975193689285106,"frontendQuestionId":"123","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 III","titleSlug":"best-time-to-buy-and-sell-stock-iii"},{"acceptance":0.443176143673738,"acs":0,"articleLive":2,"columnArticles":1055,"formTitle":"[124]二叉树中的最大路径和","frequency":82.20991534568431,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.4738900045116374,"acs":0,"articleLive":2,"columnArticles":1790,"formTitle":"[125]验证回文串","frequency":67.08535870983978,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.3940886160445597,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[126]单词接龙 II","frequency":38.79947899268702,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46702617858003154,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[127]单词接龙","frequency":49.00677802594963,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.543286138349112,"acs":0,"articleLive":2,"columnArticles":1052,"formTitle":"[128]最长连续序列","frequency":76.9494781261466,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6800372304791942,"acs":0,"articleLive":2,"columnArticles":1077,"formTitle":"[129]求根节点到叶节点数字之和","frequency":64.40292776553058,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44244875302327424,"acs":0,"articleLive":2,"columnArticles":1128,"formTitle":"[130]被围绕的区域","frequency":57.146652181933845,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.723563555876773,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[131]分割回文串","frequency":83.0423129714586,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4925325998370008,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[132]分割回文串 II","frequency":64.40292776553058,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6750889372596777,"acs":0,"articleLive":2,"columnArticles":515,"formTitle":"[133]克隆图","frequency":4.508192885707507,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5762531972366314,"acs":0,"articleLive":2,"columnArticles":938,"formTitle":"[134]加油站","frequency":72.97067572984272,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.48607217263818514,"acs":0,"articleLive":2,"columnArticles":758,"formTitle":"[135]分发糖果","frequency":85.26789975836539,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7191614691614692,"acs":0,"articleLive":2,"columnArticles":2174,"formTitle":"[136]只出现一次的数字","frequency":78.57354472159852,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7194911758639992,"acs":0,"articleLive":2,"columnArticles":745,"formTitle":"[137]只出现一次的数字 II","frequency":74.1596394413878,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6590822121663072,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[138]复制带随机指针的链表","frequency":70.36925546516386,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5130096781542598,"acs":0,"articleLive":2,"columnArticles":1155,"formTitle":"[139]单词拆分","frequency":77.08353028828611,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48298280949927397,"acs":0,"articleLive":2,"columnArticles":521,"formTitle":"[140]单词拆分 II","frequency":41.19203908581424,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.512524033868955,"acs":0,"articleLive":2,"columnArticles":2625,"formTitle":"[141]环形链表","frequency":77.82177034317876,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.551616714375562,"acs":0,"articleLive":2,"columnArticles":1646,"formTitle":"[142]环形链表 II","frequency":71.96847469541615,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6170896854969397,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[143]重排链表","frequency":91.12482355739596,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7027283136573617,"acs":0,"articleLive":2,"columnArticles":1767,"formTitle":"[144]二叉树的前序遍历","frequency":58.517933899952354,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7494129081404818,"acs":0,"articleLive":2,"columnArticles":1491,"formTitle":"[145]二叉树的后序遍历","frequency":67.98046384001083,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5268616315989402,"acs":0,"articleLive":2,"columnArticles":1325,"formTitle":"[146]LRU 缓存机制","frequency":94.73287993593478,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6809555501068338,"acs":0,"articleLive":2,"columnArticles":763,"formTitle":"[147]对链表进行插入排序","frequency":47.73219270786092,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6673692094074449,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[148]排序链表","frequency":79.28554786124639,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33656109205836865,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[149]直线上最多的点数","frequency":66.06094616954891,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5367081286775183,"acs":0,"articleLive":2,"columnArticles":1016,"formTitle":"[150]逆波兰表达式求值","frequency":70.36925546516386,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.48026038105995306,"acs":0,"articleLive":2,"columnArticles":1377,"formTitle":"[151]翻转字符串里的单词","frequency":59.05351690996441,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4204865748713279,"acs":0,"articleLive":2,"columnArticles":1178,"formTitle":"[152]乘积最大子数组","frequency":75.26245042892825,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5657179771855887,"acs":0,"articleLive":2,"columnArticles":1431,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.55487645499977,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319664464980592,"acs":0,"articleLive":2,"columnArticles":867,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":66.28746094493474,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5724849957870198,"acs":0,"articleLive":2,"columnArticles":1542,"formTitle":"[155]最小栈","frequency":72.68084767459344,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7255955161139654,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[156]上下翻转二叉树","frequency":16.280516258406706,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5306562596282223,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[157]用 Read4 读取 N 个字符","frequency":0.0,"frontendQuestionId":"157","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符","titleSlug":"read-n-characters-given-read4"},{"acceptance":0.5894217839533842,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.755948795401358,"frontendQuestionId":"158","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Read4 读取 N 个字符 II","titleSlug":"read-n-characters-given-read4-ii-call-multiple-times"},{"acceptance":0.5417834488862664,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":43.88889094207611,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6124098984213955,"acs":0,"articleLive":2,"columnArticles":1895,"formTitle":"[160]相交链表","frequency":72.51364444549998,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33659010927949623,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.157517045032444,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49462440601738245,"acs":0,"articleLive":2,"columnArticles":701,"formTitle":"[162]寻找峰值","frequency":58.644175929939315,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32363134945775723,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[163]缺失的区间","frequency":17.544729672906715,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6111211047034548,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[164]最大间距","frequency":59.31053638360887,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.29860395064589007,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[166]分数到小数","frequency":52.1493116815743,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5863677846955503,"acs":0,"articleLive":2,"columnArticles":1796,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":63.498962557182324,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43254153493602665,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[168]Excel表列名称","frequency":63.259217810944655,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6645289516159438,"acs":0,"articleLive":2,"columnArticles":2106,"formTitle":"[169]多数元素","frequency":70.8258479086484,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41623875133458743,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.035346114169862,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7172857673318389,"acs":0,"articleLive":2,"columnArticles":893,"formTitle":"[171]Excel 表列序号","frequency":49.50667288640002,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4378813352157927,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[172]阶乘后的零","frequency":48.3592446050511,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8031923068478715,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[173]二叉搜索树迭代器","frequency":48.30622563649582,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.479499553634964,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[174]地下城游戏","frequency":66.11990746599226,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7399570490146539,"acs":0,"articleLive":2,"columnArticles":1432,"formTitle":"[175]组合两个表","frequency":94.12818550510687,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.3561452862390141,"acs":0,"articleLive":2,"columnArticles":981,"formTitle":"[176]第二高的薪水","frequency":95.16841551410651,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4623263777582507,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[177]第N高的薪水","frequency":77.46166345433505,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6024181663559004,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[178]分数排名","frequency":68.39044812248605,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4098499609603061,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[179]最大数","frequency":82.99110823381761,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48726440165174373,"acs":0,"articleLive":2,"columnArticles":480,"formTitle":"[180]连续出现的数字","frequency":72.17740184638399,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7029560169480102,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[181]超过经理收入的员工","frequency":71.46304470745952,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7973622970645362,"acs":0,"articleLive":2,"columnArticles":553,"formTitle":"[182]查找重复的电子邮箱","frequency":60.75069723219201,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6775294526923474,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[183]从不订购的客户","frequency":47.12439832705087,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47462891978464505,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[184]部门工资最高的员工","frequency":74.48224335857337,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4930363539531185,"acs":0,"articleLive":2,"columnArticles":603,"formTitle":"[185]部门工资前三高的所有员工","frequency":74.2788758788103,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7531861983214174,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.157517045032444,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48251442869451294,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[187]重复的DNA序列","frequency":33.14420183446886,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.38913934797989874,"acs":0,"articleLive":2,"columnArticles":669,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":52.42285065128078,"frontendQuestionId":"188","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机 IV","titleSlug":"best-time-to-buy-and-sell-stock-iv"},{"acceptance":0.4527658281019787,"acs":0,"articleLive":2,"columnArticles":1603,"formTitle":"[189]旋转数组","frequency":64.40292776553058,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6958178855386769,"acs":0,"articleLive":2,"columnArticles":801,"formTitle":"[190]颠倒二进制位","frequency":50.31852092801198,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7472992777775522,"acs":0,"articleLive":2,"columnArticles":1164,"formTitle":"[191]位1的个数","frequency":63.7659755437421,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3559962866064647,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[192]统计词频","frequency":56.73152991862518,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32393970721496856,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[193]有效电话号码","frequency":36.764101691472966,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3457466983897107,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[194]转置文件","frequency":30.06830524866882,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4361774486094317,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[195]第十行","frequency":53.94267461471072,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6651838104855217,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[196]删除重复的电子邮箱","frequency":63.259217810944655,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5339650490022435,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[197]上升的温度","frequency":58.611426009627124,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5117022389256504,"acs":0,"articleLive":2,"columnArticles":2548,"formTitle":"[198]打家劫舍","frequency":81.43742814693903,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6525971183126271,"acs":0,"articleLive":2,"columnArticles":1533,"formTitle":"[199]二叉树的右视图","frequency":83.70828206694834,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5516847891877266,"acs":0,"articleLive":2,"columnArticles":2040,"formTitle":"[200]岛屿数量","frequency":90.68852068441893,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5224156290066715,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[201]数字范围按位与","frequency":36.764101691472966,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6181828554042748,"acs":0,"articleLive":2,"columnArticles":1331,"formTitle":"[202]快乐数","frequency":59.79036506755462,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5134319678042198,"acs":0,"articleLive":2,"columnArticles":1573,"formTitle":"[203]移除链表元素","frequency":57.038005669356195,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.37927951300416024,"acs":0,"articleLive":2,"columnArticles":716,"formTitle":"[204]计数质数","frequency":53.462910772738766,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5010739602112501,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[205]同构字符串","frequency":51.455134386379505,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7224745510718844,"acs":0,"articleLive":2,"columnArticles":7186,"formTitle":"[206]反转链表","frequency":95.25917354927716,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5447824965334881,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[207]课程表","frequency":71.55687271470893,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164342044385297,"acs":0,"articleLive":2,"columnArticles":931,"formTitle":"[208]实现 Trie (前缀树)","frequency":70.36925546516386,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.469510117339812,"acs":0,"articleLive":2,"columnArticles":1292,"formTitle":"[209]长度最小的子数组","frequency":56.03400574149302,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5415266503854566,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[210]课程表 II","frequency":49.93970362984177,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.4814304654005751,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":34.46419146508039,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4506221662749117,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[212]单词搜索 II","frequency":42.633582901843596,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4325204384340051,"acs":0,"articleLive":2,"columnArticles":1440,"formTitle":"[213]打家劫舍 II","frequency":73.24077401717865,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.3708041638765447,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[214]最短回文串","frequency":59.53404428978739,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6470818571983539,"acs":0,"articleLive":2,"columnArticles":2204,"formTitle":"[215]数组中的第K个最大元素","frequency":89.7095328062105,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7394886631655083,"acs":0,"articleLive":2,"columnArticles":985,"formTitle":"[216]组合总和 III","frequency":64.61101908364054,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5614489216901891,"acs":0,"articleLive":2,"columnArticles":1576,"formTitle":"[217]存在重复元素","frequency":70.78894528979497,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5429748822605965,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[218]天际线问题","frequency":64.14575863840915,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42543653418554794,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[219]存在重复元素 II","frequency":49.00677802594963,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2870493748288765,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":64.17911942698615,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47300144020979773,"acs":0,"articleLive":2,"columnArticles":953,"formTitle":"[221]最大正方形","frequency":74.76283177170406,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7798406446964344,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[222]完全二叉树的节点个数","frequency":40.50955714540861,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4607621489336907,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[223]矩形面积","frequency":46.99183378455747,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.41776386327572157,"acs":0,"articleLive":2,"columnArticles":635,"formTitle":"[224]基本计算器","frequency":90.33840918346091,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6759560989598269,"acs":0,"articleLive":2,"columnArticles":4722,"formTitle":"[225]用队列实现栈","frequency":51.18407642085408,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7876853483503623,"acs":0,"articleLive":2,"columnArticles":1790,"formTitle":"[226]翻转二叉树","frequency":73.36763270182927,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.4367992465329404,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[227]基本计算器 II","frequency":78.12310855285942,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5817232979125541,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[228]汇总区间","frequency":16.280516258406706,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.46312440008941136,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[229]求众数 II","frequency":39.21296487762663,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.740700483771957,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":41.899442402635756,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5035267854351265,"acs":0,"articleLive":2,"columnArticles":1167,"formTitle":"[231]2 的幂","frequency":47.73219270786092,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6910152363042149,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[232]用栈实现队列","frequency":66.37738647777901,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.47628686690139843,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[233]数字 1 的个数","frequency":41.44630179129887,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49304684553880096,"acs":0,"articleLive":2,"columnArticles":1908,"formTitle":"[234]回文链表","frequency":79.65726565448189,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6660173961133228,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":48.72667246734741,"frontendQuestionId":"235","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-search-tree"},{"acceptance":0.6797028893758849,"acs":0,"articleLive":2,"columnArticles":1326,"formTitle":"[236]二叉树的最近公共祖先","frequency":75.54517512367761,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8480831198358333,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[237]删除链表中的节点","frequency":54.47230325315938,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7225671641791045,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[238]除自身以外数组的乘积","frequency":57.146652181933845,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4962515494497762,"acs":0,"articleLive":2,"columnArticles":1274,"formTitle":"[239]滑动窗口最大值","frequency":69.8917748034153,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47438365007076994,"acs":0,"articleLive":2,"columnArticles":717,"formTitle":"[240]搜索二维矩阵 II","frequency":64.07169899255328,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7366031995289037,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[241]为运算表达式设计优先级","frequency":51.455134386379505,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.644007255217587,"acs":0,"articleLive":2,"columnArticles":1601,"formTitle":"[242]有效的字母异位词","frequency":58.324128199986106,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.656978551445446,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[243]最短单词距离","frequency":0.0,"frontendQuestionId":"243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离","titleSlug":"shortest-word-distance"},{"acceptance":0.54932526756631,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[244]最短单词距离 II","frequency":0.0,"frontendQuestionId":"244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 II","titleSlug":"shortest-word-distance-ii"},{"acceptance":0.6102170382400709,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[245]最短单词距离 III","frequency":0.0,"frontendQuestionId":"245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短单词距离 III","titleSlug":"shortest-word-distance-iii"},{"acceptance":0.4741274526827574,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5214060860440713,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[247]中心对称数 II","frequency":0.0,"frontendQuestionId":"247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 II","titleSlug":"strobogrammatic-number-ii"},{"acceptance":0.46496469310157523,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[248]中心对称数 III","frequency":0.0,"frontendQuestionId":"248","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数 III","titleSlug":"strobogrammatic-number-iii"},{"acceptance":0.6383600046723513,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6342004138338753,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[250]统计同值子树","frequency":6.157517045032444,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5424877818067161,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":16.280516258406706,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5616676605048698,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[252]会议室","frequency":6.755948795401358,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4968715434269394,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[253]会议室 II","frequency":56.03400574149302,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5687325256290774,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[254]因子的组合","frequency":17.544729672906715,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4721119304216298,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[255]验证前序遍历序列二叉搜索树","frequency":0.0,"frontendQuestionId":"255","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证前序遍历序列二叉搜索树","titleSlug":"verify-preorder-sequence-in-binary-search-tree"},{"acceptance":0.6323861334567973,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[256]粉刷房子","frequency":5.035346114169862,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6805327695138553,"acs":0,"articleLive":2,"columnArticles":1017,"formTitle":"[257]二叉树的所有路径","frequency":61.96636498272967,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6915388654511216,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[258]各位相加","frequency":47.064634172313255,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5665494726268206,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.584581530503954,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7255698912288822,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[260]只出现一次的数字 III","frequency":52.42285065128078,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49741633858267714,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[261]以图判树","frequency":24.500338269107854,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43795802501395603,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[262]行程和用户","frequency":63.67658261505657,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5154850331910273,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[263]丑数","frequency":55.401280021624956,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5785862473315494,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[264]丑数 II","frequency":59.507712160401184,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5817726682736881,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[265]粉刷房子 II","frequency":4.508192885707507,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6707355571924656,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.44497282608695654,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.755948795401358,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.6231330722652838,"acs":0,"articleLive":2,"columnArticles":1056,"formTitle":"[268]丢失的数字","frequency":31.911420834647664,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.3397147990119021,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.549708298606977,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.90034257139293,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5509008031256784,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[271]字符串的编码与解码","frequency":0.0,"frontendQuestionId":"271","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的编码与解码","titleSlug":"encode-and-decode-strings"},{"acceptance":0.645079240853062,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":10.209785292068533,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3090297690422814,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[273]整数转换英文表示","frequency":30.06830524866882,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44029155937292924,"acs":0,"articleLive":2,"columnArticles":558,"formTitle":"[274]H 指数","frequency":57.36227170261191,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.463052908679693,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[275]H 指数 II","frequency":33.14420183446886,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.486227373542248,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[276]栅栏涂色","frequency":25.17267506260245,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5697295536005214,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[277]搜寻名人","frequency":6.755948795401358,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4552536216769428,"acs":0,"articleLive":2,"columnArticles":948,"formTitle":"[278]第一个错误的版本","frequency":69.93198255594176,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6307334821690088,"acs":0,"articleLive":2,"columnArticles":1156,"formTitle":"[279]完全平方数","frequency":73.00371186719694,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6869654027830971,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.90034257139293,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7569444444444444,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.38871543264942016,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[282]给表达式添加运算符","frequency":0.0,"frontendQuestionId":"282","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给表达式添加运算符","titleSlug":"expression-add-operators"},{"acceptance":0.6392421670872507,"acs":0,"articleLive":2,"columnArticles":3192,"formTitle":"[283]移动零","frequency":75.50279208968394,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7334074074074074,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[284]顶端迭代器","frequency":16.90034257139293,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6358477970627503,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[285]二叉搜索树中的中序后继","frequency":0.0,"frontendQuestionId":"285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"inorder-successor-in-bst"},{"acceptance":0.5062734682663248,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[286]墙与门","frequency":6.755948795401358,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6624017070072494,"acs":0,"articleLive":2,"columnArticles":1195,"formTitle":"[287]寻找重复数","frequency":62.205342332533576,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42637249871729094,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7532625894580981,"acs":0,"articleLive":2,"columnArticles":813,"formTitle":"[289]生命游戏","frequency":5.584581530503954,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570354858142804,"acs":0,"articleLive":2,"columnArticles":1060,"formTitle":"[290]单词规律","frequency":27.552203105601563,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5337585221024852,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[291]单词规律 II","frequency":0.0,"frontendQuestionId":"291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律 II","titleSlug":"word-pattern-ii"},{"acceptance":0.6966830870279146,"acs":0,"articleLive":2,"columnArticles":558,"formTitle":"[292]Nim 游戏","frequency":40.50955714540861,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7108144592770361,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[293]翻转游戏","frequency":5.584581530503954,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5852456229814721,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[294]翻转游戏 II","frequency":0.0,"frontendQuestionId":"294","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏 II","titleSlug":"flip-game-ii"},{"acceptance":0.5234296855132661,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[295]数据流的中位数","frequency":39.980409431386356,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6201117318435754,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":18.215489960376434,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5579452215036513,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[297]二叉树的序列化与反序列化","frequency":58.459289050752815,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5786593707250342,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[298]二叉树最长连续序列","frequency":0.0,"frontendQuestionId":"298","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最长连续序列","titleSlug":"binary-tree-longest-consecutive-sequence"},{"acceptance":0.503859745428346,"acs":0,"articleLive":2,"columnArticles":348,"formTitle":"[299]猜数字游戏","frequency":23.228329710626443,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5114809561015573,"acs":0,"articleLive":2,"columnArticles":1907,"formTitle":"[300]最长递增子序列","frequency":80.53428973177567,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5219410418629694,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[301]删除无效的括号","frequency":52.1493116815743,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6664325842696629,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[302]包含全部黑色像素的最小矩形","frequency":0.0,"frontendQuestionId":"302","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含全部黑色像素的最小矩形","titleSlug":"smallest-rectangle-enclosing-black-pixels"},{"acceptance":0.7241400968390279,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":48.423055088855605,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5406834897512154,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":39.85035945697539,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3770507171650886,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.584581530503954,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.33732709308372333,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[306]累加数","frequency":39.52902380316885,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5431500862292991,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[307]区域和检索 - 数组可修改","frequency":18.215489960376434,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6049100770767913,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[308]二维区域和检索 - 可变","frequency":0.0,"frontendQuestionId":"308","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 可变","titleSlug":"range-sum-query-2d-mutable"},{"acceptance":0.6051043678461925,"acs":0,"articleLive":2,"columnArticles":887,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":70.9088838435997,"frontendQuestionId":"309","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳买卖股票时机含冷冻期","titleSlug":"best-time-to-buy-and-sell-stock-with-cooldown"},{"acceptance":0.3789431457641953,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[310]最小高度树","frequency":45.017870841053565,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7629378531073446,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.544729672906715,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6824805065146785,"acs":0,"articleLive":2,"columnArticles":365,"formTitle":"[312]戳气球","frequency":55.312490525862955,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6495321761564965,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[313]超级丑数","frequency":32.78914860338005,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5465870750064884,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[314]二叉树的垂直遍历","frequency":0.0,"frontendQuestionId":"314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的垂直遍历","titleSlug":"binary-tree-vertical-order-traversal"},{"acceptance":0.41843554965218355,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":57.2816738520757,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47693133836489093,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[316]去除重复字母","frequency":58.459289050752815,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.4861751152073733,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[317]离建筑物最近的距离","frequency":0.0,"frontendQuestionId":"317","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"离建筑物最近的距离","titleSlug":"shortest-distance-from-all-buildings"},{"acceptance":0.6825539245594516,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[318]最大单词长度乘积","frequency":6.755948795401358,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5163915422424187,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[319]灯泡开关","frequency":16.90034257139293,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6719414265470005,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42563003908613667,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[321]拼接最大数","frequency":35.160696630590536,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4429319452358585,"acs":0,"articleLive":2,"columnArticles":1750,"formTitle":"[322]零钱兑换","frequency":82.34908767282558,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6351797738533859,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[323]无向图中连通分量的数目","frequency":34.46419146508039,"frontendQuestionId":"323","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无向图中连通分量的数目","titleSlug":"number-of-connected-components-in-an-undirected-graph"},{"acceptance":0.377678474452668,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[324]摆动排序 II","frequency":40.28731359792218,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5388326097443319,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":33.79257218300203,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4896592342412776,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[326]3的幂","frequency":29.405911010575036,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.42425895937478,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[327]区间和的个数","frequency":38.23517400191866,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6568791371080461,"acs":0,"articleLive":2,"columnArticles":1034,"formTitle":"[328]奇偶链表","frequency":62.548764482308194,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4828620200688229,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[329]矩阵中的最长递增路径","frequency":56.68722148024236,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5340412777254432,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[330]按要求补齐数组","frequency":33.79257218300203,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799808980105712,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[331]验证二叉树的前序序列化","frequency":57.454005975098596,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.4487834362444742,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[332]重新安排行程","frequency":51.086414971376726,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46632396139320187,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[333]最大 BST 子树","frequency":17.544729672906715,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4131340778393431,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[334]递增的三元子序列","frequency":16.280516258406706,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.368765545228433,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4010358316957153,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[336]回文对","frequency":35.88390330978434,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6087597224526442,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[337]打家劫舍 III","frequency":71.55687271470893,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7873658494023209,"acs":0,"articleLive":2,"columnArticles":1330,"formTitle":"[338]比特位计数","frequency":60.63303234332119,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8101862239174332,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[339]嵌套列表权重和","frequency":0.0,"frontendQuestionId":"339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"嵌套列表权重和","titleSlug":"nested-list-weight-sum"},{"acceptance":0.49474014056135013,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":29.405911010575036,"frontendQuestionId":"340","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至多包含 K 个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-k-distinct-characters"},{"acceptance":0.7267187591113184,"acs":0,"articleLive":2,"columnArticles":480,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":72.41500561703506,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5156007804949213,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[342]4的幂","frequency":49.00677802594963,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6044870603540399,"acs":0,"articleLive":2,"columnArticles":1008,"formTitle":"[343]整数拆分","frequency":65.58674655209799,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7651630503044179,"acs":0,"articleLive":2,"columnArticles":1845,"formTitle":"[344]反转字符串","frequency":66.94319897655714,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5388573818315348,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[345]反转字符串中的元音字母","frequency":29.037919209049683,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.706784943658595,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[346]数据流中的移动平均值","frequency":0.0,"frontendQuestionId":"346","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数据流中的移动平均值","titleSlug":"moving-average-from-data-stream"},{"acceptance":0.6221217503633134,"acs":0,"articleLive":2,"columnArticles":1423,"formTitle":"[347]前 K 个高频元素","frequency":79.83340087653811,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6001291989664083,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[348]设计井字棋","frequency":0.0,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7383218132709684,"acs":0,"articleLive":2,"columnArticles":1444,"formTitle":"[349]两个数组的交集","frequency":68.45139283967502,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5496332164081615,"acs":0,"articleLive":2,"columnArticles":1310,"formTitle":"[350]两个数组的交集 II","frequency":63.89178680915627,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5892677473448854,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":20.4057570822886,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5919899874843555,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[352]将数据流变为多个不相交区间","frequency":0.0,"frontendQuestionId":"352","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数据流变为多个不相交区间","titleSlug":"data-stream-as-disjoint-intervals"},{"acceptance":0.4243740947651562,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[353]贪吃蛇","frequency":8.725461006626777,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4510014282170085,"acs":0,"articleLive":2,"columnArticles":519,"formTitle":"[354]俄罗斯套娃信封问题","frequency":77.57310656939607,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4070010281454826,"acs":0,"articleLive":2,"columnArticles":416,"formTitle":"[355]设计推特","frequency":38.09665775404082,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3515843429636533,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5198384414350202,"acs":0,"articleLive":2,"columnArticles":370,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.54028620034479,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.3519796287169377,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[358]K 距离间隔重排字符串","frequency":0.0,"frontendQuestionId":"358","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 距离间隔重排字符串","titleSlug":"rearrange-string-k-distance-apart"},{"acceptance":0.7249047013977128,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[359]日志速率限制器","frequency":0.0,"frontendQuestionId":"359","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日志速率限制器","titleSlug":"logger-rate-limiter"},{"acceptance":0.6071508379888269,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[360]有序转化数组","frequency":0.0,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5675179129156716,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6952316689158794,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[362]敲击计数器","frequency":5.584581530503954,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49074439353017935,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.35979622290369,"frontendQuestionId":"363","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"矩形区域不超过 K 的最大数值和","titleSlug":"max-sum-of-rectangle-no-larger-than-k"},{"acceptance":0.7175071750717508,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[364]加权嵌套序列和 II","frequency":0.0,"frontendQuestionId":"364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加权嵌套序列和 II","titleSlug":"nested-list-weight-sum-ii"},{"acceptance":0.36392827586206894,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[365]水壶问题","frequency":49.00677802594963,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.7623468251021166,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[366]寻找二叉树的叶子节点","frequency":0.0,"frontendQuestionId":"366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找二叉树的叶子节点","titleSlug":"find-leaves-of-binary-tree"},{"acceptance":0.4394667048957064,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[367]有效的完全平方数","frequency":15.683616972716724,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4590867127513454,"acs":0,"articleLive":2,"columnArticles":445,"formTitle":"[368]最大整除子集","frequency":69.64047101413436,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6169912503528083,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[369]给单链表加一","frequency":0.0,"frontendQuestionId":"369","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给单链表加一","titleSlug":"plus-one-linked-list"},{"acceptance":0.7191342843089031,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":17.544729672906715,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5796640160547242,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[371]两整数之和","frequency":47.73219270786092,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5075282544212067,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":6.755948795401358,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4252680213519939,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[373]查找和最小的K对数字","frequency":44.599770222384336,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5143477150880776,"acs":0,"articleLive":2,"columnArticles":546,"formTitle":"[374]猜数字大小","frequency":34.46419146508039,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46764968426620823,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":35.160696630590536,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46217088213952523,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[376]摆动序列","frequency":28.149272277419424,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.50699527548576,"acs":0,"articleLive":2,"columnArticles":526,"formTitle":"[377]组合总和 Ⅳ","frequency":60.63303234332119,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6387895075264208,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":56.73152991862518,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6465289982425307,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[379]电话目录管理系统","frequency":0.0,"frontendQuestionId":"379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电话目录管理系统","titleSlug":"design-phone-directory"},{"acceptance":0.5021247324977072,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":25.17267506260245,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44286109279622266,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[381]O(1) 时间插入、删除和获取随机元素 - 允许重复","frequency":0.0,"frontendQuestionId":"381","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素 - 允许重复","titleSlug":"insert-delete-getrandom-o1-duplicates-allowed"},{"acceptance":0.6275379913760623,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.500338269107854,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5956337382534953,"acs":0,"articleLive":2,"columnArticles":685,"formTitle":"[383]赎金信","frequency":15.108166890105792,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5758492431554415,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[384]打乱数组","frequency":56.03400574149302,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.41458599465799556,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.584581530503954,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.746736108667347,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[386]字典序排数","frequency":57.36227170261191,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.5309553518419755,"acs":0,"articleLive":2,"columnArticles":1142,"formTitle":"[387]字符串中的第一个唯一字符","frequency":63.522042929476164,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5249746099159819,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[388]文件的最长绝对路径","frequency":0.0,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6922581786030062,"acs":0,"articleLive":2,"columnArticles":970,"formTitle":"[389]找不同","frequency":23.228329710626443,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4664971479623394,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":35.88390330978434,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.3562379730596536,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[391]完美矩形","frequency":0.0,"frontendQuestionId":"391","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完美矩形","titleSlug":"perfect-rectangle"},{"acceptance":0.5146915201416297,"acs":0,"articleLive":2,"columnArticles":1529,"formTitle":"[392]判断子序列","frequency":58.459289050752815,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.3913878719779622,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[393]UTF-8 编码验证","frequency":34.46419146508039,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5512584173074168,"acs":0,"articleLive":2,"columnArticles":1252,"formTitle":"[394]字符串解码","frequency":88.21152098001815,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5203804065699038,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.03400574149302,"frontendQuestionId":"395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 K 个重复字符的最长子串","titleSlug":"longest-substring-with-at-least-k-repeating-characters"},{"acceptance":0.4235150329992667,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[396]旋转函数","frequency":0.0,"frontendQuestionId":"396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转函数","titleSlug":"rotate-function"},{"acceptance":0.3777138305798926,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[397]整数替换","frequency":23.228329710626443,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6538698224852071,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[398]随机数索引","frequency":38.09665775404082,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.592621183873223,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[399]除法求值","frequency":29.405911010575036,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.41414550693318924,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":46.99183378455747,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138715033848512,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[401]二进制手表","frequency":48.3592446050511,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.32786262762636065,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[402]移掉 K 位数字","frequency":69.64047101413436,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45620646107467305,"acs":0,"articleLive":2,"columnArticles":453,"formTitle":"[403]青蛙过河","frequency":68.63799783464712,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5818591069473172,"acs":0,"articleLive":2,"columnArticles":1085,"formTitle":"[404]左叶子之和","frequency":55.401280021624956,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5227033573569996,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[405]数字转换为十六进制数","frequency":44.599770222384336,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.735757528967465,"acs":0,"articleLive":2,"columnArticles":766,"formTitle":"[406]根据身高重建队列","frequency":58.324128199986106,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4819097721971314,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":48.423055088855605,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32531168454624526,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[408]有效单词缩写","frequency":0.0,"frontendQuestionId":"408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效单词缩写","titleSlug":"valid-word-abbreviation"},{"acceptance":0.555687795613056,"acs":0,"articleLive":2,"columnArticles":1281,"formTitle":"[409]最长回文串","frequency":64.98627196423128,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5618048080373161,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[410]分割数组的最大值","frequency":74.02584055235096,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49657142857142855,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[411]最短独占单词缩写","frequency":0.0,"frontendQuestionId":"411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短独占单词缩写","titleSlug":"minimum-unique-word-abbreviation"},{"acceptance":0.673,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[412]Fizz Buzz","frequency":30.06830524866882,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6864850574011369,"acs":0,"articleLive":2,"columnArticles":883,"formTitle":"[413]等差数列划分","frequency":35.048995830611894,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.364634454221341,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[414]第三大的数","frequency":37.418744341742546,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5363435872086391,"acs":0,"articleLive":2,"columnArticles":1038,"formTitle":"[415]字符串相加","frequency":91.4669897650053,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5064526916145972,"acs":0,"articleLive":2,"columnArticles":941,"formTitle":"[416]分割等和子集","frequency":72.449173789099,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.4765930018416206,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[417]太平洋大西洋水流问题","frequency":60.03460059295228,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.35924187097896015,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[418]屏幕可显示句子的数量","frequency":0.0,"frontendQuestionId":"418","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"屏幕可显示句子的数量","titleSlug":"sentence-screen-fitting"},{"acceptance":0.7563836681788724,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[419]甲板上的战舰","frequency":4.508192885707507,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2055079842629021,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[420]强密码检验器","frequency":19.644440068773637,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6222578919208133,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[421]数组中两个数的最大异或值","frequency":61.96636498272967,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42660343270099366,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[422]有效的单词方块","frequency":0.0,"frontendQuestionId":"422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的单词方块","titleSlug":"valid-word-square"},{"acceptance":0.5691874780161801,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[423]从英文中重建数字","frequency":0.0,"frontendQuestionId":"423","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从英文中重建数字","titleSlug":"reconstruct-original-digits-from-english"},{"acceptance":0.530500742626777,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[424]替换后的最长重复字符","frequency":66.90226157149074,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6115257048092869,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[425]单词方块","frequency":0.0,"frontendQuestionId":"425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词方块","titleSlug":"word-squares"},{"acceptance":0.6676999380037197,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":28.76672692836418,"frontendQuestionId":"426","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树转化为排序的双向链表","titleSlug":"convert-binary-search-tree-to-sorted-doubly-linked-list"},{"acceptance":0.6128338962235186,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[427]建立四叉树","frequency":0.0,"frontendQuestionId":"427","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"建立四叉树","titleSlug":"construct-quad-tree"},{"acceptance":0.6493775933609959,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[428]序列化和反序列化 N 叉树","frequency":0.0,"frontendQuestionId":"428","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化 N 叉树","titleSlug":"serialize-and-deserialize-n-ary-tree"},{"acceptance":0.6979458974071164,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[429]N 叉树的层序遍历","frequency":27.552203105601563,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5412822937163008,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[430]扁平化多级双向链表","frequency":30.06830524866882,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7242647058823529,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[431]将 N 叉树编码为二叉树","frequency":0.0,"frontendQuestionId":"431","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将 N 叉树编码为二叉树","titleSlug":"encode-n-ary-tree-to-binary-tree"},{"acceptance":0.3774908619266596,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":18.914641452403927,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5327774079394555,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":6.157517045032444,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37380597755932876,"acs":0,"articleLive":2,"columnArticles":517,"formTitle":"[434]字符串中的单词数","frequency":29.405911010575036,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5095870793221418,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[435]无重叠区间","frequency":64.40292776553058,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.4866977829638273,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":5.584581530503954,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5668420741441494,"acs":0,"articleLive":2,"columnArticles":795,"formTitle":"[437]路径总和 III","frequency":53.462910772738766,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5166830024122124,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[438]找到字符串中所有字母异位词","frequency":49.364399218325076,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5884438881935753,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[439]三元表达式解析器","frequency":0.0,"frontendQuestionId":"439","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三元表达式解析器","titleSlug":"ternary-expression-parser"},{"acceptance":0.37995723172628304,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[440]字典序的第K小数字","frequency":71.15333755147063,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42616701633448223,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[441]排列硬币","frequency":23.852768504985672,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6969539051205326,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[442]数组中重复的数据","frequency":62.602544554546604,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47679144571588056,"acs":0,"articleLive":2,"columnArticles":683,"formTitle":"[443]压缩字符串","frequency":43.20294198773284,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.24978693732083365,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.215489960376434,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5877298530269365,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[445]两数相加 II","frequency":70.36925546516386,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5522549048188206,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":28.892780089094426,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6039643896395748,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[447]回旋镖的数量","frequency":0.0,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6474822267594893,"acs":0,"articleLive":2,"columnArticles":1036,"formTitle":"[448]找到所有数组中消失的数字","frequency":60.38868303220445,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5551944370961037,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":6.157517045032444,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4846404919176348,"acs":0,"articleLive":2,"columnArticles":584,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.599770222384336,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7112615739697251,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[451]根据字符出现频率排序","frequency":59.381791401301356,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093475561075135,"acs":0,"articleLive":2,"columnArticles":807,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.00677802594963,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5542465753424658,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.228329710626443,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6000111092595678,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[454]四数相加 II","frequency":56.03400574149302,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5775123292905732,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[455]分发饼干","frequency":58.324128199986106,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.3625503966705683,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[456]132 模式","frequency":72.97067572984272,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43544915372346193,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":29.913301996909496,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6085655507761362,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":17.544729672906715,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5116830387253167,"acs":0,"articleLive":2,"columnArticles":620,"formTitle":"[459]重复的子字符串","frequency":53.79046038905465,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4390971680422672,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[460]LFU 缓存","frequency":63.39312772298291,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8118075902414,"acs":0,"articleLive":2,"columnArticles":1320,"formTitle":"[461]汉明距离","frequency":57.146652181933845,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6020148887799225,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.09665775404082,"frontendQuestionId":"462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少移动次数使数组元素相等 II","titleSlug":"minimum-moves-to-equal-array-elements-ii"},{"acceptance":0.7147860107829572,"acs":0,"articleLive":2,"columnArticles":896,"formTitle":"[463]岛屿的周长","frequency":41.19203908581424,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3583084810508327,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[464]我能赢吗","frequency":38.79947899268702,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.5297598329272537,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[465]最优账单平衡","frequency":0.0,"frontendQuestionId":"465","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最优账单平衡","titleSlug":"optimal-account-balancing"},{"acceptance":0.3735033836543467,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[466]统计重复个数","frequency":0.0,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4406007954783337,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.544729672906715,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24921441429925756,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[468]验证IP地址","frequency":53.094999639925724,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4355088153417878,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":24.500338269107854,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5566800615170908,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":64.80500206285697,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6156547917711992,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":15.108166890105792,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4082824873425938,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[472]连接词","frequency":0.0,"frontendQuestionId":"472","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连接词","titleSlug":"concatenated-words"},{"acceptance":0.42033048723503674,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[473]火柴拼正方形","frequency":39.85035945697539,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6098679321759103,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[474]一和零","frequency":66.71904850692385,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.3298907249466951,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.405911010575036,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012489086284781,"acs":0,"articleLive":2,"columnArticles":465,"formTitle":"[476]数字的补数","frequency":5.035346114169862,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038813322665161,"acs":0,"articleLive":2,"columnArticles":328,"formTitle":"[477]汉明距离总和","frequency":48.423055088855605,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43619846261355694,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.06830524866882,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.4133929819656088,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.971102305583493,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.4483548456990745,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[480]滑动窗口中位数","frequency":42.633582901843596,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5353211927156294,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.584581530503954,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42540502250759776,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[482]密钥格式化","frequency":15.108166890105792,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.589551077569439,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":33.14420183446886,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6404031149793862,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[484]寻找排列","frequency":0.0,"frontendQuestionId":"484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找排列","titleSlug":"find-permutation"},{"acceptance":0.6065141250159786,"acs":0,"articleLive":2,"columnArticles":959,"formTitle":"[485]最大连续 1 的个数","frequency":48.3592446050511,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5874440631971716,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[486]预测赢家","frequency":41.19203908581424,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5794889190411578,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[487]最大连续1的个数 II","frequency":37.418744341742546,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.387434554973822,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[488]祖玛游戏","frequency":0.0,"frontendQuestionId":"488","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"祖玛游戏","titleSlug":"zuma-game"},{"acceptance":0.7162855809612693,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[489]扫地机器人","frequency":0.0,"frontendQuestionId":"489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"扫地机器人","titleSlug":"robot-room-cleaner"},{"acceptance":0.4817298274692986,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[490]迷宫","frequency":18.914641452403927,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5479599579019507,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[491]递增子序列","frequency":52.42285065128078,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5509520759331509,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[492]构造矩形","frequency":6.157517045032444,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3440109205608715,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":40.28731359792218,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4977688594521778,"acs":0,"articleLive":2,"columnArticles":999,"formTitle":"[494]目标和","frequency":75.34395528283555,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5418557943362121,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[495]提莫攻击","frequency":30.06830524866882,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6875848490663937,"acs":0,"articleLive":2,"columnArticles":997,"formTitle":"[496]下一个更大元素 I","frequency":54.5108701133377,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40377412849322963,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[497]非重叠矩形中的随机点","frequency":0.0,"frontendQuestionId":"497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非重叠矩形中的随机点","titleSlug":"random-point-in-non-overlapping-rectangles"},{"acceptance":0.4613206808186833,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[498]对角线遍历","frequency":57.2816738520757,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.36971014492753623,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[499]迷宫 III","frequency":0.0,"frontendQuestionId":"499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 III","titleSlug":"the-maze-iii"},{"acceptance":0.7085792428386354,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[500]键盘行","frequency":16.280516258406706,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5110684601746881,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[501]二叉搜索树中的众数","frequency":49.50667288640002,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4168983822042467,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[502]IPO","frequency":31.46944968249581,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6339281703787835,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[503]下一个更大元素 II","frequency":67.50166795965991,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5043461796650429,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[504]七进制数","frequency":23.852768504985672,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4830774755364036,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[505]迷宫 II","frequency":17.544729672906715,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5634761267291388,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[506]相对名次","frequency":15.683616972716724,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.40951155325486566,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[507]完美数","frequency":16.280516258406706,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6748111312996079,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.544729672906715,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6774289685037694,"acs":0,"articleLive":2,"columnArticles":1394,"formTitle":"[509]斐波那契数","frequency":65.09556939659514,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6083172147001934,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.381878117988307,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337952523471772,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[511]游戏玩法分析 I","frequency":38.09665775404082,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.537749016622256,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[512]游戏玩法分析 II","frequency":5.584581530503954,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7310625945712257,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[513]找树左下角的值","frequency":5.035346114169862,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.501656795470556,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[514]自由之路","frequency":50.36880399666648,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6428265906255569,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[515]在每个树行中找最大值","frequency":34.46419146508039,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6516880932356122,"acs":0,"articleLive":2,"columnArticles":592,"formTitle":"[516]最长回文子序列","frequency":37.60999083191944,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.4390127006949437,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":5.035346114169862,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6515711105197225,"acs":0,"articleLive":2,"columnArticles":658,"formTitle":"[518]零钱兑换 II","frequency":71.49262843774332,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.39444188545984954,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[519]随机翻转矩阵","frequency":20.4057570822886,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.563180134290345,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[520]检测大写字母","frequency":5.584581530503954,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7121546802834275,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.280516258406706,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.3594308005054667,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.280516258406706,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2744154085902318,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[523]连续的子数组和","frequency":59.31053638360887,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.47325272566307286,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":35.160696630590536,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5365452985166115,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[525]连续数组","frequency":69.07100064764781,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7344850227545453,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[526]优美的排列","frequency":35.51884111987334,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.574910820451843,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[527]单词缩写","frequency":0.0,"frontendQuestionId":"527","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词缩写","titleSlug":"word-abbreviation"},{"acceptance":0.47650344531262434,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[528]按权重随机选择","frequency":24.380806312039997,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6464855236846969,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":31.46944968249581,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206378154574133,"acs":0,"articleLive":2,"columnArticles":623,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":16.90034257139293,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6625022965276502,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[531]孤独像素 I","frequency":0.0,"frontendQuestionId":"531","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 I","titleSlug":"lonely-pixel-i"},{"acceptance":0.37262710341936645,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.90034257139293,"frontendQuestionId":"532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k-diff 数对","titleSlug":"k-diff-pairs-in-an-array"},{"acceptance":0.5225979243388015,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[533]孤独像素 II","frequency":0.0,"frontendQuestionId":"533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"孤独像素 II","titleSlug":"lonely-pixel-ii"},{"acceptance":0.6757972406125233,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[534]游戏玩法分析 III","frequency":16.280516258406706,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8418150049142732,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[535]TinyURL 的加密与解密","frequency":30.06830524866882,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5337265020272761,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":0.0,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7120510574396196,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[537]复数乘法","frequency":4.508192885707507,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6962528588904845,"acs":0,"articleLive":2,"columnArticles":799,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":30.755546345579138,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5944188926233858,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[539]最小时间差","frequency":29.405911010575036,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.580507047674027,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[540]有序数组中的单一元素","frequency":46.99183378455747,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6084685495469264,"acs":0,"articleLive":2,"columnArticles":775,"formTitle":"[541]反转字符串 II","frequency":28.610380832145545,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.45914952223958666,"acs":0,"articleLive":2,"columnArticles":611,"formTitle":"[542]01 矩阵","frequency":46.278227267661286,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.549275885212385,"acs":0,"articleLive":2,"columnArticles":1191,"formTitle":"[543]二叉树的直径","frequency":71.29280223239073,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7078294080203692,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[544]输出比赛匹配对","frequency":0.0,"frontendQuestionId":"544","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出比赛匹配对","titleSlug":"output-contest-matches"},{"acceptance":0.4158066951925497,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[545]二叉树的边界","frequency":0.0,"frontendQuestionId":"545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的边界","titleSlug":"boundary-of-binary-tree"},{"acceptance":0.6308867204072974,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.17267506260245,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6180855643965366,"acs":0,"articleLive":2,"columnArticles":1088,"formTitle":"[547]省份数量","frequency":52.69689291840653,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3568645427458171,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":0.0,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48145454545454547,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[549]二叉树中最长的连续序列","frequency":0.0,"frontendQuestionId":"549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中最长的连续序列","titleSlug":"binary-tree-longest-consecutive-sequence-ii"},{"acceptance":0.43849132474495495,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[550]游戏玩法分析 IV","frequency":29.405911010575036,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5671698928108682,"acs":0,"articleLive":2,"columnArticles":743,"formTitle":"[551]学生出勤记录 I","frequency":20.602012907197565,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5787603245018504,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.97730377093422,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.60199110357975,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[553]最优除法","frequency":5.584581530503954,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5010571780694911,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[554]砖墙","frequency":61.606931920283714,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.341796255157093,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[555]分割连接字符串","frequency":0.0,"frontendQuestionId":"555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割连接字符串","titleSlug":"split-concatenated-strings"},{"acceptance":0.3253616425571629,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":51.455134386379505,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454703746082284,"acs":0,"articleLive":2,"columnArticles":1219,"formTitle":"[557]反转字符串中的单词 III","frequency":59.475350219801996,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5029188041747744,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[558]四叉树交集","frequency":0.0,"frontendQuestionId":"558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四叉树交集","titleSlug":"logical-or-of-two-binary-grids-represented-as-quad-trees"},{"acceptance":0.7272570023598601,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[559]N 叉树的最大深度","frequency":32.51759944999773,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4468261109795564,"acs":0,"articleLive":2,"columnArticles":874,"formTitle":"[560]和为K的子数组","frequency":81.41591502498454,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为K的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7736078334683526,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[561]数组拆分 I","frequency":15.683616972716724,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46022511698495006,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[562]矩阵中最长的连续1线段","frequency":0.0,"frontendQuestionId":"562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最长的连续1线段","titleSlug":"longest-line-of-consecutive-one-in-matrix"},{"acceptance":0.6047922645761504,"acs":0,"articleLive":2,"columnArticles":317,"formTitle":"[563]二叉树的坡度","frequency":23.852768504985672,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17871611744559995,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[564]寻找最近的回文数","frequency":24.500338269107854,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6103368176538908,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[565]数组嵌套","frequency":16.280516258406706,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.696055381400209,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[566]重塑矩阵","frequency":30.06830524866882,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4305778064688817,"acs":0,"articleLive":2,"columnArticles":985,"formTitle":"[567]字符串的排列","frequency":51.97349539886504,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5037828215398309,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[568]最大休假天数","frequency":0.0,"frontendQuestionId":"568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大休假天数","titleSlug":"maximum-vacation-days"},{"acceptance":0.5624923039034602,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[569]员工薪水中位数","frequency":24.500338269107854,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6636080524969414,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.90034257139293,"frontendQuestionId":"570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有5名直接下属的经理","titleSlug":"managers-with-at-least-5-direct-reports"},{"acceptance":0.48939277478862414,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":17.544729672906715,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4741415816250455,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[572]另一棵树的子树","frequency":51.455134386379505,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6588628762541806,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[573]松鼠模拟","frequency":0.0,"frontendQuestionId":"573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"松鼠模拟","titleSlug":"squirrel-simulation"},{"acceptance":0.6476508231690642,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845828152827717,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[575]分糖果","frequency":30.06830524866882,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.47,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[576]出界的路径数","frequency":25.87159361630726,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7057871307163092,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[577]员工奖金","frequency":16.90034257139293,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49859671848013815,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[578]查询回答率最高的问题","frequency":5.584581530503954,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4133432938742673,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[579]查询员工的累计薪水","frequency":17.544729672906715,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5250478441967804,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[580]统计各专业学生人数","frequency":24.500338269107854,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4040453204555747,"acs":0,"articleLive":2,"columnArticles":832,"formTitle":"[581]最短无序连续子数组","frequency":33.98762374316347,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40308001339136257,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5834410014191007,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[583]两个字符串的删除操作","frequency":41.899442402635756,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7735279922779923,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[584]寻找用户推荐人","frequency":0.0,"frontendQuestionId":"584","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找用户推荐人","titleSlug":"find-customer-referee"},{"acceptance":0.5947156631994533,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[585]2016年的投资","frequency":0.0,"frontendQuestionId":"585","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"2016年的投资","titleSlug":"investments-in-2016"},{"acceptance":0.7497774810858923,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[586]订单最多的客户","frequency":24.500338269107854,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.37936296013732596,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[587]安装栅栏","frequency":13.255053346128376,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4299272382157545,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":8.037543813788469,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7451019540100174,"acs":0,"articleLive":2,"columnArticles":554,"formTitle":"[589]N 叉树的前序遍历","frequency":42.633582901843596,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7598288245451588,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[590]N 叉树的后序遍历","frequency":16.280516258406706,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.33948919449901765,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5203449532369732,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[592]分数加减运算","frequency":0.0,"frontendQuestionId":"592","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数加减运算","titleSlug":"fraction-addition-and-subtraction"},{"acceptance":0.4410492457852706,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[593]有效的正方形","frequency":24.500338269107854,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5162226618106525,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[594]最长和谐子序列","frequency":5.035346114169862,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7963557643149284,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[595]大的国家","frequency":42.54028620034479,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.42042275160512993,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[596]超过5名学生的课","frequency":22.625541797804857,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4414021224789819,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.90034257139293,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5177395084434041,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[598]范围求和 II","frequency":16.90034257139293,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5223877785521879,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[599]两个列表的最小索引总和","frequency":16.90034257139293,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.3428095112748969,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[600]不含连续1的非负整数","frequency":16.280516258406706,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49724710329525845,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[601]体育馆的人流量","frequency":54.615925889655934,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6287450066577897,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":16.90034257139293,"frontendQuestionId":"602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 II ：谁有最多的好友","titleSlug":"friend-requests-ii-who-has-the-most-friends"},{"acceptance":0.6735952489721334,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[603]连续空余座位","frequency":25.87159361630726,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.3732111271908667,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.157517045032444,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.33498458898668615,"acs":0,"articleLive":2,"columnArticles":1226,"formTitle":"[605]种花问题","frequency":56.03400574149302,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5683001625949328,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[606]根据二叉树创建字符串","frequency":23.228329710626443,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6652982229781245,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.584581530503954,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.659476401179941,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[608]树节点","frequency":0.0,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.48330903230757427,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[609]在系统中查找重复文件","frequency":6.755948795401358,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6673723026495493,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[610]判断三角形","frequency":5.584581530503954,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5318004719310762,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[611]有效三角形的个数","frequency":51.2611469229804,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6691860465116279,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[612]平面上的最近距离","frequency":5.584581530503954,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8166716328963052,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.584581530503954,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34631343759974464,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[614]二级关注者","frequency":16.90034257139293,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4239343982232852,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[615]平均工资：部门与公司比较","frequency":0.0,"frontendQuestionId":"615","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"平均工资：部门与公司比较","titleSlug":"average-salary-departments-vs-company"},{"acceptance":0.46093157335760887,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[616]给字符串添加加粗标签","frequency":34.46419146508039,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7880710603551242,"acs":0,"articleLive":2,"columnArticles":1160,"formTitle":"[617]合并二叉树","frequency":64.24181812190427,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6205760137555524,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":25.87159361630726,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4659837142106646,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.584581530503954,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7727429003644365,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[620]有趣的电影","frequency":36.764101691472966,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5690746151167896,"acs":0,"articleLive":2,"columnArticles":484,"formTitle":"[621]任务调度器","frequency":63.67658261505657,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.4363632549455621,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[622]设计循环队列","frequency":53.61432305445789,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5454031843862353,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[623]在二叉树中增加一行","frequency":5.584581530503954,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.41576354679802957,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[624]数组列表中的最大距离","frequency":0.0,"frontendQuestionId":"624","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组列表中的最大距离","titleSlug":"maximum-distance-in-arrays"},{"acceptance":0.3399972039703621,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6829459922374644,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[626]换座位","frequency":42.54028620034479,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8069270088717416,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[627]变更性别","frequency":30.06830524866882,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5253390531390572,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[628]三个数的最大乘积","frequency":33.79257218300203,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.401935812531839,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[629]K个逆序对数组","frequency":25.17267506260245,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36567073170731706,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[630]课程表 III","frequency":7.381878117988307,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2833562585969739,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[631]设计 Excel 求和公式","frequency":0.0,"frontendQuestionId":"631","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Excel 求和公式","titleSlug":"design-excel-sum-formula"},{"acceptance":0.5966957585907056,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[632]最小区间","frequency":16.90034257139293,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.39968973736616653,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[633]平方数之和","frequency":61.28878002092595,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.43764472378432023,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[634]寻找数组的错位排列","frequency":0.0,"frontendQuestionId":"634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的错位排列","titleSlug":"find-the-derangement-of-an-array"},{"acceptance":0.5551448846836191,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[635]设计日志存储系统","frequency":0.0,"frontendQuestionId":"635","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计日志存储系统","titleSlug":"design-log-storage-system"},{"acceptance":0.5487762237762238,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":16.90034257139293,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.689275340088773,"acs":0,"articleLive":2,"columnArticles":633,"formTitle":"[637]二叉树的层平均值","frequency":22.04306144393415,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.593778444075601,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":16.90034257139293,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30961552987385754,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[639]解码方法 II","frequency":25.17267506260245,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4239385361908613,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[640]求解方程","frequency":25.17267506260245,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329622184423484,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[641]设计循环双端队列","frequency":28.149272277419424,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4917115177610334,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[642]设计搜索自动补全系统","frequency":9.448468278553571,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.4517051898354442,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[643]子数组最大平均数 I","frequency":38.09665775404082,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3999270871308786,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[644]子数组最大平均数 II","frequency":0.0,"frontendQuestionId":"644","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 II","titleSlug":"maximum-average-subarray-ii"},{"acceptance":0.4354551908759908,"acs":0,"articleLive":2,"columnArticles":683,"formTitle":"[645]错误的集合","frequency":43.20294198773284,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.574646667027671,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[646]最长数对链","frequency":4.508192885707507,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6560439683445829,"acs":0,"articleLive":2,"columnArticles":883,"formTitle":"[647]回文子串","frequency":61.15592838401515,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5818119285775701,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[648]单词替换","frequency":5.035346114169862,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48135178607331947,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[649]Dota2 参议院","frequency":5.035346114169862,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5352612676202537,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[650]只有两个键的键盘","frequency":16.280516258406706,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5794467674493406,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[651]4键键盘","frequency":0.0,"frontendQuestionId":"651","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"4键键盘","titleSlug":"4-keys-keyboard"},{"acceptance":0.5706838565022422,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[652]寻找重复的子树","frequency":54.615925889655934,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5948700526583999,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[653]两数之和 IV - 输入 BST","frequency":0.0,"frontendQuestionId":"653","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两数之和 IV - 输入 BST","titleSlug":"two-sum-iv-input-is-a-bst"},{"acceptance":0.8097864537460835,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[654]最大二叉树","frequency":44.28063424366451,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.59609395276408,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.90034257139293,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30740037950664134,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[656]金币路径","frequency":0.0,"frontendQuestionId":"656","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"金币路径","titleSlug":"coin-path"},{"acceptance":0.7832595199876226,"acs":0,"articleLive":2,"columnArticles":613,"formTitle":"[657]机器人能否返回原点","frequency":6.157517045032444,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45276497695852536,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[658]找到 K 个最接近的元素","frequency":34.46419146508039,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5417677777562074,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[659]分割数组为连续子序列","frequency":0.0,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6475247524752475,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[660]移除 9","frequency":14.016370359643338,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5596131690116258,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[661]图片平滑器","frequency":5.584581530503954,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40581806003775195,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[662]二叉树最大宽度","frequency":56.68722148024236,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.46427586206896554,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[663]均匀树划分","frequency":0.0,"frontendQuestionId":"663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"均匀树划分","titleSlug":"equal-tree-partition"},{"acceptance":0.6555950373403999,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":56.03400574149302,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.2700493232350435,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[665]非递减数列","frequency":48.423055088855605,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6206575682382134,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[666]路径总和 IV","frequency":0.0,"frontendQuestionId":"666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 IV","titleSlug":"path-sum-iv"},{"acceptance":0.6235425650854496,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":15.683616972716724,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5075272137728711,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[668]乘法表中第k小的数","frequency":34.46419146508039,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6665176488881978,"acs":0,"articleLive":2,"columnArticles":289,"formTitle":"[669]修剪二叉搜索树","frequency":16.90034257139293,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44991064590247637,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[670]最大交换","frequency":62.33225487560259,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48666202090592336,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[671]二叉树中第二小的节点","frequency":50.65275764031425,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5525900189513582,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.584581530503954,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3903243310932087,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[673]最长递增子序列的个数","frequency":52.86843594031143,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49179363986090346,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[674]最长连续递增序列","frequency":34.92565502036332,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3996564557686802,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":7.381878117988307,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5866571275263817,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[676]实现一个魔法字典","frequency":0.0,"frontendQuestionId":"676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现一个魔法字典","titleSlug":"implement-magic-dictionary"},{"acceptance":0.6152616341874433,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[677]键值映射","frequency":0.0,"frontendQuestionId":"677","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"键值映射","titleSlug":"map-sum-pairs"},{"acceptance":0.35144156068366234,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[678]有效的括号字符串","frequency":71.80284545600507,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5409315683776372,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[679]24 点游戏","frequency":68.9366447949791,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4016580999773589,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":57.82516074342195,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.4988855116514691,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[681]最近时刻","frequency":0.0,"frontendQuestionId":"681","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近时刻","titleSlug":"next-closest-time"},{"acceptance":0.6955488231181542,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[682]棒球比赛","frequency":29.405911010575036,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4284837323511357,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[683]K 个关闭的灯泡","frequency":0.0,"frontendQuestionId":"683","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个关闭的灯泡","titleSlug":"k-empty-slots"},{"acceptance":0.6656489962068647,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[684]冗余连接","frequency":30.06830524866882,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.43340263646819427,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":30.755546345579138,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3549631190727081,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[686]重复叠加字符串匹配","frequency":6.157517045032444,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.43976341803698976,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[687]最长同值路径","frequency":50.36880399666648,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.511435331230284,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.90034257139293,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48641049671977504,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[689]三个无重叠子数组的最大和","frequency":35.88390330978434,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6464497564772339,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[690]员工的重要性","frequency":65.56026919650668,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.48996099956666184,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.157517045032444,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5801491477272728,"acs":0,"articleLive":2,"columnArticles":715,"formTitle":"[692]前K个高频单词","frequency":62.88546046997233,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6094073467815705,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[693]交替位二进制数","frequency":5.584581530503954,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5281132861307788,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[694]不同岛屿的数量","frequency":6.157517045032444,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6627000341436383,"acs":0,"articleLive":2,"columnArticles":1181,"formTitle":"[695]岛屿的最大面积","frequency":66.26434089378432,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6304767359338621,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[696]计数二进制子串","frequency":16.90034257139293,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6058377896613191,"acs":0,"articleLive":2,"columnArticles":828,"formTitle":"[697]数组的度","frequency":30.06830524866882,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.4411836002521049,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[698]划分为k个相等的子集","frequency":60.31292246059433,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4770053475935829,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.7590033793917095,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[700]二叉搜索树中的搜索","frequency":28.76672692836418,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7241967932695239,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[701]二叉搜索树中的插入操作","frequency":26.974295895342188,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7393675027262814,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[702]搜索长度未知的有序数组","frequency":0.0,"frontendQuestionId":"702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索长度未知的有序数组","titleSlug":"search-in-a-sorted-array-of-unknown-size"},{"acceptance":0.5121919198991738,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.79257218300203,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.5544342634223066,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[704]二分查找","frequency":84.1336871402147,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6468845719812993,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[705]设计哈希集合","frequency":53.79046038905465,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6443365048749221,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[706]设计哈希映射","frequency":44.92418668657559,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.3182823050344161,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[707]设计链表","frequency":58.611426009627124,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.3352318958502848,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[708]循环有序列表的插入","frequency":7.381878117988307,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.759668116747893,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[709]转换成小写字母","frequency":0.0,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.34919944939505904,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[710]黑名单中的随机数","frequency":25.87159361630726,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5728643216080402,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[711]不同岛屿的数量 II","frequency":0.0,"frontendQuestionId":"711","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量 II","titleSlug":"number-of-distinct-islands-ii"},{"acceptance":0.6712568616316487,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":34.46419146508039,"frontendQuestionId":"712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个字符串的最小ASCII删除和","titleSlug":"minimum-ascii-delete-sum-for-two-strings"},{"acceptance":0.4052095534952054,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[713]乘积小于K的子数组","frequency":36.85625502725352,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7178163461391817,"acs":0,"articleLive":2,"columnArticles":637,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":43.474438428711366,"frontendQuestionId":"714","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买卖股票的最佳时机含手续费","titleSlug":"best-time-to-buy-and-sell-stock-with-transaction-fee"},{"acceptance":0.4035844673083306,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[715]Range 模块","frequency":8.037543813788469,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4597644141351519,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[716]最大栈","frequency":5.584581530503954,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5107173995295201,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[717]1比特与2比特字符","frequency":16.90034257139293,"frontendQuestionId":"717","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"1比特与2比特字符","titleSlug":"1-bit-and-2-bit-characters"},{"acceptance":0.5645669968605301,"acs":0,"articleLive":2,"columnArticles":563,"formTitle":"[718]最长重复子数组","frequency":69.7098801778605,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.36722623293032963,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[719]找出第 k 小的距离对","frequency":16.90034257139293,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4861107613267182,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[720]词典中最长的单词","frequency":4.508192885707507,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.4694436604519117,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[721]账户合并","frequency":37.418744341742546,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.321383269911209,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[722]删除注释","frequency":34.46419146508039,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7238372093023255,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.4575206519738738,"acs":0,"articleLive":2,"columnArticles":829,"formTitle":"[724]寻找数组的中心下标","frequency":30.755546345579138,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5627048101992489,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[725]分隔链表","frequency":5.035346114169862,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.554451099865744,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[726]原子的数量","frequency":51.830786225425705,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.4094052558782849,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[727]最小窗口子序列","frequency":31.46944968249581,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7593246599375698,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[728]自除数","frequency":0.0,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5077723709110571,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[729]我的日程安排表 I","frequency":24.500338269107854,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4883096972019931,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[730]统计不同回文子序列","frequency":41.899442402635756,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5094288793103449,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[731]我的日程安排表 II","frequency":5.584581530503954,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.610629693818602,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[732]我的日程安排表 III","frequency":18.215489960376434,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5806002490415821,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[733]图像渲染","frequency":40.09492715400195,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.477312174559881,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4110807282043702,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[735]行星碰撞","frequency":33.79257218300203,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.45834604821483066,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[736]Lisp 语法解析","frequency":0.0,"frontendQuestionId":"736","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Lisp 语法解析","titleSlug":"parse-lisp-expression"},{"acceptance":0.4629165622650965,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[737]句子相似性 II","frequency":0.0,"frontendQuestionId":"737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性 II","titleSlug":"sentence-similarity-ii"},{"acceptance":0.5021375874897535,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[738]单调递增的数字","frequency":30.755546345579138,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6779679387089453,"acs":0,"articleLive":2,"columnArticles":1446,"formTitle":"[739]每日温度","frequency":86.70123572266661,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296790891694316,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[740]删除并获得点数","frequency":63.14829363739018,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.36551328617855094,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[741]摘樱桃","frequency":26.59911431794164,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.492436974789916,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[742]二叉树最近的叶节点","frequency":0.0,"frontendQuestionId":"742","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最近的叶节点","titleSlug":"closest-leaf-in-a-binary-tree"},{"acceptance":0.5172281298329539,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[743]网络延迟时间","frequency":50.13522782876273,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.45914510031986044,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":24.500338269107854,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39151689432063264,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[745]前缀和后缀搜索","frequency":0.0,"frontendQuestionId":"745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"前缀和后缀搜索","titleSlug":"prefix-and-suffix-search"},{"acceptance":0.5811529451770129,"acs":0,"articleLive":2,"columnArticles":1209,"formTitle":"[746]使用最小花费爬楼梯","frequency":50.65275764031425,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4149428175278933,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.584581530503954,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5985259698222201,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[748]最短补全词","frequency":0.0,"frontendQuestionId":"748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最短补全词","titleSlug":"shortest-completing-word"},{"acceptance":0.5061143984220907,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":15.108166890105792,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7215865751334859,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[750]角矩形的数量","frequency":25.87159361630726,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5073909830007391,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[751]IP 到 CIDR","frequency":0.0,"frontendQuestionId":"751","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 到 CIDR","titleSlug":"ip-to-cidr"},{"acceptance":0.5315749247647406,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[752]打开转盘锁","frequency":41.899442402635756,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5899390243902439,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":17.544729672906715,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42786069651741293,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[754]到达终点数字","frequency":16.90034257139293,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5019968051118211,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5739468567725211,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[756]金字塔转换矩阵","frequency":6.755948795401358,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.4160352422907489,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[757]设置交集大小至少为2","frequency":10.209785292068533,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.4589901148811114,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[758]字符串中的加粗单词","frequency":14.016370359643338,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6571105243304414,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[759]员工空闲时间","frequency":6.755948795401358,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8386745149335078,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[760]找出变位映射","frequency":0.0,"frontendQuestionId":"760","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出变位映射","titleSlug":"find-anagram-mappings"},{"acceptance":0.5903823870220162,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[761]特殊的二进制序列","frequency":10.209785292068533,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6981101793524054,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[762]二进制表示中质数个计算置位","frequency":0.0,"frontendQuestionId":"762","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制表示中质数个计算置位","titleSlug":"prime-number-of-set-bits-in-binary-representation"},{"acceptance":0.763044958119987,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[763]划分字母区间","frequency":64.98627196423128,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.4911998016856718,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[764]最大加号标志","frequency":0.0,"frontendQuestionId":"764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大加号标志","titleSlug":"largest-plus-sign"},{"acceptance":0.6656449612765858,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[765]情侣牵手","frequency":58.06063764944837,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081495210002872,"acs":0,"articleLive":2,"columnArticles":629,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47778549749515486,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[767]重构字符串","frequency":43.39648205671752,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5005808427500265,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[768]最多能完成排序的块 II","frequency":25.87159361630726,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5898836621143146,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[769]最多能完成排序的块","frequency":5.584581530503954,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5544840887174542,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[770]基本计算器 IV","frequency":0.0,"frontendQuestionId":"770","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 IV","titleSlug":"basic-calculator-iv"},{"acceptance":0.8514278951017027,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[771]宝石与石头","frequency":44.92418668657559,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.48943843379701185,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[772]基本计算器 III","frequency":28.149272277419424,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7142902019916438,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[773]滑动谜题","frequency":51.830786225425705,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5858701895462378,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[774]最小化去加油站的最大距离","frequency":0.0,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.46090457908043825,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[775]全局倒置与局部倒置","frequency":0.0,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5712401055408971,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3241572031630894,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.90034257139293,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5976158871450509,"acs":0,"articleLive":2,"columnArticles":343,"formTitle":"[778]水位上升的泳池中游泳","frequency":5.584581530503954,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4357524863951961,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[779]第K个语法符号","frequency":34.46419146508039,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2842686292548298,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[780]到达终点","frequency":20.4057570822886,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.621203344769713,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[781]森林中的兔子","frequency":91.49417403673272,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42116370214048837,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":32.724133847789616,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958081488889855,"acs":0,"articleLive":2,"columnArticles":661,"formTitle":"[783]二叉搜索树节点最小距离","frequency":34.46419146508039,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6841169465085463,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[784]字母大小写全排列","frequency":29.405911010575036,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5115234015714923,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[785]判断二分图","frequency":39.85035945697539,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.4627944949848379,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[786]第 K 个最小的素数分数","frequency":0.0,"frontendQuestionId":"786","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 个最小的素数分数","titleSlug":"k-th-smallest-prime-fraction"},{"acceptance":0.39250940688157027,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[787]K 站中转内最便宜的航班","frequency":32.873073808072476,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6072095504868614,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[788]旋转数字","frequency":18.215489960376434,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.692712347126822,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[789]逃脱阻碍者","frequency":21.32204221270777,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.4481312889314806,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[790]多米诺和托米诺平铺","frequency":0.0,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6948306370070778,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[791]自定义字符串排序","frequency":35.160696630590536,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.45074465204440833,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[792]匹配子序列的单词数","frequency":15.108166890105792,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3951679629323184,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.035346114169862,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3407626592850666,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[794]有效的井字游戏","frequency":6.157517045032444,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5343967395123322,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[795]区间子数组个数","frequency":6.755948795401358,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5244600419247709,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[796]旋转字符串","frequency":44.599770222384336,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7952540066828068,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[797]所有可能的路径","frequency":25.87159361630726,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4558342420937841,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[798]得分最高的最小轮调","frequency":0.0,"frontendQuestionId":"798","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的最小轮调","titleSlug":"smallest-rotation-with-highest-score"},{"acceptance":0.4074469833963505,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[799]香槟塔","frequency":51.830786225425705,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7048929663608563,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[800]相似 RGB 颜色","frequency":0.0,"frontendQuestionId":"800","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相似 RGB 颜色","titleSlug":"similar-rgb-color"},{"acceptance":0.4177215189873418,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[801]使序列递增的最小交换次数","frequency":6.157517045032444,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5768088527381064,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[802]找到最终的安全状态","frequency":25.402599129352073,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48296201825355706,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[803]打砖块","frequency":0.0,"frontendQuestionId":"803","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"打砖块","titleSlug":"bricks-falling-when-hit"},{"acceptance":0.769771840643102,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.852768504985672,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2893030794165316,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[805]数组的均值分割","frequency":8.037543813788469,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6584535663483032,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[806]写字符串需要的行数","frequency":16.90034257139293,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8443555181128897,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[807]保持城市天际线","frequency":5.584581530503954,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4789017666254079,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[808]分汤","frequency":27.357495492808276,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.41948773061078276,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[809]情感丰富的文字","frequency":17.544729672906715,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7367333183554258,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[810]黑板异或游戏","frequency":41.19203908581424,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7031858812743526,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[811]子域名访问计数","frequency":16.280516258406706,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6291654112684544,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[812]最大三角形面积","frequency":0.0,"frontendQuestionId":"812","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大三角形面积","titleSlug":"largest-triangle-area"},{"acceptance":0.5476583113456465,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[813]最大平均值和的分组","frequency":6.157517045032444,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.6999620205089252,"acs":0,"articleLive":2,"columnArticles":337,"formTitle":"[814]二叉树剪枝","frequency":5.035346114169862,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.43496044436963477,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[815]公交路线","frequency":85.05622456475639,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5110612855007474,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[816]模糊坐标","frequency":8.725461006626777,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5912389142703575,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[817]链表组件","frequency":0.0,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.42944410507025044,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4208505848775978,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[819]最常见的单词","frequency":25.87159361630726,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5058859125764695,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[820]单词的压缩编码","frequency":38.79947899268702,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6921227051439968,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[821]字符的最短距离","frequency":30.06830524866882,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5020190895741556,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[822]翻转卡片游戏","frequency":0.0,"frontendQuestionId":"822","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转卡片游戏","titleSlug":"card-flipping-game"},{"acceptance":0.4301763145576533,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[823]带因子的二叉树","frequency":10.209785292068533,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6148972859499175,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[824]山羊拉丁文","frequency":5.584581530503954,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.3903527807055614,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[825]适龄的朋友","frequency":6.157517045032444,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3721943220252127,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":5.584581530503954,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3930104230533415,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[827]最大人工岛","frequency":25.17267506260245,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[828]统计子串中的唯一字符","frequency":0.0,"frontendQuestionId":"828","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子串中的唯一字符","titleSlug":"count-unique-characters-of-all-substrings-of-a-given-string"},{"acceptance":0.36130999734818353,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[829]连续整数求和","frequency":30.755546345579138,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5430126237858702,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[830]较大分组的位置","frequency":0.0,"frontendQuestionId":"830","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"较大分组的位置","titleSlug":"positions-of-large-groups"},{"acceptance":0.4031987473436976,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[831]隐藏个人信息","frequency":0.0,"frontendQuestionId":"831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏个人信息","titleSlug":"masking-personal-information"},{"acceptance":0.7956052406988849,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[832]翻转图像","frequency":47.064634172313255,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.42515592515592515,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.584581530503954,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5292907286371339,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":26.59911431794164,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.572828938285241,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.4777034559643255,"acs":0,"articleLive":2,"columnArticles":646,"formTitle":"[836]矩形重叠","frequency":18.215489960376434,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39684275691291787,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[837]新21点","frequency":16.90034257139293,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5014332965821389,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[838]推多米诺","frequency":15.683616972716724,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5745849609375,"acs":0,"articleLive":2,"columnArticles":265,"formTitle":"[839]相似字符串组","frequency":0.0,"frontendQuestionId":"839","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似字符串组","titleSlug":"similar-string-groups"},{"acceptance":0.35875820701953476,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[840]矩阵中的幻方","frequency":0.0,"frontendQuestionId":"840","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幻方","titleSlug":"magic-squares-in-grid"},{"acceptance":0.6566280503436405,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[841]钥匙和房间","frequency":17.544729672906715,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.4893825604397528,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":43.20294198773284,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37565241924107773,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.755948795401358,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5154391238995061,"acs":0,"articleLive":2,"columnArticles":940,"formTitle":"[844]比较含退格的字符串","frequency":27.552203105601563,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.42048910505393366,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[845]数组中的最长山脉","frequency":37.418744341742546,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5110759493670886,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[846]一手顺子","frequency":0.0,"frontendQuestionId":"846","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一手顺子","titleSlug":"hand-of-straights"},{"acceptance":0.6843815357036152,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[847]访问所有节点的最短路径","frequency":34.01378463625484,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4461970951116664,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[848]字母移位","frequency":0.0,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4257961091185741,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[849]到最近的人的最大距离","frequency":5.584581530503954,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4460445468509985,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[850]矩形面积 II","frequency":16.90034257139293,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.4774480018695957,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[851]喧闹和富有","frequency":5.584581530503954,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7153802669913467,"acs":0,"articleLive":2,"columnArticles":708,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.49013848828218,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.3814501866771468,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[853]车队","frequency":35.88390330978434,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3610852055955914,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[854]相似度为 K 的字符串","frequency":0.0,"frontendQuestionId":"854","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似度为 K 的字符串","titleSlug":"k-similar-strings"},{"acceptance":0.40965312005951826,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[855]考场就座","frequency":16.90034257139293,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6252368171771393,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[856]括号的分数","frequency":43.88889094207611,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.4643201542912247,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":27.357495492808276,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5562310030395137,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[858]镜面反射","frequency":25.87159361630726,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.301598555428774,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":5.584581530503954,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5868158258934628,"acs":0,"articleLive":2,"columnArticles":749,"formTitle":"[860]柠檬水找零","frequency":33.79257218300203,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090109262671615,"acs":0,"articleLive":2,"columnArticles":436,"formTitle":"[861]翻转矩阵后的得分","frequency":5.584581530503954,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18836915297092288,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[862]和至少为 K 的最短子数组","frequency":48.423055088855605,"frontendQuestionId":"862","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"和至少为 K 的最短子数组","titleSlug":"shortest-subarray-with-sum-at-least-k"},{"acceptance":0.6031709558823529,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":56.73152991862518,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4532182103610675,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[864]获取所有钥匙的最短路径","frequency":0.0,"frontendQuestionId":"864","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取所有钥匙的最短路径","titleSlug":"shortest-path-to-get-all-keys"},{"acceptance":0.6538606972699085,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[865]具有所有最深节点的最小子树","frequency":0.0,"frontendQuestionId":"865","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有所有最深节点的最小子树","titleSlug":"smallest-subtree-with-all-the-deepest-nodes"},{"acceptance":0.2236098812177471,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.215489960376434,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6708997108679631,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[867]转置矩阵","frequency":45.58955729509267,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6246040746099402,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5503609790456067,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.584581530503954,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.42436395921991243,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[870]优势洗牌","frequency":0.0,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3394877227498014,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":40.28731359792218,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520324493115985,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[872]叶子相似的树","frequency":53.462910772738766,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5090441098691866,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":34.46419146508039,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41394769613947696,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[874]模拟行走机器人","frequency":38.09665775404082,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47796311751860704,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[875]爱吃香蕉的珂珂","frequency":43.657555543871865,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7065972489641257,"acs":0,"articleLive":2,"columnArticles":1543,"formTitle":"[876]链表的中间结点","frequency":43.657555543871865,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7568233097776912,"acs":0,"articleLive":2,"columnArticles":474,"formTitle":"[877]石子游戏","frequency":61.96636498272967,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2786616905650494,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[878]第 N 个神奇数字","frequency":0.0,"frontendQuestionId":"878","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 N 个神奇数字","titleSlug":"nth-magical-number"},{"acceptance":0.5554883659787039,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":73.9011872083297,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.2523090202848511,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[880]索引处的解码字符串","frequency":7.381878117988307,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5385763177528037,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[881]救生艇","frequency":43.29302196593377,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48348082595870207,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[882]细分图中的可到达结点","frequency":0.0,"frontendQuestionId":"882","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"细分图中的可到达结点","titleSlug":"reachable-nodes-in-subdivided-graph"},{"acceptance":0.6862936244882043,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[883]三维形体投影面积","frequency":0.0,"frontendQuestionId":"883","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体投影面积","titleSlug":"projection-area-of-3d-shapes"},{"acceptance":0.6608477061657706,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[884]两句话中的不常见单词","frequency":5.584581530503954,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.689472039987504,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[885]螺旋矩阵 III","frequency":35.160696630590536,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4230809399477807,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[886]可能的二分法","frequency":5.035346114169862,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29200246168273597,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[887]鸡蛋掉落","frequency":66.58572577372765,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6396024483075418,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[888]公平的糖果棒交换","frequency":5.035346114169862,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6791926332434192,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":45.58955729509267,"frontendQuestionId":"889","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据前序和后序遍历构造二叉树","titleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal"},{"acceptance":0.7259509721048183,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[890]查找和替换模式","frequency":0.0,"frontendQuestionId":"890","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找和替换模式","titleSlug":"find-and-replace-pattern"},{"acceptance":0.3285408745247148,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[891]子序列宽度之和","frequency":0.0,"frontendQuestionId":"891","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列宽度之和","titleSlug":"sum-of-subsequence-widths"},{"acceptance":0.6387307856119565,"acs":0,"articleLive":2,"columnArticles":677,"formTitle":"[892]三维形体的表面积","frequency":0.0,"frontendQuestionId":"892","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三维形体的表面积","titleSlug":"surface-area-of-3d-shapes"},{"acceptance":0.7238607724269464,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[893]特殊等价字符串组","frequency":6.755948795401358,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7740188621843627,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[894]所有可能的满二叉树","frequency":0.0,"frontendQuestionId":"894","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有可能的满二叉树","titleSlug":"all-possible-full-binary-trees"},{"acceptance":0.5409315160130446,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[895]最大频率栈","frequency":25.17267506260245,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5869148946835494,"acs":0,"articleLive":2,"columnArticles":709,"formTitle":"[896]单调数列","frequency":16.280516258406706,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7456383459289194,"acs":0,"articleLive":2,"columnArticles":696,"formTitle":"[897]递增顺序搜索树","frequency":58.06063764944837,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3348899692937564,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.17267506260245,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5351053832729226,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[899]有序队列","frequency":6.755948795401358,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4928626247122026,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[900]RLE 迭代器","frequency":0.0,"frontendQuestionId":"900","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"RLE 迭代器","titleSlug":"rle-iterator"},{"acceptance":0.5416044605587885,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.3255742725880551,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.755948795401358,"frontendQuestionId":"902","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大为 N 的数字组合","titleSlug":"numbers-at-most-n-given-digit-set"},{"acceptance":0.5306952662721893,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[903]DI 序列的有效排列","frequency":16.280516258406706,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4524885735208707,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[904]水果成篮","frequency":35.160696630590536,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7015982272181438,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[905]按奇偶排序数组","frequency":28.76672692836418,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2725254635675111,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[906]超级回文数","frequency":39.0879818159139,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3155703826169107,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[907]子数组的最小值之和","frequency":38.09665775404082,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6981941465439702,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[908]最小差值 I","frequency":5.584581530503954,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4610668125161922,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":41.07660773716132,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31741628690311074,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[910]最小差值 II","frequency":0.0,"frontendQuestionId":"910","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 II","titleSlug":"smallest-range-ii"},{"acceptance":0.42548921224284997,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5655160248582051,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[912]排序数组","frequency":85.28315587082953,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40348171000440725,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":8.725461006626777,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.38890226287915264,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[914]卡牌分组","frequency":16.280516258406706,"frontendQuestionId":"914","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡牌分组","titleSlug":"x-of-a-kind-in-a-deck-of-cards"},{"acceptance":0.4684614180622946,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[915]分割数组","frequency":16.280516258406706,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.43956666430645047,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5698571172356071,"acs":0,"articleLive":2,"columnArticles":429,"formTitle":"[917]仅仅反转字母","frequency":35.88390330978434,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3579562417366827,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[918]环形子数组的最大和","frequency":30.06830524866882,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.626001001001001,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[919]完全二叉树插入器","frequency":0.0,"frontendQuestionId":"919","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树插入器","titleSlug":"complete-binary-tree-inserter"},{"acceptance":0.480225988700565,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[920]播放列表的数量","frequency":0.0,"frontendQuestionId":"920","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"播放列表的数量","titleSlug":"number-of-music-playlists"},{"acceptance":0.7354312354312355,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[921]使括号有效的最少添加","frequency":6.755948795401358,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.714284566174816,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[922]按奇偶排序数组 II","frequency":17.544729672906715,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3376362112321878,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.544729672906715,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3597564615292783,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[924]尽量减少恶意软件的传播","frequency":0.0,"frontendQuestionId":"924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播","titleSlug":"minimize-malware-spread"},{"acceptance":0.38822004653269,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[925]长按键入","frequency":0.0,"frontendQuestionId":"925","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长按键入","titleSlug":"long-pressed-name"},{"acceptance":0.5159983464241422,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[926]将字符串翻转到单调递增","frequency":16.90034257139293,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33874055415617127,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[927]三等分","frequency":38.23517400191866,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42158779820101683,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[928]尽量减少恶意软件的传播 II","frequency":0.0,"frontendQuestionId":"928","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"尽量减少恶意软件的传播 II","titleSlug":"minimize-malware-spread-ii"},{"acceptance":0.6429085118405506,"acs":0,"articleLive":2,"columnArticles":225,"formTitle":"[929]独特的电子邮件地址","frequency":0.0,"frontendQuestionId":"929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独特的电子邮件地址","titleSlug":"unique-email-addresses"},{"acceptance":0.5451521538664208,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[930]和相同的二元子数组","frequency":54.5108701133377,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6595527715055721,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[931]下降路径最小和","frequency":23.852768504985672,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6274079874706343,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[932]漂亮数组","frequency":16.90034257139293,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7239042403642391,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[933]最近的请求次数","frequency":34.46419146508039,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47510005905124336,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[934]最短的桥","frequency":44.599770222384336,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47446842783505155,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":0.0,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37924955930496096,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[936]戳印序列","frequency":0.0,"frontendQuestionId":"936","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳印序列","titleSlug":"stamping-the-sequence"},{"acceptance":0.5880153649167734,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[937]重新排列日志文件","frequency":16.280516258406706,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8183173406442769,"acs":0,"articleLive":2,"columnArticles":783,"formTitle":"[938]二叉搜索树的范围和","frequency":49.138858509367935,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4502232729183084,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[939]最小面积矩形","frequency":0.0,"frontendQuestionId":"939","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形","titleSlug":"minimum-area-rectangle"},{"acceptance":0.4180313278746885,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[940]不同的子序列 II","frequency":4.508192885707507,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3925080596478159,"acs":0,"articleLive":2,"columnArticles":605,"formTitle":"[941]有效的山脉数组","frequency":5.035346114169862,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7291494359347603,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[942]增减字符串匹配","frequency":0.0,"frontendQuestionId":"942","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"增减字符串匹配","titleSlug":"di-string-match"},{"acceptance":0.47534464475079535,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":9.448468278553571,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6903138241525424,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[944]删列造序","frequency":0.0,"frontendQuestionId":"944","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序","titleSlug":"delete-columns-to-make-sorted"},{"acceptance":0.48681617585833636,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[945]使数组唯一的最小增量","frequency":24.500338269107854,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6218755962602557,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[946]验证栈序列","frequency":50.36880399666648,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125669472073451,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[947]移除最多的同行或同列石头","frequency":0.0,"frontendQuestionId":"947","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除最多的同行或同列石头","titleSlug":"most-stones-removed-with-same-row-or-column"},{"acceptance":0.3913120567375887,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[948]令牌放置","frequency":0.0,"frontendQuestionId":"948","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"令牌放置","titleSlug":"bag-of-tokens"},{"acceptance":0.3689751453288781,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[949]给定数字能组成的最大时间","frequency":34.46419146508039,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7746697113032132,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[950]按递增顺序显示卡牌","frequency":18.215489960376434,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6621121905358822,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[951]翻转等价二叉树","frequency":23.852768504985672,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34873999761136987,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[952]按公因数计算最大组件大小","frequency":0.0,"frontendQuestionId":"952","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按公因数计算最大组件大小","titleSlug":"largest-component-size-by-common-factor"},{"acceptance":0.5527648708610657,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.852768504985672,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2993051610365774,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":29.405911010575036,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.3274066280904787,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":7.381878117988307,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.43553968076794286,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":25.17267506260245,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.35954351970334003,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[957]N 天后的牢房","frequency":26.59911431794164,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5373920470722217,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[958]二叉树的完全性检验","frequency":28.149272277419424,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7436338609772883,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.87159361630726,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5528666090463843,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[960]删列造序 III","frequency":8.725461006626777,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6769911504424779,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[961]重复 N 次的元素","frequency":16.90034257139293,"frontendQuestionId":"961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复 N 次的元素","titleSlug":"n-repeated-element-in-size-2n-array"},{"acceptance":0.44063919026656034,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[962]最大宽度坡","frequency":17.544729672906715,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5006072874493928,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[963]最小面积矩形 II","frequency":0.0,"frontendQuestionId":"963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小面积矩形 II","titleSlug":"minimum-area-rectangle-ii"},{"acceptance":0.42562859739472886,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[964]表示数字的最少运算符","frequency":14.016370359643338,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6839304035567716,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[965]单值二叉树","frequency":5.584581530503954,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4029911075181892,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[966]元音拼写检查器","frequency":8.725461006626777,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4597200622083981,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[967]连续差相同的数字","frequency":0.0,"frontendQuestionId":"967","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续差相同的数字","titleSlug":"numbers-with-same-consecutive-differences"},{"acceptance":0.4967525056545828,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[968]监控二叉树","frequency":39.21296487762663,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6521913058938572,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[969]煎饼排序","frequency":5.035346114169862,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41472912610239376,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[970]强整数","frequency":0.0,"frontendQuestionId":"970","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"强整数","titleSlug":"powerful-integers"},{"acceptance":0.442135507149539,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":8.037543813788469,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.40868997059784384,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":14.016370359643338,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6389545676599903,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[973]最接近原点的 K 个点","frequency":5.035346114169862,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.46561789625955774,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[974]和可被 K 整除的子数组","frequency":56.03400574149302,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4446266209569235,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":7.381878117988307,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5971355788281913,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[976]三角形的最大周长","frequency":24.500338269107854,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.716732403568529,"acs":0,"articleLive":2,"columnArticles":1181,"formTitle":"[977]有序数组的平方","frequency":49.138858509367935,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47346517512318553,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[978]最长湍流子数组","frequency":16.280516258406706,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7121815976433894,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[979]在二叉树中分配硬币","frequency":25.87159361630726,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.73261378136963,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[980]不同路径 III","frequency":30.755546345579138,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5353065212919152,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[981]基于时间的键值存储","frequency":54.38899458358279,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5424778761061947,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[982]按位与为零的三元组","frequency":0.0,"frontendQuestionId":"982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按位与为零的三元组","titleSlug":"triples-with-bitwise-and-equal-to-zero"},{"acceptance":0.6337240649399924,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[983]最低票价","frequency":47.064634172313255,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4165282983063713,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[984]不含 AAA 或 BBB 的字符串","frequency":0.0,"frontendQuestionId":"984","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含 AAA 或 BBB 的字符串","titleSlug":"string-without-aaa-or-bbb"},{"acceptance":0.599089178394117,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[985]查询后的偶数和","frequency":5.584581530503954,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6757401389344384,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[986]区间列表的交集","frequency":46.41889827002898,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5320574840125539,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[987]二叉树的垂序遍历","frequency":51.455134386379505,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.49644237772424227,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[988]从叶结点开始的最小字符串","frequency":0.0,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47279874213836476,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[989]数组形式的整数加法","frequency":16.90034257139293,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.4990303613261554,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[990]等式方程的可满足性","frequency":5.584581530503954,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5174347720068276,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[991]坏了的计算器","frequency":17.544729672906715,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.45136186770428016,"acs":0,"articleLive":2,"columnArticles":269,"formTitle":"[992]K 个不同整数的子数组","frequency":18.914641452403927,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.557339602879237,"acs":0,"articleLive":2,"columnArticles":789,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.086414971376726,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5095778070264251,"acs":0,"articleLive":2,"columnArticles":1348,"formTitle":"[994]腐烂的橘子","frequency":37.418744341742546,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5401827762645419,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":25.87159361630726,"frontendQuestionId":"995","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 连续位的最小翻转次数","titleSlug":"minimum-number-of-k-consecutive-bit-flips"},{"acceptance":0.49607423269093504,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.914641452403927,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.512341230519773,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[997]找到小镇的法官","frequency":15.683616972716724,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.614621752315384,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[998]最大二叉树 II","frequency":0.0,"frontendQuestionId":"998","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树 II","titleSlug":"maximum-binary-tree-ii"},{"acceptance":0.691195704550148,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.584581530503954,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.40705319784817695,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":32.21203630461483,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.2911773130908049,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":13.255053346128376,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7377803182368032,"acs":0,"articleLive":2,"columnArticles":589,"formTitle":"[1002]查找常用字符","frequency":39.85035945697539,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5761817125145292,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1003]检查替换后的词是否有效","frequency":0.0,"frontendQuestionId":"1003","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"检查替换后的词是否有效","titleSlug":"check-if-word-is-valid-after-substitutions"},{"acceptance":0.5984644735005351,"acs":0,"articleLive":2,"columnArticles":684,"formTitle":"[1004]最大连续1的个数 III","frequency":53.094999639925724,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5361501709575889,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.479665754251474,"frontendQuestionId":"1005","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次取反后最大化的数组和","titleSlug":"maximize-sum-of-array-after-k-negations"},{"acceptance":0.6277366020524515,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[1006]笨阶乘","frequency":51.830786225425705,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.4641859763000981,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1007]行相等的最少多米诺旋转","frequency":0.0,"frontendQuestionId":"1007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"行相等的最少多米诺旋转","titleSlug":"minimum-domino-rotations-for-equal-row"},{"acceptance":0.7259788054804239,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.50955714540861,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5930191001866338,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.584581530503954,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4500585203077919,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":0.0,"frontendQuestionId":"1010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"总持续时间可被 60 整除的歌曲","titleSlug":"pairs-of-songs-with-total-durations-divisible-by-60"},{"acceptance":0.6269619344539796,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":69.74924596171444,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33001119820828667,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":19.644440068773637,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39825984978485257,"acs":0,"articleLive":2,"columnArticles":911,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.79257218300203,"frontendQuestionId":"1013","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成和相等的三个部分","titleSlug":"partition-array-into-three-parts-with-equal-sum"},{"acceptance":0.5468781369202971,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[1014]最佳观光组合","frequency":14.55282491827155,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.3540214376733378,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":18.914641452403927,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5838323353293413,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1016]子串能表示从 1 到 N 数字的二进制串","frequency":0.0,"frontendQuestionId":"1016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串能表示从 1 到 N 数字的二进制串","titleSlug":"binary-string-with-substrings-representing-1-to-n"},{"acceptance":0.5620211898940505,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1017]负二进制转换","frequency":0.0,"frontendQuestionId":"1017","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制转换","titleSlug":"convert-to-base-2"},{"acceptance":0.5167510043492173,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1018]可被 5 整除的二进制前缀","frequency":0.0,"frontendQuestionId":"1018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 5 整除的二进制前缀","titleSlug":"binary-prefix-divisible-by-5"},{"acceptance":0.5971330310131783,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.584581530503954,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5363752977826645,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1020]飞地的数量","frequency":24.500338269107854,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7834789690920887,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[1021]删除最外层的括号","frequency":30.06830524866882,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7024839006439743,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.584581530503954,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.565025777482122,"acs":0,"articleLive":2,"columnArticles":146,"formTitle":"[1023]驼峰式匹配","frequency":6.755948795401358,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5593310463121783,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[1024]视频拼接","frequency":16.280516258406706,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7097110900437626,"acs":0,"articleLive":2,"columnArticles":638,"formTitle":"[1025]除数博弈","frequency":39.21296487762663,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6687898089171974,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1026]节点与其祖先之间的最大差值","frequency":0.0,"frontendQuestionId":"1026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点与其祖先之间的最大差值","titleSlug":"maximum-difference-between-node-and-ancestor"},{"acceptance":0.4329203781440906,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1027]最长等差数列","frequency":31.46944968249581,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7318259978780229,"acs":0,"articleLive":2,"columnArticles":419,"formTitle":"[1028]从先序遍历还原二叉树","frequency":23.852768504985672,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6534950756665866,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1029]两地调度","frequency":0.0,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7113586456045902,"acs":0,"articleLive":2,"columnArticles":441,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":5.584581530503954,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5672365708742573,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.157517045032444,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39453125,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1032]字符流","frequency":0.0,"frontendQuestionId":"1032","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符流","titleSlug":"stream-of-characters"},{"acceptance":0.3897400771476982,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.157517045032444,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.4314874696847211,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1034]边框着色","frequency":0.0,"frontendQuestionId":"1034","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"边框着色","titleSlug":"coloring-a-border"},{"acceptance":0.6292234901196772,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1035]不相交的线","frequency":61.606931920283714,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2991143700599943,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":5.584581530503954,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4380543498773353,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.79334483769088,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":4.508192885707507,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5530235518777848,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1039]多边形三角剖分的最低得分","frequency":0.0,"frontendQuestionId":"1039","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多边形三角剖分的最低得分","titleSlug":"minimum-score-triangulation-of-polygon"},{"acceptance":0.5227827502034175,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1040]移动石子直到连续 II","frequency":0.0,"frontendQuestionId":"1040","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续 II","titleSlug":"moving-stones-until-consecutive-ii"},{"acceptance":0.4819179494733741,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":24.500338269107854,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5278375149342891,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1042]不邻接植花","frequency":15.683616972716724,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6906976744186046,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1043]分隔数组以得到最大和","frequency":0.0,"frontendQuestionId":"1043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分隔数组以得到最大和","titleSlug":"partition-array-for-maximum-sum"},{"acceptance":0.20880018674136322,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1044]最长重复子串","frequency":55.312490525862955,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.644782643892172,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1045]买下所有产品的客户","frequency":5.584581530503954,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6595041829450388,"acs":0,"articleLive":2,"columnArticles":899,"formTitle":"[1046]最后一块石头的重量","frequency":29.405911010575036,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7258753325185132,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":76.65672803738508,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.45150993109039317,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":32.21203630461483,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6428777116529084,"acs":0,"articleLive":2,"columnArticles":389,"formTitle":"[1049]最后一块石头的重量 II","frequency":59.31053638360887,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7572974512316674,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.584581530503954,"frontendQuestionId":"1050","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合作过至少三次的演员和导演","titleSlug":"actors-and-directors-who-cooperated-at-least-three-times"},{"acceptance":0.7522243856752027,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1051]高度检查器","frequency":5.584581530503954,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811638591117917,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[1052]爱生气的书店老板","frequency":25.87159361630726,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4589208349743994,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1053]交换一次的先前排列","frequency":16.90034257139293,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.3754619723789146,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.280516258406706,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5848750844024307,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1055]形成字符串的最短路径","frequency":0.0,"frontendQuestionId":"1055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"形成字符串的最短路径","titleSlug":"shortest-way-to-form-string"},{"acceptance":0.40725957340651114,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1056]易混淆数","frequency":0.0,"frontendQuestionId":"1056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数","titleSlug":"confusing-number"},{"acceptance":0.46190325640214985,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1057]校园自行车分配","frequency":0.0,"frontendQuestionId":"1057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配","titleSlug":"campus-bikes"},{"acceptance":0.33842507242559916,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1058]最小化舍入误差以满足目标","frequency":0.0,"frontendQuestionId":"1058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化舍入误差以满足目标","titleSlug":"minimize-rounding-error-to-meet-target"},{"acceptance":0.35859613428280773,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1059]从始点到终点的所有路径","frequency":0.0,"frontendQuestionId":"1059","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从始点到终点的所有路径","titleSlug":"all-paths-from-source-lead-to-destination"},{"acceptance":0.5292905883867646,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1060]有序数组中的缺失元素","frequency":30.06830524866882,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.5999547203984605,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1061]按字典序排列最小的等效字符串","frequency":0.0,"frontendQuestionId":"1061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排列最小的等效字符串","titleSlug":"lexicographically-smallest-equivalent-string"},{"acceptance":0.5359628770301624,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1062]最长重复子串","frequency":0.0,"frontendQuestionId":"1062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-repeating-substring"},{"acceptance":0.6967767608436132,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1063]有效子数组的数目","frequency":0.0,"frontendQuestionId":"1063","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效子数组的数目","titleSlug":"number-of-valid-subarrays"},{"acceptance":0.6505772708304354,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.53891805523853,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1065]字符串的索引对","frequency":0.0,"frontendQuestionId":"1065","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的索引对","titleSlug":"index-pairs-of-a-string"},{"acceptance":0.4724926971762415,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1066]校园自行车分配 II","frequency":0.0,"frontendQuestionId":"1066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"校园自行车分配 II","titleSlug":"campus-bikes-ii"},{"acceptance":0.42024377318494965,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1067]范围内的数字计数","frequency":0.0,"frontendQuestionId":"1067","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"范围内的数字计数","titleSlug":"digit-count-in-range"},{"acceptance":0.8639545360038811,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1068]产品销售分析 I","frequency":0.0,"frontendQuestionId":"1068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 I","titleSlug":"product-sales-analysis-i"},{"acceptance":0.8199376947040499,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1069]产品销售分析 II","frequency":5.584581530503954,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.483596837944664,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1070]产品销售分析 III","frequency":5.584581530503954,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.58651423478395,"acs":0,"articleLive":2,"columnArticles":662,"formTitle":"[1071]字符串的最大公因子","frequency":16.280516258406706,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5786049873509216,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":10.209785292068533,"frontendQuestionId":"1072","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按列翻转得到最大值等行数","titleSlug":"flip-columns-for-maximum-number-of-equal-rows"},{"acceptance":0.33690527218174027,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":10.209785292068533,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6701568757118189,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.99183378455747,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6953179594689028,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1075]项目员工 I","frequency":0.0,"frontendQuestionId":"1075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 I","titleSlug":"project-employees-i"},{"acceptance":0.49656738760130076,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1076]项目员工II","frequency":0.0,"frontendQuestionId":"1076","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工II","titleSlug":"project-employees-ii"},{"acceptance":0.7220018309429356,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1077]项目员工 III","frequency":0.0,"frontendQuestionId":"1077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"项目员工 III","titleSlug":"project-employees-iii"},{"acceptance":0.6220322369854062,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1078]Bigram 分词","frequency":0.0,"frontendQuestionId":"1078","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Bigram 分词","titleSlug":"occurrences-after-bigram"},{"acceptance":0.735425402407683,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1079]活字印刷","frequency":5.584581530503954,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48963947778177025,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1080]根到叶路径上的不足节点","frequency":0.0,"frontendQuestionId":"1080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根到叶路径上的不足节点","titleSlug":"insufficient-nodes-in-root-to-leaf-paths"},{"acceptance":0.5712009152944061,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1081]不同字符的最小子序列","frequency":41.899442402635756,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7600589846218665,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":6.157517045032444,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.527575497965303,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.544729672906715,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5383466135458167,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1084]销售分析III","frequency":0.0,"frontendQuestionId":"1084","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析III","titleSlug":"sales-analysis-iii"},{"acceptance":0.7726182690211467,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1085]最小元素各数位之和","frequency":0.0,"frontendQuestionId":"1085","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小元素各数位之和","titleSlug":"sum-of-digits-in-the-minimum-number"},{"acceptance":0.6889538932999025,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5303261200853399,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44395214887018164,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1088]易混淆数 II","frequency":0.0,"frontendQuestionId":"1088","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"易混淆数 II","titleSlug":"confusing-number-ii"},{"acceptance":0.5851200350558703,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1089]复写零","frequency":5.584581530503954,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5418859337220879,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1090]受标签影响的最大值","frequency":0.0,"frontendQuestionId":"1090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"受标签影响的最大值","titleSlug":"largest-values-from-labels"},{"acceptance":0.3776536312849162,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":39.85035945697539,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4884131971720346,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1092]最短公共超序列","frequency":18.914641452403927,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3847643641058748,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1093]大样本统计","frequency":8.725461006626777,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6155149642403249,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1094]拼车","frequency":23.228329710626443,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3735929892891918,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[1095]山脉数组中查找目标值","frequency":0.0,"frontendQuestionId":"1095","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"山脉数组中查找目标值","titleSlug":"find-in-mountain-array"},{"acceptance":0.5551343900758098,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1096]花括号展开 II","frequency":0.0,"frontendQuestionId":"1096","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开 II","titleSlug":"brace-expansion-ii"},{"acceptance":0.51931330472103,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1097]游戏玩法分析 V","frequency":32.98556520193857,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.473724085680832,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1098]小众书籍","frequency":16.90034257139293,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5798624140087555,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1099]小于 K 的两数之和","frequency":0.0,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7004031097034265,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1100]长度为 K 的无重复字符子串","frequency":0.0,"frontendQuestionId":"1100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的无重复字符子串","titleSlug":"find-k-length-substrings-with-no-repeated-characters"},{"acceptance":0.6672453703703703,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1101]彼此熟识的最早时间","frequency":0.0,"frontendQuestionId":"1101","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"彼此熟识的最早时间","titleSlug":"the-earliest-moment-when-everyone-become-friends"},{"acceptance":0.36566440349175555,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1102]得分最高的路径","frequency":0.0,"frontendQuestionId":"1102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的路径","titleSlug":"path-with-maximum-minimum-value"},{"acceptance":0.6365056585950698,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[1103]分糖果 II","frequency":16.90034257139293,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.7610343529917747,"acs":0,"articleLive":2,"columnArticles":660,"formTitle":"[1104]二叉树寻路","frequency":44.92418668657559,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5559355692850838,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1105]填充书架","frequency":0.0,"frontendQuestionId":"1105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"填充书架","titleSlug":"filling-bookcase-shelves"},{"acceptance":0.5729517396184063,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1106]解析布尔表达式","frequency":20.4057570822886,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.41046063985132086,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1107]每日新用户统计","frequency":6.157517045032444,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8391250348515956,"acs":0,"articleLive":2,"columnArticles":675,"formTitle":"[1108]IP 地址无效化","frequency":0.0,"frontendQuestionId":"1108","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"IP 地址无效化","titleSlug":"defanging-an-ip-address"},{"acceptance":0.5728402565284823,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[1109]航班预订统计","frequency":17.924667522855007,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6272395096652522,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1110]删点成林","frequency":18.215489960376434,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7719428405535306,"acs":0,"articleLive":2,"columnArticles":397,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.500338269107854,"frontendQuestionId":"1111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效括号的嵌套深度","titleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings"},{"acceptance":0.6427799783939503,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1112]每位学生的最高成绩","frequency":17.544729672906715,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5416771805870974,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1113]报告的记录","frequency":0.0,"frontendQuestionId":"1113","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录","titleSlug":"reported-posts"},{"acceptance":0.6528258159664309,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[1114]按序打印","frequency":81.70998704610344,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5613722584066465,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1115]交替打印FooBar","frequency":55.312490525862955,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5158152017636346,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[1116]打印零与奇偶数","frequency":59.31053638360887,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5210026037581955,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[1117]H2O 生成","frequency":41.279066193191085,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6410547207258294,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1118]一月有多少天","frequency":0.0,"frontendQuestionId":"1118","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一月有多少天","titleSlug":"number-of-days-in-a-month"},{"acceptance":0.8664979436887061,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1119]删去字符串中的元音","frequency":0.0,"frontendQuestionId":"1119","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删去字符串中的元音","titleSlug":"remove-vowels-from-a-string"},{"acceptance":0.6050741981809479,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1120]子树的最大平均值","frequency":8.725461006626777,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5728103170338528,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1121]将数组分成几个递增序列","frequency":0.0,"frontendQuestionId":"1121","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成几个递增序列","titleSlug":"divide-array-into-increasing-sequences"},{"acceptance":0.7071058541032083,"acs":0,"articleLive":2,"columnArticles":857,"formTitle":"[1122]数组的相对排序","frequency":52.1493116815743,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7048334540188269,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1123]最深叶节点的最近公共祖先","frequency":0.0,"frontendQuestionId":"1123","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最深叶节点的最近公共祖先","titleSlug":"lowest-common-ancestor-of-deepest-leaves"},{"acceptance":0.31593038821954483,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1124]表现良好的最长时间段","frequency":6.755948795401358,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.49058176362727124,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1125]最小的必要团队","frequency":0.0,"frontendQuestionId":"1125","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的必要团队","titleSlug":"smallest-sufficient-team"},{"acceptance":0.6937059478174848,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1126]查询活跃业务","frequency":16.90034257139293,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4168737293878473,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1127]用户购买平台","frequency":0.0,"frontendQuestionId":"1127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用户购买平台","titleSlug":"user-purchase-platform"},{"acceptance":0.5448235974551764,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.280516258406706,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3790266875981162,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1129]颜色交替的最短路径","frequency":7.381878117988307,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283068783068783,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1130]叶值的最小代价生成树","frequency":0.0,"frontendQuestionId":"1130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"叶值的最小代价生成树","titleSlug":"minimum-cost-tree-from-leaf-values"},{"acceptance":0.4525403103133556,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1131]绝对值表达式的最大值","frequency":0.0,"frontendQuestionId":"1131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对值表达式的最大值","titleSlug":"maximum-of-absolute-value-expression"},{"acceptance":0.38926899531868925,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1132]报告的记录 II","frequency":16.90034257139293,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6446978335233752,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1133]最大唯一数","frequency":0.0,"frontendQuestionId":"1133","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大唯一数","titleSlug":"largest-unique-number"},{"acceptance":0.7738453815261044,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5345326342433556,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1135]最低成本联通所有城市","frequency":24.500338269107854,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5681919147045758,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1136]平行课程","frequency":0.0,"frontendQuestionId":"1136","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平行课程","titleSlug":"parallel-courses"},{"acceptance":0.6068489137093696,"acs":0,"articleLive":2,"columnArticles":802,"formTitle":"[1137]第 N 个泰波那契数","frequency":15.600129279700376,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.4313867032411752,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1138]字母板上的路径","frequency":6.157517045032444,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4763232663369462,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":18.215489960376434,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6547452547452547,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.755948795401358,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5114130434782609,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":5.584581530503954,"frontendQuestionId":"1141","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询近30天活跃用户数","titleSlug":"user-activity-for-the-past-30-days-i"},{"acceptance":0.37144813420061623,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1142]过去30天的用户活动 II","frequency":0.0,"frontendQuestionId":"1142","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"过去30天的用户活动 II","titleSlug":"user-activity-for-the-past-30-days-ii"},{"acceptance":0.6330488911728991,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[1143]最长公共子序列","frequency":83.70828206694834,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.44183303481717706,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":23.228329710626443,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4695121951219512,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1145]二叉树着色游戏","frequency":36.63583279905146,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2859085378945108,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1146]快照数组","frequency":0.0,"frontendQuestionId":"1146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"快照数组","titleSlug":"snapshot-array"},{"acceptance":0.5555724033358606,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1147]段式回文","frequency":0.0,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7181214606522164,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1148]文章浏览 I","frequency":0.0,"frontendQuestionId":"1148","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 I","titleSlug":"article-views-i"},{"acceptance":0.44326871776631693,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1149]文章浏览 II","frequency":0.0,"frontendQuestionId":"1149","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文章浏览 II","titleSlug":"article-views-ii"},{"acceptance":0.607176581680831,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.215489960376434,"frontendQuestionId":"1150","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个数是否在数组中占绝大多数","titleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array"},{"acceptance":0.4832173048234709,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":16.280516258406706,"frontendQuestionId":"1151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少交换次数来组合所有的 1","titleSlug":"minimum-swaps-to-group-all-1s-together"},{"acceptance":0.3838805970149254,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1152]用户网站访问行为分析","frequency":13.255053346128376,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.37069351230425057,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1153]字符串转化","frequency":0.0,"frontendQuestionId":"1153","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转化","titleSlug":"string-transforms-into-another-string"},{"acceptance":0.5662521175060943,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1154]一年中的第几天","frequency":5.584581530503954,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.479822732012513,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1155]掷骰子的N种方法","frequency":6.157517045032444,"frontendQuestionId":"1155","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子的N种方法","titleSlug":"number-of-dice-rolls-with-target-sum"},{"acceptance":0.43335151845790143,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1156]单字符重复子串的最大长度","frequency":0.0,"frontendQuestionId":"1156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单字符重复子串的最大长度","titleSlug":"swap-for-longest-repeated-character-substring"},{"acceptance":0.3163573586534312,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1157]子数组中占绝大多数的元素","frequency":0.0,"frontendQuestionId":"1157","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组中占绝大多数的元素","titleSlug":"online-majority-element-in-subarray"},{"acceptance":0.5508602150537635,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1158]市场分析 I","frequency":0.0,"frontendQuestionId":"1158","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 I","titleSlug":"market-analysis-i"},{"acceptance":0.48915461624026696,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1159]市场分析 II","frequency":18.215489960376434,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6878730442767503,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[1160]拼写单词","frequency":16.280516258406706,"frontendQuestionId":"1160","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拼写单词","titleSlug":"find-words-that-can-be-formed-by-characters"},{"acceptance":0.6332426079425956,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1161]最大层内元素和","frequency":6.157517045032444,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4692619606563139,"acs":0,"articleLive":2,"columnArticles":489,"formTitle":"[1162]地图分析","frequency":26.59911431794164,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2671220146826503,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1163]按字典序排在最后的子串","frequency":7.381878117988307,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.615661252900232,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1164]指定日期的产品价格","frequency":17.544729672906715,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8383247016437739,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1165]单行键盘","frequency":0.0,"frontendQuestionId":"1165","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单行键盘","titleSlug":"single-row-keyboard"},{"acceptance":0.4837310195227766,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1166]设计文件系统","frequency":0.0,"frontendQuestionId":"1166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件系统","titleSlug":"design-file-system"},{"acceptance":0.42168441432720233,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1167]连接棒材的最低费用","frequency":0.0,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5704647676161919,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1168]水资源分配优化","frequency":11.732419319098454,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224758905727219,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.215489960376434,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6171506974616968,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.755948795401358,"frontendQuestionId":"1170","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"比较字符串最小字母出现频次","titleSlug":"compare-strings-by-frequency-of-the-smallest-character"},{"acceptance":0.47205296020461895,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":5.584581530503954,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.27126281401374336,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1172]餐盘栈","frequency":0.0,"frontendQuestionId":"1172","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"餐盘栈","titleSlug":"dinner-plate-stacks"},{"acceptance":0.7565658575407879,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1173]即时食物配送 I","frequency":0.0,"frontendQuestionId":"1173","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 I","titleSlug":"immediate-food-delivery-i"},{"acceptance":0.6204458945078847,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1174]即时食物配送 II","frequency":0.0,"frontendQuestionId":"1174","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"即时食物配送 II","titleSlug":"immediate-food-delivery-ii"},{"acceptance":0.48866109667907043,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4462079250106519,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1176]健身计划评估","frequency":7.381878117988307,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.26303088803088803,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1177]构建回文串检测","frequency":6.157517045032444,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4621466099574681,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1178]猜字谜","frequency":0.0,"frontendQuestionId":"1178","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜字谜","titleSlug":"number-of-valid-words-for-each-puzzle"},{"acceptance":0.634086089674923,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1179]重新格式化部门表","frequency":53.94267461471072,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7733537519142419,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.448468278553571,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.36928934010152287,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1181]前后拼接","frequency":0.0,"frontendQuestionId":"1181","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前后拼接","titleSlug":"before-and-after-puzzle"},{"acceptance":0.385256143273636,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1182]与目标颜色间的最短距离","frequency":0.0,"frontendQuestionId":"1182","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"与目标颜色间的最短距离","titleSlug":"shortest-distance-to-target-color"},{"acceptance":0.6013320647002854,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1183]矩阵中 1 的最大数量","frequency":0.0,"frontendQuestionId":"1183","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中 1 的最大数量","titleSlug":"maximum-number-of-ones"},{"acceptance":0.5854994388327721,"acs":0,"articleLive":2,"columnArticles":252,"formTitle":"[1184]公交站间的距离","frequency":16.280516258406706,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6106328264758497,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1185]一周中的第几天","frequency":16.280516258406706,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3911380647981205,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":31.46944968249581,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.4379796979450359,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1187]使数组严格递增","frequency":0.0,"frontendQuestionId":"1187","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组严格递增","titleSlug":"make-array-strictly-increasing"},{"acceptance":0.6940730837789661,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1188]设计有限阻塞队列","frequency":0.0,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6445214406052322,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[1189]“气球” 的最大数量","frequency":5.584581530503954,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6512775490433519,"acs":0,"articleLive":2,"columnArticles":601,"formTitle":"[1190]反转每对括号间的子串","frequency":94.82783445158431,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26783749082905356,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1191]K 次串联后最大子数组之和","frequency":0.0,"frontendQuestionId":"1191","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次串联后最大子数组之和","titleSlug":"k-concatenation-maximum-sum"},{"acceptance":0.4993699596774194,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1192]查找集群内的「关键连接」","frequency":0.0,"frontendQuestionId":"1192","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找集群内的「关键连接」","titleSlug":"critical-connections-in-a-network"},{"acceptance":0.6098875351452671,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1193]每月交易 I","frequency":5.584581530503954,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5142989642912351,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.755948795401358,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6351819757365684,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1195]交替打印字符串","frequency":30.755546345579138,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.69117950836604,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1196]最多可以买到的苹果数量","frequency":0.0,"frontendQuestionId":"1196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以买到的苹果数量","titleSlug":"how-many-apples-can-you-put-into-the-basket"},{"acceptance":0.36695977853769746,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.215489960376434,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7474647047126666,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1198]找出所有行中最小公共元素","frequency":0.0,"frontendQuestionId":"1198","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有行中最小公共元素","titleSlug":"find-smallest-common-element-in-all-rows"},{"acceptance":0.4329083181542198,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1199]建造街区的最短时间","frequency":0.0,"frontendQuestionId":"1199","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"建造街区的最短时间","titleSlug":"minimum-time-to-build-blocks"},{"acceptance":0.6861174978197099,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1200]最小绝对差","frequency":23.852768504985672,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24699559918754233,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1201]丑数 III","frequency":0.0,"frontendQuestionId":"1201","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 III","titleSlug":"ugly-number-iii"},{"acceptance":0.5030638766101952,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[1202]交换字符串中的元素","frequency":6.755948795401358,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6238898987276033,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1203]项目管理","frequency":8.037543813788469,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.728612756578041,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":18.215489960376434,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.4664894626922347,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1205]每月交易II","frequency":25.17267506260245,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6193215051666991,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1206]设计跳表","frequency":17.544729672906715,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.730346795814235,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[1207]独一无二的出现次数","frequency":0.0,"frontendQuestionId":"1207","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"独一无二的出现次数","titleSlug":"unique-number-of-occurrences"},{"acceptance":0.49618279220075046,"acs":0,"articleLive":2,"columnArticles":600,"formTitle":"[1208]尽可能使字符串相等","frequency":16.90034257139293,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5328343130051433,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":35.160696630590536,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.44834819087572103,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":13.255053346128376,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6584968884633796,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1211]查询结果的质量和占比","frequency":17.544729672906715,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5149415331312256,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1212]查询球队积分","frequency":5.584581530503954,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7718943680948531,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1213]三个有序数组的交集","frequency":18.914641452403927,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6326490713587488,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":8.725461006626777,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.40895328719723184,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":15.108166890105792,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5333076626877166,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1216]验证回文字符串 III","frequency":0.0,"frontendQuestionId":"1216","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 III","titleSlug":"valid-palindrome-iii"},{"acceptance":0.6950250220783044,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":35.160696630590536,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.42100576217915137,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1218]最长定差子序列","frequency":0.0,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6306735190695159,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.46419146508039,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.526440962506995,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1220]统计元音字母序列的数目","frequency":0.0,"frontendQuestionId":"1220","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计元音字母序列的数目","titleSlug":"count-vowels-permutation"},{"acceptance":0.8046392975794969,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[1221]分割平衡字符串","frequency":16.280516258406706,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6721470019342359,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1222]可以攻击国王的皇后","frequency":0.0,"frontendQuestionId":"1222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以攻击国王的皇后","titleSlug":"queens-that-can-attack-the-king"},{"acceptance":0.4739522700814901,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1223]掷骰子模拟","frequency":0.0,"frontendQuestionId":"1223","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掷骰子模拟","titleSlug":"dice-roll-simulation"},{"acceptance":0.3253905971320539,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1224]最大相等频率","frequency":26.59911431794164,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5450855832009882,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1225]报告系统状态的连续日期","frequency":19.644440068773637,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6005619168787107,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1226]哲学家进餐","frequency":49.138858509367935,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6620341985148852,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1227]飞机座位分配概率","frequency":4.508192885707507,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5392792792792793,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1228]等差数列中缺失的数字","frequency":0.0,"frontendQuestionId":"1228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等差数列中缺失的数字","titleSlug":"missing-number-in-arithmetic-progression"},{"acceptance":0.41447009634611887,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1229]安排会议日程","frequency":0.0,"frontendQuestionId":"1229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排会议日程","titleSlug":"meeting-scheduler"},{"acceptance":0.48819875776397514,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1230]抛掷硬币","frequency":0.0,"frontendQuestionId":"1230","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"抛掷硬币","titleSlug":"toss-strange-coins"},{"acceptance":0.555956678700361,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1231]分享巧克力","frequency":19.644440068773637,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46924579474712275,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1232]缀点成线","frequency":16.280516258406706,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48165829145728645,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.755948795401358,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34144886024585275,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1234]替换子串得到平衡字符串","frequency":5.035346114169862,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4520384645950886,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1235]规划兼职工作","frequency":39.52902380316885,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.559322033898305,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1236]网络爬虫","frequency":0.0,"frontendQuestionId":"1236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络爬虫","titleSlug":"web-crawler"},{"acceptance":0.7116638321995464,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1237]找出给定方程的正整数解","frequency":0.0,"frontendQuestionId":"1237","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出给定方程的正整数解","titleSlug":"find-positive-integer-solution-for-a-given-equation"},{"acceptance":0.6557123952359947,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":6.755948795401358,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.49065111870637906,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[1239]串联字符串的最大长度","frequency":41.899442402635756,"frontendQuestionId":"1239","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"串联字符串的最大长度","titleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters"},{"acceptance":0.4941696823482107,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":26.59911431794164,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5971959828974843,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1241]每个帖子的评论数","frequency":0.0,"frontendQuestionId":"1241","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个帖子的评论数","titleSlug":"number-of-comments-per-post"},{"acceptance":0.4669275929549902,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":22.04306144393415,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5393641988478771,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6202836499866203,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":10.971102305583493,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5066447663132746,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.755948795401358,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4798864964112836,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1246]删除回文子数组","frequency":13.255053346128376,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6159301283965363,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1247]交换字符使得字符串相同","frequency":25.17267506260245,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5588813452929613,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[1248]统计「优美子数组」","frequency":23.852768504985672,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5719363942255509,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1249]移除无效的括号","frequency":36.764101691472966,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5604986030517946,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1250]检查「好数组」","frequency":21.204771953806695,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7719813614262561,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":5.035346114169862,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497144790829491,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[1252]奇数值单元格的数目","frequency":0.0,"frontendQuestionId":"1252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"奇数值单元格的数目","titleSlug":"cells-with-odd-values-in-a-matrix"},{"acceptance":0.3935548377172743,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":18.914641452403927,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5986409279778393,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.508192885707507,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6769562096195262,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1255]得分最高的单词集合","frequency":0.0,"frontendQuestionId":"1255","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得分最高的单词集合","titleSlug":"maximum-score-words-formed-by-letters"},{"acceptance":0.6631205673758865,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1256]加密数字","frequency":0.0,"frontendQuestionId":"1256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加密数字","titleSlug":"encode-number"},{"acceptance":0.5634517766497462,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1257]最小公共区域","frequency":0.0,"frontendQuestionId":"1257","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小公共区域","titleSlug":"smallest-common-region"},{"acceptance":0.5590994371482176,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1258]近义词句子","frequency":0.0,"frontendQuestionId":"1258","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"近义词句子","titleSlug":"synonymous-sentences"},{"acceptance":0.47541388682975044,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":12.493736332613416,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6034707593539974,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1260]二维网格迁移","frequency":0.0,"frontendQuestionId":"1260","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格迁移","titleSlug":"shift-2d-grid"},{"acceptance":0.72875,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1261]在受污染的二叉树中查找元素","frequency":0.0,"frontendQuestionId":"1261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在受污染的二叉树中查找元素","titleSlug":"find-elements-in-a-contaminated-binary-tree"},{"acceptance":0.5260741364785173,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1262]可被三整除的最大和","frequency":43.88889094207611,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41558624577226605,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":9.448468278553571,"frontendQuestionId":"1263","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"推箱子","titleSlug":"minimum-moves-to-move-a-box-to-their-target-location"},{"acceptance":0.5726463582800552,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1264]页面推荐","frequency":6.755948795401358,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.919360568383659,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1265]逆序打印不可变链表","frequency":8.725461006626777,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8238446081714669,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1266]访问所有点的最小时间","frequency":24.500338269107854,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6083780160857909,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1267]统计参与通信的服务器","frequency":0.0,"frontendQuestionId":"1267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计参与通信的服务器","titleSlug":"count-servers-that-communicate"},{"acceptance":0.581178105458195,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1268]搜索推荐系统","frequency":6.157517045032444,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49174161896974655,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":46.99183378455747,"frontendQuestionId":"1269","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"停在原地的方案数","titleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps"},{"acceptance":0.8051746076629436,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":5.035346114169862,"frontendQuestionId":"1270","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向公司CEO汇报工作的所有人","titleSlug":"all-people-report-to-the-given-manager"},{"acceptance":0.505380882042625,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5182091546942866,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1272]删除区间","frequency":0.0,"frontendQuestionId":"1272","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除区间","titleSlug":"remove-interval"},{"acceptance":0.5410128388017118,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1273]删除树节点","frequency":0.0,"frontendQuestionId":"1273","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除树节点","titleSlug":"delete-tree-nodes"},{"acceptance":0.5983554712207464,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1274]矩形内船只的数目","frequency":0.0,"frontendQuestionId":"1274","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形内船只的数目","titleSlug":"number-of-ships-in-a-rectangle"},{"acceptance":0.5401564093845631,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.90034257139293,"frontendQuestionId":"1275","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出井字棋的获胜者","titleSlug":"find-winner-on-a-tic-tac-toe-game"},{"acceptance":0.5011816606270679,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1276]不浪费原料的汉堡制作方案","frequency":0.0,"frontendQuestionId":"1276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不浪费原料的汉堡制作方案","titleSlug":"number-of-burgers-with-no-waste-of-ingredients"},{"acceptance":0.7244926327495135,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":23.852768504985672,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5957704974865661,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1278]分割回文串 III","frequency":59.53404428978739,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6224406224406225,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":9.448468278553571,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5057971014492754,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1280]学生们参加各科测试的次数","frequency":16.280516258406706,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8315615358881909,"acs":0,"articleLive":2,"columnArticles":606,"formTitle":"[1281]整数的各位积和之差","frequency":5.584581530503954,"frontendQuestionId":"1281","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的各位积和之差","titleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer"},{"acceptance":0.8113658070678128,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[1282]用户分组","frequency":6.157517045032444,"frontendQuestionId":"1282","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户分组","titleSlug":"group-the-people-given-the-group-size-they-belong-to"},{"acceptance":0.4164413860899484,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.544729672906715,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.659037095501184,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":18.914641452403927,"frontendQuestionId":"1284","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"转化为全零矩阵的最少反转次数","titleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix"},{"acceptance":0.8128689492325856,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1285]找到连续区间的开始和结束数字","frequency":0.0,"frontendQuestionId":"1285","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到连续区间的开始和结束数字","titleSlug":"find-the-start-and-end-number-of-continuous-ranges"},{"acceptance":0.6448598130841121,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":16.90034257139293,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6052843888664784,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.90034257139293,"frontendQuestionId":"1287","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中出现次数超过25%的元素","titleSlug":"element-appearing-more-than-25-in-sorted-array"},{"acceptance":0.5634854407308182,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1288]删除被覆盖区间","frequency":34.46419146508039,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6279411764705882,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1289]下降路径最小和 II","frequency":0.0,"frontendQuestionId":"1289","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和 II","titleSlug":"minimum-falling-path-sum-ii"},{"acceptance":0.8090895037872933,"acs":0,"articleLive":2,"columnArticles":686,"formTitle":"[1290]二进制链表转整数","frequency":0.0,"frontendQuestionId":"1290","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制链表转整数","titleSlug":"convert-binary-number-in-a-linked-list-to-integer"},{"acceptance":0.5180704441041347,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4680277664352797,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.157517045032444,"frontendQuestionId":"1292","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元素和小于等于阈值的正方形的最大边长","titleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold"},{"acceptance":0.35629631765621844,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":55.35979622290369,"frontendQuestionId":"1293","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格中的最短路径","titleSlug":"shortest-path-in-a-grid-with-obstacles-elimination"},{"acceptance":0.6605981794538361,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1294]不同国家的天气类型","frequency":0.0,"frontendQuestionId":"1294","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不同国家的天气类型","titleSlug":"weather-type-in-each-country"},{"acceptance":0.809447983014862,"acs":0,"articleLive":2,"columnArticles":627,"formTitle":"[1295]统计位数为偶数的数字","frequency":5.584581530503954,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45307306460385566,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1296]划分数组为连续数字的集合","frequency":0.0,"frontendQuestionId":"1296","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数组为连续数字的集合","titleSlug":"divide-array-in-sets-of-k-consecutive-numbers"},{"acceptance":0.45897211271718497,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1297]子串的最大出现次数","frequency":27.357495492808276,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5956221198156681,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1298]你能从盒子里获得的最大糖果数","frequency":0.0,"frontendQuestionId":"1298","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能从盒子里获得的最大糖果数","titleSlug":"maximum-candies-you-can-get-from-boxes"},{"acceptance":0.7854438367690366,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[1299]将每个元素替换为右侧最大元素","frequency":0.0,"frontendQuestionId":"1299","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将每个元素替换为右侧最大元素","titleSlug":"replace-elements-with-greatest-element-on-right-side"},{"acceptance":0.4671764705882353,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":5.584581530503954,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3585084906780667,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1301]最大得分的路径数目","frequency":0.0,"frontendQuestionId":"1301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分的路径数目","titleSlug":"number-of-paths-with-max-score"},{"acceptance":0.8165216642260316,"acs":0,"articleLive":2,"columnArticles":286,"formTitle":"[1302]层数最深叶子节点的和","frequency":25.17267506260245,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8215646059185467,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1303]求团队人数","frequency":0.0,"frontendQuestionId":"1303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求团队人数","titleSlug":"find-the-team-size"},{"acceptance":0.7253405804675795,"acs":0,"articleLive":2,"columnArticles":374,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.035346114169862,"frontendQuestionId":"1304","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为零的N个唯一整数","titleSlug":"find-n-unique-integers-sum-up-to-zero"},{"acceptance":0.7469626287999179,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.584581530503954,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5774026605536452,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1306]跳跃游戏 III","frequency":25.17267506260245,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33161099833917695,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1307]口算难题","frequency":0.0,"frontendQuestionId":"1307","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"口算难题","titleSlug":"verbal-arithmetic-puzzle"},{"acceptance":0.7513845232749589,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1308]不同性别每日分数总计","frequency":6.157517045032444,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7550991962087069,"acs":0,"articleLive":2,"columnArticles":282,"formTitle":"[1309]解码字母到整数映射","frequency":0.0,"frontendQuestionId":"1309","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解码字母到整数映射","titleSlug":"decrypt-string-from-alphabet-to-integer-mapping"},{"acceptance":0.7125842435510109,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":53.094999639925724,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3771935957491435,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.755948795401358,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6664651350261991,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":33.79257218300203,"frontendQuestionId":"1312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"让字符串成为回文串的最少插入次数","titleSlug":"minimum-insertion-steps-to-make-a-string-palindrome"},{"acceptance":0.8310957124296232,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[1313]解压缩编码列表","frequency":5.584581530503954,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7348116860260472,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1314]矩阵区域和","frequency":35.160696630590536,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8098254686489981,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[1315]祖父节点值为偶数的节点和","frequency":0.0,"frontendQuestionId":"1315","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"祖父节点值为偶数的节点和","titleSlug":"sum-of-nodes-with-even-valued-grandparent"},{"acceptance":0.43758148631029986,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1316]不同的循环子字符串","frequency":0.0,"frontendQuestionId":"1316","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的循环子字符串","titleSlug":"distinct-echo-substrings"},{"acceptance":0.6144451332920025,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1317]将整数转换为两个无零整数的和","frequency":0.0,"frontendQuestionId":"1317","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将整数转换为两个无零整数的和","titleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers"},{"acceptance":0.650021616947687,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1318]或运算的最小翻转次数","frequency":65.56026919650668,"frontendQuestionId":"1318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"或运算的最小翻转次数","titleSlug":"minimum-flips-to-make-a-or-b-equal-to-c"},{"acceptance":0.6173488162898148,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[1319]连通网络的操作次数","frequency":6.157517045032444,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5879188065541697,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1320]二指输入的的最小距离","frequency":0.0,"frontendQuestionId":"1320","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二指输入的的最小距离","titleSlug":"minimum-distance-to-type-a-word-using-two-fingers"},{"acceptance":0.6172931213786956,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[1321]餐馆营业额变化增长","frequency":0.0,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5925750768503192,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1322]广告效果","frequency":0.0,"frontendQuestionId":"1322","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"广告效果","titleSlug":"ads-performance"},{"acceptance":0.7555782551792384,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.500338269107854,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5926078451559765,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[1324]竖直打印单词","frequency":0.0,"frontendQuestionId":"1324","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"竖直打印单词","titleSlug":"print-words-vertically"},{"acceptance":0.728573546856465,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1325]删除给定值的叶子节点","frequency":5.584581530503954,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47616562282533054,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":8.037543813788469,"frontendQuestionId":"1326","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"灌溉花园的最少水龙头数目","titleSlug":"minimum-number-of-taps-to-open-to-water-a-garden"},{"acceptance":0.6922463093496476,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1327]列出指定时间段内所有的下单产品","frequency":0.0,"frontendQuestionId":"1327","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"列出指定时间段内所有的下单产品","titleSlug":"list-the-products-ordered-in-a-period"},{"acceptance":0.45776741943261273,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.280516258406706,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7709115739160123,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.157517045032444,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.37740863787375417,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":15.108166890105792,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5353043152321604,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1331]数组序号转换","frequency":16.280516258406706,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6836588492572204,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.584581530503954,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5427516711563404,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1333]餐厅过滤器","frequency":0.0,"frontendQuestionId":"1333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐厅过滤器","titleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance"},{"acceptance":0.4898630136986301,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":50.36880399666648,"frontendQuestionId":"1334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"阈值距离内邻居最少的城市","titleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance"},{"acceptance":0.583916083916084,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1335]工作计划的最低难度","frequency":0.0,"frontendQuestionId":"1335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"工作计划的最低难度","titleSlug":"minimum-difficulty-of-a-job-schedule"},{"acceptance":0.4226546906187625,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1336]每次访问的交易次数","frequency":0.0,"frontendQuestionId":"1336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每次访问的交易次数","titleSlug":"number-of-transactions-per-visit"},{"acceptance":0.7066227980998503,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":36.131248720112566,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6401749908858914,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":5.035346114169862,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3966389054134444,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":7.381878117988307,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5718336483931947,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1340]跳跃游戏 V","frequency":0.0,"frontendQuestionId":"1340","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 V","titleSlug":"jump-game-v"},{"acceptance":0.4797653076575899,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1341]电影评分","frequency":0.0,"frontendQuestionId":"1341","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"电影评分","titleSlug":"movie-rating"},{"acceptance":0.8204182041820418,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[1342]将数字变成 0 的操作次数","frequency":0.0,"frontendQuestionId":"1342","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将数字变成 0 的操作次数","titleSlug":"number-of-steps-to-reduce-a-number-to-zero"},{"acceptance":0.5426168386369549,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1343]大小为 K 且平均值大于等于阈值的子数组数目","frequency":0.0,"frontendQuestionId":"1343","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 且平均值大于等于阈值的子数组数目","titleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold"},{"acceptance":0.5939169749280724,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1344]时钟指针的夹角","frequency":6.755948795401358,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.36722793684072597,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1345]跳跃游戏 IV","frequency":6.755948795401358,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.43591888539533274,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1346]检查整数及其两倍数是否存在","frequency":0.0,"frontendQuestionId":"1346","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查整数及其两倍数是否存在","titleSlug":"check-if-n-and-its-double-exist"},{"acceptance":0.7383986769140967,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1347]制造字母异位词的最小步骤数","frequency":0.0,"frontendQuestionId":"1347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制造字母异位词的最小步骤数","titleSlug":"minimum-number-of-steps-to-make-two-strings-anagram"},{"acceptance":0.30296127562642367,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1348]推文计数","frequency":8.037543813788469,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5021760964178105,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1349]参加考试的最大学生数","frequency":6.755948795401358,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8478031263202366,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.584581530503954,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7547826086956522,"acs":0,"articleLive":2,"columnArticles":538,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.035346114169862,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44169096209912534,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.755948795401358,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2823841610947785,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.5108701133377,"frontendQuestionId":"1353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目","titleSlug":"maximum-number-of-events-that-can-be-attended"},{"acceptance":0.28549587198043014,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1354]多次求和构造目标数组","frequency":0.0,"frontendQuestionId":"1354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"多次求和构造目标数组","titleSlug":"construct-target-array-with-multiple-sums"},{"acceptance":0.6625597646193453,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7316411548149584,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":15.683616972716724,"frontendQuestionId":"1356","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据数字二进制下 1 的数目排序","titleSlug":"sort-integers-by-the-number-of-1-bits"},{"acceptance":0.5280883367839889,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1357]每隔 n 个顾客打折","frequency":0.0,"frontendQuestionId":"1357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每隔 n 个顾客打折","titleSlug":"apply-discount-every-n-orders"},{"acceptance":0.48685536319501693,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.584581530503954,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5447518307567127,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1359]有效的快递序列数目","frequency":0.0,"frontendQuestionId":"1359","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的快递序列数目","titleSlug":"count-all-valid-pickup-and-delivery-options"},{"acceptance":0.5040515653775323,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1360]日期之间隔几天","frequency":34.46419146508039,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40135021097046414,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1361]验证二叉树","frequency":5.584581530503954,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5229292207128996,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1362]最接近的因数","frequency":0.0,"frontendQuestionId":"1362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的因数","titleSlug":"closest-divisors"},{"acceptance":0.3610164239231484,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":35.160696630590536,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6753524134985049,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.584581530503954,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250661733594419,"acs":0,"articleLive":2,"columnArticles":1076,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.500338269107854,"frontendQuestionId":"1365","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有多少小于当前数字的数字","titleSlug":"how-many-numbers-are-smaller-than-the-current-number"},{"acceptance":0.5369111788141552,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1366]通过投票对团队排名","frequency":18.215489960376434,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41728834633209,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[1367]二叉树中的列表","frequency":16.280516258406706,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5195388531217248,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1368]使网格图至少有一条有效路径的最小代价","frequency":0.0,"frontendQuestionId":"1368","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使网格图至少有一条有效路径的最小代价","titleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid"},{"acceptance":0.6069699903194579,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":6.157517045032444,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905296817270573,"acs":0,"articleLive":2,"columnArticles":571,"formTitle":"[1370]上升下降字符串","frequency":5.035346114169862,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5798410404624278,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.19203908581424,"frontendQuestionId":"1371","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个元音包含偶数次的最长子字符串","titleSlug":"find-the-longest-substring-containing-vowels-in-even-counts"},{"acceptance":0.512972234865726,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.584581530503954,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.39640239840106595,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":30.755546345579138,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7393683274021352,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[1374]生成每种字符都是奇数个的字符串","frequency":0.0,"frontendQuestionId":"1374","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成每种字符都是奇数个的字符串","titleSlug":"generate-a-string-with-characters-that-have-odd-counts"},{"acceptance":0.5715355295398856,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1375]灯泡开关 III","frequency":0.0,"frontendQuestionId":"1375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 III","titleSlug":"bulb-switcher-iii"},{"acceptance":0.5036729036729036,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1376]通知所有员工所需的时间","frequency":0.0,"frontendQuestionId":"1376","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通知所有员工所需的时间","titleSlug":"time-needed-to-inform-all-employees"},{"acceptance":0.3254660372829826,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1377]T 秒后青蛙的位置","frequency":0.0,"frontendQuestionId":"1377","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"T 秒后青蛙的位置","titleSlug":"frog-position-after-t-seconds"},{"acceptance":0.8612081877184223,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1378]使用唯一标识码替换员工ID","frequency":0.0,"frontendQuestionId":"1378","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用唯一标识码替换员工ID","titleSlug":"replace-employee-id-with-the-unique-identifier"},{"acceptance":0.8367313248039621,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1379]找出克隆二叉树中的相同节点","frequency":0.0,"frontendQuestionId":"1379","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出克隆二叉树中的相同节点","titleSlug":"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree"},{"acceptance":0.7275004473072106,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[1380]矩阵中的幸运数","frequency":0.0,"frontendQuestionId":"1380","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的幸运数","titleSlug":"lucky-numbers-in-a-matrix"},{"acceptance":0.7320739917641675,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1381]设计一个支持增量操作的栈","frequency":0.0,"frontendQuestionId":"1381","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个支持增量操作的栈","titleSlug":"design-a-stack-with-increment-operation"},{"acceptance":0.6899622935899102,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1382]将二叉搜索树变平衡","frequency":6.157517045032444,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3233359832333598,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":10.209785292068533,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5415321397123569,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1384]按年度列出销售总额","frequency":0.0,"frontendQuestionId":"1384","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按年度列出销售总额","titleSlug":"total-sales-amount-by-year"},{"acceptance":0.7040390349688262,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1385]两个数组间的距离值","frequency":5.584581530503954,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.30986933842896247,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1386]安排电影院座位","frequency":21.204771953806695,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6946922064629332,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":18.914641452403927,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5368648065777059,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":56.03400574149302,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8309762090249895,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.280516258406706,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.3511894574704775,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.3994068215521503,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":21.204771953806695,"frontendQuestionId":"1391","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查网格中是否存在有效路径","titleSlug":"check-if-there-is-a-valid-path-in-a-grid"},{"acceptance":0.39962855738242203,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1392]最长快乐前缀","frequency":5.584581530503954,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8570474281897128,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6640147862423658,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1394]找出数组中的幸运数","frequency":0.0,"frontendQuestionId":"1394","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组中的幸运数","titleSlug":"find-lucky-integer-in-an-array"},{"acceptance":0.7532982246593192,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1395]统计作战单位数","frequency":5.584581530503954,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4141932501155802,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1396]设计地铁系统","frequency":18.914641452403927,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.36771300448430494,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1397]找到所有好字符串","frequency":0.0,"frontendQuestionId":"1397","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有好字符串","titleSlug":"find-all-good-strings"},{"acceptance":0.7711563609191108,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1398]购买了产品 A 和产品 B 却没有购买产品 C 的顾客","frequency":0.0,"frontendQuestionId":"1398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"购买了产品 A 和产品 B 却没有购买产品 C 的顾客","titleSlug":"customers-who-bought-products-a-and-b-but-not-c"},{"acceptance":0.6676245210727969,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":0.0,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6047138047138048,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.584581530503954,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41676699135383605,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":7.381878117988307,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7512747875354108,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1402]做菜顺序","frequency":5.584581530503954,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6912437777703538,"acs":0,"articleLive":2,"columnArticles":355,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.280516258406706,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4919793555586553,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.381878117988307,"frontendQuestionId":"1404","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二进制表示减到 1 的步骤数","titleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one"},{"acceptance":0.5059417984467109,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1405]最长快乐字符串","frequency":17.544729672906715,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.568679656299165,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":7.381878117988307,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6674210839785587,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1407]排名靠前的旅行者","frequency":0.0,"frontendQuestionId":"1407","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排名靠前的旅行者","titleSlug":"top-travellers"},{"acceptance":0.6141878389951471,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1408]数组中的字符串匹配","frequency":0.0,"frontendQuestionId":"1408","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的字符串匹配","titleSlug":"string-matching-in-an-array"},{"acceptance":0.8048334687246141,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1409]查询带键的排列","frequency":0.0,"frontendQuestionId":"1409","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询带键的排列","titleSlug":"queries-on-a-permutation-with-key"},{"acceptance":0.4766074228959749,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1410]HTML 实体解析器","frequency":8.725461006626777,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5493639780283319,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":81.70998704610344,"frontendQuestionId":"1411","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给 N x 3 网格图涂色的方案数","titleSlug":"number-of-ways-to-paint-n-3-grid"},{"acceptance":0.5506785411365565,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1412]查找成绩处于中游的学生","frequency":0.0,"frontendQuestionId":"1412","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查找成绩处于中游的学生","titleSlug":"find-the-quiet-students-in-all-exams"},{"acceptance":0.6920106524633821,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.280516258406706,"frontendQuestionId":"1413","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"逐步求和得到正数的最小值","titleSlug":"minimum-value-to-get-positive-step-by-step-sum"},{"acceptance":0.601761744966443,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.500338269107854,"frontendQuestionId":"1414","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的最少斐波那契数字数目","titleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k"},{"acceptance":0.6847559021472065,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.157517045032444,"frontendQuestionId":"1415","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","titleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n"},{"acceptance":0.40808988764044946,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":23.852768504985672,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5185001856205915,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.157517045032444,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.732751739080853,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[1418]点菜展示表","frequency":49.881418845328895,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41798884496669736,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":30.755546345579138,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5933014354066986,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.852768504985672,"frontendQuestionId":"1420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成数组","titleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons"},{"acceptance":0.7474863544958346,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.540633608815427,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[1422]分割字符串的最大得分","frequency":30.06830524866882,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5546446754176223,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1423]可获得的最大点数","frequency":16.280516258406706,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3973436635307139,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1424]对角线遍历 II","frequency":17.544729672906715,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.4337691870380898,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.157517045032444,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7048755186721992,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1426]数元素","frequency":9.448468278553571,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6600660066006601,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1427]字符串的左右移","frequency":0.0,"frontendQuestionId":"1427","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的左右移","titleSlug":"perform-string-shifts"},{"acceptance":0.5926849542809642,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1428]至少有一个 1 的最左端列","frequency":0.0,"frontendQuestionId":"1428","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有一个 1 的最左端列","titleSlug":"leftmost-column-with-at-least-a-one"},{"acceptance":0.504,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1429]第一个唯一数字","frequency":0.0,"frontendQuestionId":"1429","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个唯一数字","titleSlug":"first-unique-number"},{"acceptance":0.5750224618149147,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1430]判断给定的序列是否是二叉树从根到叶的路径","frequency":0.0,"frontendQuestionId":"1430","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断给定的序列是否是二叉树从根到叶的路径","titleSlug":"check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree"},{"acceptance":0.8462200341999498,"acs":0,"articleLive":2,"columnArticles":1023,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.584581530503954,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.39215861391444135,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1432]改变一个整数能得到的最大差值","frequency":0.0,"frontendQuestionId":"1432","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变一个整数能得到的最大差值","titleSlug":"max-difference-you-can-get-from-changing-an-integer"},{"acceptance":0.6415968239964711,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1433]检查一个字符串是否可以打破另一个字符串","frequency":0.0,"frontendQuestionId":"1433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否可以打破另一个字符串","titleSlug":"check-if-a-string-can-break-another-string"},{"acceptance":0.4515389026954693,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1434]每个人戴不同帽子的方案数","frequency":0.0,"frontendQuestionId":"1434","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每个人戴不同帽子的方案数","titleSlug":"number-of-ways-to-wear-different-hats-to-each-other"},{"acceptance":0.6201365729712561,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1435]制作会话柱状图","frequency":0.0,"frontendQuestionId":"1435","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"制作会话柱状图","titleSlug":"create-a-session-bar-chart"},{"acceptance":0.7833129016679669,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5887850467289719,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.157517045032444,"frontendQuestionId":"1437","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"是否所有 1 都至少相隔 k 个元素","titleSlug":"check-if-all-1s-are-at-least-length-k-places-away"},{"acceptance":0.48206077249119456,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":34.63591702641181,"frontendQuestionId":"1438","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绝对差不超过限制的最长连续子数组","titleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit"},{"acceptance":0.5618988520012411,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1439]有序矩阵中的第 k 个最小数组和","frequency":0.0,"frontendQuestionId":"1439","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序矩阵中的第 k 个最小数组和","titleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows"},{"acceptance":0.6962410171365395,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1440]计算布尔表达式的值","frequency":0.0,"frontendQuestionId":"1440","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算布尔表达式的值","titleSlug":"evaluate-boolean-expression"},{"acceptance":0.6471156346346718,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1441]用栈操作构建数组","frequency":7.381878117988307,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7918314782448717,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":53.79046038905465,"frontendQuestionId":"1442","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"形成两个异或相等数组的三元组数目","titleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor"},{"acceptance":0.41063925570228094,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1443]收集树上所有苹果的最少时间","frequency":0.0,"frontendQuestionId":"1443","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收集树上所有苹果的最少时间","titleSlug":"minimum-time-to-collect-all-apples-in-a-tree"},{"acceptance":0.5244407622203812,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1444]切披萨的方案数","frequency":0.0,"frontendQuestionId":"1444","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切披萨的方案数","titleSlug":"number-of-ways-of-cutting-a-pizza"},{"acceptance":0.8579963235294118,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5727106141051543,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.616632642097346,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7132610898885164,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":5.035346114169862,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6275108158220025,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.63583279905146,"frontendQuestionId":"1449","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数位成本和为目标值的最大数字","titleSlug":"form-largest-integer-with-digits-that-add-up-to-target"},{"acceptance":0.8022223727894844,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":4.508192885707507,"frontendQuestionId":"1450","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在既定时间做作业的学生人数","titleSlug":"number-of-students-doing-homework-at-a-given-time"},{"acceptance":0.5212069607790963,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1451]重新排列句子中的单词","frequency":7.381878117988307,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4976010966415353,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.381878117988307,"frontendQuestionId":"1452","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"收藏清单","titleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list"},{"acceptance":0.3626049466757431,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1453]圆形靶内的最大飞镖数量","frequency":0.0,"frontendQuestionId":"1453","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形靶内的最大飞镖数量","titleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard"},{"acceptance":0.40311728132186353,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1454]活跃用户","frequency":17.544729672906715,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6336822592956057,"acs":0,"articleLive":2,"columnArticles":196,"formTitle":"[1455]检查单词是否为句中其他单词的前缀","frequency":0.0,"frontendQuestionId":"1455","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查单词是否为句中其他单词的前缀","titleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence"},{"acceptance":0.5194977966242621,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1456]定长子串中元音的最大数目","frequency":0.0,"frontendQuestionId":"1456","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"定长子串中元音的最大数目","titleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length"},{"acceptance":0.636549635813078,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1457]二叉树中的伪回文路径","frequency":0.0,"frontendQuestionId":"1457","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的伪回文路径","titleSlug":"pseudo-palindromic-paths-in-a-binary-tree"},{"acceptance":0.44028178033941723,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1458]两个子序列的最大点积","frequency":0.0,"frontendQuestionId":"1458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个子序列的最大点积","titleSlug":"max-dot-product-of-two-subsequences"},{"acceptance":0.5940539038621839,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7442931517821386,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5005292872265349,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1461]检查一个字符串是否包含所有长度为 K 的二进制子串","frequency":0.0,"frontendQuestionId":"1461","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","titleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k"},{"acceptance":0.4251854006107314,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1462]课程表 IV","frequency":5.584581530503954,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5907761529808774,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.448468278553571,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7682067580127725,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1464]数组中两元素的最大乘积","frequency":5.584581530503954,"frontendQuestionId":"1464","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中两元素的最大乘积","titleSlug":"maximum-product-of-two-elements-in-an-array"},{"acceptance":0.30766543567222276,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1465]切割后面积最大的蛋糕","frequency":0.0,"frontendQuestionId":"1465","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"切割后面积最大的蛋糕","titleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts"},{"acceptance":0.485439949630096,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":18.215489960376434,"frontendQuestionId":"1466","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新规划路线","titleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero"},{"acceptance":0.6127300613496932,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1467]两个盒子中球的颜色数相同的概率","frequency":0.0,"frontendQuestionId":"1467","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个盒子中球的颜色数相同的概率","titleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls"},{"acceptance":0.7123601220752798,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.803291236127057,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1469]寻找所有的独生节点","frequency":0.0,"frontendQuestionId":"1469","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找所有的独生节点","titleSlug":"find-all-the-lonely-nodes"},{"acceptance":0.8434497117232543,"acs":0,"articleLive":2,"columnArticles":720,"formTitle":"[1470]重新排列数组","frequency":41.899442402635756,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.5417385434635866,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1471]数组中的 k 个最强值","frequency":0.0,"frontendQuestionId":"1471","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的 k 个最强值","titleSlug":"the-k-strongest-values-in-an-array"},{"acceptance":0.616120104000671,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1472]设计浏览器历史记录","frequency":0.0,"frontendQuestionId":"1472","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计浏览器历史记录","titleSlug":"design-browser-history"},{"acceptance":0.6750647412544442,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.901209044540124,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7198581560283688,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1474]删除链表 M 个节点之后的 N 个节点","frequency":0.0,"frontendQuestionId":"1474","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表 M 个节点之后的 N 个节点","titleSlug":"delete-n-nodes-after-m-nodes-of-a-linked-list"},{"acceptance":0.7245787029790787,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[1475]商品折扣后的最终价格","frequency":0.0,"frontendQuestionId":"1475","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"商品折扣后的最终价格","titleSlug":"final-prices-with-a-special-discount-in-a-shop"},{"acceptance":0.8653243224413014,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1476]子矩形查询","frequency":18.914641452403927,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2890980681678356,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":19.644440068773637,"frontendQuestionId":"1477","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找两个和为目标值且不重叠的子数组","titleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum"},{"acceptance":0.5748261162216738,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1478]安排邮筒","frequency":27.357495492808276,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5734463276836158,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":7.381878117988307,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8694262261271295,"acs":0,"articleLive":2,"columnArticles":1269,"formTitle":"[1480]一维数组的动态和","frequency":32.672284984952135,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5117953028949719,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1481]不同整数的最少数目","frequency":34.46419146508039,"frontendQuestionId":"1481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同整数的最少数目","titleSlug":"least-number-of-unique-integers-after-k-removals"},{"acceptance":0.5871052832785381,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":49.881418845328895,"frontendQuestionId":"1482","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"制作 m 束花所需的最少天数","titleSlug":"minimum-number-of-days-to-make-m-bouquets"},{"acceptance":0.30105501130369255,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1483]树节点的第 K 个祖先","frequency":0.0,"frontendQuestionId":"1483","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点的第 K 个祖先","titleSlug":"kth-ancestor-of-a-tree-node"},{"acceptance":0.8032432432432433,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1484]克隆含随机指针的二叉树","frequency":0.0,"frontendQuestionId":"1484","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆含随机指针的二叉树","titleSlug":"clone-binary-tree-with-random-pointer"},{"acceptance":0.6604407919312664,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1485]按日期分组销售产品","frequency":0.0,"frontendQuestionId":"1485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按日期分组销售产品","titleSlug":"group-sold-products-by-the-date"},{"acceptance":0.8585885713588144,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":48.423055088855605,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.3082574078634162,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1487]保证文件名唯一","frequency":25.17267506260245,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23509709723255973,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1488]避免洪水泛滥","frequency":60.49013848828218,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6927740058195926,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1489]找到最小生成树里的关键边和伪关键边","frequency":0.0,"frontendQuestionId":"1489","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最小生成树里的关键边和伪关键边","titleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree"},{"acceptance":0.85546875,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1490]克隆 N 叉树","frequency":0.0,"frontendQuestionId":"1490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"克隆 N 叉树","titleSlug":"clone-n-ary-tree"},{"acceptance":0.6715489843857952,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[1491]去掉最低工资和最高工资后的工资平均值","frequency":0.0,"frontendQuestionId":"1491","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"去掉最低工资和最高工资后的工资平均值","titleSlug":"average-salary-excluding-the-minimum-and-maximum-salary"},{"acceptance":0.6667024128686327,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1492]n 的第 k 个因子","frequency":0.0,"frontendQuestionId":"1492","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n 的第 k 个因子","titleSlug":"the-kth-factor-of-n"},{"acceptance":0.5667270293677663,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":23.852768504985672,"frontendQuestionId":"1493","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删掉一个元素以后全为 1 的最长子数组","titleSlug":"longest-subarray-of-1s-after-deleting-one-element"},{"acceptance":0.3620305264963128,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1494]并行课程 II","frequency":28.149272277419424,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428989751098097,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1495]上月播放的儿童适宜电影","frequency":0.0,"frontendQuestionId":"1495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上月播放的儿童适宜电影","titleSlug":"friendly-movies-streamed-last-month"},{"acceptance":0.5387555419660602,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1496]判断路径是否相交","frequency":4.508192885707507,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.3919082735629862,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1497]检查数组对是否可以被 k 整除","frequency":0.0,"frontendQuestionId":"1497","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组对是否可以被 k 整除","titleSlug":"check-if-array-pairs-are-divisible-by-k"},{"acceptance":0.3327596478453697,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1498]满足条件的子序列数目","frequency":20.4057570822886,"frontendQuestionId":"1498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足条件的子序列数目","titleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition"},{"acceptance":0.37696720105897924,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1499]满足不等式的最大值","frequency":0.0,"frontendQuestionId":"1499","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"满足不等式的最大值","titleSlug":"max-value-of-equation"},{"acceptance":0.2908481073310973,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1500]设计文件分享系统","frequency":0.0,"frontendQuestionId":"1500","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计文件分享系统","titleSlug":"design-a-file-sharing-system"},{"acceptance":0.5912814963672901,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1501]可以放心投资的国家","frequency":23.852768504985672,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7176641066512099,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[1502]判断能否形成等差数列","frequency":33.79257218300203,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5118071699498348,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.215489960376434,"frontendQuestionId":"1503","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有蚂蚁掉下来前的最后一刻","titleSlug":"last-moment-before-all-ants-fall-out-of-a-plank"},{"acceptance":0.5937343776037327,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1504]统计全 1 子矩形","frequency":33.79257218300203,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.35984763611920234,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":33.79257218300203,"frontendQuestionId":"1505","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多 K 次交换相邻数位后得到的最小整数","titleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits"},{"acceptance":0.8427876823338736,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1506]找到 N 叉树的根节点","frequency":29.405911010575036,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5900909495643325,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1507]转变日期格式","frequency":30.06830524866882,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5526758982035929,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1508]子数组和排序后的区间和","frequency":7.381878117988307,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5438334100322135,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1509]三次操作后最大值与最小值的最小差","frequency":0.0,"frontendQuestionId":"1509","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三次操作后最大值与最小值的最小差","titleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves"},{"acceptance":0.5765776412195699,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1510]石子游戏 IV","frequency":29.405911010575036,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6812312046700867,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.157517045032444,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8485392332813557,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[1512]好数对的数目","frequency":4.508192885707507,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37862109934654226,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":5.584581530503954,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31517747858017137,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1514]概率最大的路径","frequency":0.0,"frontendQuestionId":"1514","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"概率最大的路径","titleSlug":"path-with-maximum-probability"},{"acceptance":0.34122961657117673,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":10.971102305583493,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5804020100502513,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1516]移动 N 叉树的子树","frequency":0.0,"frontendQuestionId":"1516","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移动 N 叉树的子树","titleSlug":"move-sub-tree-of-n-ary-tree"},{"acceptance":0.7291099000908265,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1517]查找拥有有效邮箱的用户","frequency":0.0,"frontendQuestionId":"1517","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找拥有有效邮箱的用户","titleSlug":"find-users-with-valid-e-mails"},{"acceptance":0.6754020920031493,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1518]换酒问题","frequency":25.17267506260245,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2957669349980833,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1519]子树中标签相同的节点数","frequency":0.0,"frontendQuestionId":"1519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树中标签相同的节点数","titleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label"},{"acceptance":0.3309555854643338,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1520]最多的不重叠子字符串","frequency":0.0,"frontendQuestionId":"1520","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多的不重叠子字符串","titleSlug":"maximum-number-of-non-overlapping-substrings"},{"acceptance":0.39575702075702074,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":14.016370359643338,"frontendQuestionId":"1521","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最接近目标值的函数值","titleSlug":"find-a-value-of-a-mysterious-function-closest-to-target"},{"acceptance":0.7033333333333334,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1522]N 叉树的直径","frequency":0.0,"frontendQuestionId":"1522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的直径","titleSlug":"diameter-of-n-ary-tree"},{"acceptance":0.5777483921380057,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1523]在区间范围内统计奇数数目","frequency":0.0,"frontendQuestionId":"1523","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"在区间范围内统计奇数数目","titleSlug":"count-odd-numbers-in-an-interval-range"},{"acceptance":0.42363218390804597,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.280516258406706,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6595305648697446,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1525]字符串的好分割数目","frequency":6.157517045032444,"frontendQuestionId":"1525","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的好分割数目","titleSlug":"number-of-good-ways-to-split-a-string"},{"acceptance":0.6113926616663288,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1526]形成目标数组的子数组最少增加次数","frequency":0.0,"frontendQuestionId":"1526","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成目标数组的子数组最少增加次数","titleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array"},{"acceptance":0.5076203410291232,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1527]患某种疾病的患者","frequency":0.0,"frontendQuestionId":"1527","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"患某种疾病的患者","titleSlug":"patients-with-a-condition"},{"acceptance":0.7843074373981133,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[1528]重新排列字符串","frequency":15.683616972716724,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.688534931398833,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1529]灯泡开关 IV","frequency":5.584581530503954,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5660942492012779,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":17.544729672906715,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3238822246455834,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":20.4057570822886,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6207323107372588,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1532]最近的三笔订单","frequency":5.584581530503954,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6137931034482759,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1533]找到最大整数的索引","frequency":0.0,"frontendQuestionId":"1533","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最大整数的索引","titleSlug":"find-the-index-of-the-large-integer"},{"acceptance":0.7889679212398134,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.584581530503954,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45264217762655373,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.381878117988307,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.438819026790596,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1536]排布二进制网格的最少交换次数","frequency":0.0,"frontendQuestionId":"1536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排布二进制网格的最少交换次数","titleSlug":"minimum-swaps-to-arrange-a-binary-grid"},{"acceptance":0.36538785125357565,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1537]最大得分","frequency":0.0,"frontendQuestionId":"1537","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大得分","titleSlug":"get-the-maximum-score"},{"acceptance":0.5978260869565217,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1538]找出隐藏数组中出现次数最多的元素","frequency":0.0,"frontendQuestionId":"1538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出隐藏数组中出现次数最多的元素","titleSlug":"guess-the-majority-in-a-hidden-array"},{"acceptance":0.537848742973411,"acs":0,"articleLive":2,"columnArticles":233,"formTitle":"[1539]第 k 个缺失的正整数","frequency":58.06063764944837,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.316106171023601,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1540]K 次操作转变字符串","frequency":0.0,"frontendQuestionId":"1540","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次操作转变字符串","titleSlug":"can-convert-string-in-k-moves"},{"acceptance":0.45799545896853716,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1541]平衡括号字符串的最少插入次数","frequency":0.0,"frontendQuestionId":"1541","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平衡括号字符串的最少插入次数","titleSlug":"minimum-insertions-to-balance-a-parentheses-string"},{"acceptance":0.38072519083969464,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1542]找出最长的超赞子字符串","frequency":0.0,"frontendQuestionId":"1542","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出最长的超赞子字符串","titleSlug":"find-longest-awesome-substring"},{"acceptance":0.5480271024312475,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1543]产品名称格式修复","frequency":0.0,"frontendQuestionId":"1543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品名称格式修复","titleSlug":"fix-product-name-format"},{"acceptance":0.5438769874720228,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[1544]整理字符串","frequency":23.852768504985672,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5524803387779794,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.544729672906715,"frontendQuestionId":"1545","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 N 个二进制字符串中的第 K 位","titleSlug":"find-kth-bit-in-nth-binary-string"},{"acceptance":0.4105393165911898,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1546]和为目标值且不重叠的非空子数组的最大数目","frequency":0.0,"frontendQuestionId":"1546","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为目标值且不重叠的非空子数组的最大数目","titleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target"},{"acceptance":0.5346655791190864,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":26.59911431794164,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7130620985010707,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1548]图中最相似的路径","frequency":0.0,"frontendQuestionId":"1548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"图中最相似的路径","titleSlug":"the-most-similar-path-in-a-graph"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1549]每件商品的最新订单","frequency":5.584581530503954,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6603328444812855,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.584581530503954,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8177317731773177,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.584581530503954,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5069145845438698,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1552]两球之间的磁力","frequency":16.90034257139293,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.293847602605352,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":59.79036506755462,"frontendQuestionId":"1553","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"吃掉 N 个橘子的最少天数","titleSlug":"minimum-number-of-days-to-eat-n-oranges"},{"acceptance":0.7013372956909361,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1554]只有一个不同字符的字符串","frequency":0.0,"frontendQuestionId":"1554","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有一个不同字符的字符串","titleSlug":"strings-differ-by-one-character"},{"acceptance":0.4348484848484849,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1555]银行账户概要","frequency":0.0,"frontendQuestionId":"1555","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要","titleSlug":"bank-account-summary"},{"acceptance":0.5797298061161043,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[1556]千位分隔数","frequency":45.58955729509267,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7612193056731583,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1557]可以到达所有点的最少点数目","frequency":0.0,"frontendQuestionId":"1557","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达所有点的最少点数目","titleSlug":"minimum-number-of-vertices-to-reach-all-nodes"},{"acceptance":0.6213592233009708,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":8.037543813788469,"frontendQuestionId":"1558","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"得到目标数组的最少函数调用次数","titleSlug":"minimum-numbers-of-function-calls-to-make-target-array"},{"acceptance":0.36692247803358913,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1559]二维网格图中探测环","frequency":10.971102305583493,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5738744884038199,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.755948795401358,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7794422200745548,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.90034257139293,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.30949034691915084,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":10.209785292068533,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37805956944854024,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":43.39648205671752,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5865479723046488,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1564]把箱子放进仓库里 I","frequency":0.0,"frontendQuestionId":"1564","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 I","titleSlug":"put-boxes-into-the-warehouse-i"},{"acceptance":0.725708747274049,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":5.584581530503954,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460892877957804,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.584581530503954,"frontendQuestionId":"1566","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复至少 K 次且长度为 M 的模式","titleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times"},{"acceptance":0.3929097249128245,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":23.228329710626443,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45462827988338195,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1568]使陆地分离的最少天数","frequency":0.0,"frontendQuestionId":"1568","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使陆地分离的最少天数","titleSlug":"minimum-number-of-days-to-disconnect-island"},{"acceptance":0.4726801695713613,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1569]将子数组重新排序得到同一个二叉查找树的方案数","frequency":0.0,"frontendQuestionId":"1569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将子数组重新排序得到同一个二叉查找树的方案数","titleSlug":"number-of-ways-to-reorder-array-to-get-same-bst"},{"acceptance":0.9014267185473411,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1570]两个稀疏向量的点积","frequency":0.0,"frontendQuestionId":"1570","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个稀疏向量的点积","titleSlug":"dot-product-of-two-sparse-vectors"},{"acceptance":0.7571597633136095,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1571]仓库经理","frequency":0.0,"frontendQuestionId":"1571","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仓库经理","titleSlug":"warehouse-manager"},{"acceptance":0.8052072032978954,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1572]矩阵对角线元素的和","frequency":14.55282491827155,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955058485532526,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1573]分割字符串的方案数","frequency":0.0,"frontendQuestionId":"1573","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的方案数","titleSlug":"number-of-ways-to-split-a-string"},{"acceptance":0.326139948379696,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":35.160696630590536,"frontendQuestionId":"1574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除最短的子数组使剩余数组有序","titleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted"},{"acceptance":0.6000965561635018,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1575]统计所有可行路径","frequency":0.0,"frontendQuestionId":"1575","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计所有可行路径","titleSlug":"count-all-possible-routes"},{"acceptance":0.47594909110729566,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1576]替换所有的问号","frequency":6.157517045032444,"frontendQuestionId":"1576","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换所有的问号","titleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters"},{"acceptance":0.3237811203319502,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":10.209785292068533,"frontendQuestionId":"1577","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数的平方等于两数乘积的方法数","titleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers"},{"acceptance":0.5794835086173669,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1578]避免重复字母的最小删除成本","frequency":0.0,"frontendQuestionId":"1578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免重复字母的最小删除成本","titleSlug":"minimum-deletion-cost-to-avoid-repeating-letters"},{"acceptance":0.6198712479640115,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":22.04306144393415,"frontendQuestionId":"1579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"保证图可完全遍历","titleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable"},{"acceptance":0.6302083333333334,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1580]把箱子放进仓库里 II","frequency":0.0,"frontendQuestionId":"1580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把箱子放进仓库里 II","titleSlug":"put-boxes-into-the-warehouse-ii"},{"acceptance":0.8109786388474913,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1581]进店却未进行过交易的顾客","frequency":0.0,"frontendQuestionId":"1581","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"进店却未进行过交易的顾客","titleSlug":"customer-who-visited-but-did-not-make-any-transactions"},{"acceptance":0.6713301920985865,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.157517045032444,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6857068529805262,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":26.304534995018898,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6664365191066733,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[1584]连接所有点的最小费用","frequency":18.215489960376434,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42996502852935764,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1585]检查字符串是否可以通过排序子字符串得到另一个字符串","frequency":0.0,"frontendQuestionId":"1585","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","titleSlug":"check-if-string-is-transformable-with-substring-sort-operations"},{"acceptance":0.6274864376130199,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1586]二叉搜索树迭代器 II","frequency":0.0,"frontendQuestionId":"1586","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器 II","titleSlug":"binary-search-tree-iterator-ii"},{"acceptance":0.8253846153846154,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1587]银行账户概要 II","frequency":0.0,"frontendQuestionId":"1587","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"银行账户概要 II","titleSlug":"bank-account-summary-ii"},{"acceptance":0.8394526885303746,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[1588]所有奇数长度子数组的和","frequency":23.852768504985672,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2943122226704316,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":0.0,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26390378428068023,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1590]使数组和能被 P 整除","frequency":7.381878117988307,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5802603036876356,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1591]奇怪的打印机 II","frequency":0.0,"frontendQuestionId":"1591","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇怪的打印机 II","titleSlug":"strange-printer-ii"},{"acceptance":0.4447828943439049,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1592]重新排列单词间的空格","frequency":0.0,"frontendQuestionId":"1592","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列单词间的空格","titleSlug":"rearrange-spaces-between-words"},{"acceptance":0.5283018867924528,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.584581530503954,"frontendQuestionId":"1593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分字符串使唯一子字符串的数目最大","titleSlug":"split-a-string-into-the-max-number-of-unique-substrings"},{"acceptance":0.31323631323631324,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1594]矩阵的最大非负积","frequency":7.381878117988307,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46159657516998237,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1595]连通两组点的最小成本","frequency":0.0,"frontendQuestionId":"1595","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连通两组点的最小成本","titleSlug":"minimum-cost-to-connect-two-groups-of-points"},{"acceptance":0.7615176151761518,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1596]每位顾客最经常订购的商品","frequency":0.0,"frontendQuestionId":"1596","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位顾客最经常订购的商品","titleSlug":"the-most-frequently-ordered-products-for-each-customer"},{"acceptance":0.6609336609336609,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1597]根据中缀表达式构造二叉表达式树","frequency":0.0,"frontendQuestionId":"1597","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"根据中缀表达式构造二叉表达式树","titleSlug":"build-binary-expression-tree-from-infix-expression"},{"acceptance":0.6711214776523987,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.584581530503954,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4188308100342579,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1599]经营摩天轮的最大利润","frequency":0.0,"frontendQuestionId":"1599","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经营摩天轮的最大利润","titleSlug":"maximum-profit-of-operating-a-centennial-wheel"},{"acceptance":0.6816786079836233,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":18.215489960376434,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48288075560802834,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1601]最多可达成的换楼请求数目","frequency":0.0,"frontendQuestionId":"1601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可达成的换楼请求数目","titleSlug":"maximum-number-of-achievable-transfer-requests"},{"acceptance":0.7790123456790123,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1602]找到二叉树中最近的右侧节点","frequency":0.0,"frontendQuestionId":"1602","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中最近的右侧节点","titleSlug":"find-nearest-right-node-in-binary-tree"},{"acceptance":0.8449113908764303,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[1603]设计停车系统","frequency":61.606931920283714,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.4142443543717429,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1604]警告一小时内使用相同员工卡大于等于三次的人","frequency":0.0,"frontendQuestionId":"1604","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"警告一小时内使用相同员工卡大于等于三次的人","titleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period"},{"acceptance":0.7357935250169798,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3411486341148634,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1606]找到处理最多请求的服务器","frequency":0.0,"frontendQuestionId":"1606","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找到处理最多请求的服务器","titleSlug":"find-servers-that-handled-most-number-of-requests"},{"acceptance":0.5483206264166495,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1607]没有卖出的卖家","frequency":0.0,"frontendQuestionId":"1607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有卖出的卖家","titleSlug":"sellers-with-no-sales"},{"acceptance":0.6394155623513421,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1608]特殊数组的特征值","frequency":0.0,"frontendQuestionId":"1608","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊数组的特征值","titleSlug":"special-array-with-x-elements-greater-than-or-equal-x"},{"acceptance":0.5114981022549676,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1609]奇偶树","frequency":5.584581530503954,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27014942934462877,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1610]可见点的最大数目","frequency":0.0,"frontendQuestionId":"1610","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可见点的最大数目","titleSlug":"maximum-number-of-visible-points"},{"acceptance":0.6092399403874814,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1611]使整数变为 0 的最少操作次数","frequency":0.0,"frontendQuestionId":"1611","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使整数变为 0 的最少操作次数","titleSlug":"minimum-one-bit-operations-to-make-integers-zero"},{"acceptance":0.734982332155477,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1612]检查两棵二叉表达式树是否等价","frequency":0.0,"frontendQuestionId":"1612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两棵二叉表达式树是否等价","titleSlug":"check-if-two-expression-trees-are-equivalent"},{"acceptance":0.724233983286908,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1613]找到遗失的ID","frequency":0.0,"frontendQuestionId":"1613","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到遗失的ID","titleSlug":"find-the-missing-ids"},{"acceptance":0.820977679022321,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.035346114169862,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4948383984563435,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1615]最大网络秩","frequency":0.0,"frontendQuestionId":"1615","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大网络秩","titleSlug":"maximal-network-rank"},{"acceptance":0.27517914574282004,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.755948795401358,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.620109689213894,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1617]统计子树中城市之间最大距离","frequency":0.0,"frontendQuestionId":"1617","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子树中城市之间最大距离","titleSlug":"count-subtrees-with-max-distance-between-cities"},{"acceptance":0.5915492957746479,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1618]找出适应屏幕的最大字号","frequency":0.0,"frontendQuestionId":"1618","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出适应屏幕的最大字号","titleSlug":"maximum-font-to-fit-a-sentence-in-a-screen"},{"acceptance":0.6782154263040743,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.36916176925456234,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":10.971102305583493,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4370503597122302,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1621]大小为 K 的不重叠线段的数目","frequency":0.0,"frontendQuestionId":"1621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大小为 K 的不重叠线段的数目","titleSlug":"number-of-sets-of-k-non-overlapping-line-segments"},{"acceptance":0.14616507010086913,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1622]奇妙序列","frequency":18.215489960376434,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7834146341463415,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.584581530503954,"frontendQuestionId":"1623","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三人国家代表队","titleSlug":"all-valid-triplets-that-can-represent-a-country"},{"acceptance":0.6278815122176118,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.90034257139293,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5398061941858255,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1625]执行操作后字典序最小的字符串","frequency":0.0,"frontendQuestionId":"1625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行操作后字典序最小的字符串","titleSlug":"lexicographically-smallest-string-after-applying-operations"},{"acceptance":0.3835588355883559,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.157517045032444,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3781150159744409,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1627]带阈值的图连通性","frequency":0.0,"frontendQuestionId":"1627","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带阈值的图连通性","titleSlug":"graph-connectivity-with-threshold"},{"acceptance":0.8356481481481481,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1628]设计带解析函数的表达式树","frequency":0.0,"frontendQuestionId":"1628","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计带解析函数的表达式树","titleSlug":"design-an-expression-tree-with-evaluate-function"},{"acceptance":0.5226203881565874,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7692307692307693,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1630]等差子数组","frequency":6.157517045032444,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.4921605424057146,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":25.17267506260245,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.31674408316744085,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1632]矩阵转换后的秩","frequency":0.0,"frontendQuestionId":"1632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵转换后的秩","titleSlug":"rank-transform-of-a-matrix"},{"acceptance":0.6574267782426778,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":6.755948795401358,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5222672064777328,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1634]求两个多项式链表的和","frequency":0.0,"frontendQuestionId":"1634","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求两个多项式链表的和","titleSlug":"add-two-polynomials-represented-as-linked-lists"},{"acceptance":0.5439588688946015,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1635]Hopper 公司查询 I","frequency":7.381878117988307,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7066481087276896,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.584581530503954,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8066583307283526,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1637]两点之间不包含任何点的最宽垂直面积","frequency":0.0,"frontendQuestionId":"1637","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两点之间不包含任何点的最宽垂直面积","titleSlug":"widest-vertical-area-between-two-points-containing-no-points"},{"acceptance":0.7119309262166404,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":9.448468278553571,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.40152267461105595,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1639]通过给定词典构造目标字符串的方案数","frequency":0.0,"frontendQuestionId":"1639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过给定词典构造目标字符串的方案数","titleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary"},{"acceptance":0.6634754238647912,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[1640]能否连接形成数组","frequency":5.584581530503954,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7699655598154526,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":39.52902380316885,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.4532932815590886,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":17.544729672906715,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45007235890014474,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1643]第 K 条最小指令","frequency":0.0,"frontendQuestionId":"1643","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 条最小指令","titleSlug":"kth-smallest-instructions"},{"acceptance":0.5406178489702517,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":19.644440068773637,"frontendQuestionId":"1644","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 II","titleSlug":"lowest-common-ancestor-of-a-binary-tree-ii"},{"acceptance":0.4125835189309577,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":7.381878117988307,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5378690629011553,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.756242926343756,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5120765721977119,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":23.852768504985672,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27773158157325795,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1648]销售价值减少的颜色球","frequency":18.914641452403927,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.4744525547445255,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1649]通过指令创建有序数组","frequency":0.0,"frontendQuestionId":"1649","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通过指令创建有序数组","titleSlug":"create-sorted-array-through-instructions"},{"acceptance":0.7946768060836502,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.755948795401358,"frontendQuestionId":"1650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 III","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iii"},{"acceptance":0.6859421734795613,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1651]","frequency":0.0,"frontendQuestionId":"1651","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-iii"},{"acceptance":0.6601601601601602,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[1652]拆炸弹","frequency":16.90034257139293,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5029975142564702,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.584581530503954,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.2735166425470333,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1654]到家的最少跳跃次数","frequency":18.215489960376434,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.382825370675453,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1655]分配重复整数","frequency":0.0,"frontendQuestionId":"1655","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分配重复整数","titleSlug":"distribute-repeating-integers"},{"acceptance":0.780769627566285,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1656]设计有序流","frequency":5.584581530503954,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.46488090044498737,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.157517045032444,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29659026195899774,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":0.0,"frontendQuestionId":"1658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将 x 减到 0 的最小操作数","titleSlug":"minimum-operations-to-reduce-x-to-zero"},{"acceptance":0.4063581995593327,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":26.974295895342188,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.744,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1660]纠正二叉树","frequency":0.0,"frontendQuestionId":"1660","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"纠正二叉树","titleSlug":"correct-a-binary-tree"},{"acceptance":0.7303809833930316,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":17.544729672906715,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8128898128898129,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":15.683616972716724,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5721986907970735,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.17267506260245,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5443273403595784,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1664]生成平衡数组的方案数","frequency":0.0,"frontendQuestionId":"1664","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成平衡数组的方案数","titleSlug":"ways-to-make-a-fair-array"},{"acceptance":0.6665346011621764,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.755948795401358,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6823899371069182,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1666]改变二叉树的根节点","frequency":0.0,"frontendQuestionId":"1666","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"改变二叉树的根节点","titleSlug":"change-the-root-of-a-binary-tree"},{"acceptance":0.6022417449257801,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1667]修复表中的名字","frequency":0.0,"frontendQuestionId":"1667","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"修复表中的名字","titleSlug":"fix-names-in-a-table"},{"acceptance":0.44157303370786516,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1668]最大重复子字符串","frequency":0.0,"frontendQuestionId":"1668","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大重复子字符串","titleSlug":"maximum-repeating-substring"},{"acceptance":0.7671411780070524,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1669]合并两个链表","frequency":17.544729672906715,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5287760416666667,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1670]设计前中后队列","frequency":5.584581530503954,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46434533746720724,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":10.971102305583493,"frontendQuestionId":"1671","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到山形数组的最少删除次数","titleSlug":"minimum-number-of-removals-to-make-mountain-array"},{"acceptance":0.8503373819163292,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[1672]最富有客户的资产总量","frequency":5.584581530503954,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.35102805534204456,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1673]找出最具竞争力的子序列","frequency":5.584581530503954,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36061381074168797,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":20.4057570822886,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.436302934457916,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1675]数组的最小偏移量","frequency":0.0,"frontendQuestionId":"1675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最小偏移量","titleSlug":"minimize-deviation-in-array"},{"acceptance":0.7678767876787679,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":10.971102305583493,"frontendQuestionId":"1676","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先 IV","titleSlug":"lowest-common-ancestor-of-a-binary-tree-iv"},{"acceptance":0.3993362831858407,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1677]发票中的产品金额","frequency":0.0,"frontendQuestionId":"1677","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"发票中的产品金额","titleSlug":"products-worth-over-invoices"},{"acceptance":0.8300302645709264,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":5.584581530503954,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.494835401649699,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1679]K 和数对的最大数目","frequency":6.157517045032444,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.4619593998234775,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.157517045032444,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38157453936348407,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":12.493736332613416,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5246800731261426,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1682]最长回文子序列 II","frequency":0.0,"frontendQuestionId":"1682","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文子序列 II","titleSlug":"longest-palindromic-subsequence-ii"},{"acceptance":0.8945030538589672,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1683]无效的推文","frequency":0.0,"frontendQuestionId":"1683","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无效的推文","titleSlug":"invalid-tweets"},{"acceptance":0.8275489186405768,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[1684]统计一致字符串的数目","frequency":23.852768504985672,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5948744059742023,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1685]有序数组中差绝对值之和","frequency":0.0,"frontendQuestionId":"1685","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中差绝对值之和","titleSlug":"sum-of-absolute-differences-in-a-sorted-array"},{"acceptance":0.469640179910045,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.755948795401358,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.3986725663716814,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1687]从仓库到码头运输箱子","frequency":0.0,"frontendQuestionId":"1687","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从仓库到码头运输箱子","titleSlug":"delivering-boxes-from-storage-to-ports"},{"acceptance":0.8042725414111069,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[1688]比赛中的配对次数","frequency":16.90034257139293,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8695759521017221,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[1689]十-二进制数的最少数目","frequency":23.228329710626443,"frontendQuestionId":"1689","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"十-二进制数的最少数目","titleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers"},{"acceptance":0.5119634928465713,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1690]石子游戏 VII","frequency":6.157517045032444,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.48534269199009084,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1691]堆叠长方体的最大高度","frequency":0.0,"frontendQuestionId":"1691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆叠长方体的最大高度","titleSlug":"maximum-height-by-stacking-cuboids"},{"acceptance":0.6502057613168725,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1692]计算分配糖果的不同方式","frequency":0.0,"frontendQuestionId":"1692","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"计算分配糖果的不同方式","titleSlug":"count-ways-to-distribute-candies"},{"acceptance":0.8016304347826086,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1693]每天的领导和合伙人","frequency":0.0,"frontendQuestionId":"1693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的领导和合伙人","titleSlug":"daily-leads-and-partners"},{"acceptance":0.6352554681421285,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1694]重新格式化电话号码","frequency":0.0,"frontendQuestionId":"1694","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化电话号码","titleSlug":"reformat-phone-number"},{"acceptance":0.45437411653840115,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1695]删除子数组的最大得分","frequency":5.584581530503954,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39895494028230183,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1696]跳跃游戏 VI","frequency":23.228329710626443,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.525819265143992,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1697]检查边长度限制的路径是否存在","frequency":0.0,"frontendQuestionId":"1697","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在","titleSlug":"checking-existence-of-edge-length-limited-paths"},{"acceptance":0.5420918367346939,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1698]字符串的不同子字符串个数","frequency":0.0,"frontendQuestionId":"1698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串的不同子字符串个数","titleSlug":"number-of-distinct-substrings-in-a-string"},{"acceptance":0.7988883274381,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1699]两人之间的通话次数","frequency":0.0,"frontendQuestionId":"1699","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两人之间的通话次数","titleSlug":"number-of-calls-between-two-persons"},{"acceptance":0.7196622927474315,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.584581530503954,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.611597554931439,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1701]平均等待时间","frequency":17.544729672906715,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4768019174798836,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1702]修改后的最大二进制字符串","frequency":19.644440068773637,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38939728621016095,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1703]得到连续 K 个 1 的最少相邻交换次数","frequency":0.0,"frontendQuestionId":"1703","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到连续 K 个 1 的最少相邻交换次数","titleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones"},{"acceptance":0.7816421895861149,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1704]判断字符串的两半是否相似","frequency":0.0,"frontendQuestionId":"1704","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串的两半是否相似","titleSlug":"determine-if-string-halves-are-alike"},{"acceptance":0.3461201501877347,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1705]吃苹果的最大数目","frequency":17.544729672906715,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5850311262026033,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1706]球会落何处","frequency":16.90034257139293,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032630522088354,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":41.899442402635756,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.7030603804797353,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1708]长度为 K 的最大子数组","frequency":0.0,"frontendQuestionId":"1708","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 K 的最大子数组","titleSlug":"largest-subarray-length-k"},{"acceptance":0.7149122807017544,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1709]访问日期之间最大的空档期","frequency":0.0,"frontendQuestionId":"1709","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"访问日期之间最大的空档期","titleSlug":"biggest-window-between-visits"},{"acceptance":0.6927252985884907,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1710]卡车上的最大单元数","frequency":25.17267506260245,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3593379761604061,"acs":0,"articleLive":2,"columnArticles":359,"formTitle":"[1711]大餐计数","frequency":51.830786225425705,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2651678334230838,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1712]将数组分成三个子数组的方案数","frequency":0.0,"frontendQuestionId":"1712","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分成三个子数组的方案数","titleSlug":"ways-to-split-array-into-three-subarrays"},{"acceptance":0.49726441812564365,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":46.278227267661286,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6366197183098592,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1714]数组中特殊等间距元素的和","frequency":0.0,"frontendQuestionId":"1714","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中特殊等间距元素的和","titleSlug":"sum-of-special-evenly-spaced-elements-in-array"},{"acceptance":0.7380835380835381,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1715]苹果和橘子的个数","frequency":17.544729672906715,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6757059228650137,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1716]计算力扣银行的钱","frequency":0.0,"frontendQuestionId":"1716","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算力扣银行的钱","titleSlug":"calculate-money-in-leetcode-bank"},{"acceptance":0.4297724010662292,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":0.0,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4869927159209157,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1718]构建字典序最大的可行序列","frequency":0.0,"frontendQuestionId":"1718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建字典序最大的可行序列","titleSlug":"construct-the-lexicographically-largest-valid-sequence"},{"acceptance":0.363080684596577,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1719]重构一棵树的方案数","frequency":0.0,"frontendQuestionId":"1719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"重构一棵树的方案数","titleSlug":"number-of-ways-to-reconstruct-a-tree"},{"acceptance":0.8694003677794839,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":57.36227170261191,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6471301020408163,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1721]交换链表中的节点","frequency":6.157517045032444,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5136714443219405,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1722]执行交换操作后的最小汉明距离","frequency":0.0,"frontendQuestionId":"1722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行交换操作后的最小汉明距离","titleSlug":"minimize-hamming-distance-after-swap-operations"},{"acceptance":0.5077483029653448,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.78477071816862,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5576271186440678,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1724]检查边长度限制的路径是否存在 II","frequency":0.0,"frontendQuestionId":"1724","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查边长度限制的路径是否存在 II","titleSlug":"checking-existence-of-edge-length-limited-paths-ii"},{"acceptance":0.7875246623159812,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.584581530503954,"frontendQuestionId":"1725","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以形成最大正方形的矩形数目","titleSlug":"number-of-rectangles-that-can-form-the-largest-square"},{"acceptance":0.47575569541707297,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[1726]同积元组","frequency":0.0,"frontendQuestionId":"1726","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"同积元组","titleSlug":"tuple-with-same-product"},{"acceptance":0.5735647988999656,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":10.209785292068533,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.3550413223140496,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1728]猫和老鼠 II","frequency":0.0,"frontendQuestionId":"1728","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠 II","titleSlug":"cat-and-mouse-ii"},{"acceptance":0.6251217137293087,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.755948795401358,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5353748680042238,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1730]获取食物的最短路径","frequency":0.0,"frontendQuestionId":"1730","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取食物的最短路径","titleSlug":"shortest-path-to-get-food"},{"acceptance":0.47846332945285214,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1731]每位经理的下属员工数量","frequency":0.0,"frontendQuestionId":"1731","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每位经理的下属员工数量","titleSlug":"the-number-of-employees-which-report-to-each-employee"},{"acceptance":0.7927782079256704,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[1732]找到最高海拔","frequency":31.46944968249581,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.4583333333333333,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":10.971102305583493,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232786202949821,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":55.312490525862955,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4846989141164857,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1735]生成乘积数组的方案数","frequency":0.0,"frontendQuestionId":"1735","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"生成乘积数组的方案数","titleSlug":"count-ways-to-make-array-with-product"},{"acceptance":0.44917871012924176,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":46.278227267661286,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3088894750725402,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":21.204771953806695,"frontendQuestionId":"1737","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"满足三条件之一需改变的最少字符数","titleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions"},{"acceptance":0.6540797096391429,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":42.633582901843596,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.470873786407767,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1739]放置盒子","frequency":0.0,"frontendQuestionId":"1739","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"放置盒子","titleSlug":"building-boxes"},{"acceptance":0.7009472259810555,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1740]找到二叉树中的距离","frequency":12.493736332613416,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8454797047970479,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1741]查找每个员工花费的总时间","frequency":0.0,"frontendQuestionId":"1741","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找每个员工花费的总时间","titleSlug":"find-total-time-spent-by-each-employee"},{"acceptance":0.7067165477640508,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.035346114169862,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6974702661884086,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":41.899442402635756,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3629131045865408,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":56.782287436649845,"frontendQuestionId":"1744","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","titleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day"},{"acceptance":0.4844124700239808,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1745]回文串分割 IV","frequency":0.0,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5940996948118006,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":0.0,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7041062801932367,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1747]应该被禁止的Leetflex账户","frequency":0.0,"frontendQuestionId":"1747","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"应该被禁止的Leetflex账户","titleSlug":"leetflex-banned-accounts"},{"acceptance":0.7503975712013878,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1748]唯一元素的和","frequency":25.17267506260245,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5296930433441308,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.500338269107854,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.45756240822320116,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1750]删除字符串两端相同字符后的最短长度","frequency":0.0,"frontendQuestionId":"1750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符串两端相同字符后的最短长度","titleSlug":"minimum-length-of-string-after-deleting-similar-ends"},{"acceptance":0.469615832363213,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":21.204771953806695,"frontendQuestionId":"1751","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多可以参加的会议数目 II","titleSlug":"maximum-number-of-events-that-can-be-attended-ii"},{"acceptance":0.6859559314489205,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.035346114169862,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6282865907099036,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1753]移除石子的最大得分","frequency":0.0,"frontendQuestionId":"1753","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子的最大得分","titleSlug":"maximum-score-from-removing-stones"},{"acceptance":0.4207456779837534,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":7.381878117988307,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.3982850384387936,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.037543813788469,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8298429319371727,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1756]设计最近使用（MRU）队列","frequency":0.0,"frontendQuestionId":"1756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计最近使用（MRU）队列","titleSlug":"design-most-recently-used-queue"},{"acceptance":0.9237429237429238,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1757]可回收且低脂的产品","frequency":0.0,"frontendQuestionId":"1757","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可回收且低脂的产品","titleSlug":"recyclable-and-low-fat-products"},{"acceptance":0.6349280074314909,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1758]生成交替二进制字符串的最少操作数","frequency":0.0,"frontendQuestionId":"1758","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"生成交替二进制字符串的最少操作数","titleSlug":"minimum-changes-to-make-alternating-binary-string"},{"acceptance":0.42775793842293214,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1759]统计同构子字符串的数目","frequency":6.157517045032444,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5365198711063373,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1760]袋子里最少数目的球","frequency":0.0,"frontendQuestionId":"1760","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"袋子里最少数目的球","titleSlug":"minimum-limit-of-balls-in-a-bag"},{"acceptance":0.4283031751451007,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":9.448468278553571,"frontendQuestionId":"1761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"一个图中连通三元组的最小度数","titleSlug":"minimum-degree-of-a-connected-trio-in-a-graph"},{"acceptance":0.6650717703349283,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1762]能看到海景的建筑物","frequency":0.0,"frontendQuestionId":"1762","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"能看到海景的建筑物","titleSlug":"buildings-with-an-ocean-view"},{"acceptance":0.6089027595269383,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1763]最长的美好子字符串","frequency":6.755948795401358,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4773466290916974,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1764]通过连接另一个数组的子数组得到一个数组","frequency":0.0,"frontendQuestionId":"1764","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过连接另一个数组的子数组得到一个数组","titleSlug":"form-array-by-concatenating-subarrays-of-another-array"},{"acceptance":0.5598241901351131,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.157517045032444,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3761366767704602,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":15.108166890105792,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7963558413719185,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1767]寻找没有被执行的任务对","frequency":0.0,"frontendQuestionId":"1767","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找没有被执行的任务对","titleSlug":"find-the-subtasks-that-did-not-execute"},{"acceptance":0.7691866714439269,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1768]交替合并字符串","frequency":15.683616972716724,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8551778517609953,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.584581530503954,"frontendQuestionId":"1769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动所有球到每个盒子所需的最小操作数","titleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box"},{"acceptance":0.3686576750160565,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":12.493736332613416,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36470968785379265,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1771]由子序列构造的最长回文串的长度","frequency":0.0,"frontendQuestionId":"1771","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"由子序列构造的最长回文串的长度","titleSlug":"maximize-palindrome-length-from-subsequences"},{"acceptance":0.536723163841808,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1772]按受欢迎程度排列功能","frequency":0.0,"frontendQuestionId":"1772","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按受欢迎程度排列功能","titleSlug":"sort-features-by-popularity"},{"acceptance":0.8413755754129434,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":28.76672692836418,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.553689033120168,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":6.157517045032444,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.47312198483804274,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":18.914641452403927,"frontendQuestionId":"1775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过最少操作次数使数组的和相等","titleSlug":"equal-sum-arrays-with-minimum-number-of-operations"},{"acceptance":0.4602739726027397,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":28.97730377093422,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7785714285714286,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1777]每家商店的产品价格","frequency":69.64047101413436,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5699300699300699,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1778]未知网格中的最短路径","frequency":0.0,"frontendQuestionId":"1778","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"未知网格中的最短路径","titleSlug":"shortest-path-in-a-hidden-grid"},{"acceptance":0.6469855505729946,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.157517045032444,"frontendQuestionId":"1779","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最近的有相同 X 或 Y 坐标的点","titleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate"},{"acceptance":0.6614820435002529,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1780]判断一个数字是否可以表示成三的幂的和","frequency":0.0,"frontendQuestionId":"1780","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"判断一个数字是否可以表示成三的幂的和","titleSlug":"check-if-number-is-a-sum-of-powers-of-three"},{"acceptance":0.5174743406522021,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":5.584581530503954,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.2865308151093439,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1782]统计点对的数目","frequency":0.0,"frontendQuestionId":"1782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计点对的数目","titleSlug":"count-pairs-of-nodes"},{"acceptance":0.7895136778115501,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1783]大满贯数量","frequency":0.0,"frontendQuestionId":"1783","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大满贯数量","titleSlug":"grand-slam-titles"},{"acceptance":0.4212757566794834,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1784]检查二进制字符串字段","frequency":5.584581530503954,"frontendQuestionId":"1784","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查二进制字符串字段","titleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones"},{"acceptance":0.3475463040680432,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1785]构成特定和需要添加的最少元素","frequency":0.0,"frontendQuestionId":"1785","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构成特定和需要添加的最少元素","titleSlug":"minimum-elements-to-add-to-form-a-given-sum"},{"acceptance":0.3393857646814692,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1786]从第一个节点出发到最后一个节点的受限路径数","frequency":0.0,"frontendQuestionId":"1786","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从第一个节点出发到最后一个节点的受限路径数","titleSlug":"number-of-restricted-paths-from-first-to-last-node"},{"acceptance":0.6541596873255164,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":56.03400574149302,"frontendQuestionId":"1787","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使所有区间的异或结果为零","titleSlug":"make-the-xor-of-all-segments-equal-to-zero"},{"acceptance":0.6846473029045643,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1788]最大化花园的美观度","frequency":0.0,"frontendQuestionId":"1788","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化花园的美观度","titleSlug":"maximize-the-beauty-of-the-garden"},{"acceptance":0.7136706135629709,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1789]员工的直属部门","frequency":0.0,"frontendQuestionId":"1789","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工的直属部门","titleSlug":"primary-department-for-each-employee"},{"acceptance":0.6509458143230635,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":5.584581530503954,"frontendQuestionId":"1790","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅执行一次字符串交换能否使两个字符串相等","titleSlug":"check-if-one-string-swap-can-make-strings-equal"},{"acceptance":0.8094281972937581,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1791]找出星型图的中心节点","frequency":5.584581530503954,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.513392500199888,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":35.160696630590536,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4122720821050333,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1793]好子数组的最大分数","frequency":18.215489960376434,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6887755102040817,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1794]统计距离最小的子串对个数","frequency":0.0,"frontendQuestionId":"1794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计距离最小的子串对个数","titleSlug":"count-pairs-of-equal-substrings-with-minimum-difference"},{"acceptance":0.7916451779267664,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.17267506260245,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.4868505452212957,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1796]字符串中第二大的数字","frequency":5.584581530503954,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.572463768115942,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1797]设计一个验证系统","frequency":17.544729672906715,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5197449973437224,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1798]你能构造出连续值的最大数目","frequency":0.0,"frontendQuestionId":"1798","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你能构造出连续值的最大数目","titleSlug":"maximum-number-of-consecutive-values-you-can-make"},{"acceptance":0.5155192532088682,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":8.725461006626777,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6834774959683331,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1800]最大升序子数组和","frequency":16.90034257139293,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37669939577039274,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1801]积压订单中的订单总数","frequency":0.0,"frontendQuestionId":"1801","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"积压订单中的订单总数","titleSlug":"number-of-orders-in-the-backlog"},{"acceptance":0.2616924360043626,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1802]有界数组中指定下标处的最大值","frequency":0.0,"frontendQuestionId":"1802","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有界数组中指定下标处的最大值","titleSlug":"maximum-value-at-a-given-index-in-a-bounded-array"},{"acceptance":0.41056829511465603,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":22.04306144393415,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5740458015267176,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":10.971102305583493,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4942123349611141,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.035346114169862,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6633858267716536,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":26.59911431794164,"frontendQuestionId":"1806","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"还原排列的最少操作步数","titleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation"},{"acceptance":0.5843881856540084,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1807]替换字符串中的括号内容","frequency":0.0,"frontendQuestionId":"1807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换字符串中的括号内容","titleSlug":"evaluate-the-bracket-pairs-of-a-string"},{"acceptance":0.26638524772272826,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":12.493736332613416,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6410256410256411,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1809]没有广告的剧集","frequency":25.87159361630726,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.684931506849315,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":33.79257218300203,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6650625601539942,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1811]寻找面试候选人","frequency":5.584581530503954,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7949493895439841,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[1812]判断国际象棋棋盘中一个格子的颜色","frequency":0.0,"frontendQuestionId":"1812","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断国际象棋棋盘中一个格子的颜色","titleSlug":"determine-color-of-a-chessboard-square"},{"acceptance":0.5200521355524363,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1813]句子相似性 III","frequency":25.17267506260245,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34121107617405416,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.157517045032444,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.30270477652023786,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1815]得到新鲜甜甜圈的最多组数","frequency":0.0,"frontendQuestionId":"1815","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"得到新鲜甜甜圈的最多组数","titleSlug":"maximum-number-of-groups-getting-fresh-donuts"},{"acceptance":0.7526331857731644,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1816]截断句子","frequency":5.584581530503954,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6963660509477243,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.584581530503954,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37400815557420247,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":47.73219270786092,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3648473034437947,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1819]序列中不同最大公约数的数目","frequency":0.0,"frontendQuestionId":"1819","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列中不同最大公约数的数目","titleSlug":"number-of-different-subsequences-gcds"},{"acceptance":0.4970414201183432,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1820]最多邀请的个数","frequency":0.0,"frontendQuestionId":"1820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多邀请的个数","titleSlug":"maximum-number-of-accepted-invitations"},{"acceptance":0.9,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.17267506260245,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8128384902808682,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[1822]数组元素积的符号","frequency":16.280516258406706,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7079916078580966,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1823]找出游戏的获胜者","frequency":16.90034257139293,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.6620629370629371,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1824]最少侧跳次数","frequency":0.0,"frontendQuestionId":"1824","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少侧跳次数","titleSlug":"minimum-sideway-jumps"},{"acceptance":0.28753040017687376,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":11.732419319098454,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4404040404040404,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7959220498015157,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1827]最少操作使数组递增","frequency":0.0,"frontendQuestionId":"1827","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最少操作使数组递增","titleSlug":"minimum-operations-to-make-the-array-increasing"},{"acceptance":0.870082564351627,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1828]统计一个圆中点的数目","frequency":15.683616972716724,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6775791895239781,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1829]每个查询的最大异或值","frequency":0.0,"frontendQuestionId":"1829","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每个查询的最大异或值","titleSlug":"maximum-xor-for-each-query"},{"acceptance":0.4836639439906651,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1830]使字符串有序的最少操作次数","frequency":0.0,"frontendQuestionId":"1830","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"使字符串有序的最少操作次数","titleSlug":"minimum-number-of-operations-to-make-string-sorted"},{"acceptance":0.732801595214357,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1831]每天的最大交易","frequency":0.0,"frontendQuestionId":"1831","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每天的最大交易","titleSlug":"maximum-transaction-each-day"},{"acceptance":0.8224403009486425,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.500338269107854,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6850894443034763,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[1833]雪糕的最大数量","frequency":29.405911010575036,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3501897881719114,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1834]单线程 CPU","frequency":31.46944968249581,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5088222636637498,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":12.493736332613416,"frontendQuestionId":"1835","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"所有数对按位与结果的异或和","titleSlug":"find-xor-sum-of-all-pairs-bitwise-and"},{"acceptance":0.7130044843049327,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":10.209785292068533,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7947626841243862,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":0.0,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.43073189230185815,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1838]最高频元素的频数","frequency":58.06063764944837,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5782537067545305,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1839]所有元音按顺序排布的最长子字符串","frequency":0.0,"frontendQuestionId":"1839","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有元音按顺序排布的最长子字符串","titleSlug":"longest-substring-of-all-vowels-in-order"},{"acceptance":0.3881511746680286,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":9.448468278553571,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5132997843278218,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1841]联赛信息统计","frequency":25.17267506260245,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.7099236641221374,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1842]下个由相同数字构成的回文串","frequency":0.0,"frontendQuestionId":"1842","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"下个由相同数字构成的回文串","titleSlug":"next-palindrome-using-same-digits"},{"acceptance":0.5117416829745597,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1843]","frequency":5.584581530503954,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8033889857961625,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1844]将所有数字用字符替换","frequency":0.0,"frontendQuestionId":"1844","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"将所有数字用字符替换","titleSlug":"replace-all-digits-with-characters"},{"acceptance":0.573758570538126,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1845]座位预约管理系统","frequency":0.0,"frontendQuestionId":"1845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"座位预约管理系统","titleSlug":"seat-reservation-manager"},{"acceptance":0.6336645155299689,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.19203908581424,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3600764087870105,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":8.037543813788469,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6862003780718336,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1848]到目标元素的最小距离","frequency":0.0,"frontendQuestionId":"1848","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"到目标元素的最小距离","titleSlug":"minimum-distance-to-the-target-element"},{"acceptance":0.3292859731786879,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":7.381878117988307,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6049284578696343,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":9.448468278553571,"frontendQuestionId":"1850","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"邻位交换的最小次数","titleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number"},{"acceptance":0.40066431388831225,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1851]包含每个查询的最小区间","frequency":0.0,"frontendQuestionId":"1851","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"包含每个查询的最小区间","titleSlug":"minimum-interval-to-include-each-query"},{"acceptance":0.7053571428571429,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[1852]每个子数组的数字种类数","frequency":0.0,"frontendQuestionId":"1852","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每个子数组的数字种类数","titleSlug":"distinct-numbers-in-each-subarray"},{"acceptance":0.6508553654743391,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.381878117988307,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7939033877926304,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1854]人口最多的年份","frequency":24.500338269107854,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6910453808752026,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.852768504985672,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.35546646621565187,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":19.644440068773637,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.4497711919808237,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1857]有向图中最大颜色值","frequency":0.0,"frontendQuestionId":"1857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有向图中最大颜色值","titleSlug":"largest-color-value-in-a-directed-graph"},{"acceptance":0.638095238095238,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":13.255053346128376,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7726667473671468,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7734739403772054,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1860]增长的内存泄露","frequency":5.584581530503954,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6174014371722665,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":6.157517045032444,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3109632629447498,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1862]向下取整数对和","frequency":0.0,"frontendQuestionId":"1862","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"向下取整数对和","titleSlug":"sum-of-floored-pairs"},{"acceptance":0.9211074265443048,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.19203908581424,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.386349001931745,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":8.037543813788469,"frontendQuestionId":"1864","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构成交替字符串需要的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating"},{"acceptance":0.5167372454123815,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":0.0,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5953242415808516,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":20.4057570822886,"frontendQuestionId":"1866","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恰有 K 根木棍可以看到的排列数目","titleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible"},{"acceptance":0.7660818713450293,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1867]","frequency":0.0,"frontendQuestionId":"1867","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"orders-with-maximum-quantity-above-average"},{"acceptance":0.5454545454545454,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1868]两个行程编码数组的积","frequency":17.544729672906715,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7982871601894505,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1869]哪种连续子字符串更长","frequency":24.500338269107854,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.46068478466485907,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.755948795401358,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.27566109532296135,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1871]跳跃游戏 VII","frequency":0.0,"frontendQuestionId":"1871","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"跳跃游戏 VII","titleSlug":"jump-game-vii"},{"acceptance":0.6246761658031088,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1872]石子游戏 VIII","frequency":0.0,"frontendQuestionId":"1872","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VIII","titleSlug":"stone-game-viii"},{"acceptance":0.8001944579484687,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1873]计算特殊奖金","frequency":34.46419146508039,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8785425101214575,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1874]两个数组的最小乘积和","frequency":0.0,"frontendQuestionId":"1874","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组的最小乘积和","titleSlug":"minimize-product-sum-of-two-arrays"},{"acceptance":0.73568281938326,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1875]","frequency":0.0,"frontendQuestionId":"1875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"group-employees-of-the-same-salary"},{"acceptance":0.7294369399491775,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1876]长度为三且各字符不同的子字符串","frequency":0.0,"frontendQuestionId":"1876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"长度为三且各字符不同的子字符串","titleSlug":"substrings-of-size-three-with-distinct-characters"},{"acceptance":0.8194797040919389,"acs":0,"articleLive":2,"columnArticles":395,"formTitle":"[1877]数组中最大数对和的最小值","frequency":54.5108701133377,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4282178217821782,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1878]矩阵中最大的三个菱形和","frequency":0.0,"frontendQuestionId":"1878","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中最大的三个菱形和","titleSlug":"get-biggest-three-rhombus-sums-in-a-grid"},{"acceptance":0.4063854047890536,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.381878117988307,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7746788184912704,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.584581530503954,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3522506082725061,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1881]插入后的最大值","frequency":0.0,"frontendQuestionId":"1881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"插入后的最大值","titleSlug":"maximum-value-after-insertion"},{"acceptance":0.27703984819734345,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1882]使用服务器处理任务","frequency":0.0,"frontendQuestionId":"1882","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"使用服务器处理任务","titleSlug":"process-tasks-using-servers"},{"acceptance":0.37223075235797326,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[1883]准时抵达会议现场的最小跳过休息次数","frequency":0.0,"frontendQuestionId":"1883","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"准时抵达会议现场的最小跳过休息次数","titleSlug":"minimum-skips-to-arrive-at-meeting-on-time"},{"acceptance":0.6889093419236079,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":34.46419146508039,"frontendQuestionId":"1884","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落-两枚鸡蛋","titleSlug":"egg-drop-with-2-eggs-and-n-floors"},{"acceptance":0.5289017341040463,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1885]","frequency":0.0,"frontendQuestionId":"1885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-pairs-in-two-arrays"},{"acceptance":0.5734296831573096,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":17.544729672906715,"frontendQuestionId":"1886","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断矩阵经轮转后是否一致","titleSlug":"determine-whether-matrix-can-be-obtained-by-rotation"},{"acceptance":0.640446487196323,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.755948795401358,"frontendQuestionId":"1887","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组元素相等的减少操作次数","titleSlug":"reduction-operations-to-make-the-array-elements-equal"},{"acceptance":0.314519906323185,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":6.755948795401358,"frontendQuestionId":"1888","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使二进制字符串字符交替的最少反转次数","titleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating"},{"acceptance":0.2746896923907178,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1889]装包裹的最小浪费空间","frequency":19.644440068773637,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7008547008547008,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1890]2020年最后一次登录","frequency":0.0,"frontendQuestionId":"1890","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"2020年最后一次登录","titleSlug":"the-latest-login-in-2020"},{"acceptance":0.5292307692307693,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3492957746478873,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.755948795401358,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5916556215063677,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.58955729509267,"frontendQuestionId":"1893","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否区域内所有整数都被覆盖","titleSlug":"check-if-all-the-integers-in-a-range-are-covered"},{"acceptance":0.4314548902736386,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":0.0,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5297718419588202,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1895]最大的幻方","frequency":0.0,"frontendQuestionId":"1895","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大的幻方","titleSlug":"largest-magic-square"},{"acceptance":0.5027692307692307,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1896]反转表达式值的最少操作次数","frequency":0.0,"frontendQuestionId":"1896","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"反转表达式值的最少操作次数","titleSlug":"minimum-cost-to-change-the-final-value-of-expression"},{"acceptance":0.5288392857142857,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.90034257139293,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3076682804935187,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.037543813788469,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6274059685678969,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1899]合并若干三元组以形成目标三元组","frequency":0.0,"frontendQuestionId":"1899","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并若干三元组以形成目标三元组","titleSlug":"merge-triplets-to-form-target-triplet"},{"acceptance":0.4261682242990654,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":25.87159361630726,"frontendQuestionId":"1900","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳运动员的比拼回合","titleSlug":"the-earliest-and-latest-rounds-where-players-compete"},{"acceptance":0.6594464500601684,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1901]找出顶峰元素 II","frequency":0.0,"frontendQuestionId":"1901","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出顶峰元素 II","titleSlug":"find-a-peak-element-ii"},{"acceptance":0.45588235294117646,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1902]","frequency":0.0,"frontendQuestionId":"1902","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"depth-of-bst-given-insertion-order"},{"acceptance":0.6446882981742503,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1903]字符串中的最大奇数","frequency":0.0,"frontendQuestionId":"1903","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的最大奇数","titleSlug":"largest-odd-number-in-string"},{"acceptance":0.27635593220338983,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1904]你完成的完整对局数","frequency":0.0,"frontendQuestionId":"1904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你完成的完整对局数","titleSlug":"the-number-of-full-rounds-you-have-played"},{"acceptance":0.5732977303070761,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1905]统计子岛屿","frequency":0.0,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4222652128033767,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":21.204771953806695,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.6237113402061856,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[1907]按分类统计薪水","frequency":0.0,"frontendQuestionId":"1907","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按分类统计薪水","titleSlug":"count-salary-categories"},{"acceptance":0.6716417910447762,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1908]Nim 游戏 II","frequency":0.0,"frontendQuestionId":"1908","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏 II","titleSlug":"game-of-nim"},{"acceptance":0.3273238117536877,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.157517045032444,"frontendQuestionId":"1909","leaf":true,"level":1,"nodeType":"def","status":"tried","submitted":0,"title":"删除一个元素使数组严格递增","titleSlug":"remove-one-element-to-make-the-array-strictly-increasing"},{"acceptance":0.674915858245892,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1910]删除一个字符串中所有出现的给定子字符串","frequency":0.0,"frontendQuestionId":"1910","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除一个字符串中所有出现的给定子字符串","titleSlug":"remove-all-occurrences-of-a-substring"},{"acceptance":0.5689490749570857,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1911]最大子序列交替和","frequency":16.280516258406706,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.29669588671611596,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1912]设计电影租借系统","frequency":0.0,"frontendQuestionId":"1912","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计电影租借系统","titleSlug":"design-movie-rental-system"},{"acceptance":0.8469040065797203,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":5.584581530503954,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4408873911822522,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":16.90034257139293,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.38995589699815053,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1915]最美子字符串的数目","frequency":0.0,"frontendQuestionId":"1915","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最美子字符串的数目","titleSlug":"number-of-wonderful-substrings"},{"acceptance":0.5525525525525525,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":19.644440068773637,"frontendQuestionId":"1916","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计为蚁群构筑房间的不同顺序","titleSlug":"count-ways-to-build-rooms-in-an-ant-colony"},{"acceptance":0.29130434782608694,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1917]","frequency":0.0,"frontendQuestionId":"1917","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"leetcodify-friends-recommendations"},{"acceptance":0.46153846153846156,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1918]第 K 小的子序列和","frequency":0.0,"frontendQuestionId":"1918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 K 小的子序列和","titleSlug":"kth-smallest-subarray-sum"},{"acceptance":0.3907103825136612,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1919]兴趣相同的朋友","frequency":0.0,"frontendQuestionId":"1919","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"兴趣相同的朋友","titleSlug":"leetcodify-similar-friends"},{"acceptance":0.9379211311167569,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1920]基于排列构建数组","frequency":0.0,"frontendQuestionId":"1920","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"基于排列构建数组","titleSlug":"build-array-from-permutation"},{"acceptance":0.34310110615175626,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.90034257139293,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3624645318200243,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.584581530503954,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.23630308076602832,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":25.87159361630726,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.4935064935064935,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1924]","frequency":0.0,"frontendQuestionId":"1924","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"erect-the-fence-ii"},{"acceptance":0.6960832114415733,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.06830524866882,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.3458900495937533,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1926]迷宫中离入口最近的出口","frequency":0.0,"frontendQuestionId":"1926","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"迷宫中离入口最近的出口","titleSlug":"nearest-exit-from-entrance-in-maze"},{"acceptance":0.4096149129261712,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.584581530503954,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3937864077669903,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":32.98556520193857,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9374571792111187,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1929]数组串联","frequency":3.5144198644396303,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4750923340239618,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.280516258406706,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5528290993071594,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":6.755948795401358,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3243416827231856,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":10.971102305583493,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5716463414634146,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":0.0,"frontendQuestionId":"1933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断字符串是否可分解为值均等的子串","titleSlug":"check-if-string-is-decomposable-into-value-equal-substrings"},{"acceptance":0.734375,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7409320201777564,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1935]可以输入的最大单词数","frequency":0.0,"frontendQuestionId":"1935","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以输入的最大单词数","titleSlug":"maximum-number-of-words-you-can-type"},{"acceptance":0.4484416445623342,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1936]新增的最少台阶数","frequency":0.0,"frontendQuestionId":"1936","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新增的最少台阶数","titleSlug":"add-minimum-number-of-rungs"},{"acceptance":0.23991423125794156,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":18.215489960376434,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3365716076465058,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1938]查询最大基因差","frequency":17.544729672906715,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6361702127659574,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1939]","frequency":0.0,"frontendQuestionId":"1939","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"users-that-actively-request-confirmation-messages"},{"acceptance":0.8307692307692308,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1940]排序数组之间的最长公共子序列","frequency":0.0,"frontendQuestionId":"1940","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组之间的最长公共子序列","titleSlug":"longest-common-subsequence-between-sorted-arrays"},{"acceptance":0.7732755371277799,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1941]检查是否所有字符出现次数相同","frequency":0.0,"frontendQuestionId":"1941","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查是否所有字符出现次数相同","titleSlug":"check-if-all-characters-have-equal-number-of-occurrences"},{"acceptance":0.3891219658375787,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1942]最小未被占据椅子的编号","frequency":0.0,"frontendQuestionId":"1942","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小未被占据椅子的编号","titleSlug":"the-number-of-the-smallest-unoccupied-chair"},{"acceptance":0.40346820809248557,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1943]描述绘画结果","frequency":0.0,"frontendQuestionId":"1943","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"描述绘画结果","titleSlug":"describe-the-painting"},{"acceptance":0.5668747946105817,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.755948795401358,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6615384615384615,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.035346114169862,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.302590428984481,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.544729672906715,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5380905092920981,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1947]最大兼容性评分和","frequency":0.0,"frontendQuestionId":"1947","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大兼容性评分和","titleSlug":"maximum-compatibility-score-sum"},{"acceptance":0.5189220183486238,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1948]删除系统中的重复文件夹","frequency":8.037543813788469,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5205992509363296,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.55,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1950]所有子数组最小值中的最大值","frequency":0.0,"frontendQuestionId":"1950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子数组最小值中的最大值","titleSlug":"maximum-of-minimum-values-in-all-subarrays"},{"acceptance":0.7174887892376681,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1951]查询具有最多共同关注者的所有两两结对组","frequency":0.0,"frontendQuestionId":"1951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询具有最多共同关注者的所有两两结对组","titleSlug":"all-the-pairs-with-the-maximum-number-of-common-followers"},{"acceptance":0.5418437256092273,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1952]三除数","frequency":5.035346114169862,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.31983708672735983,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1953]你可以工作的最大周数","frequency":0.0,"frontendQuestionId":"1953","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"你可以工作的最大周数","titleSlug":"maximum-number-of-weeks-for-which-you-can-work"},{"acceptance":0.47990135635018494,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":4.508192885707507,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4932446057672918,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1955]统计特殊子序列的数目","frequency":0.0,"frontendQuestionId":"1955","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计特殊子序列的数目","titleSlug":"count-number-of-special-subsequences"},{"acceptance":0.4357142857142857,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":16.280516258406706,"frontendQuestionId":"1956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"感染 K 种病毒所需的最短时间","titleSlug":"minimum-time-for-k-virus-variants-to-spread"},{"acceptance":0.6079573022804464,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1957]删除字符使字符串变好","frequency":0.0,"frontendQuestionId":"1957","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除字符使字符串变好","titleSlug":"delete-characters-to-make-fancy-string"},{"acceptance":0.41910192444761224,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1958]检查操作是否合法","frequency":0.0,"frontendQuestionId":"1958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查操作是否合法","titleSlug":"check-if-move-is-legal"},{"acceptance":0.40970266040688574,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1959]K 次调整数组大小浪费的最小总空间","frequency":0.0,"frontendQuestionId":"1959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 次调整数组大小浪费的最小总空间","titleSlug":"minimum-total-space-wasted-with-k-resizing-operations"},{"acceptance":0.2797131147540984,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1960]两个回文子字符串长度的最大乘积","frequency":0.0,"frontendQuestionId":"1960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子字符串长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings"},{"acceptance":0.5360174833991762,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":0.7613170135149611,"frontendQuestionId":"1961","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查字符串是否为数组前缀","titleSlug":"check-if-string-is-a-prefix-of-array"},{"acceptance":0.42424242424242425,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1962]移除石子使总数最小","frequency":7.065342320225207,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6121684399820171,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":1.5226340270299221,"frontendQuestionId":"1963","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最小交换次数","titleSlug":"minimum-number-of-swaps-to-make-the-string-balanced"},{"acceptance":0.3812627811860941,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1964]找出到每个位置为止最长的有效障碍赛跑路线","frequency":0.0,"frontendQuestionId":"1964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出到每个位置为止最长的有效障碍赛跑路线","titleSlug":"find-the-longest-valid-obstacle-course-at-each-position"},{"acceptance":0.75,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1965]","frequency":0.0,"frontendQuestionId":"1965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-with-missing-information"},{"acceptance":0.71875,"acs":0,"articleLive":2,"columnArticles":4,"formTitle":"[1966]","frequency":0.0,"frontendQuestionId":"1966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"binary-searchable-numbers-in-an-unsorted-array"},{"acceptance":0.7722828397335978,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1967]作为子字符串出现在单词中的字符串数目","frequency":0.0,"frontendQuestionId":"1967","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"作为子字符串出现在单词中的字符串数目","titleSlug":"number-of-strings-that-appear-as-substrings-in-word"},{"acceptance":0.35118567510888854,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1968]构造元素不等于两相邻元素平均值的数组","frequency":0.0,"frontendQuestionId":"1968","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造元素不等于两相邻元素平均值的数组","titleSlug":"array-with-elements-not-equal-to-average-of-neighbors"},{"acceptance":0.27562012056527324,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":19.644440068773637,"frontendQuestionId":"1969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素的最小非零乘积","titleSlug":"minimum-non-zero-product-of-the-array-elements"},{"acceptance":0.4739347774339443,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":22.04306144393415,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5658263305322129,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[1971]","frequency":0.0,"frontendQuestionId":"1971","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-if-path-exists-in-graph"},{"acceptance":0.4876847290640394,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":17.544729672906715,"frontendQuestionId":"1972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"first-and-last-call-on-the-same-day"},{"acceptance":0.4891304347826087,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1973]","frequency":0.0,"frontendQuestionId":"1973","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-nodes-equal-to-sum-of-descendants"},{"acceptance":0.744720352750058,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":5.584581530503954,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.37466387809979085,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1975]最大方阵和","frequency":6.755948795401358,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.274503199730549,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1976]到达目的地的方案数","frequency":0.0,"frontendQuestionId":"1976","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"到达目的地的方案数","titleSlug":"number-of-ways-to-arrive-at-destination"},{"acceptance":0.23743627093954844,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1977]划分数字的方案数","frequency":0.0,"frontendQuestionId":"1977","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"划分数字的方案数","titleSlug":"number-of-ways-to-separate-numbers"},{"acceptance":0.60431654676259,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1978]","frequency":0.0,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8347639484978541,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1979]找出数组的最大公约数","frequency":0.0,"frontendQuestionId":"1979","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组的最大公约数","titleSlug":"find-greatest-common-divisor-of-array"},{"acceptance":0.5778161788530078,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1980]找出不同的二进制字符串","frequency":4.508192885707507,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29128374497415277,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":28.149272277419424,"frontendQuestionId":"1981","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化目标值与所选元素的差","titleSlug":"minimize-the-difference-between-target-and-chosen-elements"},{"acceptance":0.44774273345701915,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1982]从子集的和还原数组","frequency":18.914641452403927,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6774193548387096,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1983]","frequency":0.0,"frontendQuestionId":"1983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"widest-pair-of-indices-with-equal-range-sum"},{"acceptance":0.586558854718982,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1984]学生分数的最小差值","frequency":0.0,"frontendQuestionId":"1984","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生分数的最小差值","titleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores"},{"acceptance":0.4033882783882784,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1985]找出数组中的第 K 大整数","frequency":0.0,"frontendQuestionId":"1985","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出数组中的第 K 大整数","titleSlug":"find-the-kth-largest-integer-in-the-array"},{"acceptance":0.2620005614297745,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1986]完成任务的最少工作时间段","frequency":12.493736332613416,"frontendQuestionId":"1986","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"完成任务的最少工作时间段","titleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks"},{"acceptance":0.44311887515977844,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1987]不同的好子序列数目","frequency":0.0,"frontendQuestionId":"1987","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的好子序列数目","titleSlug":"number-of-unique-good-subsequences"},{"acceptance":0.6666666666666666,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1988]","frequency":0.0,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.844489477128322,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[LCP 01]猜数字","frequency":43.88889094207611,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6881945900608094,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[LCP 02]分式化简","frequency":30.06830524866882,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21816235431941666,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":24.500338269107854,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3752096356151852,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 04]覆盖","frequency":41.07660773716132,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19597689703246365,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[LCP 05]发 LeetCoin","frequency":0.0,"frontendQuestionId":"LCP 05","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"发 LeetCoin","titleSlug":"coin-bonus"},{"acceptance":0.8393864423552697,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[LCP 06]拿硬币","frequency":34.46419146508039,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7702683428757717,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[LCP 07]传递信息","frequency":67.39899018372174,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.28234128140849996,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[LCP 08]剧情触发时间","frequency":0.0,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.2666167466854601,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[LCP 09]最小跳跃次数","frequency":63.39312772298291,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5811756473058083,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":25.87159361630726,"frontendQuestionId":"LCP 10","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树任务调度","titleSlug":"er-cha-shu-ren-wu-diao-du"},{"acceptance":0.6841012868410129,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":7.381878117988307,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4066421167484997,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[LCP 12]小张刷题计划","frequency":38.09665775404082,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6154607869025613,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[LCP 13]寻宝","frequency":10.209785292068533,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20115588376946542,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":35.160696630590536,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5737822349570201,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":10.971102305583493,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.2973997833152763,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 16]游乐园的游览计划","frequency":0.0,"frontendQuestionId":"LCP 16","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的游览计划","titleSlug":"you-le-yuan-de-you-lan-ji-hua"},{"acceptance":0.7979020004182059,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[LCP 17]速算机器人","frequency":30.06830524866882,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2838671310848696,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[LCP 18]早餐组合","frequency":34.46419146508039,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5159568819031436,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":32.51759944999773,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.29914370811615787,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[LCP 20]快速公交","frequency":22.04306144393415,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.32354230600613765,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 21]追逐游戏","frequency":22.924316353004308,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33205264759586123,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[LCP 22]黑白方格画","frequency":50.36880399666648,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.3337391774891775,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":19.644440068773637,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.2706185567010309,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 24]数字游戏","frequency":0.0,"frontendQuestionId":"LCP 24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数字游戏","titleSlug":"5TxKeK"},{"acceptance":0.32537764350453174,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[LCP 25]古董键盘","frequency":0.0,"frontendQuestionId":"LCP 25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"古董键盘","titleSlug":"Uh984O"},{"acceptance":0.3317911434236616,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 26]导航装置","frequency":0.0,"frontendQuestionId":"LCP 26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"导航装置","titleSlug":"hSRGyL"},{"acceptance":0.3264920334863624,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":28.149272277419424,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.26882125694902476,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[LCP 28]采购方案","frequency":29.405911010575036,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.17303905480800788,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[LCP 29]乐团站位","frequency":50.36880399666648,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3359297549922107,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[LCP 30]魔塔游戏","frequency":5.035346114169862,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.23097913322632424,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 31]变换的迷宫","frequency":18.914641452403927,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3767032967032967,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":18.914641452403927,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.20162128455622533,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[LCP 33]蓄水","frequency":30.06830524866882,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4596005447117567,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 34]二叉树染色","frequency":30.06830524866882,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.37336412625096227,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[LCP 35]电动车游城市","frequency":19.644440068773637,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.23446222553033122,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[LCP 36]最多牌组数","frequency":39.980409431386356,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.1783754116355653,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[LCP 37]最小矩形面积","frequency":34.63591702641181,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5286532951289399,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":24.83330184722543,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.5377942998760843,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[LCS 01]下载插件","frequency":25.87159361630726,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.701048524750061,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[LCS 02]完成一半题目","frequency":17.544729672906715,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.4179666487358795,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[LCS 03]主题空间","frequency":6.755948795401358,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786288905905139,"acs":0,"articleLive":2,"columnArticles":2686,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.6290853287744,"frontendQuestionId":"剑指 Offer 03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数字","titleSlug":"shu-zu-zhong-zhong-fu-de-shu-zi-lcof"},{"acceptance":0.403081883252098,"acs":0,"articleLive":2,"columnArticles":1985,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":78.01996129283633,"frontendQuestionId":"剑指 Offer 04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维数组中的查找","titleSlug":"er-wei-shu-zu-zhong-de-cha-zhao-lcof"},{"acceptance":0.7621856288289953,"acs":0,"articleLive":2,"columnArticles":1844,"formTitle":"[剑指 Offer 05]替换空格","frequency":64.16359600403584,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.7523138870882277,"acs":0,"articleLive":2,"columnArticles":1978,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":76.35271467976294,"frontendQuestionId":"剑指 Offer 06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"从尾到头打印链表","titleSlug":"cong-wei-dao-tou-da-yin-lian-biao-lcof"},{"acceptance":0.6958242151211378,"acs":0,"articleLive":2,"columnArticles":1396,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":83.09070771205182,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.71722938236771,"acs":0,"articleLive":2,"columnArticles":1558,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":89.84055743075899,"frontendQuestionId":"剑指 Offer 09","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用两个栈实现队列","titleSlug":"yong-liang-ge-zhan-shi-xian-dui-lie-lcof"},{"acceptance":0.3483185276182115,"acs":0,"articleLive":2,"columnArticles":1610,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":78.47295513449977,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4417726177159415,"acs":0,"articleLive":2,"columnArticles":1256,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":76.0769174295178,"frontendQuestionId":"剑指 Offer 10- II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"青蛙跳台阶问题","titleSlug":"qing-wa-tiao-tai-jie-wen-ti-lcof"},{"acceptance":0.49365741580506683,"acs":0,"articleLive":2,"columnArticles":1552,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":83.07715377602311,"frontendQuestionId":"剑指 Offer 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数组的最小数字","titleSlug":"xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof"},{"acceptance":0.4533961406647935,"acs":0,"articleLive":2,"columnArticles":1071,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":63.7659755437421,"frontendQuestionId":"剑指 Offer 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的路径","titleSlug":"ju-zhen-zhong-de-lu-jing-lcof"},{"acceptance":0.5251576623087798,"acs":0,"articleLive":2,"columnArticles":1645,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":77.78974286624401,"frontendQuestionId":"剑指 Offer 13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人的运动范围","titleSlug":"ji-qi-ren-de-yun-dong-fan-wei-lcof"},{"acceptance":0.5682640920690747,"acs":0,"articleLive":2,"columnArticles":1251,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":67.16982794136092,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31102357556892635,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":39.52902380316885,"frontendQuestionId":"剑指 Offer 14- II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子 II","titleSlug":"jian-sheng-zi-ii-lcof"},{"acceptance":0.7462013109201531,"acs":0,"articleLive":2,"columnArticles":1217,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":54.192509001366076,"frontendQuestionId":"剑指 Offer 15","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二进制中1的个数","titleSlug":"er-jin-zhi-zhong-1de-ge-shu-lcof"},{"acceptance":0.33860333750788174,"acs":0,"articleLive":2,"columnArticles":726,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":34.92565502036332,"frontendQuestionId":"剑指 Offer 16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数值的整数次方","titleSlug":"shu-zhi-de-zheng-shu-ci-fang-lcof"},{"acceptance":0.777380080804794,"acs":0,"articleLive":2,"columnArticles":1088,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":66.01781553741863,"frontendQuestionId":"剑指 Offer 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"打印从1到最大的n位数","titleSlug":"da-yin-cong-1dao-zui-da-de-nwei-shu-lcof"},{"acceptance":0.5953477574831866,"acs":0,"articleLive":2,"columnArticles":1404,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":59.28092049663189,"frontendQuestionId":"剑指 Offer 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的节点","titleSlug":"shan-chu-lian-biao-de-jie-dian-lcof"},{"acceptance":0.37459420893037637,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":57.36227170261191,"frontendQuestionId":"剑指 Offer 19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正则表达式匹配","titleSlug":"zheng-ze-biao-da-shi-pi-pei-lcof"},{"acceptance":0.23910131193411294,"acs":0,"articleLive":2,"columnArticles":805,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":74.1596394413878,"frontendQuestionId":"剑指 Offer 20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数值的字符串","titleSlug":"biao-shi-shu-zhi-de-zi-fu-chuan-lcof"},{"acceptance":0.6424199723870931,"acs":0,"articleLive":2,"columnArticles":1547,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":54.67826316532689,"frontendQuestionId":"剑指 Offer 21","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"调整数组顺序使奇数位于偶数前面","titleSlug":"diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof"},{"acceptance":0.7899443090719028,"acs":0,"articleLive":2,"columnArticles":2089,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":86.52792127404632,"frontendQuestionId":"剑指 Offer 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表中倒数第k个节点","titleSlug":"lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof"},{"acceptance":0.7428642002415193,"acs":0,"articleLive":2,"columnArticles":1747,"formTitle":"[剑指 Offer 24]反转链表","frequency":94.02834587494111,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.72905345687209,"acs":0,"articleLive":2,"columnArticles":1132,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.9078564165293,"frontendQuestionId":"剑指 Offer 25","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并两个排序的链表","titleSlug":"he-bing-liang-ge-pai-xu-de-lian-biao-lcof"},{"acceptance":0.4656096030290317,"acs":0,"articleLive":2,"columnArticles":1124,"formTitle":"[剑指 Offer 26]树的子结构","frequency":68.99964189866665,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7909532587985129,"acs":0,"articleLive":2,"columnArticles":1337,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":66.48435528904942,"frontendQuestionId":"剑指 Offer 27","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的镜像","titleSlug":"er-cha-shu-de-jing-xiang-lcof"},{"acceptance":0.5801225663901279,"acs":0,"articleLive":2,"columnArticles":1038,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":50.13522782876273,"frontendQuestionId":"剑指 Offer 28","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称的二叉树","titleSlug":"dui-cheng-de-er-cha-shu-lcof"},{"acceptance":0.4397870924817033,"acs":0,"articleLive":2,"columnArticles":1420,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":82.1951252551228,"frontendQuestionId":"剑指 Offer 29","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"顺时针打印矩阵","titleSlug":"shun-shi-zhen-da-yin-ju-zhen-lcof"},{"acceptance":0.5734463018090222,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":53.61432305445789,"frontendQuestionId":"剑指 Offer 30","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"包含min函数的栈","titleSlug":"bao-han-minhan-shu-de-zhan-lcof"},{"acceptance":0.614019773863352,"acs":0,"articleLive":2,"columnArticles":879,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":39.85035945697539,"frontendQuestionId":"剑指 Offer 31","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈的压入、弹出序列","titleSlug":"zhan-de-ya-ru-dan-chu-xu-lie-lcof"},{"acceptance":0.645956471232428,"acs":0,"articleLive":2,"columnArticles":899,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":65.22809290727237,"frontendQuestionId":"剑指 Offer 32 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-lcof"},{"acceptance":0.6862277972254635,"acs":0,"articleLive":2,"columnArticles":1024,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.03400574149302,"frontendQuestionId":"剑指 Offer 32 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 II","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof"},{"acceptance":0.5889324045241994,"acs":0,"articleLive":2,"columnArticles":1068,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.529765924417404,"frontendQuestionId":"剑指 Offer 32 - III","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从上到下打印二叉树 III","titleSlug":"cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof"},{"acceptance":0.5494736622900637,"acs":0,"articleLive":2,"columnArticles":905,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":60.63303234332119,"frontendQuestionId":"剑指 Offer 33","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的后序遍历序列","titleSlug":"er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof"},{"acceptance":0.577870742626609,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":64.25557785027472,"frontendQuestionId":"剑指 Offer 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中和为某一值的路径","titleSlug":"er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof"},{"acceptance":0.7214201373980249,"acs":0,"articleLive":2,"columnArticles":770,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":57.68160198775363,"frontendQuestionId":"剑指 Offer 35","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复杂链表的复制","titleSlug":"fu-za-lian-biao-de-fu-zhi-lcof"},{"acceptance":0.654241636520358,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":69.21528879776568,"frontendQuestionId":"剑指 Offer 36","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树与双向链表","titleSlug":"er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof"},{"acceptance":0.5586165491245136,"acs":0,"articleLive":2,"columnArticles":539,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":72.17740184638399,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5791597224913763,"acs":0,"articleLive":2,"columnArticles":1066,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":93.75493286505977,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6892004266713108,"acs":0,"articleLive":2,"columnArticles":981,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":60.12324939675081,"frontendQuestionId":"剑指 Offer 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组中出现次数超过一半的数字","titleSlug":"shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof"},{"acceptance":0.569421772786342,"acs":0,"articleLive":2,"columnArticles":1743,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":76.61140593142102,"frontendQuestionId":"剑指 Offer 40","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小的k个数","titleSlug":"zui-xiao-de-kge-shu-lcof"},{"acceptance":0.5801323313673243,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":45.96220642983116,"frontendQuestionId":"剑指 Offer 41","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的中位数","titleSlug":"shu-ju-liu-zhong-de-zhong-wei-shu-lcof"},{"acceptance":0.6055315501285796,"acs":0,"articleLive":2,"columnArticles":1465,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":89.9235126897983,"frontendQuestionId":"剑指 Offer 42","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"连续子数组的最大和","titleSlug":"lian-xu-zi-shu-zu-de-zui-da-he-lcof"},{"acceptance":0.4824138824138824,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.94267461471072,"frontendQuestionId":"剑指 Offer 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"1～n 整数中 1 出现的次数","titleSlug":"1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof"},{"acceptance":0.41324938579790976,"acs":0,"articleLive":2,"columnArticles":436,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":48.3592446050511,"frontendQuestionId":"剑指 Offer 44","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字序列中某一位的数字","titleSlug":"shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof"},{"acceptance":0.5621570205604741,"acs":0,"articleLive":2,"columnArticles":757,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":67.73810739521967,"frontendQuestionId":"剑指 Offer 45","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数组排成最小的数","titleSlug":"ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof"},{"acceptance":0.5385740491622845,"acs":0,"articleLive":2,"columnArticles":1369,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":70.36925546516386,"frontendQuestionId":"剑指 Offer 46","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把数字翻译成字符串","titleSlug":"ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof"},{"acceptance":0.689096706703805,"acs":0,"articleLive":2,"columnArticles":930,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":53.72317814582376,"frontendQuestionId":"剑指 Offer 47","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"礼物的最大价值","titleSlug":"li-wu-de-zui-da-jie-zhi-lcof"},{"acceptance":0.4647156911789228,"acs":0,"articleLive":2,"columnArticles":972,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":71.3138036703298,"frontendQuestionId":"剑指 Offer 48","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长不含重复字符的子字符串","titleSlug":"zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof"},{"acceptance":0.65135387340651,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[剑指 Offer 49]丑数","frequency":68.3254997866332,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140772449533414,"acs":0,"articleLive":2,"columnArticles":988,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":65.31538652765015,"frontendQuestionId":"剑指 Offer 50","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第一个只出现一次的字符","titleSlug":"di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof"},{"acceptance":0.4807422863306017,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":92.06899566023972,"frontendQuestionId":"剑指 Offer 51","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的逆序对","titleSlug":"shu-zu-zhong-de-ni-xu-dui-lcof"},{"acceptance":0.6475184927111751,"acs":0,"articleLive":2,"columnArticles":1012,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":68.1819017264128,"frontendQuestionId":"剑指 Offer 52","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个链表的第一个公共节点","titleSlug":"liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof"},{"acceptance":0.5395811441107609,"acs":0,"articleLive":2,"columnArticles":1501,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":58.4190689650253,"frontendQuestionId":"剑指 Offer 53 - I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"在排序数组中查找数字 I","titleSlug":"zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof"},{"acceptance":0.44731807143125923,"acs":0,"articleLive":2,"columnArticles":1387,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":54.83621503465977,"frontendQuestionId":"剑指 Offer 53 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"0～n-1中缺失的数字","titleSlug":"que-shi-de-shu-zi-lcof"},{"acceptance":0.7552769923135131,"acs":0,"articleLive":2,"columnArticles":1092,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":48.22319556990675,"frontendQuestionId":"剑指 Offer 54","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的第k大节点","titleSlug":"er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof"},{"acceptance":0.7892919477333836,"acs":0,"articleLive":2,"columnArticles":1221,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":62.43094540801082,"frontendQuestionId":"剑指 Offer 55 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的深度","titleSlug":"er-cha-shu-de-shen-du-lcof"},{"acceptance":0.5869024668348773,"acs":0,"articleLive":2,"columnArticles":890,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":53.21598956401843,"frontendQuestionId":"剑指 Offer 55 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平衡二叉树","titleSlug":"ping-heng-er-cha-shu-lcof"},{"acceptance":0.699503007097136,"acs":0,"articleLive":2,"columnArticles":979,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":63.6217654990774,"frontendQuestionId":"剑指 Offer 56 - I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof"},{"acceptance":0.7988940214556044,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":49.50667288640002,"frontendQuestionId":"剑指 Offer 56 - II","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中数字出现的次数 II","titleSlug":"shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof"},{"acceptance":0.663234196780727,"acs":0,"articleLive":2,"columnArticles":790,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.72900822929705,"frontendQuestionId":"剑指 Offer 57","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的两个数字","titleSlug":"he-wei-sde-liang-ge-shu-zi-lcof"},{"acceptance":0.705987766927782,"acs":0,"articleLive":2,"columnArticles":1805,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":64.036526648794,"frontendQuestionId":"剑指 Offer 57 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"和为s的连续正数序列","titleSlug":"he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof"},{"acceptance":0.44103738895099137,"acs":0,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":59.14053860261054,"frontendQuestionId":"剑指 Offer 58 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转单词顺序","titleSlug":"fan-zhuan-dan-ci-shun-xu-lcof"},{"acceptance":0.8566581042082897,"acs":0,"articleLive":2,"columnArticles":1697,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":55.28625750334918,"frontendQuestionId":"剑指 Offer 58 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左旋转字符串","titleSlug":"zuo-xuan-zhuan-zi-fu-chuan-lcof"},{"acceptance":0.44404846756949395,"acs":0,"articleLive":2,"columnArticles":1138,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":76.93938959973657,"frontendQuestionId":"剑指 Offer 59 - I","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的最大值","titleSlug":"hua-dong-chuang-kou-de-zui-da-zhi-lcof"},{"acceptance":0.4741080112890453,"acs":0,"articleLive":2,"columnArticles":1035,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":52.29108539782145,"frontendQuestionId":"剑指 Offer 59 - II","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"队列的最大值","titleSlug":"dui-lie-de-zui-da-zhi-lcof"},{"acceptance":0.5593544432347372,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":60.229514428449995,"frontendQuestionId":"剑指 Offer 60","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"n个骰子的点数","titleSlug":"nge-tou-zi-de-dian-shu-lcof"},{"acceptance":0.4597925528815337,"acs":0,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":63.19029736474063,"frontendQuestionId":"剑指 Offer 61","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"扑克牌中的顺子","titleSlug":"bu-ke-pai-zhong-de-shun-zi-lcof"},{"acceptance":0.6548983481575603,"acs":0,"articleLive":2,"columnArticles":727,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":72.87636406419927,"frontendQuestionId":"剑指 Offer 62","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆圈中最后剩下的数字","titleSlug":"yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof"},{"acceptance":0.6337925149335609,"acs":0,"articleLive":2,"columnArticles":904,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":61.96636498272967,"frontendQuestionId":"剑指 Offer 63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的最大利润","titleSlug":"gu-piao-de-zui-da-li-run-lcof"},{"acceptance":0.856956847684558,"acs":0,"articleLive":2,"columnArticles":1248,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":55.43795443825677,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5816409137305973,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":42.54028620034479,"frontendQuestionId":"剑指 Offer 65","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加减乘除做加法","titleSlug":"bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof"},{"acceptance":0.5975485820836168,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":54.97953281932987,"frontendQuestionId":"剑指 Offer 66","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建乘积数组","titleSlug":"gou-jian-cheng-ji-shu-zu-lcof"},{"acceptance":0.28462493589224497,"acs":0,"articleLive":2,"columnArticles":527,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":51.14269980068203,"frontendQuestionId":"剑指 Offer 67","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把字符串转换成整数","titleSlug":"ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof"},{"acceptance":0.6931382244927528,"acs":0,"articleLive":2,"columnArticles":652,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":45.96220642983116,"frontendQuestionId":"剑指 Offer 68 - I","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树的最近公共祖先","titleSlug":"er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.6995510827016775,"acs":0,"articleLive":2,"columnArticles":649,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.15592838401515,"frontendQuestionId":"剑指 Offer 68 - II","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof"},{"acceptance":0.2114772103239978,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[剑指 Offer II 001]整数除法","frequency":15.108166890105792,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5938057402302578,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":2.283951040544883,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7929065743944637,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":3.0452680540598442,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.7056388012618297,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7334123222748815,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 005]单词长度的最大乘积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 005","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词长度的最大乘积","titleSlug":"aseY1I"},{"acceptance":0.6813093980992608,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":15.683616972716724,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.47613110081938015,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 007]数组中和为 0 的三个数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 007","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中和为 0 的三个数","titleSlug":"1fGaJU"},{"acceptance":0.5229919084270772,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 008]和大于等于 target 的最短子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和大于等于 target 的最短子数组","titleSlug":"2VG8Kg"},{"acceptance":0.5553480928247533,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 009]乘积小于 K 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 009","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积小于 K 的子数组","titleSlug":"ZVAVXX"},{"acceptance":0.44263565891472867,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 010]和为 k 的子数组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 010","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 k 的子数组","titleSlug":"QTMn0o"},{"acceptance":0.5744386873920553,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":4.001659475973717,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6672005124919923,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6575476306790425,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5211822660098522,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 014]字符串中的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的变位词","titleSlug":"MPnaiL"},{"acceptance":0.6545550289626119,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 015]字符串中的所有变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的所有变位词","titleSlug":"VabMRr"},{"acceptance":0.5149194613150251,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 016]不含重复字符的最长子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 016","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不含重复字符的最长子字符串","titleSlug":"wtcaE1"},{"acceptance":0.5359001040582726,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 017]含有所有字符的最短字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 017","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"含有所有字符的最短字符串","titleSlug":"M1oyTv"},{"acceptance":0.5562390158172232,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 018]有效的回文","frequency":0.0,"frontendQuestionId":"剑指 Offer II 018","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回文","titleSlug":"XltzEq"},{"acceptance":0.48119122257053293,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":15.683616972716724,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7103250478011472,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5387453874538746,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5250573833205815,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":3.0452680540598442,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7156686984582288,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":3.0452680540598442,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7755952380952381,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[剑指 Offer II 024]反转链表","frequency":15.108166890105792,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6123778501628665,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":17.544729672906715,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.6828625235404896,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 026]重排链表","frequency":16.90034257139293,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6346855059252506,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 027]回文链表","frequency":3.0452680540598442,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6079223928860146,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.3004746257758306,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 029]排序的循环链表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 029","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序的循环链表","titleSlug":"4ueAj6"},{"acceptance":0.5458680818802123,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 030]插入、删除和随机访问都是 O(1) 的容器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 030","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入、删除和随机访问都是 O(1) 的容器","titleSlug":"FortPu"},{"acceptance":0.5963139120095124,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 031]最近最少使用缓存","frequency":0.0,"frontendQuestionId":"剑指 Offer II 031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近最少使用缓存","titleSlug":"OrIXps"},{"acceptance":0.599624060150376,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 032]有效的变位词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 032","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的变位词","titleSlug":"dKk3P7"},{"acceptance":0.790112749349523,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 033]变位词组","frequency":0.0,"frontendQuestionId":"剑指 Offer II 033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"变位词组","titleSlug":"sfvd7V"},{"acceptance":0.5731462925851704,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 034]外星语言是否排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 034","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"外星语言是否排序","titleSlug":"lwyVBB"},{"acceptance":0.6970185334407736,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 035]最小时间差","frequency":0.0,"frontendQuestionId":"剑指 Offer II 035","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"569nqc"},{"acceptance":0.6061598951507209,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 036]后缀表达式","frequency":0.0,"frontendQuestionId":"剑指 Offer II 036","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后缀表达式","titleSlug":"8Zf90G"},{"acceptance":0.4571099597006333,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 037]小行星碰撞","frequency":0.0,"frontendQuestionId":"剑指 Offer II 037","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小行星碰撞","titleSlug":"XagZNi"},{"acceptance":0.788627935723115,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 038]每日温度","frequency":0.0,"frontendQuestionId":"剑指 Offer II 038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日温度","titleSlug":"iIQa4I"},{"acceptance":0.5188981422165279,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 039]直方图最大矩形面积","frequency":0.0,"frontendQuestionId":"剑指 Offer II 039","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图最大矩形面积","titleSlug":"0ynMMM"},{"acceptance":0.5746031746031746,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.78295524218271,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 041]滑动窗口的平均值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 041","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动窗口的平均值","titleSlug":"qIsx9U"},{"acceptance":0.8600488201790073,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 042]最近请求次数","frequency":0.0,"frontendQuestionId":"剑指 Offer II 042","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近请求次数","titleSlug":"H8086Q"},{"acceptance":0.6368098159509202,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":0.0,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6586345381526104,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 044]二叉树每层的最大值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 044","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树每层的最大值","titleSlug":"hPov7L"},{"acceptance":0.7993989481592787,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 045]二叉树最底层最左边的值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最底层最左边的值","titleSlug":"LwUNpT"},{"acceptance":0.7248939179632249,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":0.0,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6994740796393689,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":6.157517045032444,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6992316136114161,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7622641509433963,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6292548298068077,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 050]向下的路径节点之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 050","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"向下的路径节点之和","titleSlug":"6eUYwP"},{"acceptance":0.43377001455604075,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":16.90034257139293,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7490272373540856,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":3.5144198644396303,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6469489414694894,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8729857819905213,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 054]所有大于等于节点的值之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有大于等于节点的值之和","titleSlug":"w6cpku"},{"acceptance":0.8941018766756033,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 055]二叉搜索树迭代器","frequency":0.0,"frontendQuestionId":"剑指 Offer II 055","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"kTOapQ"},{"acceptance":0.7504786215698788,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3613138686131387,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 057]值和下标之差都在给定的范围内","frequency":0.0,"frontendQuestionId":"剑指 Offer II 057","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"值和下标之差都在给定的范围内","titleSlug":"7WqeDu"},{"acceptance":0.597667638483965,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 058]日程表","frequency":0.0,"frontendQuestionId":"剑指 Offer II 058","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"日程表","titleSlug":"fi9suh"},{"acceptance":0.6430976430976431,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 059]数据流的第 K 大数值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 059","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流的第 K 大数值","titleSlug":"jBjn9C"},{"acceptance":0.659839715048976,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 060]出现频率最高的 k 个数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现频率最高的 k 个数字","titleSlug":"g5c51o"},{"acceptance":0.5259009009009009,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":4.001659475973717,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.6875,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 062]实现前缀树","frequency":0.0,"frontendQuestionId":"剑指 Offer II 062","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现前缀树","titleSlug":"QC3q1f"},{"acceptance":0.7210884353741497,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 063]替换单词","frequency":0.0,"frontendQuestionId":"剑指 Offer II 063","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换单词","titleSlug":"UhWRSj"},{"acceptance":0.5852713178294574,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 064]神奇的字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 064","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇的字典","titleSlug":"US1pGT"},{"acceptance":0.5953389830508474,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 065]最短的单词编码","frequency":0.0,"frontendQuestionId":"剑指 Offer II 065","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的单词编码","titleSlug":"iSwD2y"},{"acceptance":0.6549586776859504,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 066]单词之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 066","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词之和","titleSlug":"z1R5dt"},{"acceptance":0.671201814058957,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 067]最大的异或","frequency":0.0,"frontendQuestionId":"剑指 Offer II 067","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的异或","titleSlug":"ms70jA"},{"acceptance":0.5273457099849473,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 068]查找插入位置","frequency":0.0,"frontendQuestionId":"剑指 Offer II 068","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找插入位置","titleSlug":"N6YdxV"},{"acceptance":0.7446808510638298,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 069]山峰数组的顶部","frequency":0.0,"frontendQuestionId":"剑指 Offer II 069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山峰数组的顶部","titleSlug":"B1IidL"},{"acceptance":0.6930022573363431,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 070]排序数组中只出现一次的数字","frequency":0.0,"frontendQuestionId":"剑指 Offer II 070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中只出现一次的数字","titleSlug":"skFtm2"},{"acceptance":0.5329768270944741,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42681744749596123,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[剑指 Offer II 072]求平方根","frequency":0.0,"frontendQuestionId":"剑指 Offer II 072","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求平方根","titleSlug":"jJ0w9p"},{"acceptance":0.5554382259767687,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 073]狒狒吃香蕉","frequency":0.0,"frontendQuestionId":"剑指 Offer II 073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"狒狒吃香蕉","titleSlug":"nZZqjQ"},{"acceptance":0.5422818791946309,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 074]合并区间","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7186978297161937,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 075]数组相对排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 075","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组相对排序","titleSlug":"0H97ZC"},{"acceptance":0.6694421315570358,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5485714285714286,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 077]链表排序","frequency":0.0,"frontendQuestionId":"剑指 Offer II 077","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表排序","titleSlug":"7WHec2"},{"acceptance":0.650814332247557,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8609539207760711,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 079]所有子集","frequency":0.0,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.7918050941306756,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 080]含有 k 个元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 080","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有 k 个元素的组合","titleSlug":"uUsW3B"},{"acceptance":0.7914772727272728,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 081]允许重复选择元素的组合","frequency":0.0,"frontendQuestionId":"剑指 Offer II 081","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"允许重复选择元素的组合","titleSlug":"Ygoe9J"},{"acceptance":0.6500672947510094,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8670177748518763,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":6.157517045032444,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6903039073806078,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8634453781512605,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":4.508192885707507,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7531831537708129,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6288,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7463235294117647,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[剑指 Offer II 088]爬楼梯的最少成本","frequency":0.0,"frontendQuestionId":"剑指 Offer II 088","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"爬楼梯的最少成本","titleSlug":"GzCJIP"},{"acceptance":0.6243016759776536,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 089]房屋偷盗","frequency":0.0,"frontendQuestionId":"剑指 Offer II 089","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"房屋偷盗","titleSlug":"Gu0c2T"},{"acceptance":0.5276008492569002,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7438370846730975,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6444444444444445,"acs":0,"articleLive":2,"columnArticles":15,"formTitle":"[剑指 Offer II 092]翻转字符","frequency":0.0,"frontendQuestionId":"剑指 Offer II 092","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符","titleSlug":"cyJERH"},{"acceptance":0.5441176470588235,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 093]最长斐波那契数列","frequency":0.0,"frontendQuestionId":"剑指 Offer II 093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长斐波那契数列","titleSlug":"Q91FMA"},{"acceptance":0.6245136186770428,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 094]最少回文分割","frequency":0.0,"frontendQuestionId":"剑指 Offer II 094","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最少回文分割","titleSlug":"omKAoA"},{"acceptance":0.6822933164396578,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":34.46419146508039,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5112359550561798,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 096]字符串交织","frequency":0.0,"frontendQuestionId":"剑指 Offer II 096","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串交织","titleSlug":"IY6buf"},{"acceptance":0.5236363636363637,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7573033707865169,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 098]路径的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径的数目","titleSlug":"2AoeFn"},{"acceptance":0.6699386503067485,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":23.228329710626443,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7470449172576832,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 100]三角形中最小路径之和","frequency":0.0,"frontendQuestionId":"剑指 Offer II 100","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三角形中最小路径之和","titleSlug":"IlPe0q"},{"acceptance":0.4630242825607064,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 101]分割等和子串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割等和子串","titleSlug":"NUPfPr"},{"acceptance":0.5705209656925032,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 102]加减的目标值","frequency":0.0,"frontendQuestionId":"剑指 Offer II 102","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"加减的目标值","titleSlug":"YaVDxD"},{"acceptance":0.5035035035035035,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":25.17267506260245,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5566298342541437,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 104]排列的数目","frequency":0.0,"frontendQuestionId":"剑指 Offer II 104","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排列的数目","titleSlug":"D0F0SV"},{"acceptance":0.6837881219903692,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5677655677655677,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.035346114169862,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5520282186948854,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[剑指 Offer II 107]矩阵中的距离","frequency":0.0,"frontendQuestionId":"剑指 Offer II 107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的距离","titleSlug":"2bCMpM"},{"acceptance":0.5694915254237288,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[剑指 Offer II 108]单词演变","frequency":0.0,"frontendQuestionId":"剑指 Offer II 108","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词演变","titleSlug":"om3reC"},{"acceptance":0.5665584415584416,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 109]开密码锁","frequency":0.0,"frontendQuestionId":"剑指 Offer II 109","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"开密码锁","titleSlug":"zlDJc7"},{"acceptance":0.836676217765043,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 110]所有路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有路径","titleSlug":"bP4bmD"},{"acceptance":0.6907630522088354,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 111]计算除法","frequency":0.0,"frontendQuestionId":"剑指 Offer II 111","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算除法","titleSlug":"vlzXQL"},{"acceptance":0.5875634517766497,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":0.0,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.6029411764705882,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.90034257139293,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.43301435406698563,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[剑指 Offer II 114]外星文字典","frequency":0.0,"frontendQuestionId":"剑指 Offer II 114","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"外星文字典","titleSlug":"Jf1JuT"},{"acceptance":0.270032930845225,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 115]重建序列","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6500994035785288,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[剑指 Offer II 116]朋友圈","frequency":0.0,"frontendQuestionId":"剑指 Offer II 116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"朋友圈","titleSlug":"bLyHh0"},{"acceptance":0.6149584487534626,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 117]相似的字符串","frequency":0.0,"frontendQuestionId":"剑指 Offer II 117","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相似的字符串","titleSlug":"H6lPxb"},{"acceptance":0.6851851851851852,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 118]多余的边","frequency":0.0,"frontendQuestionId":"剑指 Offer II 118","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多余的边","titleSlug":"7LpjUW"},{"acceptance":0.4544731610337972,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.584581530503954,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7211597090421923,"acs":0,"articleLive":2,"columnArticles":1473,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":78.80639499969246,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6505798502053636,"acs":0,"articleLive":2,"columnArticles":1050,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":49.00677802594963,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5798549624757569,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[面试题 01.03]URL化","frequency":40.50955714540861,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5511822417735074,"acs":0,"articleLive":2,"columnArticles":744,"formTitle":"[面试题 01.04]回文排列","frequency":41.19203908581424,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3340058110849186,"acs":0,"articleLive":2,"columnArticles":526,"formTitle":"[面试题 01.05]一次编辑","frequency":41.899442402635756,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4734325689750918,"acs":0,"articleLive":2,"columnArticles":1130,"formTitle":"[面试题 01.06]字符串压缩","frequency":68.3254997866332,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.75518144134972,"acs":0,"articleLive":2,"columnArticles":939,"formTitle":"[面试题 01.07]旋转矩阵","frequency":55.35979622290369,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6221446216719022,"acs":0,"articleLive":2,"columnArticles":468,"formTitle":"[面试题 01.08]零矩阵","frequency":41.19203908581424,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5516406670252824,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[面试题 01.09]字符串轮转","frequency":30.06830524866882,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6844668951831139,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[面试题 02.01]移除重复节点","frequency":51.772532190408285,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7803737738259112,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":56.73152991862518,"frontendQuestionId":"面试题 02.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"返回倒数第 k 个节点","titleSlug":"kth-node-from-end-of-list-lcci"},{"acceptance":0.8540391339017359,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[面试题 02.03]删除中间节点","frequency":62.29712376003602,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6576911428650092,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[面试题 02.04]分割链表","frequency":49.67613741599302,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.466730864395672,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[面试题 02.05]链表求和","frequency":75.2848203139625,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4826788637958367,"acs":0,"articleLive":2,"columnArticles":489,"formTitle":"[面试题 02.06]回文链表","frequency":35.51884111987334,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6874377829870588,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[面试题 02.07]链表相交","frequency":23.228329710626443,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5306546516890919,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[面试题 02.08]环路检测","frequency":50.36880399666648,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5423078971191224,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 03.01]三合一","frequency":0.0,"frontendQuestionId":"面试题 03.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三合一","titleSlug":"three-in-one-lcci"},{"acceptance":0.6126746506986028,"acs":0,"articleLive":2,"columnArticles":279,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.88889094207611,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3870462920894543,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 03.03]堆盘子","frequency":29.405911010575036,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7120798119082418,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[面试题 03.04]化栈为队","frequency":37.418744341742546,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5454360890043852,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[面试题 03.05]栈排序","frequency":16.90034257139293,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.589578624007419,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 03.06]动物收容所","frequency":30.755546345579138,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5346214740379334,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.01]节点间通路","frequency":34.46419146508039,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7896629213483146,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[面试题 04.02]最小高度树","frequency":52.1493116815743,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8055681540662177,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":39.21296487762663,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5839864396894251,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.544729672906715,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35117893823231594,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":41.899442402635756,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5912413299741843,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 04.06]后继者","frequency":16.90034257139293,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7172943959243085,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":29.405911010575036,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47825760420578295,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":24.500338269107854,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7178222429036761,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[面试题 04.10]检查子树","frequency":5.584581530503954,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4884257906120302,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 04.12]求和路径","frequency":33.79257218300203,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5068485332724575,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 05.01]插入","frequency":0.0,"frontendQuestionId":"面试题 05.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"插入","titleSlug":"insert-into-bits-lcci"},{"acceptance":0.6860826197421662,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":16.90034257139293,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.39071641675384555,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[面试题 05.03]翻转数位","frequency":38.79947899268702,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39423228037089425,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[面试题 05.04]下一个数","frequency":0.0,"frontendQuestionId":"面试题 05.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个数","titleSlug":"closed-number-lcci"},{"acceptance":0.5279328276322695,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 05.06]整数转换","frequency":5.584581530503954,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7041079963828962,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[面试题 05.07]配对交换","frequency":16.90034257139293,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5519189234092042,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[面试题 05.08]绘制直线","frequency":23.852768504985672,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36398283627835076,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.01]三步问题","frequency":45.793640564838526,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.3613925448978948,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 08.02]迷路的机器人","frequency":38.09665775404082,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768525996637054,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.584581530503954,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8227499074035969,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[面试题 08.04]幂集","frequency":43.20294198773284,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6796770302867864,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[面试题 08.05]递归乘法","frequency":5.584581530503954,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6559334403736681,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":59.31053638360887,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8130081300813008,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":40.50955714540861,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7180641269546657,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":43.88889094207611,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.811593637922969,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[面试题 08.09]括号","frequency":62.29712376003602,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.5595743767966705,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[面试题 08.10]颜色填充","frequency":16.280516258406706,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.49470887691645515,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":50.36880399666648,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7597352771916362,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[面试题 08.12]八皇后","frequency":49.67613741599302,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5013677217663149,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[面试题 08.13]堆箱子","frequency":17.544729672906715,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.533975163945863,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":0.0,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.554177525833832,"acs":0,"articleLive":2,"columnArticles":2358,"formTitle":"[面试题 10.01]合并排序的数组","frequency":71.0085369396652,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7394785242886509,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.606931920283714,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39643652561247217,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.79036506755462,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.552779606247382,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.500338269107854,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4561641326250229,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":45.58955729509267,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6300146412884334,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":7.381878117988307,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670038624241309,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":39.85035945697539,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8329330582146602,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[面试题 16.01]交换数字","frequency":30.755546345579138,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.765499535696728,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[面试题 16.02]单词频率","frequency":6.157517045032444,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44329704219429,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 16.03]交点","frequency":7.381878117988307,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4615691224340663,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[面试题 16.04]井字游戏","frequency":0.0,"frontendQuestionId":"面试题 16.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"井字游戏","titleSlug":"tic-tac-toe-lcci"},{"acceptance":0.464487743557511,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.06830524866882,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.4235630979817026,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 16.06]最小差","frequency":30.755546345579138,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7336076711052447,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[面试题 16.07]最大数值","frequency":41.19203908581424,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3764284495991813,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":7.381878117988307,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5482686253934942,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":0.0,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6844159464733761,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[面试题 16.10]生存人数","frequency":24.500338269107854,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4410486944624597,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[面试题 16.11]跳水板","frequency":23.852768504985672,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43312251112672756,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[面试题 16.13]平分正方形","frequency":0.0,"frontendQuestionId":"面试题 16.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平分正方形","titleSlug":"bisect-squares-lcci"},{"acceptance":0.550136809914695,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.14]最佳直线","frequency":0.0,"frontendQuestionId":"面试题 16.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳直线","titleSlug":"best-line-lcci"},{"acceptance":0.5031066822977726,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.157517045032444,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.45163134987451153,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[面试题 16.16]部分排序","frequency":40.50955714540861,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.601025310102531,"acs":0,"articleLive":2,"columnArticles":364,"formTitle":"[面试题 16.17]连续数列","frequency":43.88889094207611,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3442551432770022,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[面试题 16.18]模式匹配","frequency":35.160696630590536,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6092873306674107,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[面试题 16.19]水域大小","frequency":49.67613741599302,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7206395101624288,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[面试题 16.20]T9键盘","frequency":30.06830524866882,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46471344127473657,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.584581530503954,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5816663002857771,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.381878117988307,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47118273695711554,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[面试题 16.24]数对和","frequency":23.852768504985672,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5441941391941392,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.491963529004,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3865165997398337,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[面试题 16.26]计算器","frequency":59.79036506755462,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.598096110771737,"acs":0,"articleLive":2,"columnArticles":165,"formTitle":"[面试题 17.01]不用加号的加法","frequency":24.500338269107854,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6454111893867868,"acs":0,"articleLive":2,"columnArticles":433,"formTitle":"[面试题 17.04]消失的数字","frequency":37.418744341742546,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.386542750929368,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.544729672906715,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4481098967211471,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.584581530503954,"frontendQuestionId":"面试题 17.06","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"2出现的次数","titleSlug":"number-of-2s-in-range-lcci"},{"acceptance":0.41056076592418916,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[面试题 17.07]婴儿名字","frequency":35.160696630590536,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2715479182231882,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[面试题 17.08]马戏团人塔","frequency":39.52902380316885,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5504062716916418,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[面试题 17.09]第 k 个数","frequency":55.312490525862955,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.571377896212213,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[面试题 17.10]主要元素","frequency":61.606931920283714,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6865386499461155,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[面试题 17.11]单词距离","frequency":35.160696630590536,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6316717019133937,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 17.12]BiNode","frequency":5.584581530503954,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5533063120502778,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":30.755546345579138,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5479903232388004,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[面试题 17.14]最小K个数","frequency":72.28887414546972,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40305972344807295,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.15]最长单词","frequency":30.755546345579138,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5194765593009174,"acs":0,"articleLive":2,"columnArticles":1121,"formTitle":"[面试题 17.16]按摩师","frequency":56.03400574149302,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44250295159386066,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[面试题 17.17]多次搜索","frequency":16.280516258406706,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4454298291040911,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.18]最短超串","frequency":25.17267506260245,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5824260729086184,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[面试题 17.19]消失的两个数字","frequency":33.14420183446886,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5714067511837483,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":16.90034257139293,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6353749617831613,"acs":0,"articleLive":2,"columnArticles":528,"formTitle":"[面试题 17.21]直方图的水量","frequency":89.3207124926434,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.3707875133025896,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":41.19203908581424,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3799002138275125,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[面试题 17.23]最大黑方阵","frequency":6.755948795401358,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5167390310786106,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 17.24]最大子矩阵","frequency":71.85410524179639,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.49133574007220215,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[面试题 17.25]单词矩阵","frequency":28.149272277419424,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.3416536661466459,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.280516258406706,"frontendQuestionId":"面试题 17.26","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏相似度","titleSlug":"sparse-similarity-lcci"}]
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/CompareVersionNumbers.md b/src/main/java/leetcode/editor/cn/doc/content/CompareVersionNumbers.md
new file mode 100644
index 0000000..94993fe
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/CompareVersionNumbers.md
@@ -0,0 +1,65 @@
+给你两个版本号 version1 和 version2 ，请你比较它们。
+
+版本号由一个或多个修订号组成，各修订号由一个 '.' 连接。每个修订号由 多位数字 组成，可能包含 前导零 。每个版本号至少包含一个字符。修订号从左到右编号，下标从 0 开始，最左边的修订号下标为 0 ，下一个修订号下标为 1 ，以此类推。例如，2.5.33 和 0.1 都是有效的版本号。
+
+比较版本号时，请按从左到右的顺序依次比较它们的修订号。比较修订号时，只需比较 忽略任何前导零后的整数值 。也就是说，修订号 1 和修订号 001 相等 。如果版本号没有指定某个下标处的修订号，则该修订号视为 0 。例如，版本 1.0 小于版本 1.1 ，因为它们下标为 0 的修订号相同，而下标为 1 的修订号分别为 0 和 1 ，0 < 1 。
+
+返回规则如下：
+
+
+ - 如果
version1 > version2 返回 1，
+ - 如果
version1 < version2 返回 -1，
+ - 除此之外返回
0。
+
+
+
+
+示例 1：
+
+
+输入：version1 = "1.01", version2 = "1.001"
+输出：0
+解释：忽略前导零，"01" 和 "001" 都表示相同的整数 "1"
+
+
+示例 2：
+
+
+输入：version1 = "1.0", version2 = "1.0.0"
+输出：0
+解释：version1 没有指定下标为 2 的修订号，即视为 "0"
+
+
+示例 3：
+
+
+输入：version1 = "0.1", version2 = "1.1"
+输出：-1
+解释：version1 中下标为 0 的修订号是 "0"，version2 中下标为 0 的修订号是 "1" 。0 < 1，所以 version1 < version2
+
+
+示例 4：
+
+
+输入：version1 = "1.0.1", version2 = "1"
+输出：1
+
+
+示例 5：
+
+
+输入：version1 = "7.5.2.4", version2 = "7.5.3"
+输出：-1
+
+
+
+
+提示：
+
+
+ 1 <= version1.length, version2.length <= 500version1 和 version2 仅包含数字和 '.'version1 和 version2 都是 有效版本号version1 和 version2 的所有修订号都可以存储在 32 位整数 中
+
👍 215👎 0
\ No newline at end of file