diff --git a/src/main/java/leetcode/editor/cn/LongestWordInDictionaryThroughDeleting.java b/src/main/java/leetcode/editor/cn/LongestWordInDictionaryThroughDeleting.java new file mode 100644 index 0000000..b5b1b94 --- /dev/null +++ b/src/main/java/leetcode/editor/cn/LongestWordInDictionaryThroughDeleting.java @@ -0,0 +1,66 @@ +//给你一个字符串 s 和一个字符串数组 dictionary 作为字典，找出并返回字典中最长的字符串，该字符串可以通过删除 s 中的某些字符得到。 +// +// 如果答案不止一个，返回长度最长且字典序最小的字符串。如果答案不存在，则返回空字符串。 +// +// +// +// 示例 1： +// +// +//输入：s = "abpcplea", dictionary = ["ale","apple","monkey","plea"] +//输出："apple" +// +// +// 示例 2： +// +// +//输入：s = "abpcplea", dictionary = ["a","b","c"] +//输出："a" +// +// +// +// +// 提示： +// +// +// 1 <= s.length <= 1000 +// 1 <= dictionary.length <= 1000 +// 1 <= dictionary[i].length <= 1000 +// s 和 dictionary[i] 仅由小写英文字母组成 +// +// Related Topics 数组 双指针 字符串 排序 👍 214 👎 0 + +package leetcode.editor.cn; + +import java.util.*; + +//524:通过删除字母匹配到字典里最长单词 +class LongestWordInDictionaryThroughDeleting { + public static void main(String[] args) { + //测试代码 + Solution solution = new LongestWordInDictionaryThroughDeleting().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public String findLongestWord(String s, List dictionary) { + dictionary.sort((o1, o2) -> o2.length() != o1.length() ? o2.length() - o1.length() : o1.compareTo(o2)); + for (String str : dictionary) { + int i = 0, j = 0; + while (i < str.length() && j < s.length()) { + if (str.charAt(i) == s.charAt(j)) { + i++; + } + j++; + } + if (i == str.length()) { + return str; + } + } + return ""; + } + } +//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 4db60ec..c4a88b5 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.6120856636202429,"acs":0,"articleLive":2,"columnArticles":181,"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.5197945791702065,"acs":0,"articleLive":2,"columnArticles":14032,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.40838714671194426,"acs":0,"articleLive":2,"columnArticles":7041,"formTitle":"[2]两数相加","frequency":99.24382028310988,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37973053704280285,"acs":0,"articleLive":2,"columnArticles":7265,"formTitle":"[3]无重复字符的最长子串","frequency":95.8724718869848,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.4079530143768656,"acs":0,"articleLive":2,"columnArticles":3743,"formTitle":"[4]寻找两个正序数组的中位数","frequency":95.81785055470957,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.3536585963800896,"acs":0,"articleLive":2,"columnArticles":3909,"formTitle":"[5]最长回文子串","frequency":97.73146084932966,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5064815350234192,"acs":0,"articleLive":2,"columnArticles":2406,"formTitle":"[6]Z 字形变换","frequency":79.4529377026538,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35338183696751835,"acs":0,"articleLive":2,"columnArticles":5183,"formTitle":"[7]整数反转","frequency":98.48764056621978,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21713459046484335,"acs":0,"articleLive":2,"columnArticles":2642,"formTitle":"[8]字符串转换整数 (atoi)","frequency":72.54695333267702,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5849422446390454,"acs":0,"articleLive":2,"columnArticles":4849,"formTitle":"[9]回文数","frequency":82.27318427333643,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.3163473810616587,"acs":0,"articleLive":2,"columnArticles":1223,"formTitle":"[10]正则表达式匹配","frequency":86.02978284859762,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6299974474235156,"acs":0,"articleLive":2,"columnArticles":2957,"formTitle":"[11]盛最多水的容器","frequency":87.61295032950238,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.6652593360066644,"acs":0,"articleLive":2,"columnArticles":1738,"formTitle":"[12]整数转罗马数字","frequency":76.49731730264035,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.632636971715966,"acs":0,"articleLive":2,"columnArticles":3812,"formTitle":"[13]罗马数字转整数","frequency":83.5088460891701,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.4081095057155842,"acs":0,"articleLive":2,"columnArticles":3809,"formTitle":"[14]最长公共前缀","frequency":90.4912937155653,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.3344213046267466,"acs":0,"articleLive":2,"columnArticles":3003,"formTitle":"[15]三数之和","frequency":94.20095358151292,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.45951429029174623,"acs":0,"articleLive":2,"columnArticles":1402,"formTitle":"[16]最接近的三数之和","frequency":84.07690706226889,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5721392691781271,"acs":0,"articleLive":2,"columnArticles":3002,"formTitle":"[17]电话号码的字母组合","frequency":74.16452747594691,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4004806528899209,"acs":0,"articleLive":2,"columnArticles":1483,"formTitle":"[18]四数之和","frequency":66.65380679516095,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.4285887599747108,"acs":0,"articleLive":2,"columnArticles":3767,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":75.7628183450768,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44488016694861426,"acs":0,"articleLive":2,"columnArticles":5455,"formTitle":"[20]有效的括号","frequency":92.96956266325547,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672511795661956,"acs":0,"articleLive":2,"columnArticles":3390,"formTitle":"[21]合并两个有序链表","frequency":85.56074543000263,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7724911856734507,"acs":0,"articleLive":2,"columnArticles":2579,"formTitle":"[22]括号生成","frequency":89.88681946396353,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5589622103080039,"acs":0,"articleLive":2,"columnArticles":2060,"formTitle":"[23]合并K个升序链表","frequency":83.13438229925943,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031698913692741,"acs":0,"articleLive":2,"columnArticles":2463,"formTitle":"[24]两两交换链表中的节点","frequency":59.065689318758054,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6567340816948278,"acs":0,"articleLive":2,"columnArticles":2136,"formTitle":"[25]K 个一组翻转链表","frequency":89.02505733122635,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5400013580037345,"acs":0,"articleLive":2,"columnArticles":4441,"formTitle":"[26]删除有序数组中的重复项","frequency":83.37404021786968,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5980749381793746,"acs":0,"articleLive":2,"columnArticles":3996,"formTitle":"[27]移除元素","frequency":76.7686210060169,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.4067613978950649,"acs":0,"articleLive":2,"columnArticles":3172,"formTitle":"[28]实现 strStr()","frequency":72.85044951436078,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.20758964680506875,"acs":0,"articleLive":2,"columnArticles":875,"formTitle":"[29]两数相除","frequency":66.23431387975553,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35695203066816716,"acs":0,"articleLive":2,"columnArticles":577,"formTitle":"[30]串联所有单词的子串","frequency":53.094630916820584,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37324336113806517,"acs":0,"articleLive":2,"columnArticles":1703,"formTitle":"[31]下一个排列","frequency":81.16775266804034,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3564052389997439,"acs":0,"articleLive":2,"columnArticles":1271,"formTitle":"[32]最长有效括号","frequency":76.04568862465804,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.42651598419819475,"acs":0,"articleLive":2,"columnArticles":2360,"formTitle":"[33]搜索旋转排序数组","frequency":70.8940396805188,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.42412971569093594,"acs":0,"articleLive":2,"columnArticles":3197,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.73650259698296,"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.46490653962180156,"acs":0,"articleLive":2,"columnArticles":3832,"formTitle":"[35]搜索插入位置","frequency":76.11506552431183,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6281635231477304,"acs":0,"articleLive":2,"columnArticles":1142,"formTitle":"[36]有效的数独","frequency":53.3478299777247,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6703337100221929,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[37]解数独","frequency":61.690060669393745,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.580123831081983,"acs":0,"articleLive":2,"columnArticles":2244,"formTitle":"[38]外观数列","frequency":63.58813702289816,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.727238343571249,"acs":0,"articleLive":2,"columnArticles":1904,"formTitle":"[39]组合总和","frequency":72.69091462549223,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.625980738660534,"acs":0,"articleLive":2,"columnArticles":1359,"formTitle":"[40]组合总和 II","frequency":70.31779625441877,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.4193366607631621,"acs":0,"articleLive":2,"columnArticles":1393,"formTitle":"[41]缺失的第一个正数","frequency":87.86324529543538,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5777832189171361,"acs":0,"articleLive":2,"columnArticles":2379,"formTitle":"[42]接雨水","frequency":94.95713329840301,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4491000096773153,"acs":0,"articleLive":2,"columnArticles":1122,"formTitle":"[43]字符串相乘","frequency":82.62661924419672,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.3280945741516804,"acs":0,"articleLive":2,"columnArticles":542,"formTitle":"[44]通配符匹配","frequency":62.08648790022288,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4272723241996985,"acs":0,"articleLive":2,"columnArticles":1561,"formTitle":"[45]跳跃游戏 II","frequency":95.45000293856651,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7825796302080555,"acs":0,"articleLive":2,"columnArticles":2626,"formTitle":"[46]全排列","frequency":93.10343709480583,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6372286071432905,"acs":0,"articleLive":2,"columnArticles":1444,"formTitle":"[47]全排列 II","frequency":66.16485835804478,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7351073223746774,"acs":0,"articleLive":2,"columnArticles":1835,"formTitle":"[48]旋转图像","frequency":72.05836158318574,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6643523963006519,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[49]字母异位词分组","frequency":67.83158153068428,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3768136947319117,"acs":0,"articleLive":2,"columnArticles":1264,"formTitle":"[50]Pow(x, n)","frequency":69.73650259698296,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7391883129642001,"acs":0,"articleLive":2,"columnArticles":1512,"formTitle":"[51]N 皇后","frequency":67.12310927027882,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8230613605795857,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[52]N皇后 II","frequency":31.538177869095342,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.551931602279924,"acs":0,"articleLive":2,"columnArticles":3692,"formTitle":"[53]最大子序和","frequency":77.83120006729817,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.4802389444205753,"acs":0,"articleLive":2,"columnArticles":1966,"formTitle":"[54]螺旋矩阵","frequency":82.98551868393096,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.43236232081198467,"acs":0,"articleLive":2,"columnArticles":2424,"formTitle":"[55]跳跃游戏","frequency":70.81345735447306,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46776656090148233,"acs":0,"articleLive":2,"columnArticles":2262,"formTitle":"[56]合并区间","frequency":84.46449428608301,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.41086195660044894,"acs":0,"articleLive":2,"columnArticles":917,"formTitle":"[57]插入区间","frequency":38.79045176980457,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.3554603540822287,"acs":0,"articleLive":2,"columnArticles":2359,"formTitle":"[58]最后一个单词的长度","frequency":56.10804185885059,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7922454185922787,"acs":0,"articleLive":2,"columnArticles":1532,"formTitle":"[59]螺旋矩阵 II","frequency":78.5717059133319,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5236409265499447,"acs":0,"articleLive":2,"columnArticles":936,"formTitle":"[60]排列序列","frequency":43.8239249727883,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4178455852351109,"acs":0,"articleLive":2,"columnArticles":1963,"formTitle":"[61]旋转链表","frequency":69.13852680673416,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6610318312605317,"acs":0,"articleLive":2,"columnArticles":2379,"formTitle":"[62]不同路径","frequency":65.70213336505965,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3905297197412997,"acs":0,"articleLive":2,"columnArticles":1678,"formTitle":"[63]不同路径 II","frequency":68.48609596140697,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.688160927641557,"acs":0,"articleLive":2,"columnArticles":2047,"formTitle":"[64]最小路径和","frequency":73.35422550426757,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26919323645783433,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[65]有效数字","frequency":43.20505075029571,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4582459163794395,"acs":0,"articleLive":2,"columnArticles":3115,"formTitle":"[66]加一","frequency":62.56426715016167,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5437586771968955,"acs":0,"articleLive":2,"columnArticles":1750,"formTitle":"[67]二进制求和","frequency":55.497985809414416,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5252519509317565,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[68]文本左右对齐","frequency":43.275461448582355,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.3926682925664402,"acs":0,"articleLive":2,"columnArticles":1894,"formTitle":"[69]x 的平方根","frequency":77.5079007827668,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5288986308633326,"acs":0,"articleLive":2,"columnArticles":3498,"formTitle":"[70]爬楼梯","frequency":91.74151710558918,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4213719787383412,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[71]简化路径","frequency":56.10804185885059,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6135713390507225,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[72]编辑距离","frequency":89.90349702391444,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6028228717829277,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[73]矩阵置零","frequency":54.26020950585227,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4596308134933308,"acs":0,"articleLive":2,"columnArticles":1666,"formTitle":"[74]搜索二维矩阵","frequency":74.9878726359834,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5948679200758762,"acs":0,"articleLive":2,"columnArticles":1815,"formTitle":"[75]颜色分类","frequency":53.77199752893124,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.4252862925998168,"acs":0,"articleLive":2,"columnArticles":1232,"formTitle":"[76]最小覆盖子串","frequency":77.5079007827668,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.7700200516646495,"acs":0,"articleLive":2,"columnArticles":1245,"formTitle":"[77]组合","frequency":73.92745977304584,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.800933280901822,"acs":0,"articleLive":2,"columnArticles":2000,"formTitle":"[78]子集","frequency":71.16041885547531,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45800187055349467,"acs":0,"articleLive":2,"columnArticles":1367,"formTitle":"[79]单词搜索","frequency":72.42137728473882,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6163609053011764,"acs":0,"articleLive":2,"columnArticles":1310,"formTitle":"[80]删除有序数组中的重复项 II","frequency":68.36100988839117,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4156347513024422,"acs":0,"articleLive":2,"columnArticles":980,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.16793185526207,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5297118350763674,"acs":0,"articleLive":2,"columnArticles":1655,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":80.61467054031831,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5387632338368243,"acs":0,"articleLive":2,"columnArticles":1901,"formTitle":"[83]删除排序链表中的重复元素","frequency":71.19396149733862,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43309121739949613,"acs":0,"articleLive":2,"columnArticles":1131,"formTitle":"[84]柱状图中最大的矩形","frequency":76.7686210060169,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157120534511558,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[85]最大矩形","frequency":61.067036903216476,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6323455118076382,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[86]分隔链表","frequency":56.60312421482953,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48799015547719904,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[87]扰乱字符串","frequency":67.30791028931445,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5160138029891211,"acs":0,"articleLive":2,"columnArticles":3162,"formTitle":"[88]合并两个有序数组","frequency":96.97528113243958,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7097780133364558,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[89]格雷编码","frequency":43.8239249727883,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.63365880272416,"acs":0,"articleLive":2,"columnArticles":1179,"formTitle":"[90]子集 II","frequency":71.9113658668824,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3060349341929177,"acs":0,"articleLive":2,"columnArticles":1487,"formTitle":"[91]解码方法","frequency":71.3885580548886,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5477157387352953,"acs":0,"articleLive":2,"columnArticles":1990,"formTitle":"[92]反转链表 II","frequency":88.15638529659498,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5387164471881265,"acs":0,"articleLive":2,"columnArticles":1298,"formTitle":"[93]复原 IP 地址","frequency":82.12774798830387,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559313655775755,"acs":0,"articleLive":2,"columnArticles":2251,"formTitle":"[94]二叉树的中序遍历","frequency":62.61688513489456,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7008027122700304,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[95]不同的二叉搜索树 II","frequency":61.71884088822722,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6991494328078444,"acs":0,"articleLive":2,"columnArticles":1252,"formTitle":"[96]不同的二叉搜索树","frequency":65.24969981134575,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4570972472579512,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[97]交错字符串","frequency":45.124015532816784,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.3491908965039806,"acs":0,"articleLive":2,"columnArticles":1887,"formTitle":"[98]验证二叉搜索树","frequency":74.02457674081053,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.612591055582535,"acs":0,"articleLive":2,"columnArticles":572,"formTitle":"[99]恢复二叉搜索树","frequency":56.73723477125924,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6034274930590549,"acs":0,"articleLive":2,"columnArticles":1851,"formTitle":"[100]相同的树","frequency":56.87666484966001,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.562227302224471,"acs":0,"articleLive":2,"columnArticles":2208,"formTitle":"[101]对称二叉树","frequency":74.07947797616669,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419777248865927,"acs":0,"articleLive":2,"columnArticles":2446,"formTitle":"[102]二叉树的层序遍历","frequency":86.78596256548772,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715909205193447,"acs":0,"articleLive":2,"columnArticles":1552,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":80.68026154495558,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7661929110238787,"acs":0,"articleLive":2,"columnArticles":2499,"formTitle":"[104]二叉树的最大深度","frequency":76.93375664004046,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7040754769514551,"acs":0,"articleLive":2,"columnArticles":1397,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":83.35778717412259,"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.7213499828260557,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":72.56903546849053,"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.6959822607957523,"acs":0,"articleLive":2,"columnArticles":1286,"formTitle":"[107]二叉树的层序遍历 II","frequency":62.67444281767687,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602064359441408,"acs":0,"articleLive":2,"columnArticles":1166,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":51.46487541412517,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.76342237503306,"acs":0,"articleLive":2,"columnArticles":710,"formTitle":"[109]有序链表转换二叉搜索树","frequency":56.81728875497233,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.5630783027857182,"acs":0,"articleLive":2,"columnArticles":1431,"formTitle":"[110]平衡二叉树","frequency":60.161155652601806,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.48492680934158633,"acs":0,"articleLive":2,"columnArticles":1750,"formTitle":"[111]二叉树的最小深度","frequency":46.24117571728132,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257407657281183,"acs":0,"articleLive":2,"columnArticles":1636,"formTitle":"[112]路径总和","frequency":61.1384310469625,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6266445295195975,"acs":0,"articleLive":2,"columnArticles":1221,"formTitle":"[113]路径总和 II","frequency":63.17778099627533,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.7254444914916719,"acs":0,"articleLive":2,"columnArticles":1290,"formTitle":"[114]二叉树展开为链表","frequency":45.63477704251178,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5229410635438664,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[115]不同的子序列","frequency":63.40327042421643,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7029514352239575,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.15922969822324,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.6117103235747303,"acs":0,"articleLive":2,"columnArticles":737,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":27.80141594153932,"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.7278027374360045,"acs":0,"articleLive":2,"columnArticles":1696,"formTitle":"[118]杨辉三角","frequency":73.22760110450378,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6646222695183711,"acs":0,"articleLive":2,"columnArticles":1184,"formTitle":"[119]杨辉三角 II","frequency":56.0736585058937,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.679765169694892,"acs":0,"articleLive":2,"columnArticles":1543,"formTitle":"[120]三角形最小路径和","frequency":52.536423659939935,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734305770160982,"acs":0,"articleLive":2,"columnArticles":3315,"formTitle":"[121]买卖股票的最佳时机","frequency":87.45491589733025,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6883787635082655,"acs":0,"articleLive":2,"columnArticles":2593,"formTitle":"[122]买卖股票的最佳时机 II","frequency":66.92070889507897,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5349586608696374,"acs":0,"articleLive":2,"columnArticles":807,"formTitle":"[123]买卖股票的最佳时机 III","frequency":65.86050787875138,"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.4437377928640264,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[124]二叉树中的最大路径和","frequency":84.80456571311251,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47365360778797544,"acs":0,"articleLive":2,"columnArticles":1806,"formTitle":"[125]验证回文串","frequency":69.15537106141561,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39400849445050845,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[126]单词接龙 II","frequency":34.76552785321028,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.4675105647330004,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[127]单词接龙","frequency":50.63968594761494,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5432969430879347,"acs":0,"articleLive":2,"columnArticles":1075,"formTitle":"[128]最长连续序列","frequency":80.29840970675095,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6810491134782584,"acs":0,"articleLive":2,"columnArticles":1095,"formTitle":"[129]求根节点到叶节点数字之和","frequency":61.11841526725883,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.4438201850413165,"acs":0,"articleLive":2,"columnArticles":1149,"formTitle":"[130]被围绕的区域","frequency":54.39401864946688,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230118902051047,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[131]分割回文串","frequency":73.28492090279562,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.4920588531694044,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[132]分割回文串 II","frequency":45.124015532816784,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6754108902464396,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[133]克隆图","frequency":16.62839297027137,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5765550126733474,"acs":0,"articleLive":2,"columnArticles":956,"formTitle":"[134]加油站","frequency":74.0675949772522,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4862587157348906,"acs":0,"articleLive":2,"columnArticles":769,"formTitle":"[135]分发糖果","frequency":85.60628309308083,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.7194977808509003,"acs":0,"articleLive":2,"columnArticles":2216,"formTitle":"[136]只出现一次的数字","frequency":75.85712839120504,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.7197128545634573,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[137]只出现一次的数字 II","frequency":72.91920378793894,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6599164602108841,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[138]复制带随机指针的链表","frequency":66.7434081884898,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5135117375519525,"acs":0,"articleLive":2,"columnArticles":1172,"formTitle":"[139]单词拆分","frequency":74.97849289764906,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.48565992203452757,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[140]单词拆分 II","frequency":36.3581132853949,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123360018121017,"acs":0,"articleLive":2,"columnArticles":2669,"formTitle":"[141]环形链表","frequency":77.07296635814205,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5519744716323853,"acs":0,"articleLive":2,"columnArticles":1679,"formTitle":"[142]环形链表 II","frequency":70.20020723024693,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6185174597920773,"acs":0,"articleLive":2,"columnArticles":1060,"formTitle":"[143]重排链表","frequency":89.60758142442788,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7028177348871085,"acs":0,"articleLive":2,"columnArticles":1795,"formTitle":"[144]二叉树的前序遍历","frequency":50.06644475815737,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.749598641793571,"acs":0,"articleLive":2,"columnArticles":1515,"formTitle":"[145]二叉树的后序遍历","frequency":69.27290113232668,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266291402555414,"acs":0,"articleLive":2,"columnArticles":1356,"formTitle":"[146]LRU 缓存机制","frequency":91.41443416465991,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6808635781752759,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[147]对链表进行插入排序","frequency":46.06282413033297,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6670210007778066,"acs":0,"articleLive":2,"columnArticles":1224,"formTitle":"[148]排序链表","frequency":76.14442850961444,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.338204114800724,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[149]直线上最多的点数","frequency":65.97850381313035,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362270450751252,"acs":0,"articleLive":2,"columnArticles":1026,"formTitle":"[150]逆波兰表达式求值","frequency":69.10172837532362,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4813794350124351,"acs":0,"articleLive":2,"columnArticles":1397,"formTitle":"[151]翻转字符串里的单词","frequency":53.9468215446853,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4207950292418322,"acs":0,"articleLive":2,"columnArticles":1206,"formTitle":"[152]乘积最大子数组","frequency":76.14442850961444,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5662120617926223,"acs":0,"articleLive":2,"columnArticles":1454,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":56.60312421482953,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319213977970748,"acs":0,"articleLive":2,"columnArticles":884,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":64.2624707739827,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5730945956395573,"acs":0,"articleLive":2,"columnArticles":1569,"formTitle":"[155]最小栈","frequency":69.21421895800107,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.7240270921822982,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":25.539106844866836,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5313441832429174,"acs":0,"articleLive":2,"columnArticles":81,"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.5914096916299559,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":5.778067303239537,"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.5442806413429463,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.10437795901931,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6128207385815473,"acs":0,"articleLive":2,"columnArticles":1925,"formTitle":"[160]相交链表","frequency":68.48609596140697,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.3364468947919989,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":5.778067303239537,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.49478180825586077,"acs":0,"articleLive":2,"columnArticles":721,"formTitle":"[162]寻找峰值","frequency":59.60514544374432,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.3245244291316937,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[163]缺失的区间","frequency":17.934665866602437,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.610724831933653,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[164]最大间距","frequency":58.22938019843856,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5185132032146957,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[165]比较版本号","frequency":55.497985809414416,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.29854927235874196,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[166]分数到小数","frequency":51.911198458957706,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5864384370400552,"acs":0,"articleLive":2,"columnArticles":1850,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":65.73483842761833,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.432660152917842,"acs":0,"articleLive":2,"columnArticles":741,"formTitle":"[168]Excel表列名称","frequency":59.22899757099898,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.66479164133444,"acs":0,"articleLive":2,"columnArticles":2140,"formTitle":"[169]多数元素","frequency":67.9803131761705,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41708794233945645,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":4.6634686777810055,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.7175195779856428,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[171]Excel 表列序号","frequency":47.2521926404652,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4383556254917388,"acs":0,"articleLive":2,"columnArticles":587,"formTitle":"[172]阶乘后的零","frequency":45.32672166757912,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8036273146135791,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[173]二叉搜索树迭代器","frequency":48.40951537413687,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.47989320661199253,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[174]地下城游戏","frequency":63.08899128278487,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7398588232956465,"acs":0,"articleLive":2,"columnArticles":1443,"formTitle":"[175]组合两个表","frequency":91.78532633247887,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35611690096610704,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[176]第二高的薪水","frequency":90.63066271256598,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4625612031853371,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[177]第N高的薪水","frequency":75.20413696853653,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6029882327315724,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[178]分数排名","frequency":67.77104806279665,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.40977777470619337,"acs":0,"articleLive":2,"columnArticles":945,"formTitle":"[179]最大数","frequency":81.63549600756768,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48709714351136296,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[180]连续出现的数字","frequency":67.63764581894857,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7027359509689367,"acs":0,"articleLive":2,"columnArticles":657,"formTitle":"[181]超过经理收入的员工","frequency":68.59032278967116,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7975454869139208,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[182]查找重复的电子邮箱","frequency":60.51684055436613,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6774388639332986,"acs":0,"articleLive":2,"columnArticles":531,"formTitle":"[183]从不订购的客户","frequency":45.49415006574267,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47502436936829845,"acs":0,"articleLive":2,"columnArticles":655,"formTitle":"[184]部门工资最高的员工","frequency":73.28492090279562,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.4942491623077972,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[185]部门工资前三高的所有员工","frequency":73.6197412545423,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7541218637992831,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[186]翻转字符串里的单词 II","frequency":5.208997904445751,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.48365809480958477,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[187]重复的DNA序列","frequency":30.955160141743228,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39035238226813496,"acs":0,"articleLive":2,"columnArticles":678,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":52.35377697976856,"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.4520973631275144,"acs":0,"articleLive":2,"columnArticles":1644,"formTitle":"[189]旋转数组","frequency":64.42444614321764,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6965846552282292,"acs":0,"articleLive":2,"columnArticles":813,"formTitle":"[190]颠倒二进制位","frequency":49.82106855756734,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7479060633991905,"acs":0,"articleLive":2,"columnArticles":1180,"formTitle":"[191]位1的个数","frequency":60.77756697174821,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.3558048065064498,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[192]统计词频","frequency":57.51094219314563,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.32434208032747536,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[193]有效电话号码","frequency":32.140266047348355,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.3449026813665442,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":23.53390457822948,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4360549132947977,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":52.57881184854276,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6652436163795992,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[196]删除重复的电子邮箱","frequency":56.66634259452247,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338964369003005,"acs":0,"articleLive":2,"columnArticles":491,"formTitle":"[197]上升的温度","frequency":54.86952966404349,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5134207419645949,"acs":0,"articleLive":2,"columnArticles":2598,"formTitle":"[198]打家劫舍","frequency":80.16213726391886,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.652297732170149,"acs":0,"articleLive":2,"columnArticles":1554,"formTitle":"[199]二叉树的右视图","frequency":82.95601162887809,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5537883735554427,"acs":0,"articleLive":2,"columnArticles":2074,"formTitle":"[200]岛屿数量","frequency":88.26887761433625,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5229601151227474,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[201]数字范围按位与","frequency":37.00833846775293,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6183778207222395,"acs":0,"articleLive":2,"columnArticles":1352,"formTitle":"[202]快乐数","frequency":62.30320755659007,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5144021286831851,"acs":0,"articleLive":2,"columnArticles":1615,"formTitle":"[203]移除链表元素","frequency":53.86407503428741,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3787084477880717,"acs":0,"articleLive":2,"columnArticles":723,"formTitle":"[204]计数质数","frequency":52.35377697976856,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008992684753699,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[205]同构字符串","frequency":50.28367166406629,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.7228169965278324,"acs":0,"articleLive":2,"columnArticles":7272,"formTitle":"[206]反转链表","frequency":90.56319354705865,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5445887445887446,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[207]课程表","frequency":72.03249639649296,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164947662068436,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[208]实现 Trie (前缀树)","frequency":69.0601035073898,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4705794768002342,"acs":0,"articleLive":2,"columnArticles":1327,"formTitle":"[209]长度最小的子数组","frequency":53.86407503428741,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5416392138337415,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[210]课程表 II","frequency":47.2521926404652,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48180494905385735,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":30.39010311391695,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4496695697842356,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[212]单词搜索 II","frequency":40.078294753171704,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.4329553540748437,"acs":0,"articleLive":2,"columnArticles":1483,"formTitle":"[213]打家劫舍 II","frequency":73.03241729217318,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37110679705304284,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[214]最短回文串","frequency":57.01304431700096,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.646691688230907,"acs":0,"articleLive":2,"columnArticles":2242,"formTitle":"[215]数组中的第K个最大元素","frequency":89.06119389935118,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.737911660076034,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[216]组合总和 III","frequency":65.60071923943973,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5604220852313279,"acs":0,"articleLive":2,"columnArticles":1629,"formTitle":"[217]存在重复元素","frequency":75.35388341143116,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5423719894048099,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[218]天际线问题","frequency":63.81043512352357,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.4251153158241551,"acs":0,"articleLive":2,"columnArticles":865,"formTitle":"[219]存在重复元素 II","frequency":47.938393146163364,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2867803308864997,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":62.67444281767687,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.4746065495101353,"acs":0,"articleLive":2,"columnArticles":968,"formTitle":"[221]最大正方形","frequency":74.10043145793878,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7804319888944631,"acs":0,"articleLive":2,"columnArticles":865,"formTitle":"[222]完全二叉树的节点个数","frequency":40.756171368716956,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4620023014959724,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[223]矩形面积","frequency":43.43482511868017,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4181072140847277,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[224]基本计算器","frequency":72.73390978441684,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6754131565621692,"acs":0,"articleLive":2,"columnArticles":4735,"formTitle":"[225]用队列实现栈","frequency":46.740176062359,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7874879191138205,"acs":0,"articleLive":2,"columnArticles":1826,"formTitle":"[226]翻转二叉树","frequency":75.25315218712534,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43702700880236944,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[227]基本计算器 II","frequency":71.02679562272732,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5815722826538238,"acs":0,"articleLive":2,"columnArticles":630,"formTitle":"[228]汇总区间","frequency":5.208997904445751,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4634886604329183,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[229]求众数 II","frequency":39.423545269625265,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406444562193668,"acs":0,"articleLive":2,"columnArticles":837,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":38.177678958171576,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036724642142527,"acs":0,"articleLive":2,"columnArticles":1186,"formTitle":"[231]2 的幂","frequency":43.02316929245137,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6913555457389038,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[232]用栈实现队列","frequency":57.96515265094753,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4765147029800671,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[233]数字 1 的个数","frequency":61.39031404048521,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49440785659814135,"acs":0,"articleLive":2,"columnArticles":1939,"formTitle":"[234]回文链表","frequency":77.67156201331646,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.666145922815373,"acs":0,"articleLive":2,"columnArticles":954,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":56.66634259452247,"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.6802494419521921,"acs":0,"articleLive":2,"columnArticles":1349,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.07947797616669,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.8481711924097982,"acs":0,"articleLive":2,"columnArticles":1005,"formTitle":"[237]删除链表中的节点","frequency":53.22827700302314,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.722654689023513,"acs":0,"articleLive":2,"columnArticles":846,"formTitle":"[238]除自身以外数组的乘积","frequency":54.33093805903039,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.4963408017151251,"acs":0,"articleLive":2,"columnArticles":1288,"formTitle":"[239]滑动窗口最大值","frequency":65.97850381313035,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.4756526810923431,"acs":0,"articleLive":2,"columnArticles":731,"formTitle":"[240]搜索二维矩阵 II","frequency":61.885125994835214,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7374052394204011,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[241]为运算表达式设计优先级","frequency":56.19080315806734,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6444959923876992,"acs":0,"articleLive":2,"columnArticles":1629,"formTitle":"[242]有效的字母异位词","frequency":57.77265473387676,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6556625401192113,"acs":0,"articleLive":2,"columnArticles":102,"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.5478438957788144,"acs":0,"articleLive":2,"columnArticles":57,"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.6070858138521853,"acs":0,"articleLive":2,"columnArticles":58,"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.47455742752073893,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5225524838910829,"acs":0,"articleLive":2,"columnArticles":91,"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.46332737030411447,"acs":0,"articleLive":2,"columnArticles":52,"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.6383419689119171,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.63286152050197,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":5.208997904445751,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5432386275423071,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":16.01274918778056,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5618261291889267,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[252]会议室","frequency":5.778067303239537,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.49866701135867897,"acs":0,"articleLive":2,"columnArticles":333,"formTitle":"[253]会议室 II","frequency":54.089475028946154,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.5679124886052871,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[254]因子的组合","frequency":17.268431807365815,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.47234958360625057,"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.6354696507290607,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[256]粉刷房子","frequency":6.372460891638071,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6812212528961405,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[257]二叉树的所有路径","frequency":61.968783562235316,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6918284659101095,"acs":0,"articleLive":2,"columnArticles":636,"formTitle":"[258]各位相加","frequency":47.2521926404652,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5650919284359799,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":5.778067303239537,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7249355862716907,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[260]只出现一次的数字 III","frequency":50.28367166406629,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.495083343326538,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":23.53390457822948,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.4370149950405508,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":61.753734942282975,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.5152022069613195,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[263]丑数","frequency":56.14679370891884,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5792353610005685,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[264]丑数 II","frequency":64.16811685985843,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5831978319783198,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[265]粉刷房子 II","frequency":5.208997904445751,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6716123677111434,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4464309719048259,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[267]回文排列 II","frequency":6.372460891638071,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.623914478802636,"acs":0,"articleLive":2,"columnArticles":1075,"formTitle":"[268]丢失的数字","frequency":30.39010311391695,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.33849363197189286,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5517822876083037,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.62839297027137,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5521102497846684,"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.645704334365325,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":6.994166501186637,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.3092417974872177,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[273]整数转换英文表示","frequency":29.70749945621389,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.44042889202892527,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[274]H 指数","frequency":56.81728875497233,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46267024463763856,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":33.40663538255413,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4872609217305385,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[276]栅栏涂色","frequency":24.1771046016201,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5695700460098366,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":5.208997904445751,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.4547165416439473,"acs":0,"articleLive":2,"columnArticles":987,"formTitle":"[278]第一个错误的版本","frequency":69.31113517682618,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6311007682744111,"acs":0,"articleLive":2,"columnArticles":1172,"formTitle":"[279]完全平方数","frequency":72.28836928642224,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.6867287836816923,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":16.62839297027137,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.757773631840796,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.3881201115790625,"acs":0,"articleLive":2,"columnArticles":72,"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.6388664132777601,"acs":0,"articleLive":2,"columnArticles":3261,"formTitle":"[283]移动零","frequency":77.15389418631,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.733547586005405,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[284]顶端迭代器","frequency":16.62839297027137,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6348947282519993,"acs":0,"articleLive":2,"columnArticles":101,"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.5075295075295075,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[286]墙与门","frequency":5.778067303239537,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6614013449954927,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[287]寻找重复数","frequency":60.82792593758487,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42815398297547963,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533185522186069,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[289]生命游戏","frequency":16.01274918778056,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.45705822047770356,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[290]单词规律","frequency":28.41470406574424,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5334201388888888,"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.6961606193648913,"acs":0,"articleLive":2,"columnArticles":562,"formTitle":"[292]Nim 游戏","frequency":39.423545269625265,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7113157113157114,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":5.208997904445751,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5851579475179676,"acs":0,"articleLive":2,"columnArticles":53,"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.5231909401282372,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[295]数据流的中位数","frequency":39.193209308190816,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.62139486103828,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":17.934665866602437,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.5587692947465761,"acs":0,"articleLive":2,"columnArticles":738,"formTitle":"[297]二叉树的序列化与反序列化","frequency":57.90690353175337,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5784001956947162,"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.5038571743442803,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[299]猜数字游戏","frequency":22.91367943896234,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5130660833170304,"acs":0,"articleLive":2,"columnArticles":1943,"formTitle":"[300]最长递增子序列","frequency":78.75769302138276,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.522624916067539,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[301]删除无效的括号","frequency":50.58378092311957,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6646069344318571,"acs":0,"articleLive":2,"columnArticles":37,"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.7249118270790097,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":47.938393146163364,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.5430991310765338,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":39.423545269625265,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.3788323847989719,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":5.208997904445751,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3372681627215903,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":38.3797560492819,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5426631442343345,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[307]区域和检索 - 数组可修改","frequency":19.353973552147338,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6058823529411764,"acs":0,"articleLive":2,"columnArticles":42,"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.6060145646077898,"acs":0,"articleLive":2,"columnArticles":903,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":69.23938869935297,"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.37964280631848585,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[310]最小高度树","frequency":45.63477704251178,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7621164962205424,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":16.62839297027137,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.682812053787606,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[312]戳气球","frequency":51.911198458957706,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6406382265097187,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[313]超级丑数","frequency":56.81728875497233,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5439636684748328,"acs":0,"articleLive":2,"columnArticles":86,"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.418554703950139,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.497985809414416,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.4766592936346157,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[316]去除重复字母","frequency":58.38395420543077,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48375280633345147,"acs":0,"articleLive":2,"columnArticles":63,"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.6838057106732695,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[318]最大单词长度乘积","frequency":5.208997904445751,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5172469115995508,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":16.62839297027137,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6742990654205607,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.4254149008443596,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[321]拼接最大数","frequency":30.39010311391695,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.443804727001332,"acs":0,"articleLive":2,"columnArticles":1787,"formTitle":"[322]零钱兑换","frequency":80.38827540723321,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.631060235063663,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[323]无向图中连通分量的数目","frequency":34.07372263998341,"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.3782022917652085,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.10437795901931,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5386794122853602,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":34.07372263998341,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.4896289384913515,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[326]3的幂","frequency":29.049574993027633,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4230394883203559,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[327]区间和的个数","frequency":39.857550884539336,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.656420506164828,"acs":0,"articleLive":2,"columnArticles":1047,"formTitle":"[328]奇偶链表","frequency":61.690060669393745,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.48376091098409324,"acs":0,"articleLive":2,"columnArticles":481,"formTitle":"[329]矩阵中的最长递增路径","frequency":54.781339311567145,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5340109016579605,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[330]按要求补齐数组","frequency":32.7626401770219,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.47999525877396204,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[331]验证二叉树的前序序列化","frequency":30.39010311391695,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44895989581516493,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[332]重新安排行程","frequency":47.938393146163364,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46824907521578296,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":17.934665866602437,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.41248816529600685,"acs":0,"articleLive":2,"columnArticles":287,"formTitle":"[334]递增的三元子序列","frequency":24.1771046016201,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3673079373168556,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.4011734171662524,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[336]回文对","frequency":35.48385440078198,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6083199923538267,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[337]打家劫舍 III","frequency":70.43606565196713,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869159444576239,"acs":0,"articleLive":2,"columnArticles":1345,"formTitle":"[338]比特位计数","frequency":58.22938019843856,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8076241134751773,"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.4938153725966755,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":29.70749945621389,"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.7270402265634031,"acs":0,"articleLive":2,"columnArticles":485,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":69.73650259698296,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.515559541580392,"acs":0,"articleLive":2,"columnArticles":758,"formTitle":"[342]4的幂","frequency":46.5891387280255,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6050186453857637,"acs":0,"articleLive":2,"columnArticles":1021,"formTitle":"[343]整数拆分","frequency":67.56390891846961,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7665147425338703,"acs":0,"articleLive":2,"columnArticles":1870,"formTitle":"[344]反转字符串","frequency":64.9226535387688,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391582231511352,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[345]反转字符串中的元音字母","frequency":29.049574993027633,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7063764344019875,"acs":0,"articleLive":2,"columnArticles":133,"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.6219383432596133,"acs":0,"articleLive":2,"columnArticles":1450,"formTitle":"[347]前 K 个高频元素","frequency":75.82679978077647,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.6000765403750479,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[348]设计井字棋","frequency":4.6634686777810055,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.738542874105906,"acs":0,"articleLive":2,"columnArticles":1469,"formTitle":"[349]两个数组的交集","frequency":64.98626561067205,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5496927775288707,"acs":0,"articleLive":2,"columnArticles":1339,"formTitle":"[350]两个数组的交集 II","frequency":63.6339303723866,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5894245723172629,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":11.357048889746514,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5919548147127703,"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.4228038141610874,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":7.645407825658858,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.451795129299523,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[354]俄罗斯套娃信封问题","frequency":70.46062084597978,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.4070069817654568,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[355]设计推特","frequency":34.76552785321028,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3512014787430684,"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.5197509201403749,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.095320636715776,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.35097785679650884,"acs":0,"articleLive":2,"columnArticles":60,"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.7247692066969176,"acs":0,"articleLive":2,"columnArticles":54,"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.6084270902272226,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":6.372460891638071,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.5612880270414518,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6927288655278143,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":5.778067303239537,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.4904950971545449,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.497985809414416,"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.7200811359026369,"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.36435237928314784,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[365]水壶问题","frequency":46.5891387280255,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.763235294117647,"acs":0,"articleLive":2,"columnArticles":119,"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.43935764610798433,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[367]有效的完全平方数","frequency":16.62839297027137,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.4591657825674242,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[368]最大整除子集","frequency":68.26271596997329,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6162562954672636,"acs":0,"articleLive":2,"columnArticles":122,"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.718801996672213,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":16.62839297027137,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5801503823825539,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[371]两整数之和","frequency":46.5891387280255,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5094549912694579,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[372]超级次方","frequency":6.994166501186637,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.42217621943330313,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[373]查找和最小的K对数字","frequency":42.18798778072249,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5146466749965293,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.40663538255413,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.46918965008362573,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":34.07372263998341,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46282736453717266,"acs":0,"articleLive":2,"columnArticles":793,"formTitle":"[376]摆动序列","frequency":31.538177869095342,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5072389629160475,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[377]组合总和 Ⅳ","frequency":62.39233526445817,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6388949916595468,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":55.497985809414416,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6432686153189674,"acs":0,"articleLive":2,"columnArticles":66,"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.5022402771969652,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":29.049574993027633,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.442173131804249,"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.6294912331129635,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":24.844904528765106,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5972940341563672,"acs":0,"articleLive":2,"columnArticles":721,"formTitle":"[383]赎金信","frequency":2.6868194799188014,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5769953322192128,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[384]打乱数组","frequency":51.26526828676759,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.415097598894455,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":5.208997904445751,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7475751613682649,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[386]字典序排数","frequency":56.14679370891884,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.531977226108322,"acs":0,"articleLive":2,"columnArticles":1161,"formTitle":"[387]字符串中的第一个唯一字符","frequency":59.43501038423024,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.5251824488692675,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":5.208997904445751,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6919558558180521,"acs":0,"articleLive":2,"columnArticles":977,"formTitle":"[389]找不同","frequency":16.01274918778056,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.4668066657634467,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":39.10437795901931,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35761799176433323,"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.5148958693397857,"acs":0,"articleLive":2,"columnArticles":1547,"formTitle":"[392]判断子序列","frequency":54.26020950585227,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39168340987370837,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":32.7626401770219,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5516421932085569,"acs":0,"articleLive":2,"columnArticles":1273,"formTitle":"[394]字符串解码","frequency":84.37102664276243,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205536912751678,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":56.19080315806734,"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.42590718519589416,"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.37761269201712416,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[397]整数替换","frequency":22.3149590830915,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.6549685827321386,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":37.68167738319494,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5925612363500696,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[399]除法求值","frequency":24.1771046016201,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4143274594881785,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":43.43482511868017,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6139285796726761,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[401]二进制手表","frequency":46.5891387280255,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3276613388063105,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[402]移掉 K 位数字","frequency":66.98342496701486,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.45594221004271784,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[403]青蛙过河","frequency":68.85861260921502,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5822620035707675,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[404]左叶子之和","frequency":53.66891531856312,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5223133058126113,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[405]数字转换为十六进制数","frequency":47.2521926404652,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7364172519074319,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[406]根据身高重建队列","frequency":58.55710616919355,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.4842751962553026,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":47.938393146163364,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.324580528960091,"acs":0,"articleLive":2,"columnArticles":80,"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.5559550833863011,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[409]最长回文串","frequency":64.38984296965376,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5627526793196219,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[410]分割数组的最大值","frequency":73.12897026971574,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743589743589745,"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.6735253260737827,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[412]Fizz Buzz","frequency":24.1771046016201,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6869271875093292,"acs":0,"articleLive":2,"columnArticles":896,"formTitle":"[413]等差数列划分","frequency":54.180351868713636,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36403288546348783,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[414]第三大的数","frequency":23.53390457822948,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5372412149024457,"acs":0,"articleLive":2,"columnArticles":1052,"formTitle":"[415]字符串相加","frequency":87.84958728463525,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5067326768496017,"acs":0,"articleLive":2,"columnArticles":962,"formTitle":"[416]分割等和子集","frequency":73.8805378294826,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47839806700566195,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[417]太平洋大西洋水流问题","frequency":56.90840401309304,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3595119436329266,"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.7553929366846962,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[419]甲板上的战舰","frequency":4.6634686777810055,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.2069097594607017,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":20.11015326903744,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.622423805366835,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.471585017714546,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.4268643505200266,"acs":0,"articleLive":2,"columnArticles":45,"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.5694704049844237,"acs":0,"articleLive":2,"columnArticles":136,"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.5306390031048083,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":63.81043512352357,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6115906288532675,"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.667339523617279,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.049574993027633,"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.6134632957660676,"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.6496406570841889,"acs":0,"articleLive":2,"columnArticles":53,"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.6985669414998037,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[429]N 叉树的层序遍历","frequency":32.7626401770219,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5423857099606418,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[430]扁平化多级双向链表","frequency":30.39010311391695,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7285587975243147,"acs":0,"articleLive":2,"columnArticles":28,"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.37764685294289213,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[432]全 O(1) 的数据结构","frequency":27.80141594153932,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5326905798603911,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":4.6634686777810055,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.37398278214604747,"acs":0,"articleLive":2,"columnArticles":521,"formTitle":"[434]字符串中的单词数","frequency":24.1771046016201,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5090744950815521,"acs":0,"articleLive":2,"columnArticles":821,"formTitle":"[435]无重叠区间","frequency":60.1828495032226,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.485855282033626,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":4.6634686777810055,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5667640846089297,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[437]路径总和 III","frequency":47.82235204811674,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.5173633495547201,"acs":0,"articleLive":2,"columnArticles":781,"formTitle":"[438]找到字符串中所有字母异位词","frequency":46.740176062359,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5890014471780028,"acs":0,"articleLive":2,"columnArticles":67,"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.37978044905991415,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":68.31355905078208,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.42570882181757713,"acs":0,"articleLive":2,"columnArticles":463,"formTitle":"[441]排列硬币","frequency":16.01274918778056,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6972080674153598,"acs":0,"articleLive":2,"columnArticles":421,"formTitle":"[442]数组中重复的数据","frequency":63.08899128278487,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.47707948881568735,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[443]压缩字符串","frequency":42.35021282646551,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2502835538752363,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.629099549180648,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5880728597449909,"acs":0,"articleLive":2,"columnArticles":922,"formTitle":"[445]两数相加 II","frequency":69.73650259698296,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517979575896086,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":45.124015532816784,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6478473061125876,"acs":0,"articleLive":2,"columnArticles":1048,"formTitle":"[448]找到所有数组中消失的数字","frequency":60.06597860611307,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5562418604651163,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4853922611222294,"acs":0,"articleLive":2,"columnArticles":596,"formTitle":"[450]删除二叉搜索树中的节点","frequency":44.72480741686372,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7112869771126917,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[451]根据字符出现频率排序","frequency":61.71884088822722,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5094107997414407,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.18301978993158,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5546263937427193,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.53390457822948,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6010116036893781,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[454]四数相加 II","frequency":57.51094219314563,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5773756717147045,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[455]分发饼干","frequency":57.2770542634498,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36251410153102337,"acs":0,"articleLive":2,"columnArticles":456,"formTitle":"[456]132 模式","frequency":71.76844821649256,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.4352852668427194,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":50.9500122536942,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6090204759269507,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[458]可怜的小猪","frequency":16.62839297027137,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.51153977961723,"acs":0,"articleLive":2,"columnArticles":624,"formTitle":"[459]重复的子字符串","frequency":52.35377697976856,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.4394570353167294,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[460]LFU 缓存","frequency":61.033306399021306,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.811928863502337,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[461]汉明距离","frequency":58.38395420543077,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6026131714398839,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":37.68167738319494,"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.714287056612638,"acs":0,"articleLive":2,"columnArticles":908,"formTitle":"[463]岛屿的周长","frequency":37.68167738319494,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3584625536126691,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":37.00833846775293,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.531667237247518,"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.3735719602576135,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":7.645407825658858,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.44131334022750773,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":17.268431807365815,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24989091815745185,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[468]验证IP地址","frequency":50.9500122536942,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4335138387484958,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":25.539106844866836,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5460591418459316,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":44.61042141823669,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6161113873694679,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":14.848310724327446,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.40209173387096775,"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.420393227066923,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[473]火柴拼正方形","frequency":37.00833846775293,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6107760053173812,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[474]一和零","frequency":62.56426715016167,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33036802741260585,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[475]供暖器","frequency":29.70749945621389,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.701172573450528,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[476]数字的补数","frequency":5.208997904445751,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6039562157935887,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.2521926404652,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43781942078364566,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":29.70749945621389,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41456972056165714,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":10.600869172856413,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.448002210385743,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":41.458801193540516,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5362504938759384,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":5.208997904445751,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.42607481476476816,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[482]密钥格式化","frequency":15.419877723131382,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5901367112072294,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":34.07372263998341,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6404545454545455,"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.6065673149785299,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[485]最大连续 1 的个数","frequency":49.63901230315857,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870415048575004,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":44.87355547036976,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.576931330472103,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[487]最大连续1的个数 II","frequency":36.3581132853949,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.38705234159779617,"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.7174617878647522,"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.48167036215816705,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":17.268431807365815,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.547207041293455,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[491]递增子序列","frequency":50.28367166406629,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5513714417425377,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[492]构造矩形","frequency":5.208997904445751,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.34454811417727527,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.23070993956754,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.4953670219298844,"acs":0,"articleLive":2,"columnArticles":1012,"formTitle":"[494]目标和","frequency":75.82679978077647,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5419960182137155,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[495]提莫攻击","frequency":29.70749945621389,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6874262634113842,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[496]下一个更大元素 I","frequency":42.02355191989097,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.4050436742744435,"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.46403273351225305,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[498]对角线遍历","frequency":51.5395289756174,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3705823436829303,"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.7088712346904998,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[500]键盘行","frequency":16.01274918778056,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5118314736437091,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[501]二叉搜索树中的众数","frequency":46.5891387280255,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4406294706723891,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[502]IPO","frequency":29.485532867338254,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6346271557572047,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[503]下一个更大元素 II","frequency":47.2521926404652,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5045142346051943,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[504]七进制数","frequency":23.53390457822948,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.4829135106570372,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":17.268431807365815,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5643841574469242,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[506]相对名次","frequency":4.6634686777810055,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41118078071215347,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[507]完美数","frequency":16.62839297027137,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6758695549577611,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[508]出现次数最多的子树元素和","frequency":16.62839297027137,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6761244337199802,"acs":0,"articleLive":2,"columnArticles":1424,"formTitle":"[509]斐波那契数","frequency":62.971206552805526,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6083969465648855,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":6.994166501186637,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337786259541985,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[511]游戏玩法分析 I","frequency":37.68167738319494,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5381950887610565,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":5.208997904445751,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7308559913378249,"acs":0,"articleLive":2,"columnArticles":547,"formTitle":"[513]找树左下角的值","frequency":5.208997904445751,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5011516861202412,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[514]自由之路","frequency":49.87101232073635,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6438029614936228,"acs":0,"articleLive":2,"columnArticles":405,"formTitle":"[515]在每个树行中找最大值","frequency":24.1771046016201,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6526225009800078,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[516]最长回文子序列","frequency":57.77265473387676,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.44010846498467343,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6535910974130962,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[518]零钱兑换 II","frequency":69.73650259698296,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.395071061384941,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":20.11015326903744,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5634637687384563,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[520]检测大写字母","frequency":5.208997904445751,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7127411369714903,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.01274918778056,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36003034572450415,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.01274918778056,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.27438528651574046,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[523]连续的子数组和","frequency":57.51094219314563,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.4726600575327485,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":31.836764813741475,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.536672759626675,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[525]连续数组","frequency":67.77104806279665,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7349805875356269,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.347058620783514,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5771614045441134,"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.4768843289347631,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":23.881792897521475,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6460741990439802,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":34.07372263998341,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6206631310473261,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":4.139872630431496,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6608959485989648,"acs":0,"articleLive":2,"columnArticles":75,"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.3732207730331725,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[532]数组中的 k-diff 数对","frequency":16.62839297027137,"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.5232939632545932,"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.67558396852717,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":16.01274918778056,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.84151821971953,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":23.53390457822948,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5348963029756537,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":9.80299121983382,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7125425828429854,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":4.139872630431496,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6976681696639229,"acs":0,"articleLive":2,"columnArticles":810,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":37.00833846775293,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5962426989800366,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[539]最小时间差","frequency":33.40663538255413,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5803553227855048,"acs":0,"articleLive":2,"columnArticles":385,"formTitle":"[540]有序数组中的单一元素","frequency":46.5891387280255,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6082987121794484,"acs":0,"articleLive":2,"columnArticles":781,"formTitle":"[541]反转字符串 II","frequency":28.259412978487912,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4588226312428861,"acs":0,"articleLive":2,"columnArticles":617,"formTitle":"[542]01 矩阵","frequency":45.124015532816784,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5503283482202271,"acs":0,"articleLive":2,"columnArticles":1208,"formTitle":"[543]二叉树的直径","frequency":73.74588999518753,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7083071113908118,"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.4171322160148976,"acs":0,"articleLive":2,"columnArticles":78,"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.6308316430020284,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":25.539106844866836,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6184070215732917,"acs":0,"articleLive":2,"columnArticles":1106,"formTitle":"[547]省份数量","frequency":46.740176062359,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.3566401816118048,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":10.600869172856413,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48376470588235293,"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.4386174448063699,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":24.1771046016201,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5673205289365725,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":20.502299322926863,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5785976782107133,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.34552064783985,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6026552372987665,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":5.208997904445751,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.5020216235535898,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":61.033306399021306,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3424185463659148,"acs":0,"articleLive":2,"columnArticles":23,"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.32597331132205254,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":44.1409074515111,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7455191251556362,"acs":0,"articleLive":2,"columnArticles":1249,"formTitle":"[557]反转字符串中的单词 III","frequency":60.36398196402892,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5036893886156009,"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.7275108425515325,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":32.140266047348355,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.4465804146126192,"acs":0,"articleLive":2,"columnArticles":891,"formTitle":"[560]和为 K 的子数组","frequency":81.38902677678622,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7742276415662914,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[561]数组拆分 I","frequency":14.848310724327446,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46232834343684276,"acs":0,"articleLive":2,"columnArticles":57,"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.6052150045745655,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":4.6634686777810055,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.17931661364293683,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":24.844904528765106,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6114200639313395,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":16.01274918778056,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6939293423893014,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[566]重塑矩阵","frequency":29.049574993027633,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4309206509128656,"acs":0,"articleLive":2,"columnArticles":1027,"formTitle":"[567]字符串的排列","frequency":56.10804185885059,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5043821209465381,"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.563507762392855,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[569]员工薪水中位数","frequency":29.70749945621389,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6630652044730161,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[570]至少有5名直接下属的经理","frequency":15.419877723131382,"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.4875748502994012,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":5.778067303239537,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.4737918974060041,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[572]另一棵树的子树","frequency":49.01469879127306,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.660737812911726,"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.6480303597199208,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6845558630059815,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[575]分糖果","frequency":29.049574993027633,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.469713503615884,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":25.539106844866836,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7056912170145727,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[577]员工奖金","frequency":23.53390457822948,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.4976407675369613,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[578]查询回答率最高的问题","frequency":5.208997904445751,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.41241363940271897,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.26171830425565,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.524046615965421,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[580]统计各专业学生人数","frequency":16.01274918778056,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.4044022190590288,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[581]最短无序连续子数组","frequency":63.555001349829574,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40495514737291755,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5866966844044208,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[583]两个字符串的删除操作","frequency":45.124015532816784,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7744312153719203,"acs":0,"articleLive":2,"columnArticles":59,"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.5949160101085179,"acs":0,"articleLive":2,"columnArticles":96,"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.7492164703339458,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[586]订单最多的客户","frequency":24.1771046016201,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.3828254847645429,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":8.328683017057273,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.4263542300669507,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":9.80299121983382,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7452154343045629,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[589]N 叉树的前序遍历","frequency":42.75350488428591,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7602218975209887,"acs":0,"articleLive":2,"columnArticles":449,"formTitle":"[590]N 叉树的后序遍历","frequency":15.419877723131382,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.3405045961275181,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5209852923592012,"acs":0,"articleLive":2,"columnArticles":106,"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.44092769440654844,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[593]有效的正方形","frequency":23.53390457822948,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5167188182215107,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[594]最长和谐子序列","frequency":5.208997904445751,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.7964720348067343,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[595]大的国家","frequency":39.423545269625265,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.420759805483001,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[596]超过5名学生的课","frequency":22.91367943896234,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.4410631050555755,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.01274918778056,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5175147189422097,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[598]范围求和 II","frequency":16.01274918778056,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5221865786497061,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[599]两个列表的最小索引总和","frequency":16.01274918778056,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.4806462738439498,"acs":0,"articleLive":2,"columnArticles":217,"formTitle":"[600]不含连续1的非负整数","frequency":30.39010311391695,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49881651048928377,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[601]体育馆的人流量","frequency":51.911198458957706,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6282290063972791,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":17.268431807365815,"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.6706182140483049,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[603]连续空余座位","frequency":24.1771046016201,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37214104193138503,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":6.372460891638071,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3344996742181235,"acs":0,"articleLive":2,"columnArticles":1240,"formTitle":"[605]种花问题","frequency":53.420766791186566,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5684630413546076,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[606]根据二叉树创建字符串","frequency":4.6634686777810055,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6634433827315901,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":5.208997904445751,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6569730800396146,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[608]树节点","frequency":4.6634686777810055,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4841354182480644,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.6670661074495706,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[610]判断三角形","frequency":5.778067303239537,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5319722441733332,"acs":0,"articleLive":2,"columnArticles":383,"formTitle":"[611]有效三角形的个数","frequency":76.49731730264035,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6682119205298013,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":5.778067303239537,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.8169672190990728,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":4.6634686777810055,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34641950002228067,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[614]二级关注者","frequency":16.62839297027137,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.42465065684879927,"acs":0,"articleLive":2,"columnArticles":87,"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.45990252547629595,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.07372263998341,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7881835623811715,"acs":0,"articleLive":2,"columnArticles":1198,"formTitle":"[617]合并二叉树","frequency":63.48144145159782,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6196611118890911,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":16.62839297027137,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.4658196440793977,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":5.208997904445751,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7728239591189905,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[620]有趣的电影","frequency":40.078294753171704,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5696090069508216,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[621]任务调度器","frequency":62.80744911804359,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.436657477601654,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[622]设计循环队列","frequency":47.2521926404652,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5453484833113523,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4163568773234201,"acs":0,"articleLive":2,"columnArticles":48,"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.34054054054054056,"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.6830479372592696,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.095320636715776,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8076004909777997,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[627]变更性别","frequency":29.049574993027633,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.525163792931077,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[628]三个数的最大乘积","frequency":33.40663538255413,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40409852614577024,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":24.844904528765106,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.36746807362551714,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":6.372460891638071,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.2848995111352526,"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.5970407378939278,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":16.62839297027137,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.399012656264808,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[633]平方数之和","frequency":63.08899128278487,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44014430960970813,"acs":0,"articleLive":2,"columnArticles":20,"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.5566502463054187,"acs":0,"articleLive":2,"columnArticles":63,"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.5500576701268742,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":5.208997904445751,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6894078966015702,"acs":0,"articleLive":2,"columnArticles":637,"formTitle":"[637]二叉树的层平均值","frequency":21.176815304844883,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5928782755705833,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":5.208997904445751,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30980887930393397,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":29.049574993027633,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.42434879731939845,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[640]求解方程","frequency":22.91367943896234,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5328433741067569,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[641]设计循环双端队列","frequency":14.848310724327446,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.49008971416649283,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":9.046811502943717,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45149923301785766,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[643]子数组最大平均数 I","frequency":37.68167738319494,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.3987730061349693,"acs":0,"articleLive":2,"columnArticles":24,"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.43517522559369304,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[645]错误的集合","frequency":41.458801193540516,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5756978478585126,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[646]最长数对链","frequency":3.6367572611854526,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6564112677908162,"acs":0,"articleLive":2,"columnArticles":889,"formTitle":"[647]回文子串","frequency":58.09054281142014,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5829914001461413,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[648]单词替换","frequency":5.778067303239537,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48166919524516094,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":4.6634686777810055,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5358808608133541,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[650]只有两个键的键盘","frequency":16.62839297027137,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5804351278386534,"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.5712953992944488,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":52.77374335734027,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5962794918330309,"acs":0,"articleLive":2,"columnArticles":373,"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.8096721889319703,"acs":0,"articleLive":2,"columnArticles":585,"formTitle":"[654]最大二叉树","frequency":43.8239249727883,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.5963036898705647,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":16.62839297027137,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.30754716981132074,"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.7834341527317562,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":4.6634686777810055,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45366205102973217,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[658]找到 K 个最接近的元素","frequency":31.099189097302688,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418224569247967,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":4.6634686777810055,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6503428011753183,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":13.763881535631178,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5604406990398563,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":5.208997904445751,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.4073766357081392,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[662]二叉树最大宽度","frequency":52.14706933960234,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4618918918918919,"acs":0,"articleLive":2,"columnArticles":35,"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.6551651777684514,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":54.781339311567145,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27030788217930923,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[665]非递减数列","frequency":49.87101232073635,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6183368869936035,"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.6242774566473989,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":16.01274918778056,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.507386536704234,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[668]乘法表中第k小的数","frequency":34.76552785321028,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6664512081519363,"acs":0,"articleLive":2,"columnArticles":296,"formTitle":"[669]修剪二叉搜索树","frequency":23.53390457822948,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.44976290374636907,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[670]最大交换","frequency":61.033306399021306,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48644263126354126,"acs":0,"articleLive":2,"columnArticles":659,"formTitle":"[671]二叉树中第二小的节点","frequency":46.5891387280255,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5502702702702703,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[672]灯泡开关 Ⅱ","frequency":4.6634686777810055,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.39190432382704693,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[673]最长递增子序列的个数","frequency":53.86407503428741,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49335490581301283,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[674]最长连续递增序列","frequency":35.72953074721291,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.39968807599603007,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":6.372460891638071,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5884244372990354,"acs":0,"articleLive":2,"columnArticles":120,"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.6164978292329957,"acs":0,"articleLive":2,"columnArticles":238,"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.38243271028952447,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[678]有效的括号字符串","frequency":51.0816074263197,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5412804852005296,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":69.0601035073898,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4014246258103093,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":46.64849959978773,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5,"acs":0,"articleLive":2,"columnArticles":61,"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.6952921803099559,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":29.70749945621389,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.4307568438003221,"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.665451199563795,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[684]冗余连接","frequency":28.41470406574424,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4322818821267858,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":30.39010311391695,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3552387115629501,"acs":0,"articleLive":2,"columnArticles":190,"formTitle":"[686]重复叠加字符串匹配","frequency":4.6634686777810055,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4405387570408428,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[687]最长同值路径","frequency":50.9500122536942,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5114419451306722,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":16.62839297027137,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.48519987793713765,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.23070993956754,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6469898449776027,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":64.95996692182153,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49062720225510925,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":6.372460891638071,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5788877365150472,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[692]前K个高频单词","frequency":64.2624707739827,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6095857762524429,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":5.208997904445751,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5307315746532499,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":5.208997904445751,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6634817121969157,"acs":0,"articleLive":2,"columnArticles":1226,"formTitle":"[695]岛屿的最大面积","frequency":64.68586600008763,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6312807091182934,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[696]计数二进制子串","frequency":23.53390457822948,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6056295176279687,"acs":0,"articleLive":2,"columnArticles":833,"formTitle":"[697]数组的度","frequency":24.1771046016201,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44493557204217105,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[698]划分为k个相等的子集","frequency":56.81728875497233,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.4756718777445986,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.759080021032542,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[700]二叉搜索树中的搜索","frequency":22.91367943896234,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7238758645290422,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[701]二叉搜索树中的插入操作","frequency":29.84199086364351,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7403914590747331,"acs":0,"articleLive":2,"columnArticles":76,"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.5127622680769898,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.40663538255413,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.559614666281814,"acs":0,"articleLive":2,"columnArticles":1327,"formTitle":"[704]二分查找","frequency":68.47074883059517,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6459803795400774,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[705]设计哈希集合","frequency":45.124015532816784,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6445797723262171,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":32.7626401770219,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.31931688401370484,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[707]设计链表","frequency":59.92404898556004,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33540372670807456,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":6.372460891638071,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7593894552111883,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[709]转换成小写字母","frequency":5.208997904445751,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3502609676964311,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[710]黑名单中的随机数","frequency":24.844904528765106,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5721352019785655,"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.6718865826538176,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":35.48385440078198,"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.408,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[713]乘积小于K的子数组","frequency":36.3581132853949,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7192646981931176,"acs":0,"articleLive":2,"columnArticles":645,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.1409074515111,"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.40282284231018817,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":6.372460891638071,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4603750756200847,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":17.934665866602437,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.511148527152058,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[717]1比特与2比特字符","frequency":16.62839297027137,"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.5645894009280807,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[718]最长重复子数组","frequency":69.0601035073898,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3685317988577318,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":24.1771046016201,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.4856748700514867,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[720]词典中最长的单词","frequency":7.645407825658858,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46913295559362234,"acs":0,"articleLive":2,"columnArticles":334,"formTitle":"[721]账户合并","frequency":37.00833846775293,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.3225168183616937,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":38.3797560492819,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7214244686961516,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45916969628309834,"acs":0,"articleLive":2,"columnArticles":840,"formTitle":"[724]寻找数组的中心下标","frequency":34.76552785321028,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.5627033910295713,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[725]分隔链表","frequency":16.01274918778056,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.554058908045977,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":52.35377697976856,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40791991756219637,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[727]最小窗口子序列","frequency":31.099189097302688,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.759427121102248,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[728]自除数","frequency":5.208997904445751,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.510254735467015,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[729]我的日程安排表 I","frequency":24.844904528765106,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4895397489539749,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.10437795901931,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5102013952876135,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[731]我的日程安排表 II","frequency":5.208997904445751,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6102487376098747,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":17.268431807365815,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5804474121020069,"acs":0,"articleLive":2,"columnArticles":522,"formTitle":"[733]图像渲染","frequency":46.64849959978773,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.4780915287244401,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4113775497858543,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[735]行星碰撞","frequency":32.7626401770219,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4598496240601504,"acs":0,"articleLive":2,"columnArticles":46,"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.4611989702096359,"acs":0,"articleLive":2,"columnArticles":65,"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.5023104612203719,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[738]单调递增的数字","frequency":29.049574993027633,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6786568205643762,"acs":0,"articleLive":2,"columnArticles":1474,"formTitle":"[739]每日温度","frequency":83.82250240887251,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.6296379433279636,"acs":0,"articleLive":2,"columnArticles":558,"formTitle":"[740]删除并获得点数","frequency":63.03454406762219,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3658996605054696,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":24.844904528765106,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4917600527356625,"acs":0,"articleLive":2,"columnArticles":43,"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.5188622642216972,"acs":0,"articleLive":2,"columnArticles":514,"formTitle":"[743]网络延迟时间","frequency":49.01469879127306,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590274909357933,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":25.539106844866836,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39075274880180433,"acs":0,"articleLive":2,"columnArticles":54,"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.5837104279642386,"acs":0,"articleLive":2,"columnArticles":1236,"formTitle":"[746]使用最小花费爬楼梯","frequency":49.1379937863895,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4154478849235386,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":5.208997904445751,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5997834006104165,"acs":0,"articleLive":2,"columnArticles":169,"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.5050348567002324,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7211826347305389,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":20.11015326903744,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5049216186656945,"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.5307068637952198,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[752]打开转盘锁","frequency":42.18798778072249,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5900433716764096,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":5.208997904445751,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.4292282430213465,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5021645021645021,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5691180187010362,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":7.645407825658858,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.41617080854042704,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":9.80299121983382,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45924744049993355,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":12.251522101850973,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6584377302873987,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":5.778067303239537,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8391548081069427,"acs":0,"articleLive":2,"columnArticles":90,"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.5891985061763861,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":10.600869172856413,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6987913359128805,"acs":0,"articleLive":2,"columnArticles":138,"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.7635048091359053,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[763]划分字母区间","frequency":65.60071923943973,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49522081064730794,"acs":0,"articleLive":2,"columnArticles":53,"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.6658092920866644,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[765]情侣牵手","frequency":55.497985809414416,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7080383011342228,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.47795327012383904,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[767]重构字符串","frequency":34.76552785321028,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.4999480950897955,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[768]最多能完成排序的块 II","frequency":24.844904528765106,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5876994287965334,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5529188419553868,"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.8515271096341785,"acs":0,"articleLive":2,"columnArticles":1104,"formTitle":"[771]宝石与石头","frequency":42.095320636715776,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4912295425933697,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[772]基本计算器 III","frequency":18.629099549180648,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7137792704543334,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[773]滑动谜题","frequency":52.09106514997971,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5888268156424581,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":13.007701818741078,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4612248679699805,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":6.994166501186637,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5692908262849707,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.32354153175958084,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":16.62839297027137,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5955217748562038,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[778]水位上升的泳池中游泳","frequency":6.994166501186637,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.43588488873354303,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[779]第K个语法符号","frequency":34.76552785321028,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.28458246061378745,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":19.353973552147338,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.619708637140728,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[781]森林中的兔子","frequency":90.65916812908158,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.42248520710059173,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.40663538255413,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5958098335697727,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.40663538255413,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6852414559236751,"acs":0,"articleLive":2,"columnArticles":457,"formTitle":"[784]字母大小写全排列","frequency":28.41470406574424,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5118348183598563,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[785]判断二分图","frequency":42.75350488428591,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.46805129951197366,"acs":0,"articleLive":2,"columnArticles":56,"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.3922815220283575,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[787]K 站中转内最便宜的航班","frequency":32.0530410295263,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6072851640324081,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[788]旋转数字","frequency":17.268431807365815,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923563486250749,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[789]逃脱阻碍者","frequency":21.020255392346108,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44866920152091255,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[790]多米诺和托米诺平铺","frequency":5.778067303239537,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.695404457801152,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[791]自定义字符串排序","frequency":34.07372263998341,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4511463466895222,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[792]匹配子序列的单词数","frequency":14.848310724327446,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.39461519746979157,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":5.208997904445751,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.3403852524965687,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[794]有效的井字游戏","frequency":5.208997904445751,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5351411178749308,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":18.629099549180648,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.526732398278017,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[796]旋转字符串","frequency":42.18798778072249,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.794775686850342,"acs":0,"articleLive":2,"columnArticles":512,"formTitle":"[797]所有可能的路径","frequency":24.59911226724005,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4530308401276143,"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.4071784165729886,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":50.58378092311957,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.7051474262868566,"acs":0,"articleLive":2,"columnArticles":36,"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.4180386118678195,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.576504985381213,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[802]找到最终的安全状态","frequency":46.51682959053691,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.48275040692365717,"acs":0,"articleLive":2,"columnArticles":125,"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.7703808346577197,"acs":0,"articleLive":2,"columnArticles":392,"formTitle":"[804]唯一摩尔斯密码词","frequency":23.53390457822948,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2897037121126121,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[805]数组的均值分割","frequency":8.328683017057273,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.6573920890359453,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[806]写字符串需要的行数","frequency":16.62839297027137,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8443297894517406,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[807]保持城市天际线","frequency":4.6634686777810055,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.47965667149704605,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":30.39010311391695,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.4190871369294606,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[809]情感丰富的文字","frequency":16.62839297027137,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7360526551446226,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":40.756171368716956,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7039923434509161,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[811]子域名访问计数","frequency":16.01274918778056,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.630259623992838,"acs":0,"articleLive":2,"columnArticles":94,"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.5480244399185336,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":5.208997904445751,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000562922191643,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[814]二叉树剪枝","frequency":4.139872630431496,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4349538339345402,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[815]公交路线","frequency":74.0675949772522,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.5084869768803043,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[816]模糊坐标","frequency":7.645407825658858,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914255281377596,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[817]链表组件","frequency":5.208997904445751,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43023255813953487,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.4208425984752224,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[819]最常见的单词","frequency":16.62839297027137,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5067069803143341,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[820]单词的压缩编码","frequency":38.3797560492819,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6936159302623708,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[821]字符的最短距离","frequency":34.76552785321028,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5023474178403756,"acs":0,"articleLive":2,"columnArticles":38,"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.42990511172329354,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":18.629099549180648,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6145376088088684,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[824]山羊拉丁文","frequency":5.208997904445751,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.39089021858590794,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[825]适龄的朋友","frequency":5.778067303239537,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3722004619865421,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[826]安排工作以达到最大收益","frequency":16.62839297027137,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.3911430768534853,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[827]最大人工岛","frequency":29.70749945621389,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.49187639375597325,"acs":0,"articleLive":2,"columnArticles":52,"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.36247929561502923,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[829]连续整数求和","frequency":29.049574993027633,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431472615352239,"acs":0,"articleLive":2,"columnArticles":577,"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.40423064177620677,"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.7955983365263305,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[832]翻转图像","frequency":46.5891387280255,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4264919941775837,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[833]字符串中的查找与替换","frequency":5.208997904445751,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5291794646774901,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[834]树中距离之和","frequency":24.844904528765106,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5733625051278545,"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.4782065644274475,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[836]矩形重叠","frequency":17.934665866602437,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39650595715784925,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[837]新21点","frequency":17.268431807365815,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5003612194769542,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[838]推多米诺","frequency":32.7626401770219,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5748504811925074,"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.3588460762557999,"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.6568313408840915,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[841]钥匙和房间","frequency":24.844904528765106,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48928391106777863,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":42.75350488428591,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.3778305842885099,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":6.372460891638071,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5145643287822304,"acs":0,"articleLive":2,"columnArticles":956,"formTitle":"[844]比较含退格的字符串","frequency":28.41470406574424,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4208781260608804,"acs":0,"articleLive":2,"columnArticles":550,"formTitle":"[845]数组中的最长山脉","frequency":38.3797560492819,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5111526404629853,"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.6833006330285418,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.19080315806734,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.4477764177886577,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[848]字母移位","frequency":5.208997904445751,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.4260180628413823,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.44800905831288923,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":16.01274918778056,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47866099160243875,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[851]喧闹和富有","frequency":5.778067303239537,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7148424701236441,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[852]山脉数组的峰顶索引","frequency":59.92404898556004,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38306327160493825,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":35.48385440078198,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.3583786042624321,"acs":0,"articleLive":2,"columnArticles":66,"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.4073473797947056,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.62839297027137,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6260798186295586,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[856]括号的分数","frequency":43.43482511868017,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.46564523771915967,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":26.26171830425565,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5546518547907161,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":30.39010311391695,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.30164821269530606,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5873184009224931,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[860]柠檬水找零","frequency":28.41470406574424,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8092021840954378,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":4.139872630431496,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18990086367852368,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[862]和至少为 K 的最短子数组","frequency":50.58378092311957,"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.6036697247706422,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":56.90840401309304,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.45341136608655475,"acs":0,"articleLive":2,"columnArticles":42,"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.6551672640382318,"acs":0,"articleLive":2,"columnArticles":125,"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.2241191097095033,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":17.934665866602437,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6704009671569615,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":40.756171368716956,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6248154192896557,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5513546476173883,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[869]重新排序得到 2 的幂","frequency":5.778067303239537,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.4269143606870229,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[870]优势洗牌","frequency":5.208997904445751,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.34069988447061456,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":39.857550884539336,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520949158443311,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[872]叶子相似的树","frequency":53.55272864269516,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5087676823574171,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":42.18798778072249,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.4145140441945875,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":37.68167738319494,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.47847988409673464,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[875]爱吃香蕉的珂珂","frequency":45.94776019174313,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7062416406598306,"acs":0,"articleLive":2,"columnArticles":1577,"formTitle":"[876]链表的中间结点","frequency":43.66734937513342,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567187694818811,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":60.71730135918426,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.2805573558003889,"acs":0,"articleLive":2,"columnArticles":60,"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.5554656293240738,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":62.80744911804359,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25235485528343893,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":6.372460891638071,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5381572498774767,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[881]救生艇","frequency":42.342349954291166,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.48739977090492553,"acs":0,"articleLive":2,"columnArticles":30,"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.6874113246485232,"acs":0,"articleLive":2,"columnArticles":107,"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.6613177139292274,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[884]两句话中的不常见单词","frequency":6.372460891638071,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.689369535204786,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":34.76552785321028,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.42260655989356805,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[886]可能的二分法","frequency":5.208997904445751,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.2917511205828189,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[887]鸡蛋掉落","frequency":62.93549441667526,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6398289989312433,"acs":0,"articleLive":2,"columnArticles":451,"formTitle":"[888]公平的糖果棒交换","frequency":5.208997904445751,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6778581502206451,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":40.078294753171704,"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.7262902144772118,"acs":0,"articleLive":2,"columnArticles":120,"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.3298059964726631,"acs":0,"articleLive":2,"columnArticles":39,"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.6386985970938422,"acs":0,"articleLive":2,"columnArticles":680,"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.724098182804448,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":6.372460891638071,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7743487938398604,"acs":0,"articleLive":2,"columnArticles":120,"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.5441773591034594,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[895]最大频率栈","frequency":24.1771046016201,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5869257598405581,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[896]单调数列","frequency":17.268431807365815,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.744972710733778,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[897]递增顺序搜索树","frequency":55.497985809414416,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3356661152818425,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":25.539106844866836,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5385420756445491,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[899]有序队列","frequency":5.208997904445751,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4931133646132889,"acs":0,"articleLive":2,"columnArticles":43,"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.5433781817101785,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32719218765730396,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":6.372460891638071,"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.5316176470588235,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":13.763881535631178,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4527688081353318,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[904]水果成篮","frequency":37.68167738319494,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7012835758682833,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[905]按奇偶排序数组","frequency":23.53390457822948,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.2742849780984282,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[906]超级回文数","frequency":31.836764813741475,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3163061419511771,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[907]子数组的最小值之和","frequency":34.76552785321028,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.6986432780594765,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[908]最小差值 I","frequency":5.208997904445751,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.45965993381262127,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":40.641518940103005,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.31806790821089875,"acs":0,"articleLive":2,"columnArticles":66,"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.4256450659838487,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5633073188238078,"acs":0,"articleLive":2,"columnArticles":1016,"formTitle":"[912]排序数组","frequency":82.46074653272669,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40572792362768495,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.046811502943717,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888000895097741,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[914]卡牌分组","frequency":16.01274918778056,"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.46759542763829354,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[915]分割数组","frequency":16.01274918778056,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.44067200899761,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.569648006952949,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.1771046016201,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3579448592087473,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[918]环形子数组的最大和","frequency":35.48385440078198,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6281093003308418,"acs":0,"articleLive":2,"columnArticles":90,"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.48115711252653925,"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.7358286845420191,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[921]使括号有效的最少添加","frequency":5.208997904445751,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141999038923594,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[922]按奇偶排序数组 II","frequency":17.268431807365815,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.3378244064053009,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":17.268431807365815,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3593934387538353,"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.3880442724121314,"acs":0,"articleLive":2,"columnArticles":669,"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.5187243295482,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[926]将字符串翻转到单调递增","frequency":17.268431807365815,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.3386470060775132,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[927]三等分","frequency":37.00833846775293,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42017781213761113,"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.6431356558525956,"acs":0,"articleLive":2,"columnArticles":226,"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.5450047356216728,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":53.985128159266715,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6601760099785184,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[931]下降路径最小和","frequency":22.3149590830915,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6280793883697583,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[932]漂亮数组","frequency":5.208997904445751,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7244268807415377,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[933]最近的请求次数","frequency":34.07372263998341,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.4752222292603619,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[934]最短的桥","frequency":37.68167738319494,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.4748402555910543,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":5.778067303239537,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.37752305008721654,"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.5885708516330961,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[937]重新排列日志文件","frequency":16.62839297027137,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8185268256905771,"acs":0,"articleLive":2,"columnArticles":785,"formTitle":"[938]二叉搜索树的范围和","frequency":47.2521926404652,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4507506725679077,"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.41937710292468294,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[940]不同的子序列 II","frequency":4.139872630431496,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.3924008606654195,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[941]有效的山脉数组","frequency":5.208997904445751,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7294777956477501,"acs":0,"articleLive":2,"columnArticles":207,"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.4748485646563076,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":11.357048889746514,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6894851055434997,"acs":0,"articleLive":2,"columnArticles":178,"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.4863714858050701,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":24.844904528765106,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6226184027696003,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[946]验证栈序列","frequency":49.87101232073635,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125222763454913,"acs":0,"articleLive":2,"columnArticles":333,"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.3912154663863092,"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.3695327018084576,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":37.68167738319494,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7745153245917464,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[950]按递增顺序显示卡牌","frequency":17.268431807365815,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6636727160873578,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":24.844904528765106,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.349681678849328,"acs":0,"articleLive":2,"columnArticles":54,"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.5529885718983804,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[953]验证外星语词典","frequency":23.53390457822948,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.29967483199653155,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":29.70749945621389,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32835040769391594,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":7.645407825658858,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.435832414553473,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.1771046016201,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.36017322752969244,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[957]N 天后的牢房","frequency":30.39010311391695,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363310819999093,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":27.208375737138102,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.74375,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":24.844904528765106,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5530519110096976,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6769020364576503,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[961]重复 N 次的元素","frequency":17.268431807365815,"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.4416471307715829,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[962]最大宽度坡","frequency":17.268431807365815,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5008067769261799,"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.4260265700483092,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[964]表示数字的最少运算符","frequency":13.763881535631178,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6840938364408032,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[965]单值二叉树","frequency":5.778067303239537,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.40192667915440194,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[966]元音拼写检查器","frequency":7.645407825658858,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.461297264063941,"acs":0,"articleLive":2,"columnArticles":145,"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.49764228309004427,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[968]监控二叉树","frequency":38.79045176980457,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6531728665207878,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[969]煎饼排序","frequency":4.6634686777810055,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.41442296737933393,"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.4417527137940164,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":6.372460891638071,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4099641810485184,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":13.763881535631178,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6395741967890883,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[973]最接近原点的 K 个点","frequency":4.6634686777810055,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.465921403168857,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[974]和可被 K 整除的子数组","frequency":53.420766791186566,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.44603151229568544,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":6.372460891638071,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972097108368616,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.1771046016201,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7143974427180669,"acs":0,"articleLive":2,"columnArticles":1240,"formTitle":"[977]有序数组的平方","frequency":50.44816918371249,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47337572573956316,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":5.208997904445751,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7123783271599621,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":24.844904528765106,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7335710914144857,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":30.39010311391695,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5334077135684763,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[981]基于时间的键值存储","frequency":54.66435359332428,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.543998244459074,"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.6338823809240649,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[983]最低票价","frequency":45.808038424257674,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.4166470837054096,"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.599709745841551,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[985]查询后的偶数和","frequency":5.208997904445751,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.6771486668385027,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[986]区间列表的交集","frequency":43.8239249727883,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5323322383857344,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":52.57881184854276,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4977598318491067,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":4.6634686777810055,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.47206777625101237,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[989]数组形式的整数加法","frequency":17.268431807365815,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.5017581947162426,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":5.208997904445751,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5174854791868344,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":16.62839297027137,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4517739002592177,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":17.268431807365815,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570627219720523,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[993]二叉树的堂兄弟节点","frequency":51.63950530485878,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5091644706550809,"acs":0,"articleLive":2,"columnArticles":1363,"formTitle":"[994]腐烂的橘子","frequency":32.7626401770219,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398703075130452,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":5.778067303239537,"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.4948332550493189,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":18.629099549180648,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5114055636896047,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[997]找到小镇的法官","frequency":14.848310724327446,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6148648648648649,"acs":0,"articleLive":2,"columnArticles":108,"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.6909913409033791,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":5.208997904445751,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4081849274678618,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":34.76552785321028,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29238607415793944,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":9.80299121983382,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7374996712170231,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[1002]查找常用字符","frequency":38.79045176980457,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5761945966733968,"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.5974777962176062,"acs":0,"articleLive":2,"columnArticles":691,"formTitle":"[1004]最大连续1的个数 III","frequency":54.089475028946154,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5343596706377015,"acs":0,"articleLive":2,"columnArticles":403,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":21.176815304844883,"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.6276125030233187,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[1006]笨阶乘","frequency":50.58378092311957,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46446984980945977,"acs":0,"articleLive":2,"columnArticles":82,"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.7262411964177028,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.078294753171704,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5931069756462211,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":5.208997904445751,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.45066554505418377,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":6.372460891638071,"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.6272262069988451,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":70.37147025936271,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.33067287440416804,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":18.629099549180648,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39774856077260634,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.40663538255413,"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.5481366459627329,"acs":0,"articleLive":2,"columnArticles":433,"formTitle":"[1014]最佳观光组合","frequency":16.01274918778056,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35414503930001484,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":17.268431807365815,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5830485304169515,"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.5619754680438993,"acs":0,"articleLive":2,"columnArticles":54,"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.5166481555875889,"acs":0,"articleLive":2,"columnArticles":375,"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.5975844828624781,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1019]链表中的下一个更大节点","frequency":5.208997904445751,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5367440749805982,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1020]飞地的数量","frequency":24.1771046016201,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7835989010989011,"acs":0,"articleLive":2,"columnArticles":647,"formTitle":"[1021]删除最外层的括号","frequency":24.844904528765106,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7035053199242093,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":5.208997904445751,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.5658717105263158,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5580361686967733,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1024]视频拼接","frequency":16.62839297027137,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095588235294118,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[1025]除数博弈","frequency":39.423545269625265,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6691636313655419,"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.4331216611228707,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1027]最长等差数列","frequency":35.48385440078198,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7314319017957964,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[1028]从先序遍历还原二叉树","frequency":24.1771046016201,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6547477155343663,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":4.6634686777810055,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114130722880921,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5665671641791045,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":5.778067303239537,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.3955676020408163,"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.389983844911147,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":6.372460891638071,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43247283962922356,"acs":0,"articleLive":2,"columnArticles":93,"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.6307728816034464,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1035]不相交的线","frequency":57.90690353175337,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.2992459943449576,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4376107432621468,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7929826816180959,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":3.152805497377604,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5547141234380917,"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.5221327967806841,"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.48217907852796293,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":29.70749945621389,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5288225288225288,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":16.62839297027137,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6920888399412628,"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.2094944419065022,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":56.19080315806734,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6430606108561481,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1045]买下所有产品的客户","frequency":5.778067303239537,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6596302050016754,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[1046]最后一块石头的重量","frequency":27.80141594153932,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.725480208001698,"acs":0,"articleLive":2,"columnArticles":962,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":59.0143919014594,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4515261201330464,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1048]最长字符串链","frequency":39.10437795901931,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6436000749625187,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[1049]最后一块石头的重量 II","frequency":60.21735241090115,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7575842108933677,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":5.208997904445751,"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.7529276299671713,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1051]高度检查器","frequency":5.778067303239537,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811892474963534,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[1052]爱生气的书店老板","frequency":25.539106844866836,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4581738655002734,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1053]交换一次的先前排列","frequency":17.268431807365815,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37626384207992297,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":16.62839297027137,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5829927488464074,"acs":0,"articleLive":2,"columnArticles":81,"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.4081278651963821,"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.4651489162638391,"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.33924843423799583,"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.360442098317387,"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.528044466902476,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":5.778067303239537,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6017006041620049,"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.5383869403588168,"acs":0,"articleLive":2,"columnArticles":43,"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.700587084148728,"acs":0,"articleLive":2,"columnArticles":38,"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.6510632421982878,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5383744623047317,"acs":0,"articleLive":2,"columnArticles":66,"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.473796537823097,"acs":0,"articleLive":2,"columnArticles":39,"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.42113564668769715,"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.8640538885486834,"acs":0,"articleLive":2,"columnArticles":60,"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.8200872026313777,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1069]产品销售分析 II","frequency":5.208997904445751,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48402091807088904,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1070]产品销售分析 III","frequency":5.208997904445751,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5864321779475983,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":17.268431807365815,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.578797072996609,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":8.328683017057273,"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.33597621407333994,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6695020443925234,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":45.808038424257674,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6942519984773506,"acs":0,"articleLive":2,"columnArticles":69,"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.49547362565114045,"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.7215948835814929,"acs":0,"articleLive":2,"columnArticles":86,"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.6215079279473628,"acs":0,"articleLive":2,"columnArticles":176,"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.7334622566017605,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1079]活字印刷","frequency":5.208997904445751,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.48979349632091146,"acs":0,"articleLive":2,"columnArticles":84,"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.5710786282226327,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1081]不同字符的最小子序列","frequency":41.458801193540516,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7599834471342851,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":5.208997904445751,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5277501179183481,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":17.268431807365815,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5372996468350991,"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.7724317295188556,"acs":0,"articleLive":2,"columnArticles":72,"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.6891127363046778,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5323502858862473,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.44478662560492743,"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.5854307916163586,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[1089]复写零","frequency":5.208997904445751,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5430500844119303,"acs":0,"articleLive":2,"columnArticles":77,"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.37786144793918486,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":42.75350488428591,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.4876602257509087,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":17.934665866602437,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3804382010692945,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1093]大样本统计","frequency":6.994166501186637,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6124883459635199,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1094]拼车","frequency":22.3149590830915,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.37244711362630173,"acs":0,"articleLive":2,"columnArticles":380,"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.5536437246963563,"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.5177953314990681,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1097]游戏玩法分析 V","frequency":36.23070993956754,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.4716233460944321,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":5.208997904445751,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.579044570302881,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":5.778067303239537,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7000987445337847,"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.6684860672220626,"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.3678144149401809,"acs":0,"articleLive":2,"columnArticles":63,"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.6366545533438195,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":16.01274918778056,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.760857923204627,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[1104]二叉树寻路","frequency":44.46313478347891,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5567395364165659,"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.5733351869873489,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1106]解析布尔表达式","frequency":17.934665866602437,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4097989787344063,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":5.208997904445751,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8392237079687362,"acs":0,"articleLive":2,"columnArticles":677,"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.5756037625636997,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[1109]航班预订统计","frequency":27.208375737138102,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6285134743552594,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1110]删点成林","frequency":24.1771046016201,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7715736040609137,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":24.844904528765106,"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.6423864335295668,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":17.268431807365815,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5406938507070043,"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.6529906251081053,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":78.818550009037,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619467248791332,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1115]交替打印FooBar","frequency":48.51817717499532,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5171035617726578,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1116]打印零与奇偶数","frequency":60.64388659070276,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5201786814540974,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[1117]H2O 生成","frequency":45.124015532816784,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.641234221598878,"acs":0,"articleLive":2,"columnArticles":35,"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.8663444362719345,"acs":0,"articleLive":2,"columnArticles":143,"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.6077269495141029,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1120]子树的最大平均值","frequency":8.328683017057273,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5739455419113721,"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.7069150169480297,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[1122]数组的相对排序","frequency":51.63950530485878,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.704860800286456,"acs":0,"articleLive":2,"columnArticles":101,"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.31686533096626934,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":6.372460891638071,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4895162621759947,"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.6937649880095923,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1126]查询活跃业务","frequency":16.62839297027137,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.413884007029877,"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.5446520980571902,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":15.419877723131382,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.37950794145126127,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1129]颜色交替的最短路径","frequency":8.328683017057273,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.6283253379851723,"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.4539553140096618,"acs":0,"articleLive":2,"columnArticles":45,"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.38858243586375973,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":16.62839297027137,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6444394213381555,"acs":0,"articleLive":2,"columnArticles":61,"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.774869109947644,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5336208414011617,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":25.539106844866836,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5674800259123299,"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.6069661419787024,"acs":0,"articleLive":2,"columnArticles":818,"formTitle":"[1137]第 N 个泰波那契数","frequency":34.367083088052105,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43207398379812173,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":5.778067303239537,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4761781056788071,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":17.268431807365815,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6528436018957346,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":6.994166501186637,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5105952507720157,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1141]查询近30天活跃用户数","frequency":17.268431807365815,"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.3710270993643359,"acs":0,"articleLive":2,"columnArticles":50,"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.6340836038829933,"acs":0,"articleLive":2,"columnArticles":1067,"formTitle":"[1143]最长公共子序列","frequency":84.07690706226889,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.4418463407227452,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.1771046016201,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.4691909012381227,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":19.353973552147338,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2862059277988481,"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.5620034052213394,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1147]段式回文","frequency":36.23070993956754,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7182707055214724,"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.4421674192427926,"acs":0,"articleLive":2,"columnArticles":45,"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.6067040598290598,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.629099549180648,"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.48306530214424953,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":17.934665866602437,"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.38563049853372433,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":13.007701818741078,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3709964412811388,"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.5674219228413963,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[1154]一年中的第几天","frequency":4.6634686777810055,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.47984635083226634,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1155]掷骰子的N种方法","frequency":5.778067303239537,"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.4343570402298851,"acs":0,"articleLive":2,"columnArticles":76,"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.31597998509528374,"acs":0,"articleLive":2,"columnArticles":44,"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.5494228751311647,"acs":0,"articleLive":2,"columnArticles":60,"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.4882017900732303,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1159]市场分析 II","frequency":17.934665866602437,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870923706961929,"acs":0,"articleLive":2,"columnArticles":904,"formTitle":"[1160]拼写单词","frequency":16.01274918778056,"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.6327319587628866,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1161]最大层内元素和","frequency":17.268431807365815,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.46919672824006164,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":17.268431807365815,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.2670753064798599,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":8.328683017057273,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6100247246572263,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":17.268431807365815,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.838969764837626,"acs":0,"articleLive":2,"columnArticles":112,"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.4879245283018868,"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.42734553775743706,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":9.046811502943717,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5708996667900778,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":10.600869172856413,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3224971933421194,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":17.934665866602437,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6168305115601674,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":5.778067303239537,"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.47289021657953695,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":24.1771046016201,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.2690293101526803,"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.7564427957828973,"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.6180804460374353,"acs":0,"articleLive":2,"columnArticles":58,"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.4888965755793843,"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.4470899470899471,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.2637002750971573,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1177]构建回文串检测","frequency":6.372460891638071,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.46195679289527514,"acs":0,"articleLive":2,"columnArticles":182,"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.6348147035471342,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1179]重新格式化部门表","frequency":51.63950530485878,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7745694022289767,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":9.80299121983382,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.37063291139240506,"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.38740028635712825,"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.6024667931688804,"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.5858193979933111,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":4.6634686777810055,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.6094769434922039,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1185]一周中的第几天","frequency":16.62839297027137,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.39234088457389427,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":29.70749945621389,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44098320759308834,"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.6928290336685614,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":20.903776462279872,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6444170927223379,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1189]“气球” 的最大数量","frequency":5.208997904445751,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6508459483526269,"acs":0,"articleLive":2,"columnArticles":605,"formTitle":"[1190]反转每对括号间的子串","frequency":93.6738623531497,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.26751881062460336,"acs":0,"articleLive":2,"columnArticles":93,"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.5010402643495289,"acs":0,"articleLive":2,"columnArticles":45,"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.6067966700878094,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1193]每月交易 I","frequency":6.372460891638071,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5120254121918015,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":6.372460891638071,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6347064393939394,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1195]交替打印字符串","frequency":29.70749945621389,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6902185011231367,"acs":0,"articleLive":2,"columnArticles":55,"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.36860529875089504,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":17.268431807365815,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7476284584980237,"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.43393939393939396,"acs":0,"articleLive":2,"columnArticles":17,"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.6866381173142655,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":23.53390457822948,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24696899777656584,"acs":0,"articleLive":2,"columnArticles":84,"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.5032292178116856,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":5.778067303239537,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6231028231028231,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":6.994166501186637,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.727714093054619,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":6.994166501186637,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.461609280058921,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1205]每月交易II","frequency":25.539106844866836,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6189519984700708,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":17.934665866602437,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7304204451772465,"acs":0,"articleLive":2,"columnArticles":823,"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.49668072895475085,"acs":0,"articleLive":2,"columnArticles":601,"formTitle":"[1208]尽可能使字符串相等","frequency":16.62839297027137,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5320533092387622,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.07372263998341,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4502500431108812,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":12.251522101850973,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6556303778526,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":17.268431807365815,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.512562281352698,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":5.208997904445751,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7728428093645485,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":18.629099549180648,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.6339302907760447,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":17.934665866602437,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4096925704526046,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5334088335220838,"acs":0,"articleLive":2,"columnArticles":37,"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.6955266487170337,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.07372263998341,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4209955031787874,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":5.208997904445751,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6312861117055425,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.07372263998341,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5264473136193253,"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.8439522960070905,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[1221]分割平衡字符串","frequency":17.12400354460612,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.672391634536745,"acs":0,"articleLive":2,"columnArticles":125,"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.47288378766140604,"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.32565003513703444,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":28.623859955303377,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5419532324621733,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1225]报告系统状态的连续日期","frequency":17.934665866602437,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.6004581662935388,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1226]哲学家进餐","frequency":49.87101232073635,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6628313820481766,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1227]飞机座位分配概率","frequency":4.139872630431496,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5390222222222222,"acs":0,"articleLive":2,"columnArticles":50,"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.41452533904354033,"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.49026639344262296,"acs":0,"articleLive":2,"columnArticles":56,"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.558760054934275,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":18.629099549180648,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46923873205942424,"acs":0,"articleLive":2,"columnArticles":417,"formTitle":"[1232]缀点成线","frequency":15.419877723131382,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.48345645291451983,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":5.778067303239537,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.3422421948912015,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1234]替换子串得到平衡字符串","frequency":24.1771046016201,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.4539561040381161,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1235]规划兼职工作","frequency":39.10437795901931,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.56047197640118,"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.7107379709326936,"acs":0,"articleLive":2,"columnArticles":128,"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.6577516851489454,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":4.6634686777810055,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4906492690726359,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[1239]串联字符串的最大长度","frequency":41.458801193540516,"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.4962211614956245,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":28.623859955303377,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5948493683187561,"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.469743987587277,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":13.763881535631178,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5395987328405492,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.619173031340532,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.046811502943717,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5085269038518083,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":6.372460891638071,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.48044414981769973,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":9.046811502943717,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6166471277842908,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.1771046016201,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.55894975604184,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1248]统计「优美子数组」","frequency":16.62839297027137,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5727202821308303,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[1249]移除无效的括号","frequency":35.72953074721291,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5622609434764131,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1250]检查「好数组」","frequency":8.328683017057273,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7706942922601853,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7498108130833263,"acs":0,"articleLive":2,"columnArticles":309,"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.3937080024434942,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":18.629099549180648,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5979708306911858,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1254]统计封闭岛屿的数目","frequency":4.6634686777810055,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6785293424463823,"acs":0,"articleLive":2,"columnArticles":63,"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.664612676056338,"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.5646279949558638,"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.5574151557415156,"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.47542997542997545,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":14.848310724327446,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6038149310224613,"acs":0,"articleLive":2,"columnArticles":248,"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.727826417967263,"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.5251359541699531,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1262]可被三整除的最大和","frequency":40.756171368716956,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.4157631359466222,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":6.994166501186637,"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.5700305810397553,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1264]页面推荐","frequency":6.372460891638071,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9199580566235582,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":7.645407825658858,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.8238873145524254,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[1266]访问所有点的最小时间","frequency":5.778067303239537,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6078172454773537,"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.5828308712692192,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1268]搜索推荐系统","frequency":5.778067303239537,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.4916790514608613,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":48.016135462615225,"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.8046233115165019,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"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.5057519347416859,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5189331577214357,"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.5442368699330279,"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.6005025125628141,"acs":0,"articleLive":2,"columnArticles":25,"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.539829591560725,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":16.62839297027137,"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.5016014373877041,"acs":0,"articleLive":2,"columnArticles":96,"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.7245726328936071,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":32.7626401770219,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5981196581196582,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":58.75240672652717,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6231707317073171,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.504829969370926,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1280]学生们参加各科测试的次数","frequency":17.268431807365815,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.831725517062603,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[1281]整数的各位积和之差","frequency":5.208997904445751,"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.8113220293183814,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[1282]用户分组","frequency":0.0,"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.416585543927963,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":17.268431807365815,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6599476439790576,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":16.01274918778056,"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.8105566218809981,"acs":0,"articleLive":2,"columnArticles":58,"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.645746744250485,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":5.208997904445751,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6038478355924792,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.01274918778056,"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.5631263383297644,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":24.1771046016201,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6271048066129197,"acs":0,"articleLive":2,"columnArticles":91,"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.809235253509243,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[1290]二进制链表转整数","frequency":4.139872630431496,"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.5191579585037104,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.46800320769847636,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":4.6634686777810055,"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.3564952146415179,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":56.81728875497233,"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.6582142157822597,"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.8091703131118791,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":16.62839297027137,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.4533293341331734,"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.45737103388733,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.26171830425565,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5961803957662218,"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.7855311355311355,"acs":0,"articleLive":2,"columnArticles":427,"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.4672678299566694,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":3.6367572611854526,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3608969866853539,"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.8170023898941619,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.1771046016201,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.8224578313253013,"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.7246301672888151,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1304]和为零的N个唯一整数","frequency":5.208997904445751,"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.7467202278043323,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":5.208997904445751,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5747887180531515,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[1306]跳跃游戏 III","frequency":29.70749945621389,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33278206541712607,"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.7517615971814445,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1308]不同性别每日分数总计","frequency":5.778067303239537,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7556870723136675,"acs":0,"articleLive":2,"columnArticles":285,"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.7125997179888355,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":53.26957969301333,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.3780420353982301,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1311]获取你好友已观看的视频","frequency":6.372460891638071,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6665793266081488,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":37.00833846775293,"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.8316281298670181,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":4.139872630431496,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7358081560764124,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1314]矩阵区域和","frequency":34.07372263998341,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8101322717349428,"acs":0,"articleLive":2,"columnArticles":258,"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.43905973273224924,"acs":0,"articleLive":2,"columnArticles":57,"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.6140404659717964,"acs":0,"articleLive":2,"columnArticles":189,"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.6534831937228289,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1318]或运算的最小翻转次数","frequency":58.22938019843856,"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.6174045182858879,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[1319]连通网络的操作次数","frequency":5.778067303239537,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892509727626459,"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.6172875436554133,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":4.6634686777810055,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5928977602413833,"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.7552707991415225,"acs":0,"articleLive":2,"columnArticles":472,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.1771046016201,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5924678505817513,"acs":0,"articleLive":2,"columnArticles":113,"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.7284095063985375,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":4.6634686777810055,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47441464452958704,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":5.778067303239537,"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.6909423127120856,"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.459255132898297,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":16.01274918778056,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7711549295774648,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":6.372460891638071,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3783783783783784,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":13.763881535631178,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5357391667827783,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1331]数组序号转换","frequency":16.62839297027137,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6847162222553255,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":5.208997904445751,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5430489731437599,"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.48981769675411296,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":49.87101232073635,"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.5856152512998267,"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.4246913580246914,"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.706062271062271,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":37.68167738319494,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6407731846810976,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":4.6634686777810055,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.39773337892628596,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":5.778067303239537,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5723455469376839,"acs":0,"articleLive":2,"columnArticles":95,"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.4806841639634326,"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.820480404551201,"acs":0,"articleLive":2,"columnArticles":634,"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.5437219730941704,"acs":0,"articleLive":2,"columnArticles":212,"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.5938324203692432,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1344]时钟指针的夹角","frequency":5.778067303239537,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3667118600296985,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":5.778067303239537,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.435725260342571,"acs":0,"articleLive":2,"columnArticles":264,"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.7392480912341741,"acs":0,"articleLive":2,"columnArticles":111,"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.3038544316180787,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":8.328683017057273,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5035449299258038,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":6.994166501186637,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8489171178675552,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":5.778067303239537,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7551729462631254,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":5.208997904445751,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.4426758147512864,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":5.208997904445751,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.2828944004091025,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1353]最多可以参加的会议数目","frequency":54.727260890403464,"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.28220128904313335,"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.6630785791173305,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315641334941697,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.01274918778056,"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.5288172630428845,"acs":0,"articleLive":2,"columnArticles":41,"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.4890774508033941,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":5.778067303239537,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.5473366834170854,"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.5033832769453842,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1360]日期之间隔几天","frequency":29.70749945621389,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.40123046225473896,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1361]验证二叉树","frequency":5.208997904445751,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5236455696202532,"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.3630856529407254,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":31.099189097302688,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6765566234851651,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1364]顾客的可信联系人数量","frequency":5.778067303239537,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250458059395851,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.1771046016201,"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.537705932400031,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1366]通过投票对团队排名","frequency":17.934665866602437,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.4175578075135771,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":16.62839297027137,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5220359103724588,"acs":0,"articleLive":2,"columnArticles":85,"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.6098136352913422,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":5.208997904445751,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905339525045033,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[1370]上升下降字符串","frequency":4.6634686777810055,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.5799552967797125,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.458801193540516,"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.5131908338147506,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":5.208997904445751,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3987478790006436,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":29.70749945621389,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7394459686697938,"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.5730003374957813,"acs":0,"articleLive":2,"columnArticles":170,"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.5023563964210095,"acs":0,"articleLive":2,"columnArticles":152,"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.3249980279245878,"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.861920570515185,"acs":0,"articleLive":2,"columnArticles":59,"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.83684339916414,"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.7278981004793184,"acs":0,"articleLive":2,"columnArticles":247,"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.7312822448722789,"acs":0,"articleLive":2,"columnArticles":149,"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.691192507537366,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.32382731125637526,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":7.645407825658858,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5434719395173015,"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.7030507025698562,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1385]两个数组间的距离值","frequency":5.208997904445751,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.3108108108108108,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1386]安排电影院座位","frequency":19.353973552147338,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6939512054280352,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":17.934665866602437,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5381456953642384,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":24.1771046016201,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8308027324523461,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.01274918778056,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35313138189244386,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.40049079754601224,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":18.629099549180648,"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.40077361126034167,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[1392]最长快乐前缀","frequency":5.778067303239537,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8560821139986897,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6639275931880434,"acs":0,"articleLive":2,"columnArticles":269,"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.7491840992991279,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":5.778067303239537,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.4111492130484481,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":18.629099549180648,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.3697261287934863,"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.7709630172098133,"acs":0,"articleLive":2,"columnArticles":63,"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.669312554616953,"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.6046511627906976,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":5.208997904445751,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.4178327367393427,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7519763634911762,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1402]做菜顺序","frequency":4.6634686777810055,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915525189877616,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.01274918778056,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.4925476603119584,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":6.372460891638071,"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.506108848574602,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1405]最长快乐字符串","frequency":17.268431807365815,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5686790197250449,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":6.994166501186637,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.667760459392945,"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.6145298742878667,"acs":0,"articleLive":2,"columnArticles":198,"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.805446293494705,"acs":0,"articleLive":2,"columnArticles":128,"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.47572752608723834,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":5.778067303239537,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5498459112735612,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":37.00833846775293,"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.5515657620041754,"acs":0,"articleLive":2,"columnArticles":65,"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.6921311475409836,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":15.419877723131382,"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.6020959826998253,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.1771046016201,"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.6838825517532742,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":6.372460891638071,"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.408166295471418,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":17.934665866602437,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.5184806188858417,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":5.778067303239537,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327625440892024,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":48.64936639155681,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.41905632969279605,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":34.76552785321028,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.59425,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":23.53390457822948,"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.7488713318284425,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5407874015748031,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":30.39010311391695,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5543009020618557,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":5.208997904445751,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.39699193401661714,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":17.268431807365815,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43444585269680325,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":6.372460891638071,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7043610547667343,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":20.11015326903744,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6597353497164461,"acs":0,"articleLive":2,"columnArticles":44,"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.5911949685534591,"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.500903342366757,"acs":0,"articleLive":2,"columnArticles":38,"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.5782493368700266,"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.8463375969076419,"acs":0,"articleLive":2,"columnArticles":1026,"formTitle":"[1431]拥有最多糖果的孩子","frequency":5.208997904445751,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3931699548792356,"acs":0,"articleLive":2,"columnArticles":98,"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.6429273620972147,"acs":0,"articleLive":2,"columnArticles":99,"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.4560480841472577,"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.6200873362445415,"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.7835619477206345,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5891080467795426,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":5.778067303239537,"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.4825116761805916,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":36.04120311935543,"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.5608108108108109,"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.6986152592994841,"acs":0,"articleLive":2,"columnArticles":34,"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.6476179949154416,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1441]用栈操作构建数组","frequency":6.372460891638071,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7918014360103687,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":52.57881184854276,"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.410351751319997,"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.5244726602498464,"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.8594948128101038,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5725701542464225,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.6169646658152406,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.7129749980885389,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":4.139872630431496,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276681666089766,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":35.48385440078198,"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.8023576961940048,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":4.6634686777810055,"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.5218491381582415,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":5.778067303239537,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.4985077172337341,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":6.372460891638071,"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.36242670275146593,"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.402619067478522,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":17.934665866602437,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6333027572438353,"acs":0,"articleLive":2,"columnArticles":199,"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.5198411089943659,"acs":0,"articleLive":2,"columnArticles":202,"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.635339868751519,"acs":0,"articleLive":2,"columnArticles":136,"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.4413567959232423,"acs":0,"articleLive":2,"columnArticles":88,"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.5946093111897631,"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.7445117711334062,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5004359958144402,"acs":0,"articleLive":2,"columnArticles":82,"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.4271188850967008,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1462]课程表 IV","frequency":4.6634686777810055,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.590218847699866,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.046811502943717,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.7684817993489198,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":16.01274918778056,"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.3082059652767473,"acs":0,"articleLive":2,"columnArticles":79,"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.48525760397268775,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":17.268431807365815,"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.6145357686453576,"acs":0,"articleLive":2,"columnArticles":47,"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.7115768463073853,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8028592927012792,"acs":0,"articleLive":2,"columnArticles":81,"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.8433404547048883,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":40.078294753171704,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.543057210965435,"acs":0,"articleLive":2,"columnArticles":104,"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.6171358629130967,"acs":0,"articleLive":2,"columnArticles":125,"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.6745813109449473,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.426816377863304,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7192099147947327,"acs":0,"articleLive":2,"columnArticles":61,"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.7209407281115234,"acs":0,"articleLive":2,"columnArticles":224,"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.8647955647955647,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.629099549180648,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.28940834494035,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":16.62839297027137,"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.5761957730812013,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":26.26171830425565,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5733169382108823,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":5.208997904445751,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8694859094790777,"acs":0,"articleLive":2,"columnArticles":1278,"formTitle":"[1480]一维数组的动态和","frequency":30.985388222841436,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5121849831124967,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1481]不同整数的最少数目","frequency":34.07372263998341,"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.5869734567080238,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":47.938393146163364,"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.2994731490895646,"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.8057630736392742,"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.659260608268075,"acs":0,"articleLive":2,"columnArticles":44,"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.8586377867384604,"acs":0,"articleLive":2,"columnArticles":673,"formTitle":"[1486]数组异或操作","frequency":47.938393146163364,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30837004405286345,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.1771046016201,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.2357465306804882,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1488]避免洪水泛滥","frequency":61.033306399021306,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6918109951119426,"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.8574730354391371,"acs":0,"articleLive":2,"columnArticles":29,"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.6718449931412894,"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.6660714285714285,"acs":0,"articleLive":2,"columnArticles":75,"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.5662779993863148,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.1771046016201,"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.36676747311827956,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":27.80141594153932,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428775948460988,"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.5381437065403608,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":5.778067303239537,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39069420253794473,"acs":0,"articleLive":2,"columnArticles":107,"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.3329847722371087,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":19.353973552147338,"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.37685545467646636,"acs":0,"articleLive":2,"columnArticles":58,"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.3025685676969961,"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.5911419102139198,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":23.53390457822948,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7170390340436515,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1502]判断能否形成等差数列","frequency":34.07372263998341,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.512224790171512,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":17.268431807365815,"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.5923026744944553,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.40663538255413,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.36129679144385024,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":32.605074009780594,"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.8435054773082942,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":26.634368191155293,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5886356540743053,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":29.70749945621389,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5522318947953325,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1508]子数组和排序后的区间和","frequency":6.994166501186637,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.545320308950477,"acs":0,"articleLive":2,"columnArticles":74,"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.5781450017456069,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":29.70749945621389,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6817241379310345,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":5.778067303239537,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488225645832113,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[1512]好数对的数目","frequency":4.6634686777810055,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.379068394178332,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":4.6634686777810055,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31826902579407373,"acs":0,"articleLive":2,"columnArticles":133,"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.3414152495885902,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"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.7313865358894338,"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.6740147512109202,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1518]换酒问题","frequency":24.1771046016201,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2960519140582397,"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.33204684588767636,"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.39531701383609547,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":13.007701818741078,"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.7024185068349106,"acs":0,"articleLive":2,"columnArticles":27,"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.5772681361772919,"acs":0,"articleLive":2,"columnArticles":165,"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.4257861635220126,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.01274918778056,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6621861526756277,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"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.6121345614737685,"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.5060984570168994,"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.7844282755324233,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[1528]重新排列字符串","frequency":16.01274918778056,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6892517861348826,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":6.372460891638071,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.5661725780836422,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1530]好叶子节点对的数量","frequency":16.62839297027137,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.32416787264833574,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.73640925264647,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6193455245428297,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":5.208997904445751,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.6150341685649203,"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.7896240108629489,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":5.208997904445751,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45291169863487124,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1535]找出数组游戏的赢家","frequency":6.372460891638071,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.43867618429591176,"acs":0,"articleLive":2,"columnArticles":77,"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.36517603871183046,"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.6084656084656085,"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.5383076818767374,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[1539]第 k 个缺失的正整数","frequency":24.1771046016201,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.31648424543946935,"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.45887790883009244,"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.38148381012260296,"acs":0,"articleLive":2,"columnArticles":47,"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.5490348995905635,"acs":0,"articleLive":2,"columnArticles":43,"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.544714524775222,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1544]整理字符串","frequency":34.07372263998341,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5526512881965249,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":17.934665866602437,"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.4115209619759506,"acs":0,"articleLive":2,"columnArticles":77,"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.534777344275528,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":27.80141594153932,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7133757961783439,"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.6678966789667896,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":5.208997904445751,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6601665136598183,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1550]存在连续三个奇数的数组","frequency":4.6634686777810055,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8175932127707077,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":5.208997904445751,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5082042455536432,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1552]两球之间的磁力","frequency":16.01274918778056,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.2947981366459627,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":61.753734942282975,"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.703012912482066,"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.4347696436558819,"acs":0,"articleLive":2,"columnArticles":55,"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.5783438085786746,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1556]千位分隔数","frequency":45.124015532816784,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7636777329610094,"acs":0,"articleLive":2,"columnArticles":100,"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.6220773699872467,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":6.372460891638071,"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.3667987670629679,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":8.328683017057273,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.573609891223566,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":6.372460891638071,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7795496543699952,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.01274918778056,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3096114218428025,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":11.357048889746514,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.37790754257907544,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":38.3797560492819,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5881773399014778,"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.7254485363550519,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":5.778067303239537,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4460908671586716,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":5.208997904445751,"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.39599667594031146,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":23.53390457822948,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.45503694359344027,"acs":0,"articleLive":2,"columnArticles":47,"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.4717289719626168,"acs":0,"articleLive":2,"columnArticles":45,"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.8965303593556382,"acs":0,"articleLive":2,"columnArticles":35,"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.7575196668209162,"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.8049987094553902,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[1572]矩阵对角线元素的和","frequency":16.62839297027137,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2954054054054054,"acs":0,"articleLive":2,"columnArticles":64,"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.32586170437724676,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":17.268431807365815,"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.5962154738287807,"acs":0,"articleLive":2,"columnArticles":64,"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.475803622034493,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":5.208997904445751,"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.32418823833193466,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.046811502943717,"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.5802206203582351,"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.619639959823843,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":7.645407825658858,"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.6297229219143576,"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.8089125696294502,"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.6717157214644652,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":5.778067303239537,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6860598439175944,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":47.2521926404652,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6661779720920491,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":18.629099549180648,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.4288580809923386,"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.6174957118353345,"acs":0,"articleLive":2,"columnArticles":23,"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.8238238238238238,"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.8389105961545901,"acs":0,"articleLive":2,"columnArticles":689,"formTitle":"[1588]所有奇数长度子数组的和","frequency":21.314999009708423,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.2938934328595251,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":6.372460891638071,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26510499583049046,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":17.934665866602437,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5812332439678284,"acs":0,"articleLive":2,"columnArticles":32,"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.4446804744202514,"acs":0,"articleLive":2,"columnArticles":124,"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.5292217623902291,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":5.778067303239537,"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.3132557608943646,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":6.372460891638071,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46142322097378274,"acs":0,"articleLive":2,"columnArticles":38,"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.7576354679802956,"acs":0,"articleLive":2,"columnArticles":39,"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.6666666666666666,"acs":0,"articleLive":2,"columnArticles":19,"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.6714981881794327,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":5.208997904445751,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.41931942919868276,"acs":0,"articleLive":2,"columnArticles":68,"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.6799788952473721,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":17.934665866602437,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48590573012939003,"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.7829181494661922,"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.84482991461969,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":61.033306399021306,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41394978984437125,"acs":0,"articleLive":2,"columnArticles":61,"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.7339265850945494,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.34123931623931625,"acs":0,"articleLive":2,"columnArticles":33,"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.5457091418283657,"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.6403138201569101,"acs":0,"articleLive":2,"columnArticles":157,"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.5122130125430939,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":4.6634686777810055,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27066260828845706,"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.6095322676139727,"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.7340241796200345,"acs":0,"articleLive":2,"columnArticles":20,"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.7237619263970922,"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.8207608316298549,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1614]括号的最大嵌套深度","frequency":4.139872630431496,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.49551697825257535,"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.2750181189719574,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1616]分割两个字符串得到回文串","frequency":6.372460891638071,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6184163382300251,"acs":0,"articleLive":2,"columnArticles":32,"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.5877712031558185,"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.6739933680720038,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.37059818545286793,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":8.328683017057273,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4379766141331978,"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.14764098095356654,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":16.62839297027137,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.781956676981671,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":5.208997904445751,"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.6273568928531106,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":16.62839297027137,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5421754649633665,"acs":0,"articleLive":2,"columnArticles":65,"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.3839538648320518,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":6.372460891638071,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3788623039138013,"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.8371040723981901,"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.5233681208271213,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7690123067213632,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":5.208997904445751,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49243102385072907,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":23.53390457822948,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3170301828596607,"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.654647028948705,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":5.778067303239537,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.519205298013245,"acs":0,"articleLive":2,"columnArticles":24,"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.5438247011952191,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":6.994166501186637,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7060710562194241,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":5.208997904445751,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8061035758323057,"acs":0,"articleLive":2,"columnArticles":69,"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.7106690777576854,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":8.328683017057273,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.402156158118262,"acs":0,"articleLive":2,"columnArticles":28,"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.6621069932665288,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":4.6634686777810055,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7693747176872943,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.3797560492819,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45376328537343646,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":5.778067303239537,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.4496823119491699,"acs":0,"articleLive":2,"columnArticles":48,"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.5438311688311688,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":18.629099549180648,"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.41147807255008123,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":7.645407825658858,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.5376266507732363,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1646]获取生成数组中的最大值","frequency":20.458274067110747,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5130269320843092,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.1771046016201,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27727645611156687,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.353973552147338,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47497621313035204,"acs":0,"articleLive":2,"columnArticles":63,"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.7948717948717948,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":6.994166501186637,"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.6868884540117417,"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.6606174178913108,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":16.01274918778056,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5038036457585762,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":5.208997904445751,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27523620089507705,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":16.62839297027137,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3870005963029219,"acs":0,"articleLive":2,"columnArticles":32,"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.7810271041369472,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":4.6634686777810055,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4646098003629764,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":5.778067303239537,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.29789382071366405,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":5.208997904445751,"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.41032017407522536,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":13.763881535631178,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7398058252427184,"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.7255023183925812,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":17.268431807365815,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8129214617403594,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.01274918778056,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5722569815351747,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1663]具有给定数值的最小字符串","frequency":25.539106844866836,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5453798767967146,"acs":0,"articleLive":2,"columnArticles":106,"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.6660996990710454,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":5.778067303239537,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6859756097560976,"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.6004092370651856,"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.4428355750754872,"acs":0,"articleLive":2,"columnArticles":125,"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.7643809523809524,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1669]合并两个链表","frequency":5.208997904445751,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5291863584110359,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":5.208997904445751,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.4652418976045092,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":7.645407825658858,"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.8505377065307309,"acs":0,"articleLive":2,"columnArticles":438,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3515212112555349,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":4.6634686777810055,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.36198960653303636,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":18.629099549180648,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4347301258837731,"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.7650727650727651,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":9.046811502943717,"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.39532434709351305,"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.8302014722975591,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[1678]设计 Goal 解析器","frequency":4.6634686777810055,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4963653719068948,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":5.208997904445751,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.461814051031108,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":6.372460891638071,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38376687520579517,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5201401050788091,"acs":0,"articleLive":2,"columnArticles":15,"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.8953362255965293,"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.8279890754602468,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[1684]统计一致字符串的数目","frequency":24.1771046016201,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5963118189438391,"acs":0,"articleLive":2,"columnArticles":82,"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.4698418536226554,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":5.778067303239537,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.4025974025974026,"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.8052640277663003,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":16.01274918778056,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8678901312591152,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1689]十-二进制数的最少数目","frequency":15.419877723131382,"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.5164621552666747,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1690]石子游戏 VII","frequency":6.994166501186637,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4862497453656549,"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.6363636363636364,"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.8021853805576489,"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.634006734006734,"acs":0,"articleLive":2,"columnArticles":135,"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.457554067574848,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1695]删除子数组的最大得分","frequency":5.208997904445751,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.3968526844750066,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":24.1771046016201,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.5244977951984321,"acs":0,"articleLive":2,"columnArticles":41,"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.5473815461346634,"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.8002922552362397,"acs":0,"articleLive":2,"columnArticles":40,"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.7123076923076923,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1700]无法吃午餐的学生数量","frequency":5.208997904445751,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.6114979757085021,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":17.268431807365815,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.4747779453661807,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":20.11015326903744,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.3879390736711222,"acs":0,"articleLive":2,"columnArticles":23,"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.7820546678991153,"acs":0,"articleLive":2,"columnArticles":181,"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.34778038827748237,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":17.268431807365815,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5832986544597032,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1706]球会落何处","frequency":16.62839297027137,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032198053806526,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":39.857550884539336,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6976377952755906,"acs":0,"articleLive":2,"columnArticles":24,"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.7132196162046909,"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.6935171897423098,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":23.53390457822948,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.359258237474361,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":49.87101232073635,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.2643779085082097,"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.496912098812838,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":46.51682959053691,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6398891966759003,"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.7366697848456502,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":17.268431807365815,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6753191849158705,"acs":0,"articleLive":2,"columnArticles":187,"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.43084998990510803,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":6.372460891638071,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4881869542886492,"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.36594202898550726,"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.8692994207437876,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":56.81728875497233,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6476946145195551,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1721]交换链表中的节点","frequency":5.778067303239537,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5145673603504929,"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.507216585991203,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.24460119219428,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5583756345177665,"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.7876450767502808,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":5.208997904445751,"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.478344900289906,"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.5752257624808315,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":6.372460891638071,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35471204188481675,"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.6232471174820816,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":5.778067303239537,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5317307692307692,"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.47164591977869985,"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.7926677713338857,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":34.07372263998341,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.45827755466309683,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1733]需要教语言的最少人数","frequency":8.328683017057273,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7231839298227402,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[1734]解码异或后的排列","frequency":56.241218169066144,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.48452611218568664,"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.44905397268088615,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.124015532816784,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.30953003749237074,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":6.994166501186637,"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.6543821473216352,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":38.79045176980457,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.4721627408993576,"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.7044854881266491,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":12.251522101850973,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8440123729562528,"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.7076645781477985,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1742]盒子中小球的最大数量","frequency":4.6634686777810055,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6970875003918864,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":42.94573896282834,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.3626770520038045,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":55.497985809414416,"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.48462104488594554,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":6.372460891638071,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.5892857142857143,"acs":0,"articleLive":2,"columnArticles":29,"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.7043325526932084,"acs":0,"articleLive":2,"columnArticles":33,"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.7489073734667983,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1748]唯一元素的和","frequency":24.844904528765106,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5305107729395812,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.1771046016201,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4583998838391172,"acs":0,"articleLive":2,"columnArticles":80,"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.472480181200453,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":18.629099549180648,"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.6834406085430076,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":5.208997904445751,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6282852218871177,"acs":0,"articleLive":2,"columnArticles":123,"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.42030467232389324,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":5.778067303239537,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.4000581902822229,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":8.328683017057273,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.830423940149626,"acs":0,"articleLive":2,"columnArticles":12,"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.9237972231191476,"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.6363386476085762,"acs":0,"articleLive":2,"columnArticles":112,"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.4279741543139491,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":5.778067303239537,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5379337643488586,"acs":0,"articleLive":2,"columnArticles":76,"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.42905462540165734,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":0.0,"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.6732117812061711,"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.6092044915388265,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1763]最长的美好子字符串","frequency":5.208997904445751,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.47770428845743546,"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.5523329129886507,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":5.778067303239537,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3752043596730245,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":12.251522101850973,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7939958592132506,"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.7674158871981014,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1768]交替合并字符串","frequency":16.62839297027137,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8554948391013965,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":5.208997904445751,"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.36890021849963583,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":10.600869172856413,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.3648908857509628,"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.5172413793103449,"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.8419754410424152,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":22.91367943896234,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5527481851607429,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":5.208997904445751,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4736901791789521,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":17.934665866602437,"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.46201844818231147,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":27.80141594153932,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7802773497688752,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":64.55847044322766,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5709459459459459,"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.6462177685445436,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":5.208997904445751,"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.6627529352985261,"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.517592473256863,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":6.994166501186637,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28750923872875095,"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.793178519593614,"acs":0,"articleLive":2,"columnArticles":27,"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.4210603255043368,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":5.208997904445751,"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.3488191164212281,"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.3399795501022495,"acs":0,"articleLive":2,"columnArticles":87,"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.6543333891400189,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":56.546397369943115,"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.688,"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.7073047858942065,"acs":0,"articleLive":2,"columnArticles":29,"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.6486554919734643,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"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.8096006796941376,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5125385649869473,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":35.48385440078198,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.4127396815079623,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.629099549180648,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6995305164319249,"acs":0,"articleLive":2,"columnArticles":9,"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.7885441527446301,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1795]每个产品在不同商店的价格","frequency":24.844904528765106,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48738379814077026,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1796]字符串中第二大的数字","frequency":5.208997904445751,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.574938237716168,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1797]设计一个验证系统","frequency":16.01274918778056,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.521271054002431,"acs":0,"articleLive":2,"columnArticles":51,"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.5165336374002281,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":6.994166501186637,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6834308837343739,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":16.62839297027137,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37715355805243445,"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.2624099917160517,"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.4071107638210588,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":23.53390457822948,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5740740740740741,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.046811502943717,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4914712153518124,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":5.208997904445751,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6634590377113134,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":27.014981993264435,"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.5850908331593234,"acs":0,"articleLive":2,"columnArticles":85,"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.26726427622841964,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":11.357048889746514,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6368597816960537,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1809]没有广告的剧集","frequency":24.844904528765106,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6433823529411765,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":20.11015326903744,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6619343389529725,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1811]寻找面试候选人","frequency":6.372460891638071,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7951510170536265,"acs":0,"articleLive":2,"columnArticles":182,"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.5157003642090757,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1813]句子相似性 III","frequency":25.539106844866836,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34265734265734266,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":5.778067303239537,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29773822766036334,"acs":0,"articleLive":2,"columnArticles":38,"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.7527220845535781,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1816]截断句子","frequency":5.208997904445751,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.6979191580961492,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":5.208997904445751,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37419685327478963,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":45.808038424257674,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657669306610635,"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.5027932960893855,"acs":0,"articleLive":2,"columnArticles":8,"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.9016460905349795,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":25.539106844866836,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8125961978451682,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1822]数组元素积的符号","frequency":15.419877723131382,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7094370860927153,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1823]找出游戏的获胜者","frequency":15.419877723131382,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.659277150004313,"acs":0,"articleLive":2,"columnArticles":152,"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.28714285714285714,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":10.600869172856413,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.4429657794676806,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7963908450704226,"acs":0,"articleLive":2,"columnArticles":135,"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.8689182805857345,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.01274918778056,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6794107330761137,"acs":0,"articleLive":2,"columnArticles":83,"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.48579710144927535,"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.7370405278039586,"acs":0,"articleLive":2,"columnArticles":23,"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.8227685179226463,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":23.53390457822948,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6848661123581297,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":29.049574993027633,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.3506854278640015,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1834]单线程 CPU","frequency":31.099189097302688,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5087819505926031,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":11.357048889746514,"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.7111111111111111,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":20.903776462279872,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7948088015381328,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":5.208997904445751,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42997365449755365,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[1838]最高频元素的频数","frequency":58.974406422076406,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5763613415073927,"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.38798144787255495,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":9.046811502943717,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5182967398536261,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":24.844904528765106,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6917808219178082,"acs":0,"articleLive":2,"columnArticles":10,"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.5093457943925234,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1843]","frequency":5.208997904445751,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8025641025641026,"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.5651324147366363,"acs":0,"articleLive":2,"columnArticles":57,"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.633805752396832,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":40.756171368716956,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.3601768514132323,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":6.994166501186637,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6849529780564263,"acs":0,"articleLive":2,"columnArticles":98,"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.32864549192539183,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":6.372460891638071,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6055745464107284,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":6.994166501186637,"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.40106951871657753,"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.7095435684647303,"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.6496090973702914,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":6.994166501186637,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.7919220055710307,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.1771046016201,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6885464612100594,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":23.53390457822948,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3560381704508062,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":17.934665866602437,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.44932504821084207,"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.6504424778761062,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":11.357048889746514,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7706616435130681,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7706893146355915,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.208997904445751,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6173762945914845,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":5.778067303239537,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3100256337225862,"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.91701244813278,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.458801193540516,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38716733503463363,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":5.778067303239537,"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.5158690677544523,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":3.6367572611854526,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5959679646506489,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.73640925264647,"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.753199268738574,"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.5272727272727272,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":13.763881535631178,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7927698574338086,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":29.70749945621389,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4592491127576116,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":6.372460891638071,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2760855169804181,"acs":0,"articleLive":2,"columnArticles":125,"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.6273133375877473,"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.8042704626334519,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.07372263998341,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8805460750853242,"acs":0,"articleLive":2,"columnArticles":16,"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.7430997876857749,"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.7266769468003084,"acs":0,"articleLive":2,"columnArticles":89,"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.8188711948867945,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1877]数组中最大数对和的最小值","frequency":53.26957969301333,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4293600490697199,"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.4093686354378819,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":7.645407825658858,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7726686721100129,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":4.6634686777810055,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.3526021970106249,"acs":0,"articleLive":2,"columnArticles":63,"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.27854130876151806,"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.373391494002181,"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.6936708860759494,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":32.7626401770219,"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.5189873417721519,"acs":0,"articleLive":2,"columnArticles":10,"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.5718491059747056,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":16.62839297027137,"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.6411321734614386,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.372460891638071,"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.31477391607578753,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":7.645407825658858,"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.2726190476190476,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":17.268431807365815,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7045060658578857,"acs":0,"articleLive":2,"columnArticles":18,"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.5178571428571429,"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.33685064935064934,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":6.372460891638071,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915911907712842,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.124015532816784,"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.4586095464357334,"acs":0,"articleLive":2,"columnArticles":500,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":11.797615539788591,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5298226759806556,"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.5039658328248933,"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.5305443724838088,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":16.62839297027137,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3080616433051963,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":7.645407825658858,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6281424581005587,"acs":0,"articleLive":2,"columnArticles":42,"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.42782931354359927,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":27.80141594153932,"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.6633879781420765,"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.42948717948717946,"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.6458371454711802,"acs":0,"articleLive":2,"columnArticles":99,"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.2766028309741882,"acs":0,"articleLive":2,"columnArticles":69,"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.569171974522293,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1905]统计子岛屿","frequency":5.208997904445751,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.42305685967657797,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":19.353973552147338,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5934718100890207,"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.6727272727272727,"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.32703553756185333,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":6.994166501186637,"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.6751259201859744,"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.5696767001114827,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1911]最大子序列交替和","frequency":16.01274918778056,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2856272838002436,"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.8427581582476531,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":16.62839297027137,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.44159821801475707,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":17.934665866602437,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.39059218815623686,"acs":0,"articleLive":2,"columnArticles":56,"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.5485436893203883,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":20.11015326903744,"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.2901907356948229,"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.4713656387665198,"acs":0,"articleLive":2,"columnArticles":3,"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.3811881188118812,"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.9248097717260713,"acs":0,"articleLive":2,"columnArticles":79,"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.34325978829230963,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":16.62839297027137,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3618804373852662,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":5.208997904445751,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2367086536888598,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":26.26171830425565,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3858267716535433,"acs":0,"articleLive":2,"columnArticles":4,"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.6985328916232845,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1925]统计平方和三元组的数目","frequency":29.70749945621389,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34229193725646917,"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.4116939364773821,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":5.778067303239537,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.39702839947338725,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":31.836764813741475,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9248474280732345,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1929]数组串联","frequency":16.01274918778056,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.4755393767202344,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":16.62839297027137,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5535002845759818,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":9.046811502943717,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.3258003766478343,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":21.73640925264647,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5704022988505747,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":10.600869172856413,"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.75177304964539,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7407622588891472,"acs":0,"articleLive":2,"columnArticles":90,"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.44844517184942717,"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.24164828238260322,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":17.268431807365815,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3398328690807799,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1938]查询最大基因差","frequency":20.903776462279872,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6156521739130435,"acs":0,"articleLive":2,"columnArticles":12,"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.8033573141486811,"acs":0,"articleLive":2,"columnArticles":22,"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.7737989718135082,"acs":0,"articleLive":2,"columnArticles":79,"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.3917090909090909,"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.40394530374355525,"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.5695488721804511,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":5.778067303239537,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6625566445357782,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":5.208997904445751,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.3030619952356051,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":17.268431807365815,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5402856746637082,"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.5123018042646255,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":9.046811502943717,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5015673981191222,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5462962962962963,"acs":0,"articleLive":2,"columnArticles":7,"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.7210144927536232,"acs":0,"articleLive":2,"columnArticles":11,"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.5450304090644006,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1952]三除数","frequency":5.208997904445751,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.32266917588018507,"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.4797694801296674,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":5.208997904445751,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4940418050400469,"acs":0,"articleLive":2,"columnArticles":41,"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.4405594405594406,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":18.629099549180648,"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.6102571906863491,"acs":0,"articleLive":2,"columnArticles":52,"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.42102510460251047,"acs":0,"articleLive":2,"columnArticles":43,"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.409024318781131,"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.2799208704253215,"acs":0,"articleLive":2,"columnArticles":18,"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.5352465642683912,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":4.6634686777810055,"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.42494428525947153,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":16.01274918778056,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6120639534883721,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":5.778067303239537,"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.38212094653812445,"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.7514450867052023,"acs":0,"articleLive":2,"columnArticles":11,"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.7441860465116279,"acs":0,"articleLive":2,"columnArticles":5,"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.7759042697851509,"acs":0,"articleLive":2,"columnArticles":54,"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.35451955041950295,"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.2771659682292174,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":20.11015326903744,"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.4783593927033764,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":14.296716148632921,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5543710021321961,"acs":0,"articleLive":2,"columnArticles":16,"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.5077519379844961,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":9.046811502943717,"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.5196078431372549,"acs":0,"articleLive":2,"columnArticles":9,"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.7487352445193929,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":0.7561797168901019,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.3778184892897407,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1975]最大方阵和","frequency":11.797615539788591,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.2811862545112192,"acs":0,"articleLive":2,"columnArticles":33,"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.24465474938661058,"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.5776892430278885,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1978]","frequency":12.251522101850973,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.82777138473341,"acs":0,"articleLive":2,"columnArticles":69,"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.5792383933229004,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1980]找出不同的二进制字符串","frequency":10.19647017548591,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29520854877628405,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":21.176815304844883,"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.4568115942028986,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":8.328683017057273,"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":3,"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.5816515763063161,"acs":0,"articleLive":2,"columnArticles":57,"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.40894392302232035,"acs":0,"articleLive":2,"columnArticles":72,"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.2669467560798255,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1986]完成任务的最少工作时间段","frequency":4.6634686777810055,"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.451568894952251,"acs":0,"articleLive":2,"columnArticles":25,"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.6545454545454545,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":30.39010311391695,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3972602739726027,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1989]","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6439393939393939,"acs":0,"articleLive":2,"columnArticles":5,"formTitle":"[1990]","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6621457489878543,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5909918107370337,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3822421102213848,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.356953642384106,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5419723780750971,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.23782961460446247,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.33776546629732224,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1997]访问完所有房间的第一天","frequency":10.600869172856413,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4198450536352801,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1998]数组的最大公因数排序","frequency":20.11015326903744,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.8065510597302504,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[5867]反转单词前缀","frequency":0.0,"frontendQuestionId":"5867","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.33076263924592975,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[5868]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"5868","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.525056095736724,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[5869]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"5869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.34425675675675677,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[5870]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"5870","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.8447399911825835,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[LCP 01]猜数字","frequency":37.68167738319494,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6900521397966032,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[LCP 02]分式化简","frequency":28.41470406574424,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21855682477444136,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[LCP 03]机器人大冒险","frequency":22.91367943896234,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.3771667662881052,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":26.26171830425565,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19703557312252964,"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.8396579055521851,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[LCP 06]拿硬币","frequency":34.07372263998341,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703450357106931,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[LCP 07]传递信息","frequency":66.11092689688343,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2848075702498413,"acs":0,"articleLive":2,"columnArticles":101,"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.2707248870724887,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":64.7673537714265,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5835876568328247,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":18.629099549180648,"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.6854739433729996,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":6.372460891638071,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4075885774722369,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 12]小张刷题计划","frequency":40.756171368716956,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6126990341947273,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":6.994166501186637,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.2059125760809422,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":24.844904528765106,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5714285714285714,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":9.046811502943717,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30101767541510444,"acs":0,"articleLive":2,"columnArticles":15,"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.7983340790968231,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[LCP 17]速算机器人","frequency":27.80141594153932,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.28560896737764524,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[LCP 18]早餐组合","frequency":34.76552785321028,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163737280296022,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":34.07372263998341,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.30445007235890015,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":17.268431807365815,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3270868824531516,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":7.645407825658858,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.33279343076691276,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":50.58378092311957,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33813525410164064,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":16.62839297027137,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.275,"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.3280329799764429,"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.3343989769820972,"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.32674853176721835,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":13.007701818741078,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.2765117426771562,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[LCP 28]采购方案","frequency":27.208375737138102,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.1819616598660405,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[LCP 29]乐团站位","frequency":49.87101232073635,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3446691176470588,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[LCP 30]魔塔游戏","frequency":4.139872630431496,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.24456849728424865,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":16.01274918778056,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.39645214521452143,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":17.268431807365815,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.2090435131341488,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 33]蓄水","frequency":29.70749945621389,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.47173489278752434,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":29.70749945621389,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.38894907908992415,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":17.268431807365815,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.2522743177046886,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":36.23070993956754,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.18958716802524322,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":31.836764813741475,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5407894736842105,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 38]守卫城堡","frequency":20.11015326903744,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.49275583346042395,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.20810681926561755,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.36039083051484405,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.1701310438319024,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.350597609561753,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.5407983563252128,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[LCS 01]下载插件","frequency":24.844904528765106,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.6995669022110782,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[LCS 02]完成一半题目","frequency":17.268431807365815,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41772479917076966,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":6.372460891638071,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.6786472988182329,"acs":0,"articleLive":2,"columnArticles":2727,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.62865160387491,"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.4028613309314979,"acs":0,"articleLive":2,"columnArticles":2023,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":73.99764517564354,"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.7614919597581907,"acs":0,"articleLive":2,"columnArticles":1881,"formTitle":"[剑指 Offer 05]替换空格","frequency":64.18100848754734,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.752290077333396,"acs":0,"articleLive":2,"columnArticles":2021,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":77.72243598830528,"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.6967483757094384,"acs":0,"articleLive":2,"columnArticles":1421,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":80.64081021901605,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7169593212110003,"acs":0,"articleLive":2,"columnArticles":1597,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":93.04373183992894,"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.35953208368186573,"acs":0,"articleLive":2,"columnArticles":1823,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":55.33649998626792,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4426373168299713,"acs":0,"articleLive":2,"columnArticles":1284,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":69.73650259698296,"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.49327130166556593,"acs":0,"articleLive":2,"columnArticles":1589,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":79.77402304349222,"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.45270870644769295,"acs":0,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":61.39031404048521,"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.5259772206184036,"acs":0,"articleLive":2,"columnArticles":1676,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.10608524201196,"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.568829503258422,"acs":0,"articleLive":2,"columnArticles":1270,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":65.86050787875138,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.3113963759123806,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":32.7626401770219,"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.7465885288319369,"acs":0,"articleLive":2,"columnArticles":1231,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":50.9500122536942,"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.3390883782113434,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":35.72953074721291,"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.7770666099622561,"acs":0,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":65.13814694144922,"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.5956609564783966,"acs":0,"articleLive":2,"columnArticles":1429,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":59.95481848797124,"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.37547894951377164,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":55.497985809414416,"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.24026463743441517,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":67.63764581894857,"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.6425427517526315,"acs":0,"articleLive":2,"columnArticles":1586,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":56.87666484966001,"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.7977244634406189,"acs":0,"articleLive":2,"columnArticles":2397,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":62.86291663996529,"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.7427724477310351,"acs":0,"articleLive":2,"columnArticles":1779,"formTitle":"[剑指 Offer 24]反转链表","frequency":93.45069842427903,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7286219719419795,"acs":0,"articleLive":2,"columnArticles":1158,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":80.49952139983301,"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.4654825726015717,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[剑指 Offer 26]树的子结构","frequency":70.74336638246402,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7913569673207115,"acs":0,"articleLive":2,"columnArticles":1365,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":61.39031404048521,"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.5804225243787419,"acs":0,"articleLive":2,"columnArticles":1056,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":50.15304987152237,"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.4399718397997497,"acs":0,"articleLive":2,"columnArticles":1446,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":80.88198260611965,"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.5721378632771038,"acs":0,"articleLive":2,"columnArticles":880,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":59.065689318758054,"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.6145406372426911,"acs":0,"articleLive":2,"columnArticles":916,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":38.79045176980457,"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.6452227911537205,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":62.99774336165355,"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.6859196878965528,"acs":0,"articleLive":2,"columnArticles":1059,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.941639572040934,"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.5885096064167133,"acs":0,"articleLive":2,"columnArticles":1098,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.49521083884604,"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.5507740550743611,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.968783562235316,"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.5774180138985532,"acs":0,"articleLive":2,"columnArticles":843,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":66.47476527251098,"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.7206409703399924,"acs":0,"articleLive":2,"columnArticles":795,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":60.58534619280255,"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.654515539065624,"acs":0,"articleLive":2,"columnArticles":868,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":67.88849533062657,"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.5601217428927364,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.98766022766164,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5789455773310092,"acs":0,"articleLive":2,"columnArticles":1087,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":92.21338294636536,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6898851757223812,"acs":0,"articleLive":2,"columnArticles":998,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":57.544577960927434,"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.5697649965827244,"acs":0,"articleLive":2,"columnArticles":1776,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":75.24417469044093,"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.5808382654442769,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":47.2521926404652,"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.6053128827034384,"acs":0,"articleLive":2,"columnArticles":1491,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":89.94363944814846,"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.4836327487041113,"acs":0,"articleLive":2,"columnArticles":496,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":53.420766791186566,"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.4138170536892552,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":50.9500122536942,"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.5618392775739683,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.55756683107178,"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.5375356111918194,"acs":0,"articleLive":2,"columnArticles":1391,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":70.27248961315051,"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.688942366272694,"acs":0,"articleLive":2,"columnArticles":962,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":55.967753817831564,"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.4646080085693176,"acs":0,"articleLive":2,"columnArticles":1000,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":70.24601517644018,"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.6512411183906985,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[剑指 Offer 49]丑数","frequency":68.95800241097096,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6139478543717282,"acs":0,"articleLive":2,"columnArticles":1023,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":65.86050787875138,"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.48173685530632016,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":91.18238247563178,"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.6482608461497034,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":66.90782069595106,"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.5386211783761895,"acs":0,"articleLive":2,"columnArticles":1538,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":60.14625463702027,"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.44702658477539675,"acs":0,"articleLive":2,"columnArticles":1424,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":57.652592023696215,"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.7553926488341988,"acs":0,"articleLive":2,"columnArticles":1111,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":46.24117571728132,"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.7895118024513671,"acs":0,"articleLive":2,"columnArticles":1235,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":57.74758250742854,"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.5869626286993396,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.183391514271584,"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.6993325777609872,"acs":0,"articleLive":2,"columnArticles":1001,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":64.20979626076823,"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.7994219599804242,"acs":0,"articleLive":2,"columnArticles":679,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":49.63901230315857,"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.664096910585977,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":63.30274329893456,"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.7062923848915577,"acs":0,"articleLive":2,"columnArticles":1831,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":59.22899757099898,"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.44131792072496345,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":57.85134431809088,"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.8568889983637419,"acs":0,"articleLive":2,"columnArticles":1735,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":53.39219453851418,"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.4438702007133366,"acs":0,"articleLive":2,"columnArticles":1167,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":75.35388341143116,"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.4746833138249447,"acs":0,"articleLive":2,"columnArticles":1046,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":47.777902316390914,"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.5603211890066899,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":58.05801388453394,"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.4597099624651781,"acs":0,"articleLive":2,"columnArticles":950,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":61.15570194351348,"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.6552480385494532,"acs":0,"articleLive":2,"columnArticles":746,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":75.24417469044093,"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.6336037565986005,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":65.13814694144922,"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.8571833398811095,"acs":0,"articleLive":2,"columnArticles":1264,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":53.094630916820584,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5819269386883145,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":44.46313478347891,"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.5977817046390338,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":56.0736585058937,"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.2854401356886505,"acs":0,"articleLive":2,"columnArticles":544,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":47.2521926404652,"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.6930681539593038,"acs":0,"articleLive":2,"columnArticles":671,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":48.40951537413687,"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.6998587965986776,"acs":0,"articleLive":2,"columnArticles":668,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":61.11841526725883,"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.20526880895774216,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[剑指 Offer II 001]整数除法","frequency":13.763881535631178,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5856550771356206,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":1.5123594337802038,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7850571854798608,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":14.296716148632921,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6929144566843465,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":3.152805497377604,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7190301548492257,"acs":0,"articleLive":2,"columnArticles":64,"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.6692855025200118,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":17.268431807365815,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.46216017634092577,"acs":0,"articleLive":2,"columnArticles":55,"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.5128623928133932,"acs":0,"articleLive":2,"columnArticles":67,"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.5433494884221863,"acs":0,"articleLive":2,"columnArticles":55,"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.4377313590692755,"acs":0,"articleLive":2,"columnArticles":40,"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.5686274509803921,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.296716148632921,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.662913758162576,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6633247089262613,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5033864977059209,"acs":0,"articleLive":2,"columnArticles":50,"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.644633972992182,"acs":0,"articleLive":2,"columnArticles":37,"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.49624847321584364,"acs":0,"articleLive":2,"columnArticles":54,"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.5267333563297689,"acs":0,"articleLive":2,"columnArticles":30,"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.5394736842105263,"acs":0,"articleLive":2,"columnArticles":46,"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.4738624338624339,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":14.296716148632921,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.707953473750393,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5381236272356448,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":14.848310724327446,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5179190751445086,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":13.007701818741078,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7120642086782042,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7705575611712796,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[剑指 Offer II 024]反转链表","frequency":21.73640925264647,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6093073593073594,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":28.41470406574424,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.65035134480252,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[剑指 Offer II 026]重排链表","frequency":15.419877723131382,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6148847284542782,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[剑指 Offer II 027]回文链表","frequency":1.9306397630286996,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6051779935275081,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":16.62839297027137,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2995078509491446,"acs":0,"articleLive":2,"columnArticles":38,"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.5296934865900383,"acs":0,"articleLive":2,"columnArticles":21,"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.5863833136560409,"acs":0,"articleLive":2,"columnArticles":20,"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.5973154362416108,"acs":0,"articleLive":2,"columnArticles":35,"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.7861271676300579,"acs":0,"articleLive":2,"columnArticles":34,"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.5756247259973696,"acs":0,"articleLive":2,"columnArticles":32,"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.7024704618689581,"acs":0,"articleLive":2,"columnArticles":26,"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.5970149253731343,"acs":0,"articleLive":2,"columnArticles":37,"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.4594192107222636,"acs":0,"articleLive":2,"columnArticles":31,"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.7781774580335732,"acs":0,"articleLive":2,"columnArticles":36,"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.5243589743589744,"acs":0,"articleLive":2,"columnArticles":19,"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.5739191073919108,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":14.848310724327446,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7916307161345988,"acs":0,"articleLive":2,"columnArticles":38,"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.8580178173719376,"acs":0,"articleLive":2,"columnArticles":31,"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.6473724295506473,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6472642607683353,"acs":0,"articleLive":2,"columnArticles":34,"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.8120939530234883,"acs":0,"articleLive":2,"columnArticles":39,"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.7128043282236249,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6876172607879925,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.6735714285714286,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":5.778067303239537,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7564282374941561,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":15.419877723131382,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6191588785046729,"acs":0,"articleLive":2,"columnArticles":24,"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.417301658449126,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":24.1771046016201,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.736796158882584,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":2.6868194799188014,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6472009665726943,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8472906403940886,"acs":0,"articleLive":2,"columnArticles":32,"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.8920502092050209,"acs":0,"articleLive":2,"columnArticles":19,"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.7290296052631579,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3588203167667941,"acs":0,"articleLive":2,"columnArticles":10,"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.5820627802690583,"acs":0,"articleLive":2,"columnArticles":12,"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.6234972677595628,"acs":0,"articleLive":2,"columnArticles":17,"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.6719727117680501,"acs":0,"articleLive":2,"columnArticles":31,"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.5418155825589707,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.7224108658743633,"acs":0,"articleLive":2,"columnArticles":16,"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.723726977248104,"acs":0,"articleLive":2,"columnArticles":20,"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.6045949214026602,"acs":0,"articleLive":2,"columnArticles":12,"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.6246786632390745,"acs":0,"articleLive":2,"columnArticles":12,"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.6377672209026128,"acs":0,"articleLive":2,"columnArticles":18,"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.6349206349206349,"acs":0,"articleLive":2,"columnArticles":14,"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.5138932251014674,"acs":0,"articleLive":2,"columnArticles":36,"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.7222222222222222,"acs":0,"articleLive":2,"columnArticles":28,"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.6805037313432836,"acs":0,"articleLive":2,"columnArticles":27,"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.5167652859960552,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":5.778067303239537,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.42424242424242425,"acs":0,"articleLive":2,"columnArticles":40,"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.5403422982885085,"acs":0,"articleLive":2,"columnArticles":20,"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.5391591096455071,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 074]合并区间","frequency":16.01274918778056,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7129015808261091,"acs":0,"articleLive":2,"columnArticles":34,"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.6708697889861039,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":29.70749945621389,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5665998998497747,"acs":0,"articleLive":2,"columnArticles":43,"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.646513353115727,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.846116504854369,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[剑指 Offer II 079]所有子集","frequency":3.6367572611854526,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8147100424328148,"acs":0,"articleLive":2,"columnArticles":24,"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.7899096385542169,"acs":0,"articleLive":2,"columnArticles":35,"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.6434443963652099,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8587921847246892,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6770301624129931,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8569469835466179,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.7693298969072165,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":4.139872630431496,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.6310418904403867,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":16.62839297027137,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7461928934010152,"acs":0,"articleLive":2,"columnArticles":36,"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.6195991091314031,"acs":0,"articleLive":2,"columnArticles":19,"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.520297699594046,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":3.6367572611854526,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.7519110493398193,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6451612903225806,"acs":0,"articleLive":2,"columnArticles":22,"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.5480769230769231,"acs":0,"articleLive":2,"columnArticles":11,"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.6089266737513284,"acs":0,"articleLive":2,"columnArticles":15,"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.6631225517627308,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":45.124015532816784,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.4982905982905983,"acs":0,"articleLive":2,"columnArticles":12,"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.5296655879180151,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7609011627906976,"acs":0,"articleLive":2,"columnArticles":26,"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.6825866441251056,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":24.1771046016201,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7431048069345941,"acs":0,"articleLive":2,"columnArticles":28,"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.47276853252647505,"acs":0,"articleLive":2,"columnArticles":27,"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.5921273031825796,"acs":0,"articleLive":2,"columnArticles":14,"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.5015166835187057,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":29.70749945621389,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5547703180212014,"acs":0,"articleLive":2,"columnArticles":10,"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.6912845642282114,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5412147505422994,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 106]二分图","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5507853403141362,"acs":0,"articleLive":2,"columnArticles":12,"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.5810526315789474,"acs":0,"articleLive":2,"columnArticles":7,"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.6025998142989787,"acs":0,"articleLive":2,"columnArticles":19,"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.8433048433048433,"acs":0,"articleLive":2,"columnArticles":23,"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.6616915422885572,"acs":0,"articleLive":2,"columnArticles":12,"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.5839350180505415,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":5.778067303239537,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5693430656934306,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.01274918778056,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.39970717423133234,"acs":0,"articleLive":2,"columnArticles":11,"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.2747603833865815,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 115]重建序列","frequency":4.6634686777810055,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.633217064663268,"acs":0,"articleLive":2,"columnArticles":43,"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.632495164410058,"acs":0,"articleLive":2,"columnArticles":11,"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.7017268445839875,"acs":0,"articleLive":2,"columnArticles":17,"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.44389027431421446,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":5.208997904445751,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7212256154644131,"acs":0,"articleLive":2,"columnArticles":1489,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.19034749322846,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6502392457835892,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":45.94776019174313,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5796062677984289,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[面试题 01.03]URL化","frequency":40.078294753171704,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510433569618812,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[面试题 01.04]回文排列","frequency":45.124015532816784,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.3331723804925157,"acs":0,"articleLive":2,"columnArticles":536,"formTitle":"[面试题 01.05]一次编辑","frequency":40.078294753171704,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.4727908603404057,"acs":0,"articleLive":2,"columnArticles":1146,"formTitle":"[面试题 01.06]字符串压缩","frequency":67.63764581894857,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7549087438864368,"acs":0,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.089475028946154,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6217007483531749,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 01.08]零矩阵","frequency":38.3797560492819,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.55123637703796,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 01.09]字符串轮转","frequency":37.00833846775293,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.683791389071172,"acs":0,"articleLive":2,"columnArticles":672,"formTitle":"[面试题 02.01]移除重复节点","frequency":47.87501324958765,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800198721801744,"acs":0,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":61.033306399021306,"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.8538730039040171,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.03]删除中间节点","frequency":61.71884088822722,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6566128422530647,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 02.04]分割链表","frequency":46.5891387280255,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.4666360715924736,"acs":0,"articleLive":2,"columnArticles":509,"formTitle":"[面试题 02.05]链表求和","frequency":72.91920378793894,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.48353798925556407,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[面试题 02.06]回文链表","frequency":27.208375737138102,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6859240936847801,"acs":0,"articleLive":2,"columnArticles":401,"formTitle":"[面试题 02.07]链表相交","frequency":22.3149590830915,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319936862554638,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":49.87101232073635,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.541144301707682,"acs":0,"articleLive":2,"columnArticles":169,"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.6132316145807781,"acs":0,"articleLive":2,"columnArticles":283,"formTitle":"[面试题 03.02]栈的最小值","frequency":42.75350488428591,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3862428655776422,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 03.03]堆盘子","frequency":33.40663538255413,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7120712918510151,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 03.04]化栈为队","frequency":35.72953074721291,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.5442166161596285,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[面试题 03.05]栈排序","frequency":16.62839297027137,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5891824469894545,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.07372263998341,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.533826037521319,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":34.76552785321028,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7892742708796221,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[面试题 04.02]最小高度树","frequency":49.18301978993158,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8050158467686371,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":32.7626401770219,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5841203344227957,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[面试题 04.04]检查平衡性","frequency":17.268431807365815,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.3512050595407669,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":34.76552785321028,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908757114007711,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.06]后继者","frequency":17.268431807365815,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7166115037123177,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":30.39010311391695,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.4783027965284474,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":17.268431807365815,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7170026973894756,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.10]检查子树","frequency":5.778067303239537,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.48801355114696676,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":34.07372263998341,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5063758389261745,"acs":0,"articleLive":2,"columnArticles":174,"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.6881142221398109,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":17.268431807365815,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.38947606824701797,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 05.03]翻转数位","frequency":39.10437795901931,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.39127429142023196,"acs":0,"articleLive":2,"columnArticles":133,"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.5274059461744399,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 05.06]整数转换","frequency":4.6634686777810055,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7036683225066871,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":4.6634686777810055,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5523700928489982,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":23.53390457822948,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.3639887984597882,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[面试题 08.01]三步问题","frequency":40.842611225241576,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36109315852645185,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":36.3581132853949,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6768500823723229,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":5.208997904445751,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8226330759853718,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[面试题 08.04]幂集","frequency":40.078294753171704,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6799803246433842,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 08.05]递归乘法","frequency":5.778067303239537,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6563773021974869,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":52.35377697976856,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8135203584648354,"acs":0,"articleLive":2,"columnArticles":305,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":29.049574993027633,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.718508882110174,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":45.808038424257674,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8121254034117105,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":63.08899128278487,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.559557020880886,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":16.01274918778056,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946759156983166,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.124015532816784,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.7599962322799416,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[面试题 08.12]八皇后","frequency":46.5891387280255,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5012189547463051,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.268431807365815,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5336346716298856,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":24.844904528765106,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5542959486907537,"acs":0,"articleLive":2,"columnArticles":2363,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.73390978441684,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395272742928488,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.033306399021306,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.39624838699524756,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.471585017714546,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534648785963254,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.1771046016201,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.456176523783686,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":43.43482511868017,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6308772935779816,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.6670282976222764,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.095320636715776,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330484903320934,"acs":0,"articleLive":2,"columnArticles":391,"formTitle":"[面试题 16.01]交换数字","frequency":24.1771046016201,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7664693218514532,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":5.778067303239537,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.44330184728490996,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":6.372460891638071,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.46057465232222516,"acs":0,"articleLive":2,"columnArticles":153,"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.4638737902691237,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":29.70749945621389,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42462493533367823,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.06]最小差","frequency":34.07372263998341,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7329425736505383,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 16.07]最大数值","frequency":40.756171368716956,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.375695263778864,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5498308613062711,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":9.046811502943717,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6834940830426157,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 16.10]生存人数","frequency":16.62839297027137,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.4409612359252647,"acs":0,"articleLive":2,"columnArticles":575,"formTitle":"[面试题 16.11]跳水板","frequency":22.91367943896234,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.43218973060096705,"acs":0,"articleLive":2,"columnArticles":50,"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.5506047103755569,"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.5033735078715184,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 16.15]珠玑妙算","frequency":5.778067303239537,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4519705202673162,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.16]部分排序","frequency":34.76552785321028,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6007402553703933,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":38.3797560492819,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443567753001715,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":33.40663538255413,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.610583695718748,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[面试题 16.19]水域大小","frequency":45.124015532816784,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7206708595387841,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 16.20]T9键盘","frequency":29.70749945621389,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46548762001010613,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":5.208997904445751,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5824776054183963,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":7.645407825658858,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47235706580366776,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.1771046016201,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5446078780539925,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 16.25]LRU 缓存","frequency":88.1345422707354,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.3873398851590106,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 16.26]计算器","frequency":58.22938019843856,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5974852219216511,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":16.62839297027137,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6451382268827455,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":37.00833846775293,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38678968951376685,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":17.268431807365815,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.4485344912661601,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":5.778067303239537,"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.41162005785920924,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.07372263998341,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.2721970839617898,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":40.756171368716956,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5502796668142127,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[面试题 17.09]第 k 个数","frequency":52.57881184854276,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5710707953939101,"acs":0,"articleLive":2,"columnArticles":921,"formTitle":"[面试题 17.10]主要元素","frequency":58.75240672652717,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.6865635455559327,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.07372263998341,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6315756727329289,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 17.12]BiNode","frequency":4.6634686777810055,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5531031666817893,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":30.39010311391695,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5983424442952591,"acs":0,"articleLive":2,"columnArticles":751,"formTitle":"[面试题 17.14]最小K个数","frequency":47.83466439231477,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.4025529487270912,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":31.099189097302688,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5189243285681009,"acs":0,"articleLive":2,"columnArticles":1128,"formTitle":"[面试题 17.16]按摩师","frequency":50.9500122536942,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.4424727441428903,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":16.01274918778056,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4458684009181331,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.18]最短超串","frequency":24.1771046016201,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5815847598012148,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":34.76552785321028,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5707639201560859,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":17.934665866602437,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.63586382510815,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 17.21]直方图的水量","frequency":87.24202161342647,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37218635491188273,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.078294753171704,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.37929530786673643,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":5.208997904445751,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5193514644351465,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[面试题 17.24]最大子矩阵","frequency":74.49764026442716,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.5025432349949135,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":29.485532867338254,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.341190939838065,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":16.62839297027137,"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.47563231863573163,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[524]通过删除字母匹配到字典里最长单词","frequency":31.709178233000372,"frontendQuestionId":"524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过删除字母匹配到字典里最长单词","titleSlug":"longest-word-in-dictionary-through-deleting"},{"acceptance":0.5198201251730981,"acs":0,"articleLive":2,"columnArticles":14044,"formTitle":"[1]两数之和","frequency":100.0,"frontendQuestionId":"1","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和","titleSlug":"two-sum"},{"acceptance":0.4084167019704688,"acs":0,"articleLive":2,"columnArticles":7045,"formTitle":"[2]两数相加","frequency":99.21130069066973,"frontendQuestionId":"2","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加","titleSlug":"add-two-numbers"},{"acceptance":0.37979361329452027,"acs":0,"articleLive":2,"columnArticles":7277,"formTitle":"[3]无重复字符的最长子串","frequency":95.42900766399536,"frontendQuestionId":"3","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重复字符的最长子串","titleSlug":"longest-substring-without-repeating-characters"},{"acceptance":0.40795241763138435,"acs":0,"articleLive":2,"columnArticles":3750,"formTitle":"[4]寻找两个正序数组的中位数","frequency":95.36437194511028,"frontendQuestionId":"4","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找两个正序数组的中位数","titleSlug":"median-of-two-sorted-arrays"},{"acceptance":0.35374638746889125,"acs":0,"articleLive":2,"columnArticles":3915,"formTitle":"[5]最长回文子串","frequency":97.63390207200918,"frontendQuestionId":"5","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子串","titleSlug":"longest-palindromic-substring"},{"acceptance":0.5065571515658882,"acs":0,"articleLive":2,"columnArticles":2409,"formTitle":"[6]Z 字形变换","frequency":78.9712651429887,"frontendQuestionId":"6","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Z 字形变换","titleSlug":"zigzag-conversion"},{"acceptance":0.35335232030149905,"acs":0,"articleLive":2,"columnArticles":5190,"formTitle":"[7]整数反转","frequency":98.42260138133946,"frontendQuestionId":"7","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整数反转","titleSlug":"reverse-integer"},{"acceptance":0.21711737932945344,"acs":0,"articleLive":2,"columnArticles":2646,"formTitle":"[8]字符串转换整数 (atoi)","frequency":73.91746383388657,"frontendQuestionId":"8","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串转换整数 (atoi)","titleSlug":"string-to-integer-atoi"},{"acceptance":0.5849162494190957,"acs":0,"articleLive":2,"columnArticles":4857,"formTitle":"[9]回文数","frequency":81.19779934938059,"frontendQuestionId":"9","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文数","titleSlug":"palindrome-number"},{"acceptance":0.31638583906891327,"acs":0,"articleLive":2,"columnArticles":1224,"formTitle":"[10]正则表达式匹配","frequency":86.20841452490019,"frontendQuestionId":"10","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"正则表达式匹配","titleSlug":"regular-expression-matching"},{"acceptance":0.6298898669719338,"acs":0,"articleLive":2,"columnArticles":2967,"formTitle":"[11]盛最多水的容器","frequency":87.46953346589486,"frontendQuestionId":"11","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"盛最多水的容器","titleSlug":"container-with-most-water"},{"acceptance":0.665261614041782,"acs":0,"articleLive":2,"columnArticles":1739,"formTitle":"[12]整数转罗马数字","frequency":76.58505458074951,"frontendQuestionId":"12","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数转罗马数字","titleSlug":"integer-to-roman"},{"acceptance":0.6325331461872424,"acs":0,"articleLive":2,"columnArticles":3818,"formTitle":"[13]罗马数字转整数","frequency":82.1084372259705,"frontendQuestionId":"13","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"罗马数字转整数","titleSlug":"roman-to-integer"},{"acceptance":0.40819866848992387,"acs":0,"articleLive":2,"columnArticles":3817,"formTitle":"[14]最长公共前缀","frequency":90.66125941413421,"frontendQuestionId":"14","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共前缀","titleSlug":"longest-common-prefix"},{"acceptance":0.33452330199124547,"acs":0,"articleLive":2,"columnArticles":3010,"formTitle":"[15]三数之和","frequency":93.7819670278389,"frontendQuestionId":"15","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三数之和","titleSlug":"3sum"},{"acceptance":0.4594787377015013,"acs":0,"articleLive":2,"columnArticles":1405,"formTitle":"[16]最接近的三数之和","frequency":83.54204119523726,"frontendQuestionId":"16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的三数之和","titleSlug":"3sum-closest"},{"acceptance":0.5721233662674771,"acs":0,"articleLive":2,"columnArticles":3007,"formTitle":"[17]电话号码的字母组合","frequency":73.47812034206393,"frontendQuestionId":"17","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"电话号码的字母组合","titleSlug":"letter-combinations-of-a-phone-number"},{"acceptance":0.4003676362134576,"acs":0,"articleLive":2,"columnArticles":1482,"formTitle":"[18]四数之和","frequency":66.85478203815869,"frontendQuestionId":"18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四数之和","titleSlug":"4sum"},{"acceptance":0.42860990254275205,"acs":0,"articleLive":2,"columnArticles":3772,"formTitle":"[19]删除链表的倒数第 N 个结点","frequency":75.03329668262874,"frontendQuestionId":"19","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表的倒数第 N 个结点","titleSlug":"remove-nth-node-from-end-of-list"},{"acceptance":0.44489005966797507,"acs":0,"articleLive":2,"columnArticles":5462,"formTitle":"[20]有效的括号","frequency":92.03578936193077,"frontendQuestionId":"20","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号","titleSlug":"valid-parentheses"},{"acceptance":0.6672365898322264,"acs":0,"articleLive":2,"columnArticles":3393,"formTitle":"[21]合并两个有序链表","frequency":85.4676880512184,"frontendQuestionId":"21","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序链表","titleSlug":"merge-two-sorted-lists"},{"acceptance":0.7725456941963984,"acs":0,"articleLive":2,"columnArticles":2582,"formTitle":"[22]括号生成","frequency":89.91113577281531,"frontendQuestionId":"22","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号生成","titleSlug":"generate-parentheses"},{"acceptance":0.5591037072208371,"acs":0,"articleLive":2,"columnArticles":2061,"formTitle":"[23]合并K个升序链表","frequency":82.3707018030458,"frontendQuestionId":"23","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"合并K个升序链表","titleSlug":"merge-k-sorted-lists"},{"acceptance":0.7031707670962067,"acs":0,"articleLive":2,"columnArticles":2465,"formTitle":"[24]两两交换链表中的节点","frequency":58.527268521626674,"frontendQuestionId":"24","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两两交换链表中的节点","titleSlug":"swap-nodes-in-pairs"},{"acceptance":0.6569220832736656,"acs":0,"articleLive":2,"columnArticles":2137,"formTitle":"[25]K 个一组翻转链表","frequency":89.52044632045913,"frontendQuestionId":"25","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"K 个一组翻转链表","titleSlug":"reverse-nodes-in-k-group"},{"acceptance":0.5399530490342116,"acs":0,"articleLive":2,"columnArticles":4447,"formTitle":"[26]删除有序数组中的重复项","frequency":81.04854781043646,"frontendQuestionId":"26","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项","titleSlug":"remove-duplicates-from-sorted-array"},{"acceptance":0.5980405355632381,"acs":0,"articleLive":2,"columnArticles":4003,"formTitle":"[27]移除元素","frequency":76.85323725538193,"frontendQuestionId":"27","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除元素","titleSlug":"remove-element"},{"acceptance":0.40672456082200864,"acs":0,"articleLive":2,"columnArticles":3176,"formTitle":"[28]实现 strStr()","frequency":74.45756581567734,"frontendQuestionId":"28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"实现 strStr()","titleSlug":"implement-strstr"},{"acceptance":0.2075914317578741,"acs":0,"articleLive":2,"columnArticles":876,"formTitle":"[29]两数相除","frequency":66.55403632532273,"frontendQuestionId":"29","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两数相除","titleSlug":"divide-two-integers"},{"acceptance":0.35697220255361917,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[30]串联所有单词的子串","frequency":53.45158846723426,"frontendQuestionId":"30","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"串联所有单词的子串","titleSlug":"substring-with-concatenation-of-all-words"},{"acceptance":0.37322367486144664,"acs":0,"articleLive":2,"columnArticles":1706,"formTitle":"[31]下一个排列","frequency":80.38387057229744,"frontendQuestionId":"31","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个排列","titleSlug":"next-permutation"},{"acceptance":0.3565426628253504,"acs":0,"articleLive":2,"columnArticles":1273,"formTitle":"[32]最长有效括号","frequency":76.13862135741127,"frontendQuestionId":"32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长有效括号","titleSlug":"longest-valid-parentheses"},{"acceptance":0.4265588445929816,"acs":0,"articleLive":2,"columnArticles":2363,"formTitle":"[33]搜索旋转排序数组","frequency":71.41394144997845,"frontendQuestionId":"33","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组","titleSlug":"search-in-rotated-sorted-array"},{"acceptance":0.4240169490013015,"acs":0,"articleLive":2,"columnArticles":3206,"formTitle":"[34]在排序数组中查找元素的第一个和最后一个位置","frequency":69.9020150649165,"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.4647343569872737,"acs":0,"articleLive":2,"columnArticles":3841,"formTitle":"[35]搜索插入位置","frequency":76.20720015775679,"frontendQuestionId":"35","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"搜索插入位置","titleSlug":"search-insert-position"},{"acceptance":0.6281253938815564,"acs":0,"articleLive":2,"columnArticles":1147,"formTitle":"[36]有效的数独","frequency":53.70187477192741,"frontendQuestionId":"36","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的数独","titleSlug":"valid-sudoku"},{"acceptance":0.6703333310671625,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[37]解数独","frequency":61.046141415081536,"frontendQuestionId":"37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解数独","titleSlug":"sudoku-solver"},{"acceptance":0.5800806438447851,"acs":0,"articleLive":2,"columnArticles":2245,"formTitle":"[38]外观数列","frequency":62.921195944288264,"frontendQuestionId":"38","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"外观数列","titleSlug":"count-and-say"},{"acceptance":0.7273072414344328,"acs":0,"articleLive":2,"columnArticles":1910,"formTitle":"[39]组合总和","frequency":74.03624888094107,"frontendQuestionId":"39","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和","titleSlug":"combination-sum"},{"acceptance":0.6258836445570687,"acs":0,"articleLive":2,"columnArticles":1361,"formTitle":"[40]组合总和 II","frequency":70.47662162523174,"frontendQuestionId":"40","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 II","titleSlug":"combination-sum-ii"},{"acceptance":0.41933786302563053,"acs":0,"articleLive":2,"columnArticles":1395,"formTitle":"[41]缺失的第一个正数","frequency":87.44523548234046,"frontendQuestionId":"41","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"缺失的第一个正数","titleSlug":"first-missing-positive"},{"acceptance":0.5779435850109613,"acs":0,"articleLive":2,"columnArticles":2381,"formTitle":"[42]接雨水","frequency":94.57066633716917,"frontendQuestionId":"42","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"接雨水","titleSlug":"trapping-rain-water"},{"acceptance":0.4490472689808381,"acs":0,"articleLive":2,"columnArticles":1122,"formTitle":"[43]字符串相乘","frequency":80.73099499120356,"frontendQuestionId":"43","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串相乘","titleSlug":"multiply-strings"},{"acceptance":0.32810564274948906,"acs":0,"articleLive":2,"columnArticles":542,"formTitle":"[44]通配符匹配","frequency":62.34000475388552,"frontendQuestionId":"44","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"通配符匹配","titleSlug":"wildcard-matching"},{"acceptance":0.4273475005578372,"acs":0,"articleLive":2,"columnArticles":1565,"formTitle":"[45]跳跃游戏 II","frequency":95.24172609634924,"frontendQuestionId":"45","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏 II","titleSlug":"jump-game-ii"},{"acceptance":0.7825653206650831,"acs":0,"articleLive":2,"columnArticles":2632,"formTitle":"[46]全排列","frequency":93.36503923087368,"frontendQuestionId":"46","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列","titleSlug":"permutations"},{"acceptance":0.6372505986238463,"acs":0,"articleLive":2,"columnArticles":1448,"formTitle":"[47]全排列 II","frequency":68.35292836524563,"frontendQuestionId":"47","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"全排列 II","titleSlug":"permutations-ii"},{"acceptance":0.7352149626476131,"acs":0,"articleLive":2,"columnArticles":1836,"formTitle":"[48]旋转图像","frequency":72.19716380520079,"frontendQuestionId":"48","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转图像","titleSlug":"rotate-image"},{"acceptance":0.6644000266777244,"acs":0,"articleLive":2,"columnArticles":1289,"formTitle":"[49]字母异位词分组","frequency":68.01900786610005,"frontendQuestionId":"49","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母异位词分组","titleSlug":"group-anagrams"},{"acceptance":0.3767958375397996,"acs":0,"articleLive":2,"columnArticles":1267,"formTitle":"[50]Pow(x, n)","frequency":69.9020150649165,"frontendQuestionId":"50","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"Pow(x, n)","titleSlug":"powx-n"},{"acceptance":0.7390775568251478,"acs":0,"articleLive":2,"columnArticles":1512,"formTitle":"[51]N 皇后","frequency":67.31868574246617,"frontendQuestionId":"51","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"N 皇后","titleSlug":"n-queens"},{"acceptance":0.8229621851111638,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[52]N皇后 II","frequency":32.143116957344105,"frontendQuestionId":"52","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N皇后 II","titleSlug":"n-queens-ii"},{"acceptance":0.5519651591469386,"acs":0,"articleLive":2,"columnArticles":3699,"formTitle":"[53]最大子序和","frequency":78.03155115838422,"frontendQuestionId":"53","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大子序和","titleSlug":"maximum-subarray"},{"acceptance":0.480280904101944,"acs":0,"articleLive":2,"columnArticles":1969,"formTitle":"[54]螺旋矩阵","frequency":81.09668597080059,"frontendQuestionId":"54","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵","titleSlug":"spiral-matrix"},{"acceptance":0.4324153924594712,"acs":0,"articleLive":2,"columnArticles":2433,"formTitle":"[55]跳跃游戏","frequency":71.33427277806591,"frontendQuestionId":"55","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"跳跃游戏","titleSlug":"jump-game"},{"acceptance":0.46782153832464163,"acs":0,"articleLive":2,"columnArticles":2265,"formTitle":"[56]合并区间","frequency":84.12494113929458,"frontendQuestionId":"56","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并区间","titleSlug":"merge-intervals"},{"acceptance":0.410930442202286,"acs":0,"articleLive":2,"columnArticles":918,"formTitle":"[57]插入区间","frequency":39.31196201051902,"frontendQuestionId":"57","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"插入区间","titleSlug":"insert-interval"},{"acceptance":0.35567461807095974,"acs":0,"articleLive":2,"columnArticles":2365,"formTitle":"[58]最后一个单词的长度","frequency":56.430333674698396,"frontendQuestionId":"58","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个单词的长度","titleSlug":"length-of-last-word"},{"acceptance":0.7921853609856578,"acs":0,"articleLive":2,"columnArticles":1535,"formTitle":"[59]螺旋矩阵 II","frequency":69.23339714813763,"frontendQuestionId":"59","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 II","titleSlug":"spiral-matrix-ii"},{"acceptance":0.5237425234305091,"acs":0,"articleLive":2,"columnArticles":937,"formTitle":"[60]排列序列","frequency":44.28753104797218,"frontendQuestionId":"60","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"排列序列","titleSlug":"permutation-sequence"},{"acceptance":0.4178409524487011,"acs":0,"articleLive":2,"columnArticles":1965,"formTitle":"[61]旋转链表","frequency":69.31091828002754,"frontendQuestionId":"61","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转链表","titleSlug":"rotate-list"},{"acceptance":0.6611678207940597,"acs":0,"articleLive":2,"columnArticles":2380,"formTitle":"[62]不同路径","frequency":66.28170078137578,"frontendQuestionId":"62","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同路径","titleSlug":"unique-paths"},{"acceptance":0.3906236617701638,"acs":0,"articleLive":2,"columnArticles":1679,"formTitle":"[63]不同路径 II","frequency":67.50136084399614,"frontendQuestionId":"63","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 II","titleSlug":"unique-paths-ii"},{"acceptance":0.6882365511813486,"acs":0,"articleLive":2,"columnArticles":2049,"formTitle":"[64]最小路径和","frequency":73.47812034206393,"frontendQuestionId":"64","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小路径和","titleSlug":"minimum-path-sum"},{"acceptance":0.26927691262078546,"acs":0,"articleLive":2,"columnArticles":629,"formTitle":"[65]有效数字","frequency":43.6757762426249,"frontendQuestionId":"65","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"有效数字","titleSlug":"valid-number"},{"acceptance":0.4582268099623061,"acs":0,"articleLive":2,"columnArticles":3121,"formTitle":"[66]加一","frequency":61.046141415081536,"frontendQuestionId":"66","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"加一","titleSlug":"plus-one"},{"acceptance":0.5436986153487764,"acs":0,"articleLive":2,"columnArticles":1750,"formTitle":"[67]二进制求和","frequency":56.39634586161644,"frontendQuestionId":"67","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制求和","titleSlug":"add-binary"},{"acceptance":0.5249117634551872,"acs":0,"articleLive":2,"columnArticles":564,"formTitle":"[68]文本左右对齐","frequency":43.74537694897073,"frontendQuestionId":"68","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"文本左右对齐","titleSlug":"text-justification"},{"acceptance":0.39267328210102215,"acs":0,"articleLive":2,"columnArticles":1896,"formTitle":"[69]x 的平方根","frequency":76.8364933159421,"frontendQuestionId":"69","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"x 的平方根","titleSlug":"sqrtx"},{"acceptance":0.5289289230647121,"acs":0,"articleLive":2,"columnArticles":3509,"formTitle":"[70]爬楼梯","frequency":91.05012231008595,"frontendQuestionId":"70","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"爬楼梯","titleSlug":"climbing-stairs"},{"acceptance":0.4214133171835655,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[71]简化路径","frequency":56.430333674698396,"frontendQuestionId":"71","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"简化路径","titleSlug":"simplify-path"},{"acceptance":0.6136319773550919,"acs":0,"articleLive":2,"columnArticles":1214,"formTitle":"[72]编辑距离","frequency":89.77153745799467,"frontendQuestionId":"72","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"编辑距离","titleSlug":"edit-distance"},{"acceptance":0.6029088339091175,"acs":0,"articleLive":2,"columnArticles":948,"formTitle":"[73]矩阵置零","frequency":54.603758450947815,"frontendQuestionId":"73","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵置零","titleSlug":"set-matrix-zeroes"},{"acceptance":0.4596725909993015,"acs":0,"articleLive":2,"columnArticles":1668,"formTitle":"[74]搜索二维矩阵","frequency":76.1983231830006,"frontendQuestionId":"74","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索二维矩阵","titleSlug":"search-a-2d-matrix"},{"acceptance":0.5949993771869232,"acs":0,"articleLive":2,"columnArticles":1819,"formTitle":"[75]颜色分类","frequency":55.27413911952256,"frontendQuestionId":"75","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色分类","titleSlug":"sort-colors"},{"acceptance":0.42541780520261596,"acs":0,"articleLive":2,"columnArticles":1233,"formTitle":"[76]最小覆盖子串","frequency":76.40592733347029,"frontendQuestionId":"76","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小覆盖子串","titleSlug":"minimum-window-substring"},{"acceptance":0.770057523463518,"acs":0,"articleLive":2,"columnArticles":1251,"formTitle":"[77]组合","frequency":74.0447602274714,"frontendQuestionId":"77","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合","titleSlug":"combinations"},{"acceptance":0.800907380710049,"acs":0,"articleLive":2,"columnArticles":2003,"formTitle":"[78]子集","frequency":71.30955084825612,"frontendQuestionId":"78","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集","titleSlug":"subsets"},{"acceptance":0.45794308225111857,"acs":0,"articleLive":2,"columnArticles":1370,"formTitle":"[79]单词搜索","frequency":73.62351222464605,"frontendQuestionId":"79","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词搜索","titleSlug":"word-search"},{"acceptance":0.6163962619658823,"acs":0,"articleLive":2,"columnArticles":1312,"formTitle":"[80]删除有序数组中的重复项 II","frequency":67.89540280596272,"frontendQuestionId":"80","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除有序数组中的重复项 II","titleSlug":"remove-duplicates-from-sorted-array-ii"},{"acceptance":0.4156063942582171,"acs":0,"articleLive":2,"columnArticles":984,"formTitle":"[81]搜索旋转排序数组 II","frequency":72.95377099144224,"frontendQuestionId":"81","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索旋转排序数组 II","titleSlug":"search-in-rotated-sorted-array-ii"},{"acceptance":0.5298137522481542,"acs":0,"articleLive":2,"columnArticles":1658,"formTitle":"[82]删除排序链表中的重复元素 II","frequency":79.80701099003632,"frontendQuestionId":"82","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素 II","titleSlug":"remove-duplicates-from-sorted-list-ii"},{"acceptance":0.5387793769990266,"acs":0,"articleLive":2,"columnArticles":1903,"formTitle":"[83]删除排序链表中的重复元素","frequency":69.9020150649165,"frontendQuestionId":"83","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除排序链表中的重复元素","titleSlug":"remove-duplicates-from-sorted-list"},{"acceptance":0.43315807245188365,"acs":0,"articleLive":2,"columnArticles":1138,"formTitle":"[84]柱状图中最大的矩形","frequency":77.24285184905393,"frontendQuestionId":"84","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"柱状图中最大的矩形","titleSlug":"largest-rectangle-in-histogram"},{"acceptance":0.5157575398981233,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[85]最大矩形","frequency":61.97658708663474,"frontendQuestionId":"85","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最大矩形","titleSlug":"maximal-rectangle"},{"acceptance":0.6322291872397063,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[86]分隔链表","frequency":56.91972069277927,"frontendQuestionId":"86","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"partition-list"},{"acceptance":0.48798429443209235,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[87]扰乱字符串","frequency":67.50136084399614,"frontendQuestionId":"87","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"扰乱字符串","titleSlug":"scramble-string"},{"acceptance":0.5161170956335828,"acs":0,"articleLive":2,"columnArticles":3169,"formTitle":"[88]合并两个有序数组","frequency":97.00640628265592,"frontendQuestionId":"88","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个有序数组","titleSlug":"merge-sorted-array"},{"acceptance":0.7096599510171933,"acs":0,"articleLive":2,"columnArticles":466,"formTitle":"[89]格雷编码","frequency":44.28753104797218,"frontendQuestionId":"89","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"格雷编码","titleSlug":"gray-code"},{"acceptance":0.633580226052345,"acs":0,"articleLive":2,"columnArticles":1181,"formTitle":"[90]子集 II","frequency":72.62702726520196,"frontendQuestionId":"90","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子集 II","titleSlug":"subsets-ii"},{"acceptance":0.3061388086404932,"acs":0,"articleLive":2,"columnArticles":1489,"formTitle":"[91]解码方法","frequency":72.11010404142881,"frontendQuestionId":"91","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码方法","titleSlug":"decode-ways"},{"acceptance":0.5478830605116036,"acs":0,"articleLive":2,"columnArticles":1992,"formTitle":"[92]反转链表 II","frequency":86.47600823354159,"frontendQuestionId":"92","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表 II","titleSlug":"reverse-linked-list-ii"},{"acceptance":0.5387945459845189,"acs":0,"articleLive":2,"columnArticles":1299,"formTitle":"[93]复原 IP 地址","frequency":81.85685745448498,"frontendQuestionId":"93","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复原 IP 地址","titleSlug":"restore-ip-addresses"},{"acceptance":0.7559142436394244,"acs":0,"articleLive":2,"columnArticles":2253,"formTitle":"[94]二叉树的中序遍历","frequency":63.49921706231076,"frontendQuestionId":"94","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的中序遍历","titleSlug":"binary-tree-inorder-traversal"},{"acceptance":0.7008636389505435,"acs":0,"articleLive":2,"columnArticles":608,"formTitle":"[95]不同的二叉搜索树 II","frequency":62.64233370534864,"frontendQuestionId":"95","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树 II","titleSlug":"unique-binary-search-trees-ii"},{"acceptance":0.6991248809061718,"acs":0,"articleLive":2,"columnArticles":1255,"formTitle":"[96]不同的二叉搜索树","frequency":66.45686284898538,"frontendQuestionId":"96","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的二叉搜索树","titleSlug":"unique-binary-search-trees"},{"acceptance":0.4570905763952425,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[97]交错字符串","frequency":45.57266560129181,"frontendQuestionId":"97","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交错字符串","titleSlug":"interleaving-string"},{"acceptance":0.34925634025839153,"acs":0,"articleLive":2,"columnArticles":1891,"formTitle":"[98]验证二叉搜索树","frequency":73.88882981254555,"frontendQuestionId":"98","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉搜索树","titleSlug":"validate-binary-search-tree"},{"acceptance":0.6127340823970038,"acs":0,"articleLive":2,"columnArticles":572,"formTitle":"[99]恢复二叉搜索树","frequency":57.05228846561886,"frontendQuestionId":"99","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复二叉搜索树","titleSlug":"recover-binary-search-tree"},{"acceptance":0.6034123447168588,"acs":0,"articleLive":2,"columnArticles":1852,"formTitle":"[100]相同的树","frequency":57.666009730734615,"frontendQuestionId":"100","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相同的树","titleSlug":"same-tree"},{"acceptance":0.5623600975959171,"acs":0,"articleLive":2,"columnArticles":2214,"formTitle":"[101]对称二叉树","frequency":74.1950296406728,"frontendQuestionId":"101","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"对称二叉树","titleSlug":"symmetric-tree"},{"acceptance":0.6419426589258644,"acs":0,"articleLive":2,"columnArticles":2453,"formTitle":"[102]二叉树的层序遍历","frequency":87.21932932937104,"frontendQuestionId":"102","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的层序遍历","titleSlug":"binary-tree-level-order-traversal"},{"acceptance":0.5715562278902117,"acs":0,"articleLive":2,"columnArticles":1553,"formTitle":"[103]二叉树的锯齿形层序遍历","frequency":80.18447007374404,"frontendQuestionId":"103","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的锯齿形层序遍历","titleSlug":"binary-tree-zigzag-level-order-traversal"},{"acceptance":0.7662333319145572,"acs":0,"articleLive":2,"columnArticles":2501,"formTitle":"[104]二叉树的最大深度","frequency":76.20720015775679,"frontendQuestionId":"104","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最大深度","titleSlug":"maximum-depth-of-binary-tree"},{"acceptance":0.7040874521962927,"acs":0,"articleLive":2,"columnArticles":1400,"formTitle":"[105]从前序与中序遍历序列构造二叉树","frequency":82.34329074658945,"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.7212982372690114,"acs":0,"articleLive":2,"columnArticles":861,"formTitle":"[106]从中序与后序遍历序列构造二叉树","frequency":72.70196299047356,"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.6960438970772785,"acs":0,"articleLive":2,"columnArticles":1291,"formTitle":"[107]二叉树的层序遍历 II","frequency":63.587376021812744,"frontendQuestionId":"107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层序遍历 II","titleSlug":"binary-tree-level-order-traversal-ii"},{"acceptance":0.7602256927603712,"acs":0,"articleLive":2,"columnArticles":1167,"formTitle":"[108]将有序数组转换为二叉搜索树","frequency":50.543846838358796,"frontendQuestionId":"108","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将有序数组转换为二叉搜索树","titleSlug":"convert-sorted-array-to-binary-search-tree"},{"acceptance":0.7633890246318431,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[109]有序链表转换二叉搜索树","frequency":57.13142152277937,"frontendQuestionId":"109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序链表转换二叉搜索树","titleSlug":"convert-sorted-list-to-binary-search-tree"},{"acceptance":0.56305329295344,"acs":0,"articleLive":2,"columnArticles":1433,"formTitle":"[110]平衡二叉树","frequency":59.20609674020748,"frontendQuestionId":"110","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"平衡二叉树","titleSlug":"balanced-binary-tree"},{"acceptance":0.4850364970175365,"acs":0,"articleLive":2,"columnArticles":1752,"formTitle":"[111]二叉树的最小深度","frequency":46.19596003806959,"frontendQuestionId":"111","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最小深度","titleSlug":"minimum-depth-of-binary-tree"},{"acceptance":0.5257666282824994,"acs":0,"articleLive":2,"columnArticles":1640,"formTitle":"[112]路径总和","frequency":61.40285417522915,"frontendQuestionId":"112","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和","titleSlug":"path-sum"},{"acceptance":0.6267713987849157,"acs":0,"articleLive":2,"columnArticles":1225,"formTitle":"[113]路径总和 II","frequency":63.88593837917702,"frontendQuestionId":"113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 II","titleSlug":"path-sum-ii"},{"acceptance":0.725490031971343,"acs":0,"articleLive":2,"columnArticles":1292,"formTitle":"[114]二叉树展开为链表","frequency":46.07755140293963,"frontendQuestionId":"114","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树展开为链表","titleSlug":"flatten-binary-tree-to-linked-list"},{"acceptance":0.5229336214558319,"acs":0,"articleLive":2,"columnArticles":668,"formTitle":"[115]不同的子序列","frequency":63.641639249835166,"frontendQuestionId":"115","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同的子序列","titleSlug":"distinct-subsequences"},{"acceptance":0.7030137816144177,"acs":0,"articleLive":2,"columnArticles":1156,"formTitle":"[116]填充每个节点的下一个右侧节点指针","frequency":46.595970850135885,"frontendQuestionId":"116","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"填充每个节点的下一个右侧节点指针","titleSlug":"populating-next-right-pointers-in-each-node"},{"acceptance":0.611814818182454,"acs":0,"articleLive":2,"columnArticles":738,"formTitle":"[117]填充每个节点的下一个右侧节点指针 II","frequency":27.978825729722352,"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.7279780858489647,"acs":0,"articleLive":2,"columnArticles":1697,"formTitle":"[118]杨辉三角","frequency":73.3529526064977,"frontendQuestionId":"118","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角","titleSlug":"pascals-triangle"},{"acceptance":0.6647743440896933,"acs":0,"articleLive":2,"columnArticles":1185,"formTitle":"[119]杨辉三角 II","frequency":56.39634586161644,"frontendQuestionId":"119","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"杨辉三角 II","titleSlug":"pascals-triangle-ii"},{"acceptance":0.6798268809009037,"acs":0,"articleLive":2,"columnArticles":1545,"formTitle":"[120]三角形最小路径和","frequency":53.45158846723426,"frontendQuestionId":"120","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"三角形最小路径和","titleSlug":"triangle"},{"acceptance":0.5734551346752196,"acs":0,"articleLive":2,"columnArticles":3319,"formTitle":"[121]买卖股票的最佳时机","frequency":87.31331703325328,"frontendQuestionId":"121","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机","titleSlug":"best-time-to-buy-and-sell-stock"},{"acceptance":0.6884442816591887,"acs":0,"articleLive":2,"columnArticles":2596,"formTitle":"[122]买卖股票的最佳时机 II","frequency":66.68991554696952,"frontendQuestionId":"122","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"买卖股票的最佳时机 II","titleSlug":"best-time-to-buy-and-sell-stock-ii"},{"acceptance":0.5350389275329858,"acs":0,"articleLive":2,"columnArticles":808,"formTitle":"[123]买卖股票的最佳时机 III","frequency":65.35655806132922,"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.4438011977893112,"acs":0,"articleLive":2,"columnArticles":1077,"formTitle":"[124]二叉树中的最大路径和","frequency":84.4956162026388,"frontendQuestionId":"124","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的最大路径和","titleSlug":"binary-tree-maximum-path-sum"},{"acceptance":0.47370269344640487,"acs":0,"articleLive":2,"columnArticles":1808,"formTitle":"[125]验证回文串","frequency":69.32756876144903,"frontendQuestionId":"125","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文串","titleSlug":"valid-palindrome"},{"acceptance":0.39411974379192277,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[126]单词接龙 II","frequency":35.33334009083937,"frontendQuestionId":"126","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙 II","titleSlug":"word-ladder-ii"},{"acceptance":0.46751856328786046,"acs":0,"articleLive":2,"columnArticles":642,"formTitle":"[127]单词接龙","frequency":51.64327049407609,"frontendQuestionId":"127","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词接龙","titleSlug":"word-ladder"},{"acceptance":0.5434154658273086,"acs":0,"articleLive":2,"columnArticles":1076,"formTitle":"[128]最长连续序列","frequency":80.3389117857985,"frontendQuestionId":"128","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"longest-consecutive-sequence"},{"acceptance":0.6811362098970288,"acs":0,"articleLive":2,"columnArticles":1096,"formTitle":"[129]求根节点到叶节点数字之和","frequency":62.72059485361492,"frontendQuestionId":"129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求根节点到叶节点数字之和","titleSlug":"sum-root-to-leaf-numbers"},{"acceptance":0.44388949201291467,"acs":0,"articleLive":2,"columnArticles":1150,"formTitle":"[130]被围绕的区域","frequency":54.73602827837082,"frontendQuestionId":"130","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"被围绕的区域","titleSlug":"surrounded-regions"},{"acceptance":0.7230457290291213,"acs":0,"articleLive":2,"columnArticles":842,"formTitle":"[131]分割回文串","frequency":72.86494062208345,"frontendQuestionId":"131","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串","titleSlug":"palindrome-partitioning"},{"acceptance":0.49203664552501764,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[132]分割回文串 II","frequency":45.57266560129181,"frontendQuestionId":"132","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 II","titleSlug":"palindrome-partitioning-ii"},{"acceptance":0.6754852420306966,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[133]克隆图","frequency":17.40322030163009,"frontendQuestionId":"133","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"克隆图","titleSlug":"clone-graph"},{"acceptance":0.5766382569087366,"acs":0,"articleLive":2,"columnArticles":957,"formTitle":"[134]加油站","frequency":74.18328334162904,"frontendQuestionId":"134","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"加油站","titleSlug":"gas-station"},{"acceptance":0.4864868938697376,"acs":0,"articleLive":2,"columnArticles":769,"formTitle":"[135]分发糖果","frequency":85.22791494228542,"frontendQuestionId":"135","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"分发糖果","titleSlug":"candy"},{"acceptance":0.719525789613377,"acs":0,"articleLive":2,"columnArticles":2219,"formTitle":"[136]只出现一次的数字","frequency":76.21270808060949,"frontendQuestionId":"136","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字","titleSlug":"single-number"},{"acceptance":0.719718729775522,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[137]只出现一次的数字 II","frequency":72.4561568581999,"frontendQuestionId":"137","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 II","titleSlug":"single-number-ii"},{"acceptance":0.6599867357364355,"acs":0,"articleLive":2,"columnArticles":848,"formTitle":"[138]复制带随机指针的链表","frequency":66.94335267326119,"frontendQuestionId":"138","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"复制带随机指针的链表","titleSlug":"copy-list-with-random-pointer"},{"acceptance":0.5136451069968743,"acs":0,"articleLive":2,"columnArticles":1174,"formTitle":"[139]单词拆分","frequency":74.8257970993307,"frontendQuestionId":"139","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词拆分","titleSlug":"word-break"},{"acceptance":0.4857982733519413,"acs":0,"articleLive":2,"columnArticles":530,"formTitle":"[140]单词拆分 II","frequency":36.90760470819734,"frontendQuestionId":"140","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词拆分 II","titleSlug":"word-break-ii"},{"acceptance":0.5123193088737878,"acs":0,"articleLive":2,"columnArticles":2672,"formTitle":"[141]环形链表","frequency":75.69671189944867,"frontendQuestionId":"141","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表","titleSlug":"linked-list-cycle"},{"acceptance":0.5519273286368588,"acs":0,"articleLive":2,"columnArticles":1682,"formTitle":"[142]环形链表 II","frequency":70.36038532393052,"frontendQuestionId":"142","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形链表 II","titleSlug":"linked-list-cycle-ii"},{"acceptance":0.6185835705388275,"acs":0,"articleLive":2,"columnArticles":1061,"formTitle":"[143]重排链表","frequency":89.99866418797684,"frontendQuestionId":"143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"重排链表","titleSlug":"reorder-list"},{"acceptance":0.7028809071346729,"acs":0,"articleLive":2,"columnArticles":1798,"formTitle":"[144]二叉树的前序遍历","frequency":50.45823801455727,"frontendQuestionId":"144","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的前序遍历","titleSlug":"binary-tree-preorder-traversal"},{"acceptance":0.7496903438462877,"acs":0,"articleLive":2,"columnArticles":1517,"formTitle":"[145]二叉树的后序遍历","frequency":69.43321218434573,"frontendQuestionId":"145","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的后序遍历","titleSlug":"binary-tree-postorder-traversal"},{"acceptance":0.5266176497806734,"acs":0,"articleLive":2,"columnArticles":1358,"formTitle":"[146]LRU 缓存机制","frequency":91.1355679469149,"frontendQuestionId":"146","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存机制","titleSlug":"lru-cache"},{"acceptance":0.6807744663796738,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[147]对链表进行插入排序","frequency":46.50067431446574,"frontendQuestionId":"147","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"对链表进行插入排序","titleSlug":"insertion-sort-list"},{"acceptance":0.6671226984142385,"acs":0,"articleLive":2,"columnArticles":1225,"formTitle":"[148]排序链表","frequency":76.36264810284715,"frontendQuestionId":"148","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序链表","titleSlug":"sort-list"},{"acceptance":0.33840298573514876,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[149]直线上最多的点数","frequency":66.18724761951918,"frontendQuestionId":"149","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"直线上最多的点数","titleSlug":"max-points-on-a-line"},{"acceptance":0.5362048031609491,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[150]逆波兰表达式求值","frequency":69.27454317111771,"frontendQuestionId":"150","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逆波兰表达式求值","titleSlug":"evaluate-reverse-polish-notation"},{"acceptance":0.4815773083661721,"acs":0,"articleLive":2,"columnArticles":1402,"formTitle":"[151]翻转字符串里的单词","frequency":54.79198677365268,"frontendQuestionId":"151","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词","titleSlug":"reverse-words-in-a-string"},{"acceptance":0.4208612548155008,"acs":0,"articleLive":2,"columnArticles":1208,"formTitle":"[152]乘积最大子数组","frequency":76.23622535658613,"frontendQuestionId":"152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积最大子数组","titleSlug":"maximum-product-subarray"},{"acceptance":0.5662151839470377,"acs":0,"articleLive":2,"columnArticles":1456,"formTitle":"[153]寻找旋转排序数组中的最小值","frequency":54.73602827837082,"frontendQuestionId":"153","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值","titleSlug":"find-minimum-in-rotated-sorted-array"},{"acceptance":0.5319443317954762,"acs":0,"articleLive":2,"columnArticles":886,"formTitle":"[154]寻找旋转排序数组中的最小值 II","frequency":64.49095551414584,"frontendQuestionId":"154","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"寻找旋转排序数组中的最小值 II","titleSlug":"find-minimum-in-rotated-sorted-array-ii"},{"acceptance":0.5731599022163879,"acs":0,"articleLive":2,"columnArticles":1569,"formTitle":"[155]最小栈","frequency":68.42762179646343,"frontendQuestionId":"155","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最小栈","titleSlug":"min-stack"},{"acceptance":0.724197247706422,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[156]上下翻转二叉树","frequency":26.213058161373958,"frontendQuestionId":"156","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"上下翻转二叉树","titleSlug":"binary-tree-upside-down"},{"acceptance":0.5318168153121555,"acs":0,"articleLive":2,"columnArticles":81,"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.5920387068396745,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[158]用 Read4 读取 N 个字符 II","frequency":6.62395241264668,"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.5442530176582255,"acs":0,"articleLive":2,"columnArticles":187,"formTitle":"[159]至多包含两个不同字符的最长子串","frequency":39.622276849619915,"frontendQuestionId":"159","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"至多包含两个不同字符的最长子串","titleSlug":"longest-substring-with-at-most-two-distinct-characters"},{"acceptance":0.6129353810706485,"acs":0,"articleLive":2,"columnArticles":1929,"formTitle":"[160]相交链表","frequency":68.66599288116674,"frontendQuestionId":"160","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"相交链表","titleSlug":"intersection-of-two-linked-lists"},{"acceptance":0.33647540983606555,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[161]相隔为 1 的编辑距离","frequency":6.62395241264668,"frontendQuestionId":"161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"相隔为 1 的编辑距离","titleSlug":"one-edit-distance"},{"acceptance":0.4948978984814655,"acs":0,"articleLive":2,"columnArticles":726,"formTitle":"[162]寻找峰值","frequency":59.33204472826661,"frontendQuestionId":"162","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找峰值","titleSlug":"find-peak-element"},{"acceptance":0.32441129150212084,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[163]缺失的区间","frequency":18.694466070773423,"frontendQuestionId":"163","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缺失的区间","titleSlug":"missing-ranges"},{"acceptance":0.6106612261979494,"acs":0,"articleLive":2,"columnArticles":488,"formTitle":"[164]最大间距","frequency":58.527268521626674,"frontendQuestionId":"164","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大间距","titleSlug":"maximum-gap"},{"acceptance":0.5187266499654994,"acs":0,"articleLive":2,"columnArticles":899,"formTitle":"[165]比较版本号","frequency":55.82729559973928,"frontendQuestionId":"165","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"比较版本号","titleSlug":"compare-version-numbers"},{"acceptance":0.2984831946149998,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[166]分数到小数","frequency":52.28177000236804,"frontendQuestionId":"166","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数到小数","titleSlug":"fraction-to-recurring-decimal"},{"acceptance":0.5864948289050629,"acs":0,"articleLive":2,"columnArticles":1856,"formTitle":"[167]两数之和 II - 输入有序数组","frequency":66.07060908903227,"frontendQuestionId":"167","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 II - 输入有序数组","titleSlug":"two-sum-ii-input-array-is-sorted"},{"acceptance":0.43267441617361124,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[168]Excel表列名称","frequency":58.35787357480926,"frontendQuestionId":"168","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel表列名称","titleSlug":"excel-sheet-column-title"},{"acceptance":0.6647873264041448,"acs":0,"articleLive":2,"columnArticles":2145,"formTitle":"[169]多数元素","frequency":67.70816772608185,"frontendQuestionId":"169","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"多数元素","titleSlug":"majority-element"},{"acceptance":0.41721688675470187,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[170]两数之和 III - 数据结构设计","frequency":5.522175928223974,"frontendQuestionId":"170","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两数之和 III - 数据结构设计","titleSlug":"two-sum-iii-data-structure-design"},{"acceptance":0.717566429386513,"acs":0,"articleLive":2,"columnArticles":904,"formTitle":"[171]Excel 表列序号","frequency":47.67636054432939,"frontendQuestionId":"171","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Excel 表列序号","titleSlug":"excel-sheet-column-number"},{"acceptance":0.4385002578142264,"acs":0,"articleLive":2,"columnArticles":588,"formTitle":"[172]阶乘后的零","frequency":45.77303984133493,"frontendQuestionId":"172","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘后的零","titleSlug":"factorial-trailing-zeroes"},{"acceptance":0.8036767181001814,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[173]二叉搜索树迭代器","frequency":48.23996094125651,"frontendQuestionId":"173","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树迭代器","titleSlug":"binary-search-tree-iterator"},{"acceptance":0.4798738685833195,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[174]地下城游戏","frequency":62.64233370534864,"frontendQuestionId":"174","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"地下城游戏","titleSlug":"dungeon-game"},{"acceptance":0.7398695987520367,"acs":0,"articleLive":2,"columnArticles":1443,"formTitle":"[175]组合两个表","frequency":90.31892187742862,"frontendQuestionId":"175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"组合两个表","titleSlug":"combine-two-tables"},{"acceptance":0.35612304053927696,"acs":0,"articleLive":2,"columnArticles":996,"formTitle":"[176]第二高的薪水","frequency":89.32718757845038,"frontendQuestionId":"176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第二高的薪水","titleSlug":"second-highest-salary"},{"acceptance":0.4625940681717574,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[177]第N高的薪水","frequency":75.93584053636772,"frontendQuestionId":"177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第N高的薪水","titleSlug":"nth-highest-salary"},{"acceptance":0.6029044912999824,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[178]分数排名","frequency":67.95917076428083,"frontendQuestionId":"178","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分数排名","titleSlug":"rank-scores"},{"acceptance":0.4097374840002898,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[179]最大数","frequency":81.12871569183208,"frontendQuestionId":"179","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大数","titleSlug":"largest-number"},{"acceptance":0.48710009140767824,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[180]连续出现的数字","frequency":67.08654338079432,"frontendQuestionId":"180","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连续出现的数字","titleSlug":"consecutive-numbers"},{"acceptance":0.7026536988953923,"acs":0,"articleLive":2,"columnArticles":657,"formTitle":"[181]超过经理收入的员工","frequency":68.76902070284578,"frontendQuestionId":"181","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过经理收入的员工","titleSlug":"employees-earning-more-than-their-managers"},{"acceptance":0.7975420643599332,"acs":0,"articleLive":2,"columnArticles":565,"formTitle":"[182]查找重复的电子邮箱","frequency":60.78841434725818,"frontendQuestionId":"182","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找重复的电子邮箱","titleSlug":"duplicate-emails"},{"acceptance":0.6774568178885468,"acs":0,"articleLive":2,"columnArticles":531,"formTitle":"[183]从不订购的客户","frequency":44.600867017579276,"frontendQuestionId":"183","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从不订购的客户","titleSlug":"customers-who-never-order"},{"acceptance":0.47500249097318764,"acs":0,"articleLive":2,"columnArticles":656,"formTitle":"[184]部门工资最高的员工","frequency":73.40961300819505,"frontendQuestionId":"184","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资最高的员工","titleSlug":"department-highest-salary"},{"acceptance":0.49465422541767223,"acs":0,"articleLive":2,"columnArticles":615,"formTitle":"[185]部门工资前三高的所有员工","frequency":73.14846529666434,"frontendQuestionId":"185","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"部门工资前三高的所有员工","titleSlug":"department-top-three-salaries"},{"acceptance":0.7545491719484768,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[186]翻转字符串里的单词 II","frequency":6.061429485312524,"frontendQuestionId":"186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转字符串里的单词 II","titleSlug":"reverse-words-in-a-string-ii"},{"acceptance":0.4836447791095299,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[187]重复的DNA序列","frequency":31.566806160501105,"frontendQuestionId":"187","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的DNA序列","titleSlug":"repeated-dna-sequences"},{"acceptance":0.39043062200956935,"acs":0,"articleLive":2,"columnArticles":679,"formTitle":"[188]买卖股票的最佳时机 IV","frequency":52.71925717990641,"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.45200328713805027,"acs":0,"articleLive":2,"columnArticles":1649,"formTitle":"[189]旋转数组","frequency":65.24064155145477,"frontendQuestionId":"189","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"旋转数组","titleSlug":"rotate-array"},{"acceptance":0.6966659661261727,"acs":0,"articleLive":2,"columnArticles":813,"formTitle":"[190]颠倒二进制位","frequency":50.21568457740775,"frontendQuestionId":"190","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"颠倒二进制位","titleSlug":"reverse-bits"},{"acceptance":0.7479574885415208,"acs":0,"articleLive":2,"columnArticles":1180,"formTitle":"[191]位1的个数","frequency":61.046141415081536,"frontendQuestionId":"191","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"位1的个数","titleSlug":"number-of-1-bits"},{"acceptance":0.35591075591075594,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[192]统计词频","frequency":57.8170952972324,"frontendQuestionId":"192","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计词频","titleSlug":"word-frequency"},{"acceptance":0.3243359202473342,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[193]有效电话号码","frequency":33.35349327229824,"frontendQuestionId":"193","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效电话号码","titleSlug":"valid-phone-numbers"},{"acceptance":0.34496822213914285,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[194]转置文件","frequency":24.230923379013827,"frontendQuestionId":"194","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转置文件","titleSlug":"transpose-file"},{"acceptance":0.4361298193633523,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[195]第十行","frequency":52.94170328824299,"frontendQuestionId":"195","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第十行","titleSlug":"tenth-line"},{"acceptance":0.6652327495082757,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[196]删除重复的电子邮箱","frequency":56.98221181966393,"frontendQuestionId":"196","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除重复的电子邮箱","titleSlug":"delete-duplicate-emails"},{"acceptance":0.5338147326728087,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[197]上升的温度","frequency":55.206069100221775,"frontendQuestionId":"197","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升的温度","titleSlug":"rising-temperature"},{"acceptance":0.5135169698478584,"acs":0,"articleLive":2,"columnArticles":2602,"formTitle":"[198]打家劫舍","frequency":79.05498971489831,"frontendQuestionId":"198","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍","titleSlug":"house-robber"},{"acceptance":0.6522346567148628,"acs":0,"articleLive":2,"columnArticles":1557,"formTitle":"[199]二叉树的右视图","frequency":82.14747047821575,"frontendQuestionId":"199","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的右视图","titleSlug":"binary-tree-right-side-view"},{"acceptance":0.5539783042454379,"acs":0,"articleLive":2,"columnArticles":2074,"formTitle":"[200]岛屿数量","frequency":87.78701142837133,"frontendQuestionId":"200","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿数量","titleSlug":"number-of-islands"},{"acceptance":0.5230308687675025,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[201]数字范围按位与","frequency":37.550349817636906,"frontendQuestionId":"201","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数字范围按位与","titleSlug":"bitwise-and-of-numbers-range"},{"acceptance":0.6185170669801989,"acs":0,"articleLive":2,"columnArticles":1353,"formTitle":"[202]快乐数","frequency":62.55423130651502,"frontendQuestionId":"202","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"快乐数","titleSlug":"happy-number"},{"acceptance":0.5144811453848744,"acs":0,"articleLive":2,"columnArticles":1616,"formTitle":"[203]移除链表元素","frequency":53.70187477192741,"frontendQuestionId":"203","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除链表元素","titleSlug":"remove-linked-list-elements"},{"acceptance":0.3785329936154634,"acs":0,"articleLive":2,"columnArticles":723,"formTitle":"[204]计数质数","frequency":52.15239946376935,"frontendQuestionId":"204","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数质数","titleSlug":"count-primes"},{"acceptance":0.5008600686263092,"acs":0,"articleLive":2,"columnArticles":860,"formTitle":"[205]同构字符串","frequency":50.672965981421456,"frontendQuestionId":"205","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"同构字符串","titleSlug":"isomorphic-strings"},{"acceptance":0.722874227179623,"acs":0,"articleLive":2,"columnArticles":7281,"formTitle":"[206]反转链表","frequency":90.32600533252908,"frontendQuestionId":"206","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"reverse-linked-list"},{"acceptance":0.5443945695244603,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[207]课程表","frequency":72.17159616693857,"frontendQuestionId":"207","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表","titleSlug":"course-schedule"},{"acceptance":0.7164186733593338,"acs":0,"articleLive":2,"columnArticles":944,"formTitle":"[208]实现 Trie (前缀树)","frequency":68.58622239402918,"frontendQuestionId":"208","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"实现 Trie (前缀树)","titleSlug":"implement-trie-prefix-tree"},{"acceptance":0.4706659819041433,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[209]长度最小的子数组","frequency":54.212181038711336,"frontendQuestionId":"209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"长度最小的子数组","titleSlug":"minimum-size-subarray-sum"},{"acceptance":0.5416178121878742,"acs":0,"articleLive":2,"columnArticles":665,"formTitle":"[210]课程表 II","frequency":49.680693030977736,"frontendQuestionId":"210","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 II","titleSlug":"course-schedule-ii"},{"acceptance":0.48172701290355313,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[211]添加与搜索单词 - 数据结构设计","frequency":31.008249446544394,"frontendQuestionId":"211","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"添加与搜索单词 - 数据结构设计","titleSlug":"design-add-and-search-words-data-structure"},{"acceptance":0.4496268860554809,"acs":0,"articleLive":2,"columnArticles":399,"formTitle":"[212]单词搜索 II","frequency":40.58498988108451,"frontendQuestionId":"212","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词搜索 II","titleSlug":"word-search-ii"},{"acceptance":0.432904627592815,"acs":0,"articleLive":2,"columnArticles":1485,"formTitle":"[213]打家劫舍 II","frequency":73.55664539285355,"frontendQuestionId":"213","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打家劫舍 II","titleSlug":"house-robber-ii"},{"acceptance":0.37116867469879516,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[214]最短回文串","frequency":57.324925148220665,"frontendQuestionId":"214","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短回文串","titleSlug":"shortest-palindrome"},{"acceptance":0.6465292185208716,"acs":0,"articleLive":2,"columnArticles":2246,"formTitle":"[215]数组中的第K个最大元素","frequency":88.57571073770161,"frontendQuestionId":"215","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中的第K个最大元素","titleSlug":"kth-largest-element-in-an-array"},{"acceptance":0.7379553645583317,"acs":0,"articleLive":2,"columnArticles":997,"formTitle":"[216]组合总和 III","frequency":66.55403632532273,"frontendQuestionId":"216","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"组合总和 III","titleSlug":"combination-sum-iii"},{"acceptance":0.5603704823591197,"acs":0,"articleLive":2,"columnArticles":1635,"formTitle":"[217]存在重复元素","frequency":74.9422542827256,"frontendQuestionId":"217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素","titleSlug":"contains-duplicate"},{"acceptance":0.5422974488365573,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[218]天际线问题","frequency":64.04412000006855,"frontendQuestionId":"218","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"天际线问题","titleSlug":"the-skyline-problem"},{"acceptance":0.42504022518272605,"acs":0,"articleLive":2,"columnArticles":864,"formTitle":"[219]存在重复元素 II","frequency":48.35466712349478,"frontendQuestionId":"219","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 II","titleSlug":"contains-duplicate-ii"},{"acceptance":0.2866846662489802,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[220]存在重复元素 III","frequency":62.921195944288264,"frontendQuestionId":"220","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"存在重复元素 III","titleSlug":"contains-duplicate-iii"},{"acceptance":0.47469403454787046,"acs":0,"articleLive":2,"columnArticles":968,"formTitle":"[221]最大正方形","frequency":73.7234072286053,"frontendQuestionId":"221","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大正方形","titleSlug":"maximal-square"},{"acceptance":0.7805422100205902,"acs":0,"articleLive":2,"columnArticles":867,"formTitle":"[222]完全二叉树的节点个数","frequency":41.255068326624084,"frontendQuestionId":"222","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"完全二叉树的节点个数","titleSlug":"count-complete-tree-nodes"},{"acceptance":0.4622899570144588,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[223]矩形面积","frequency":43.90290732822527,"frontendQuestionId":"223","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangle-area"},{"acceptance":0.4181140841849324,"acs":0,"articleLive":2,"columnArticles":644,"formTitle":"[224]基本计算器","frequency":72.30547360068061,"frontendQuestionId":"224","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器","titleSlug":"basic-calculator"},{"acceptance":0.6753989531469424,"acs":0,"articleLive":2,"columnArticles":4740,"formTitle":"[225]用队列实现栈","frequency":47.170234112350414,"frontendQuestionId":"225","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用队列实现栈","titleSlug":"implement-stack-using-queues"},{"acceptance":0.7874648857794032,"acs":0,"articleLive":2,"columnArticles":1829,"formTitle":"[226]翻转二叉树","frequency":75.35520211574259,"frontendQuestionId":"226","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"翻转二叉树","titleSlug":"invert-binary-tree"},{"acceptance":0.43696760997333195,"acs":0,"articleLive":2,"columnArticles":693,"formTitle":"[227]基本计算器 II","frequency":71.17746479301475,"frontendQuestionId":"227","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基本计算器 II","titleSlug":"basic-calculator-ii"},{"acceptance":0.5816313836073732,"acs":0,"articleLive":2,"columnArticles":631,"formTitle":"[228]汇总区间","frequency":0.0,"frontendQuestionId":"228","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汇总区间","titleSlug":"summary-ranges"},{"acceptance":0.4635231890601819,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[229]求众数 II","frequency":39.93777251719928,"frontendQuestionId":"229","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求众数 II","titleSlug":"majority-element-ii"},{"acceptance":0.7406088796790264,"acs":0,"articleLive":2,"columnArticles":838,"formTitle":"[230]二叉搜索树中第K小的元素","frequency":39.93777251719928,"frontendQuestionId":"230","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树中第K小的元素","titleSlug":"kth-smallest-element-in-a-bst"},{"acceptance":0.5036745382622246,"acs":0,"articleLive":2,"columnArticles":1187,"formTitle":"[231]2 的幂","frequency":43.49598711618222,"frontendQuestionId":"231","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"2 的幂","titleSlug":"power-of-two"},{"acceptance":0.6913456060390257,"acs":0,"articleLive":2,"columnArticles":1246,"formTitle":"[232]用栈实现队列","frequency":56.338699956939195,"frontendQuestionId":"232","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈实现队列","titleSlug":"implement-queue-using-stacks"},{"acceptance":0.4764129700517901,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[233]数字 1 的个数","frequency":61.65183955234205,"frontendQuestionId":"233","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数字 1 的个数","titleSlug":"number-of-digit-one"},{"acceptance":0.49448325901045953,"acs":0,"articleLive":2,"columnArticles":1943,"formTitle":"[234]回文链表","frequency":78.18256583365843,"frontendQuestionId":"234","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list"},{"acceptance":0.6662104355876203,"acs":0,"articleLive":2,"columnArticles":956,"formTitle":"[235]二叉搜索树的最近公共祖先","frequency":56.98221181966393,"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.6801958012471383,"acs":0,"articleLive":2,"columnArticles":1350,"formTitle":"[236]二叉树的最近公共祖先","frequency":74.1950296406728,"frontendQuestionId":"236","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的最近公共祖先","titleSlug":"lowest-common-ancestor-of-a-binary-tree"},{"acceptance":0.848167884777193,"acs":0,"articleLive":2,"columnArticles":1006,"formTitle":"[237]删除链表中的节点","frequency":52.36306104060733,"frontendQuestionId":"237","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除链表中的节点","titleSlug":"delete-node-in-a-linked-list"},{"acceptance":0.7226368225362901,"acs":0,"articleLive":2,"columnArticles":850,"formTitle":"[238]除自身以外数组的乘积","frequency":55.24207699234726,"frontendQuestionId":"238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除自身以外数组的乘积","titleSlug":"product-of-array-except-self"},{"acceptance":0.49631245839628924,"acs":0,"articleLive":2,"columnArticles":1293,"formTitle":"[239]滑动窗口最大值","frequency":66.18724761951918,"frontendQuestionId":"239","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口最大值","titleSlug":"sliding-window-maximum"},{"acceptance":0.47578907119021135,"acs":0,"articleLive":2,"columnArticles":733,"formTitle":"[240]搜索二维矩阵 II","frequency":61.40285417522915,"frontendQuestionId":"240","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索二维矩阵 II","titleSlug":"search-a-2d-matrix-ii"},{"acceptance":0.7374383292618671,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[241]为运算表达式设计优先级","frequency":56.51214290289459,"frontendQuestionId":"241","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"为运算表达式设计优先级","titleSlug":"different-ways-to-add-parentheses"},{"acceptance":0.6445916164943769,"acs":0,"articleLive":2,"columnArticles":1635,"formTitle":"[242]有效的字母异位词","frequency":58.0757971442201,"frontendQuestionId":"242","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有效的字母异位词","titleSlug":"valid-anagram"},{"acceptance":0.6556564192539477,"acs":0,"articleLive":2,"columnArticles":103,"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.5480572597137015,"acs":0,"articleLive":2,"columnArticles":57,"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.6074481959136357,"acs":0,"articleLive":2,"columnArticles":58,"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.4740209879703097,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[246]中心对称数","frequency":0.0,"frontendQuestionId":"246","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"中心对称数","titleSlug":"strobogrammatic-number"},{"acceptance":0.5226020991374831,"acs":0,"articleLive":2,"columnArticles":91,"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.46332737030411447,"acs":0,"articleLive":2,"columnArticles":52,"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.6378874856486797,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[249]移位字符串分组","frequency":0.0,"frontendQuestionId":"249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移位字符串分组","titleSlug":"group-shifted-strings"},{"acceptance":0.6329740751529275,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[250]统计同值子树","frequency":6.061429485312524,"frontendQuestionId":"250","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同值子树","titleSlug":"count-univalue-subtrees"},{"acceptance":0.5433669511249031,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[251]展开二维向量","frequency":17.40322030163009,"frontendQuestionId":"251","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展开二维向量","titleSlug":"flatten-2d-vector"},{"acceptance":0.5618738808498281,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[252]会议室","frequency":6.62395241264668,"frontendQuestionId":"252","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室","titleSlug":"meeting-rooms"},{"acceptance":0.4991376392269379,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[253]会议室 II","frequency":55.82729559973928,"frontendQuestionId":"253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"会议室 II","titleSlug":"meeting-rooms-ii"},{"acceptance":0.568458129757982,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[254]因子的组合","frequency":18.035896247680004,"frontendQuestionId":"254","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"因子的组合","titleSlug":"factor-combinations"},{"acceptance":0.4724792075506962,"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.6357735508268895,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[256]粉刷房子","frequency":7.211508204687712,"frontendQuestionId":"256","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"paint-house"},{"acceptance":0.6812653139075957,"acs":0,"articleLive":2,"columnArticles":1030,"formTitle":"[257]二叉树的所有路径","frequency":62.22365446531786,"frontendQuestionId":"257","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的所有路径","titleSlug":"binary-tree-paths"},{"acceptance":0.6918159025787965,"acs":0,"articleLive":2,"columnArticles":637,"formTitle":"[258]各位相加","frequency":48.35466712349478,"frontendQuestionId":"258","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各位相加","titleSlug":"add-digits"},{"acceptance":0.5648201498065685,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[259]较小的三数之和","frequency":6.62395241264668,"frontendQuestionId":"259","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"较小的三数之和","titleSlug":"3sum-smaller"},{"acceptance":0.7250781916406028,"acs":0,"articleLive":2,"columnArticles":432,"formTitle":"[260]只出现一次的数字 III","frequency":50.672965981421456,"frontendQuestionId":"260","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"只出现一次的数字 III","titleSlug":"single-number-iii"},{"acceptance":0.49511888363179013,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[261]以图判树","frequency":24.230923379013827,"frontendQuestionId":"261","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"以图判树","titleSlug":"graph-valid-tree"},{"acceptance":0.43690914171284867,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[262]行程和用户","frequency":62.011079725802475,"frontendQuestionId":"262","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"行程和用户","titleSlug":"trips-and-users"},{"acceptance":0.515189285627001,"acs":0,"articleLive":2,"columnArticles":828,"formTitle":"[263]丑数","frequency":56.468639730490935,"frontendQuestionId":"263","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丑数","titleSlug":"ugly-number"},{"acceptance":0.5792822465717783,"acs":0,"articleLive":2,"columnArticles":599,"formTitle":"[264]丑数 II","frequency":64.39768703038774,"frontendQuestionId":"264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数 II","titleSlug":"ugly-number-ii"},{"acceptance":0.5830178474851271,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[265]粉刷房子 II","frequency":6.061429485312524,"frontendQuestionId":"265","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 II","titleSlug":"paint-house-ii"},{"acceptance":0.6712527154236061,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[266]回文排列","frequency":0.0,"frontendQuestionId":"266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation"},{"acceptance":0.4466630930045564,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[267]回文排列 II","frequency":7.211508204687712,"frontendQuestionId":"267","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列 II","titleSlug":"palindrome-permutation-ii"},{"acceptance":0.624012532075646,"acs":0,"articleLive":2,"columnArticles":1076,"formTitle":"[268]丢失的数字","frequency":31.008249446544394,"frontendQuestionId":"268","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"丢失的数字","titleSlug":"missing-number"},{"acceptance":0.338337625335598,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[269]火星词典","frequency":0.0,"frontendQuestionId":"269","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"火星词典","titleSlug":"alien-dictionary"},{"acceptance":0.5518402414954139,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[270]最接近的二叉搜索树值","frequency":16.794658773886972,"frontendQuestionId":"270","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值","titleSlug":"closest-binary-search-tree-value"},{"acceptance":0.5521393248763706,"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.6451861856067914,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[272]最接近的二叉搜索树值 II","frequency":7.826061825326265,"frontendQuestionId":"272","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近的二叉搜索树值 II","titleSlug":"closest-binary-search-tree-value-ii"},{"acceptance":0.30942291393789967,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[273]整数转换英文表示","frequency":30.333498337885196,"frontendQuestionId":"273","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换英文表示","titleSlug":"integer-to-english-words"},{"acceptance":0.4404477215358044,"acs":0,"articleLive":2,"columnArticles":560,"formTitle":"[274]H 指数","frequency":57.13142152277937,"frontendQuestionId":"274","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数","titleSlug":"h-index"},{"acceptance":0.46261446192562383,"acs":0,"articleLive":2,"columnArticles":414,"formTitle":"[275]H 指数 II","frequency":33.990080073438854,"frontendQuestionId":"275","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"H 指数 II","titleSlug":"h-index-ii"},{"acceptance":0.4875881523272214,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[276]栅栏涂色","frequency":24.866724145644405,"frontendQuestionId":"276","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栅栏涂色","titleSlug":"paint-fence"},{"acceptance":0.5702198323580578,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[277]搜寻名人","frequency":6.061429485312524,"frontendQuestionId":"277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜寻名人","titleSlug":"find-the-celebrity"},{"acceptance":0.45468125521976355,"acs":0,"articleLive":2,"columnArticles":993,"formTitle":"[278]第一个错误的版本","frequency":69.05230459489529,"frontendQuestionId":"278","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第一个错误的版本","titleSlug":"first-bad-version"},{"acceptance":0.6311791549188205,"acs":0,"articleLive":2,"columnArticles":1172,"formTitle":"[279]完全平方数","frequency":72.96909745735685,"frontendQuestionId":"279","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"完全平方数","titleSlug":"perfect-squares"},{"acceptance":0.686831845050937,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[280]摆动排序","frequency":17.40322030163009,"frontendQuestionId":"280","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序","titleSlug":"wiggle-sort"},{"acceptance":0.7580745341614907,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[281]锯齿迭代器","frequency":0.0,"frontendQuestionId":"281","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"锯齿迭代器","titleSlug":"zigzag-iterator"},{"acceptance":0.38803204534307045,"acs":0,"articleLive":2,"columnArticles":73,"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.6388451464929449,"acs":0,"articleLive":2,"columnArticles":3268,"formTitle":"[283]移动零","frequency":76.3249399308592,"frontendQuestionId":"283","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移动零","titleSlug":"move-zeroes"},{"acceptance":0.7336008755928494,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[284]顶端迭代器","frequency":17.40322030163009,"frontendQuestionId":"284","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顶端迭代器","titleSlug":"peeking-iterator"},{"acceptance":0.6350008147303242,"acs":0,"articleLive":2,"columnArticles":101,"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.5075644673260172,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[286]墙与门","frequency":6.62395241264668,"frontendQuestionId":"286","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"墙与门","titleSlug":"walls-and-gates"},{"acceptance":0.6612206014142951,"acs":0,"articleLive":2,"columnArticles":1201,"formTitle":"[287]寻找重复数","frequency":61.65183955234205,"frontendQuestionId":"287","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找重复数","titleSlug":"find-the-duplicate-number"},{"acceptance":0.42868020304568527,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[288]单词的唯一缩写","frequency":0.0,"frontendQuestionId":"288","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单词的唯一缩写","titleSlug":"unique-word-abbreviation"},{"acceptance":0.7533907690537489,"acs":0,"articleLive":2,"columnArticles":817,"formTitle":"[289]生命游戏","frequency":16.794658773886972,"frontendQuestionId":"289","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生命游戏","titleSlug":"game-of-life"},{"acceptance":0.4570509122580791,"acs":0,"articleLive":2,"columnArticles":1073,"formTitle":"[290]单词规律","frequency":29.055575031812968,"frontendQuestionId":"290","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单词规律","titleSlug":"word-pattern"},{"acceptance":0.5331312256388047,"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.6961986312477701,"acs":0,"articleLive":2,"columnArticles":563,"formTitle":"[292]Nim 游戏","frequency":39.93777251719928,"frontendQuestionId":"292","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"Nim 游戏","titleSlug":"nim-game"},{"acceptance":0.7115099377039454,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[293]翻转游戏","frequency":6.061429485312524,"frontendQuestionId":"293","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转游戏","titleSlug":"flip-game"},{"acceptance":0.5851703406813628,"acs":0,"articleLive":2,"columnArticles":53,"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.5231746771014396,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[295]数据流的中位数","frequency":38.90599085929966,"frontendQuestionId":"295","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"数据流的中位数","titleSlug":"find-median-from-data-stream"},{"acceptance":0.6200679383328979,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[296]最佳的碰头地点","frequency":18.694466070773423,"frontendQuestionId":"296","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳的碰头地点","titleSlug":"best-meeting-point"},{"acceptance":0.558918694387967,"acs":0,"articleLive":2,"columnArticles":739,"formTitle":"[297]二叉树的序列化与反序列化","frequency":58.20850156820199,"frontendQuestionId":"297","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的序列化与反序列化","titleSlug":"serialize-and-deserialize-binary-tree"},{"acceptance":0.5787031383563317,"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.5039652951941977,"acs":0,"articleLive":2,"columnArticles":353,"formTitle":"[299]猜数字游戏","frequency":23.617833197594297,"frontendQuestionId":"299","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字游戏","titleSlug":"bulls-and-cows"},{"acceptance":0.5132055990852599,"acs":0,"articleLive":2,"columnArticles":1945,"formTitle":"[300]最长递增子序列","frequency":78.03155115838422,"frontendQuestionId":"300","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列","titleSlug":"longest-increasing-subsequence"},{"acceptance":0.5229266380253851,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[301]删除无效的括号","frequency":50.26505379655652,"frontendQuestionId":"301","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除无效的括号","titleSlug":"remove-invalid-parentheses"},{"acceptance":0.6658694909463615,"acs":0,"articleLive":2,"columnArticles":37,"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.7250133164092161,"acs":0,"articleLive":2,"columnArticles":778,"formTitle":"[303]区域和检索 - 数组不可变","frequency":48.35466712349478,"frontendQuestionId":"303","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"区域和检索 - 数组不可变","titleSlug":"range-sum-query-immutable"},{"acceptance":0.543216702208883,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[304]二维区域和检索 - 矩阵不可变","frequency":39.31196201051902,"frontendQuestionId":"304","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维区域和检索 - 矩阵不可变","titleSlug":"range-sum-query-2d-immutable"},{"acceptance":0.37897534598112,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[305]岛屿数量 II","frequency":6.061429485312524,"frontendQuestionId":"305","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿数量 II","titleSlug":"number-of-islands-ii"},{"acceptance":0.3373538385927549,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[306]累加数","frequency":38.90599085929966,"frontendQuestionId":"306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"累加数","titleSlug":"additive-number"},{"acceptance":0.5425945645631742,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[307]区域和检索 - 数组可修改","frequency":20.097446297355418,"frontendQuestionId":"307","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区域和检索 - 数组可修改","titleSlug":"range-sum-query-mutable"},{"acceptance":0.6055944055944056,"acs":0,"articleLive":2,"columnArticles":42,"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.6060557684120903,"acs":0,"articleLive":2,"columnArticles":906,"formTitle":"[309]最佳买卖股票时机含冷冻期","frequency":68.90721482515674,"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.37955711824978244,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[310]最小高度树","frequency":45.325086786112806,"frontendQuestionId":"310","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-trees"},{"acceptance":0.7618625277161862,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[311]稀疏矩阵的乘法","frequency":17.40322030163009,"frontendQuestionId":"311","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"稀疏矩阵的乘法","titleSlug":"sparse-matrix-multiplication"},{"acceptance":0.6826749001810382,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[312]戳气球","frequency":51.64327049407609,"frontendQuestionId":"312","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"戳气球","titleSlug":"burst-balloons"},{"acceptance":0.6398209221553071,"acs":0,"articleLive":2,"columnArticles":349,"formTitle":"[313]超级丑数","frequency":57.13142152277937,"frontendQuestionId":"313","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"超级丑数","titleSlug":"super-ugly-number"},{"acceptance":0.5443101711983888,"acs":0,"articleLive":2,"columnArticles":86,"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.4185731360369005,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[315]计算右侧小于当前元素的个数","frequency":55.82729559973928,"frontendQuestionId":"315","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"计算右侧小于当前元素的个数","titleSlug":"count-of-smaller-numbers-after-self"},{"acceptance":0.47676072096263095,"acs":0,"articleLive":2,"columnArticles":518,"formTitle":"[316]去除重复字母","frequency":58.68006433719386,"frontendQuestionId":"316","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"去除重复字母","titleSlug":"remove-duplicate-letters"},{"acceptance":0.48365010034234446,"acs":0,"articleLive":2,"columnArticles":63,"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.683773267430855,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[318]最大单词长度乘积","frequency":6.061429485312524,"frontendQuestionId":"318","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大单词长度乘积","titleSlug":"maximum-product-of-word-lengths"},{"acceptance":0.5171868917031168,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[319]灯泡开关","frequency":17.40322030163009,"frontendQuestionId":"319","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"灯泡开关","titleSlug":"bulb-switcher"},{"acceptance":0.6745272005603549,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[320]列举单词的全部缩写","frequency":0.0,"frontendQuestionId":"320","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"列举单词的全部缩写","titleSlug":"generalized-abbreviation"},{"acceptance":0.42525781527818185,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[321]拼接最大数","frequency":31.008249446544394,"frontendQuestionId":"321","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"拼接最大数","titleSlug":"create-maximum-number"},{"acceptance":0.4438326766903997,"acs":0,"articleLive":2,"columnArticles":1789,"formTitle":"[322]零钱兑换","frequency":80.07822372244614,"frontendQuestionId":"322","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换","titleSlug":"coin-change"},{"acceptance":0.6310578744728962,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[323]无向图中连通分量的数目","frequency":34.64949327968721,"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.37824940157648385,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[324]摆动排序 II","frequency":39.622276849619915,"frontendQuestionId":"324","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动排序 II","titleSlug":"wiggle-sort-ii"},{"acceptance":0.5385158594715471,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[325]和等于 k 的最长子数组长度","frequency":30.333498337885196,"frontendQuestionId":"325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和等于 k 的最长子数组长度","titleSlug":"maximum-size-subarray-sum-equals-k"},{"acceptance":0.489766658303165,"acs":0,"articleLive":2,"columnArticles":375,"formTitle":"[326]3的幂","frequency":29.683142518751797,"frontendQuestionId":"326","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"3的幂","titleSlug":"power-of-three"},{"acceptance":0.4231110030057161,"acs":0,"articleLive":2,"columnArticles":203,"formTitle":"[327]区间和的个数","frequency":40.366785410000055,"frontendQuestionId":"327","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"区间和的个数","titleSlug":"count-of-range-sum"},{"acceptance":0.6563998859246585,"acs":0,"articleLive":2,"columnArticles":1046,"formTitle":"[328]奇偶链表","frequency":61.948137950234425,"frontendQuestionId":"328","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"奇偶链表","titleSlug":"odd-even-linked-list"},{"acceptance":0.4837691055759977,"acs":0,"articleLive":2,"columnArticles":482,"formTitle":"[329]矩阵中的最长递增路径","frequency":55.118893273612976,"frontendQuestionId":"329","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中的最长递增路径","titleSlug":"longest-increasing-path-in-a-matrix"},{"acceptance":0.5339406322719791,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[330]按要求补齐数组","frequency":33.35349327229824,"frontendQuestionId":"330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按要求补齐数组","titleSlug":"patching-array"},{"acceptance":0.4799896609658381,"acs":0,"articleLive":2,"columnArticles":501,"formTitle":"[331]验证二叉树的前序序列化","frequency":31.008249446544394,"frontendQuestionId":"331","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证二叉树的前序序列化","titleSlug":"verify-preorder-serialization-of-a-binary-tree"},{"acceptance":0.44905918815076207,"acs":0,"articleLive":2,"columnArticles":323,"formTitle":"[332]重新安排行程","frequency":48.35466712349478,"frontendQuestionId":"332","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新安排行程","titleSlug":"reconstruct-itinerary"},{"acceptance":0.46848416521471764,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[333]最大 BST 子树","frequency":18.694466070773423,"frontendQuestionId":"333","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大 BST 子树","titleSlug":"largest-bst-subtree"},{"acceptance":0.4124885419849449,"acs":0,"articleLive":2,"columnArticles":288,"formTitle":"[334]递增的三元子序列","frequency":24.866724145644405,"frontendQuestionId":"334","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递增的三元子序列","titleSlug":"increasing-triplet-subsequence"},{"acceptance":0.3673755252769642,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[335]路径交叉","frequency":0.0,"frontendQuestionId":"335","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"路径交叉","titleSlug":"self-crossing"},{"acceptance":0.40116204710310427,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[336]回文对","frequency":36.04340313970188,"frontendQuestionId":"336","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文对","titleSlug":"palindrome-pairs"},{"acceptance":0.6082161842318741,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[337]打家劫舍 III","frequency":70.59353047301722,"frontendQuestionId":"337","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打家劫舍 III","titleSlug":"house-robber-iii"},{"acceptance":0.7869880926585672,"acs":0,"articleLive":2,"columnArticles":1346,"formTitle":"[338]比特位计数","frequency":58.527268521626674,"frontendQuestionId":"338","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比特位计数","titleSlug":"counting-bits"},{"acceptance":0.8077945084145262,"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.4936155477643596,"acs":0,"articleLive":2,"columnArticles":173,"formTitle":"[340]至多包含 K 个不同字符的最长子串","frequency":24.866724145644405,"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.7271112779566554,"acs":0,"articleLive":2,"columnArticles":486,"formTitle":"[341]扁平化嵌套列表迭代器","frequency":69.9020150649165,"frontendQuestionId":"341","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化嵌套列表迭代器","titleSlug":"flatten-nested-list-iterator"},{"acceptance":0.5155176042574943,"acs":0,"articleLive":2,"columnArticles":759,"formTitle":"[342]4的幂","frequency":47.02093428419921,"frontendQuestionId":"342","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"4的幂","titleSlug":"power-of-four"},{"acceptance":0.6050585862248714,"acs":0,"articleLive":2,"columnArticles":1023,"formTitle":"[343]整数拆分","frequency":68.49544080396203,"frontendQuestionId":"343","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"整数拆分","titleSlug":"integer-break"},{"acceptance":0.7666171755643062,"acs":0,"articleLive":2,"columnArticles":1879,"formTitle":"[344]反转字符串","frequency":65.57185460661799,"frontendQuestionId":"344","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串","titleSlug":"reverse-string"},{"acceptance":0.5391195146184379,"acs":0,"articleLive":2,"columnArticles":1020,"formTitle":"[345]反转字符串中的元音字母","frequency":29.683142518751797,"frontendQuestionId":"345","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的元音字母","titleSlug":"reverse-vowels-of-a-string"},{"acceptance":0.7064350292501329,"acs":0,"articleLive":2,"columnArticles":133,"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.6219507190099604,"acs":0,"articleLive":2,"columnArticles":1451,"formTitle":"[347]前 K 个高频元素","frequency":75.4825687880217,"frontendQuestionId":"347","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前 K 个高频元素","titleSlug":"top-k-frequent-elements"},{"acceptance":0.5993895459748187,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[348]设计井字棋","frequency":5.522175928223974,"frontendQuestionId":"348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计井字棋","titleSlug":"design-tic-tac-toe"},{"acceptance":0.7384991054761796,"acs":0,"articleLive":2,"columnArticles":1469,"formTitle":"[349]两个数组的交集","frequency":65.2064239459168,"frontendQuestionId":"349","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集","titleSlug":"intersection-of-two-arrays"},{"acceptance":0.5496329105551615,"acs":0,"articleLive":2,"columnArticles":1340,"formTitle":"[350]两个数组的交集 II","frequency":63.35514910385178,"frontendQuestionId":"350","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数组的交集 II","titleSlug":"intersection-of-two-arrays-ii"},{"acceptance":0.5892341842397336,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[351]安卓系统手势解锁","frequency":12.179972950986874,"frontendQuestionId":"351","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安卓系统手势解锁","titleSlug":"android-unlock-patterns"},{"acceptance":0.5921034530196726,"acs":0,"articleLive":2,"columnArticles":81,"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.42303792334212126,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[353]贪吃蛇","frequency":7.826061825326265,"frontendQuestionId":"353","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"贪吃蛇","titleSlug":"design-snake-game"},{"acceptance":0.4519736711802415,"acs":0,"articleLive":2,"columnArticles":525,"formTitle":"[354]俄罗斯套娃信封问题","frequency":70.61780318851822,"frontendQuestionId":"354","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"俄罗斯套娃信封问题","titleSlug":"russian-doll-envelopes"},{"acceptance":0.40708117715526054,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[355]设计推特","frequency":35.33334009083937,"frontendQuestionId":"355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计推特","titleSlug":"design-twitter"},{"acceptance":0.3506167199634536,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[356]直线镜像","frequency":0.0,"frontendQuestionId":"356","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"直线镜像","titleSlug":"line-reflection"},{"acceptance":0.5198870926353605,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[357]计算各个位数不同的数字个数","frequency":42.578812263600504,"frontendQuestionId":"357","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算各个位数不同的数字个数","titleSlug":"count-numbers-with-unique-digits"},{"acceptance":0.351030303030303,"acs":0,"articleLive":2,"columnArticles":60,"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.7246489859594384,"acs":0,"articleLive":2,"columnArticles":55,"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.6079683028835571,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[360]有序转化数组","frequency":7.211508204687712,"frontendQuestionId":"360","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序转化数组","titleSlug":"sort-transformed-array"},{"acceptance":0.561179186645356,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[361]轰炸敌人","frequency":0.0,"frontendQuestionId":"361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"轰炸敌人","titleSlug":"bomb-enemy"},{"acceptance":0.6926946631671042,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[362]敲击计数器","frequency":6.62395241264668,"frontendQuestionId":"362","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"敲击计数器","titleSlug":"design-hit-counter"},{"acceptance":0.49049286777194906,"acs":0,"articleLive":2,"columnArticles":213,"formTitle":"[363]矩形区域不超过 K 的最大数值和","frequency":55.82729559973928,"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.7197891321978913,"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.36440557373819193,"acs":0,"articleLive":2,"columnArticles":478,"formTitle":"[365]水壶问题","frequency":48.927781421700644,"frontendQuestionId":"365","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水壶问题","titleSlug":"water-and-jug-problem"},{"acceptance":0.763235294117647,"acs":0,"articleLive":2,"columnArticles":119,"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.4393926100104702,"acs":0,"articleLive":2,"columnArticles":595,"formTitle":"[367]有效的完全平方数","frequency":16.794658773886972,"frontendQuestionId":"367","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的完全平方数","titleSlug":"valid-perfect-square"},{"acceptance":0.459202803133439,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[368]最大整除子集","frequency":68.44518261276097,"frontendQuestionId":"368","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大整除子集","titleSlug":"largest-divisible-subset"},{"acceptance":0.6161051307143856,"acs":0,"articleLive":2,"columnArticles":123,"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.7195353247984827,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[370]区间加法","frequency":17.40322030163009,"frontendQuestionId":"370","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间加法","titleSlug":"range-addition"},{"acceptance":0.5800826410893208,"acs":0,"articleLive":2,"columnArticles":310,"formTitle":"[371]两整数之和","frequency":47.02093428419921,"frontendQuestionId":"371","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两整数之和","titleSlug":"sum-of-two-integers"},{"acceptance":0.5093891486677058,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[372]超级次方","frequency":7.826061825326265,"frontendQuestionId":"372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"超级次方","titleSlug":"super-pow"},{"acceptance":0.4213065197350085,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[373]查找和最小的K对数字","frequency":42.67041338153945,"frontendQuestionId":"373","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找和最小的K对数字","titleSlug":"find-k-pairs-with-smallest-sums"},{"acceptance":0.5145967686013453,"acs":0,"articleLive":2,"columnArticles":552,"formTitle":"[374]猜数字大小","frequency":33.990080073438854,"frontendQuestionId":"374","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"猜数字大小","titleSlug":"guess-number-higher-or-lower"},{"acceptance":0.4693870862012455,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[375]猜数字大小 II","frequency":35.33334009083937,"frontendQuestionId":"375","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字大小 II","titleSlug":"guess-number-higher-or-lower-ii"},{"acceptance":0.46291539065070486,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[376]摆动序列","frequency":32.143116957344105,"frontendQuestionId":"376","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"摆动序列","titleSlug":"wiggle-subsequence"},{"acceptance":0.5072286521904639,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[377]组合总和 Ⅳ","frequency":62.64233370534864,"frontendQuestionId":"377","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"组合总和 Ⅳ","titleSlug":"combination-sum-iv"},{"acceptance":0.6389202721265372,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[378]有序矩阵中第 K 小的元素","frequency":55.82729559973928,"frontendQuestionId":"378","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序矩阵中第 K 小的元素","titleSlug":"kth-smallest-element-in-a-sorted-matrix"},{"acceptance":0.6434653043848446,"acs":0,"articleLive":2,"columnArticles":66,"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.5023028424080727,"acs":0,"articleLive":2,"columnArticles":207,"formTitle":"[380]O(1) 时间插入、删除和获取随机元素","frequency":28.449342063288796,"frontendQuestionId":"380","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"O(1) 时间插入、删除和获取随机元素","titleSlug":"insert-delete-getrandom-o1"},{"acceptance":0.44203878163153226,"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.6296660923783739,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[382]链表随机节点","frequency":25.52684182318494,"frontendQuestionId":"382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表随机节点","titleSlug":"linked-list-random-node"},{"acceptance":0.5974394273127753,"acs":0,"articleLive":2,"columnArticles":725,"formTitle":"[383]赎金信","frequency":3.5682657452990214,"frontendQuestionId":"383","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"赎金信","titleSlug":"ransom-note"},{"acceptance":0.5772378310562724,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[384]打乱数组","frequency":50.03572266522871,"frontendQuestionId":"384","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打乱数组","titleSlug":"shuffle-an-array"},{"acceptance":0.414993383579771,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[385]迷你语法分析器","frequency":6.061429485312524,"frontendQuestionId":"385","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"迷你语法分析器","titleSlug":"mini-parser"},{"acceptance":0.7478473513811393,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[386]字典序排数","frequency":56.468639730490935,"frontendQuestionId":"386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序排数","titleSlug":"lexicographical-numbers"},{"acceptance":0.532137441156276,"acs":0,"articleLive":2,"columnArticles":1162,"formTitle":"[387]字符串中的第一个唯一字符","frequency":60.34273903332904,"frontendQuestionId":"387","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中的第一个唯一字符","titleSlug":"first-unique-character-in-a-string"},{"acceptance":0.525624887610142,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[388]文件的最长绝对路径","frequency":6.061429485312524,"frontendQuestionId":"388","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"文件的最长绝对路径","titleSlug":"longest-absolute-file-path"},{"acceptance":0.6919233564400715,"acs":0,"articleLive":2,"columnArticles":978,"formTitle":"[389]找不同","frequency":16.794658773886972,"frontendQuestionId":"389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找不同","titleSlug":"find-the-difference"},{"acceptance":0.466765940165155,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[390]消除游戏","frequency":39.622276849619915,"frontendQuestionId":"390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"消除游戏","titleSlug":"elimination-game"},{"acceptance":0.35748715922560254,"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.5148679641385855,"acs":0,"articleLive":2,"columnArticles":1549,"formTitle":"[392]判断子序列","frequency":54.01926640506627,"frontendQuestionId":"392","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断子序列","titleSlug":"is-subsequence"},{"acceptance":0.39145384863354704,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[393]UTF-8 编码验证","frequency":33.35349327229824,"frontendQuestionId":"393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"UTF-8 编码验证","titleSlug":"utf-8-validation"},{"acceptance":0.5516661542904521,"acs":0,"articleLive":2,"columnArticles":1276,"formTitle":"[394]字符串解码","frequency":83.25539157283282,"frontendQuestionId":"394","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串解码","titleSlug":"decode-string"},{"acceptance":0.5205301667756703,"acs":0,"articleLive":2,"columnArticles":424,"formTitle":"[395]至少有 K 个重复字符的最长子串","frequency":57.22148860744692,"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.4260212673819949,"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.3775944048906891,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[397]整数替换","frequency":23.026000412431554,"frontendQuestionId":"397","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"整数替换","titleSlug":"integer-replacement"},{"acceptance":0.655164395665721,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[398]随机数索引","frequency":38.21594276395469,"frontendQuestionId":"398","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机数索引","titleSlug":"random-pick-index"},{"acceptance":0.5925888775846504,"acs":0,"articleLive":2,"columnArticles":520,"formTitle":"[399]除法求值","frequency":24.230923379013827,"frontendQuestionId":"399","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"除法求值","titleSlug":"evaluate-division"},{"acceptance":0.4140383426097712,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[400]第 N 位数字","frequency":43.90290732822527,"frontendQuestionId":"400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 位数字","titleSlug":"nth-digit"},{"acceptance":0.6138963195277188,"acs":0,"articleLive":2,"columnArticles":653,"formTitle":"[401]二进制手表","frequency":47.02093428419921,"frontendQuestionId":"401","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制手表","titleSlug":"binary-watch"},{"acceptance":0.3276261660582884,"acs":0,"articleLive":2,"columnArticles":578,"formTitle":"[402]移掉 K 位数字","frequency":68.58622239402918,"frontendQuestionId":"402","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移掉 K 位数字","titleSlug":"remove-k-digits"},{"acceptance":0.4559073747797634,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[403]青蛙过河","frequency":67.29665546288498,"frontendQuestionId":"403","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"青蛙过河","titleSlug":"frog-jump"},{"acceptance":0.5824055909028568,"acs":0,"articleLive":2,"columnArticles":1097,"formTitle":"[404]左叶子之和","frequency":54.01926640506627,"frontendQuestionId":"404","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"左叶子之和","titleSlug":"sum-of-left-leaves"},{"acceptance":0.5223489880440728,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[405]数字转换为十六进制数","frequency":47.67636054432939,"frontendQuestionId":"405","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字转换为十六进制数","titleSlug":"convert-a-number-to-hexadecimal"},{"acceptance":0.7365374905326938,"acs":0,"articleLive":2,"columnArticles":777,"formTitle":"[406]根据身高重建队列","frequency":58.851224392076375,"frontendQuestionId":"406","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"根据身高重建队列","titleSlug":"queue-reconstruction-by-height"},{"acceptance":0.48450197070702156,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[407]接雨水 II","frequency":49.05746146123761,"frontendQuestionId":"407","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"接雨水 II","titleSlug":"trapping-rain-water-ii"},{"acceptance":0.32431409649952697,"acs":0,"articleLive":2,"columnArticles":80,"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.556042163762119,"acs":0,"articleLive":2,"columnArticles":1298,"formTitle":"[409]最长回文串","frequency":64.61686244311043,"frontendQuestionId":"409","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长回文串","titleSlug":"longest-palindrome"},{"acceptance":0.5629661166245816,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[410]分割数组的最大值","frequency":71.84669496024975,"frontendQuestionId":"410","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组的最大值","titleSlug":"split-array-largest-sum"},{"acceptance":0.49743589743589745,"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.6735275490816973,"acs":0,"articleLive":2,"columnArticles":367,"formTitle":"[412]Fizz Buzz","frequency":24.866724145644405,"frontendQuestionId":"412","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"Fizz Buzz","titleSlug":"fizz-buzz"},{"acceptance":0.6870562534134352,"acs":0,"articleLive":2,"columnArticles":898,"formTitle":"[413]等差数列划分","frequency":55.82729559973928,"frontendQuestionId":"413","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分","titleSlug":"arithmetic-slices"},{"acceptance":0.36404035768842946,"acs":0,"articleLive":2,"columnArticles":827,"formTitle":"[414]第三大的数","frequency":23.617833197594297,"frontendQuestionId":"414","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第三大的数","titleSlug":"third-maximum-number"},{"acceptance":0.5373740904206468,"acs":0,"articleLive":2,"columnArticles":1053,"formTitle":"[415]字符串相加","frequency":87.28047009686377,"frontendQuestionId":"415","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串相加","titleSlug":"add-strings"},{"acceptance":0.5067587692511349,"acs":0,"articleLive":2,"columnArticles":963,"formTitle":"[416]分割等和子集","frequency":73.99837806546208,"frontendQuestionId":"416","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割等和子集","titleSlug":"partition-equal-subset-sum"},{"acceptance":0.47835704137968243,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[417]太平洋大西洋水流问题","frequency":58.527268521626674,"frontendQuestionId":"417","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"太平洋大西洋水流问题","titleSlug":"pacific-atlantic-water-flow"},{"acceptance":0.3596702164204741,"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.7553563481467354,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[419]甲板上的战舰","frequency":5.522175928223974,"frontendQuestionId":"419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"甲板上的战舰","titleSlug":"battleships-in-a-board"},{"acceptance":0.20690711386783062,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[420]强密码检验器","frequency":20.097446297355418,"frontendQuestionId":"420","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"强密码检验器","titleSlug":"strong-password-checker"},{"acceptance":0.6223739097459234,"acs":0,"articleLive":2,"columnArticles":302,"formTitle":"[421]数组中两个数的最大异或值","frequency":59.75518324128801,"frontendQuestionId":"421","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中两个数的最大异或值","titleSlug":"maximum-xor-of-two-numbers-in-an-array"},{"acceptance":0.42661965623622744,"acs":0,"articleLive":2,"columnArticles":46,"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.5697296549816774,"acs":0,"articleLive":2,"columnArticles":136,"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.5307168308530706,"acs":0,"articleLive":2,"columnArticles":446,"formTitle":"[424]替换后的最长重复字符","frequency":64.04412000006855,"frontendQuestionId":"424","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"替换后的最长重复字符","titleSlug":"longest-repeating-character-replacement"},{"acceptance":0.6117502054231717,"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.6674055415617128,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[426]将二叉搜索树转化为排序的双向链表","frequency":29.683142518751797,"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.6115238817285823,"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.6496406570841889,"acs":0,"articleLive":2,"columnArticles":53,"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.6986329895391852,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[429]N 叉树的层序遍历","frequency":33.35349327229824,"frontendQuestionId":"429","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"N 叉树的层序遍历","titleSlug":"n-ary-tree-level-order-traversal"},{"acceptance":0.5421607875720724,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[430]扁平化多级双向链表","frequency":31.008249446544394,"frontendQuestionId":"430","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"扁平化多级双向链表","titleSlug":"flatten-a-multilevel-doubly-linked-list"},{"acceptance":0.7290379523389232,"acs":0,"articleLive":2,"columnArticles":28,"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.37768966120473496,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[432]全 O(1) 的数据结构","frequency":27.671955108945014,"frontendQuestionId":"432","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"全 O(1) 的数据结构","titleSlug":"all-oone-data-structure"},{"acceptance":0.5325276243093923,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[433]最小基因变化","frequency":5.522175928223974,"frontendQuestionId":"433","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小基因变化","titleSlug":"minimum-genetic-mutation"},{"acceptance":0.3739936258886982,"acs":0,"articleLive":2,"columnArticles":522,"formTitle":"[434]字符串中的单词数","frequency":24.866724145644405,"frontendQuestionId":"434","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的单词数","titleSlug":"number-of-segments-in-a-string"},{"acceptance":0.5089736276273641,"acs":0,"articleLive":2,"columnArticles":822,"formTitle":"[435]无重叠区间","frequency":62.22365446531786,"frontendQuestionId":"435","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"无重叠区间","titleSlug":"non-overlapping-intervals"},{"acceptance":0.48602680105371665,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[436]寻找右区间","frequency":5.522175928223974,"frontendQuestionId":"436","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找右区间","titleSlug":"find-right-interval"},{"acceptance":0.5667660243079625,"acs":0,"articleLive":2,"columnArticles":812,"formTitle":"[437]路径总和 III","frequency":48.82036964655011,"frontendQuestionId":"437","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"路径总和 III","titleSlug":"path-sum-iii"},{"acceptance":0.51733278723961,"acs":0,"articleLive":2,"columnArticles":782,"formTitle":"[438]找到字符串中所有字母异位词","frequency":46.676974177008915,"frontendQuestionId":"438","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到字符串中所有字母异位词","titleSlug":"find-all-anagrams-in-a-string"},{"acceptance":0.5890014471780028,"acs":0,"articleLive":2,"columnArticles":67,"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.3798058712121212,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[440]字典序的第K小数字","frequency":68.49544080396203,"frontendQuestionId":"440","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"字典序的第K小数字","titleSlug":"k-th-smallest-in-lexicographical-order"},{"acceptance":0.4255855157521732,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[441]排列硬币","frequency":23.617833197594297,"frontendQuestionId":"441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"排列硬币","titleSlug":"arranging-coins"},{"acceptance":0.6974217129309493,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[442]数组中重复的数据","frequency":62.64233370534864,"frontendQuestionId":"442","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中重复的数据","titleSlug":"find-all-duplicates-in-an-array"},{"acceptance":0.4771288007375305,"acs":0,"articleLive":2,"columnArticles":687,"formTitle":"[443]压缩字符串","frequency":42.83077221969119,"frontendQuestionId":"443","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"压缩字符串","titleSlug":"string-compression"},{"acceptance":0.2502833824529585,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[444]序列重建","frequency":18.694466070773423,"frontendQuestionId":"444","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列重建","titleSlug":"sequence-reconstruction"},{"acceptance":0.5881321527570628,"acs":0,"articleLive":2,"columnArticles":923,"formTitle":"[445]两数相加 II","frequency":69.9020150649165,"frontendQuestionId":"445","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两数相加 II","titleSlug":"add-two-numbers-ii"},{"acceptance":0.5517749768732655,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[446]等差数列划分 II - 子序列","frequency":43.90290732822527,"frontendQuestionId":"446","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"等差数列划分 II - 子序列","titleSlug":"arithmetic-slices-ii-subsequence"},{"acceptance":0.6614907274305802,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[447]回旋镖的数量","frequency":0.7886993093302754,"frontendQuestionId":"447","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"回旋镖的数量","titleSlug":"number-of-boomerangs"},{"acceptance":0.6477708388590168,"acs":0,"articleLive":2,"columnArticles":1054,"formTitle":"[448]找到所有数组中消失的数字","frequency":59.719029355773564,"frontendQuestionId":"448","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到所有数组中消失的数字","titleSlug":"find-all-numbers-disappeared-in-an-array"},{"acceptance":0.5565869597504827,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[449]序列化和反序列化二叉搜索树","frequency":0.0,"frontendQuestionId":"449","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化和反序列化二叉搜索树","titleSlug":"serialize-and-deserialize-bst"},{"acceptance":0.4856192656717416,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[450]删除二叉搜索树中的节点","frequency":45.77303984133493,"frontendQuestionId":"450","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除二叉搜索树中的节点","titleSlug":"delete-node-in-a-bst"},{"acceptance":0.7112938352815681,"acs":0,"articleLive":2,"columnArticles":932,"formTitle":"[451]根据字符出现频率排序","frequency":61.97658708663474,"frontendQuestionId":"451","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"根据字符出现频率排序","titleSlug":"sort-characters-by-frequency"},{"acceptance":0.5093200002166812,"acs":0,"articleLive":2,"columnArticles":824,"formTitle":"[452]用最少数量的箭引爆气球","frequency":49.58497580741732,"frontendQuestionId":"452","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用最少数量的箭引爆气球","titleSlug":"minimum-number-of-arrows-to-burst-balloons"},{"acceptance":0.5544038221852929,"acs":0,"articleLive":2,"columnArticles":292,"formTitle":"[453]最小操作次数使数组元素相等","frequency":23.617833197594297,"frontendQuestionId":"453","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小操作次数使数组元素相等","titleSlug":"minimum-moves-to-equal-array-elements"},{"acceptance":0.6012074196878225,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[454]四数相加 II","frequency":57.8170952972324,"frontendQuestionId":"454","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"四数相加 II","titleSlug":"4sum-ii"},{"acceptance":0.5773769110106993,"acs":0,"articleLive":2,"columnArticles":1205,"formTitle":"[455]分发饼干","frequency":57.58589797198614,"frontendQuestionId":"455","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分发饼干","titleSlug":"assign-cookies"},{"acceptance":0.36251900332397125,"acs":0,"articleLive":2,"columnArticles":455,"formTitle":"[456]132 模式","frequency":71.9105855494534,"frontendQuestionId":"456","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"132 模式","titleSlug":"132-pattern"},{"acceptance":0.43528978388998035,"acs":0,"articleLive":2,"columnArticles":330,"formTitle":"[457]环形数组是否存在循环","frequency":51.33164110939982,"frontendQuestionId":"457","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环形数组是否存在循环","titleSlug":"circular-array-loop"},{"acceptance":0.6090080132633324,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[458]可怜的小猪","frequency":17.40322030163009,"frontendQuestionId":"458","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"可怜的小猪","titleSlug":"poor-pigs"},{"acceptance":0.5115623683101559,"acs":0,"articleLive":2,"columnArticles":626,"formTitle":"[459]重复的子字符串","frequency":52.71925717990641,"frontendQuestionId":"459","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重复的子字符串","titleSlug":"repeated-substring-pattern"},{"acceptance":0.43943388187676413,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[460]LFU 缓存","frequency":60.20244214546591,"frontendQuestionId":"460","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"LFU 缓存","titleSlug":"lfu-cache"},{"acceptance":0.8119462133161963,"acs":0,"articleLive":2,"columnArticles":1329,"formTitle":"[461]汉明距离","frequency":59.719029355773564,"frontendQuestionId":"461","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离","titleSlug":"hamming-distance"},{"acceptance":0.6023805340829234,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[462]最少移动次数使数组元素相等 II","frequency":38.21594276395469,"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.7143339872532547,"acs":0,"articleLive":2,"columnArticles":910,"formTitle":"[463]岛屿的周长","frequency":38.21594276395469,"frontendQuestionId":"463","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的周长","titleSlug":"island-perimeter"},{"acceptance":0.3582649935777097,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[464]我能赢吗","frequency":37.550349817636906,"frontendQuestionId":"464","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我能赢吗","titleSlug":"can-i-win"},{"acceptance":0.531987683886418,"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.37358441726525593,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[466]统计重复个数","frequency":8.469811387364896,"frontendQuestionId":"466","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计重复个数","titleSlug":"count-the-repetitions"},{"acceptance":0.4413223140495868,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[467]环绕字符串中唯一的子字符串","frequency":18.035896247680004,"frontendQuestionId":"467","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环绕字符串中唯一的子字符串","titleSlug":"unique-substrings-in-wraparound-string"},{"acceptance":0.24998704676635475,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[468]验证IP地址","frequency":51.33164110939982,"frontendQuestionId":"468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证IP地址","titleSlug":"validate-ip-address"},{"acceptance":0.4335138387484958,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[469]凸多边形","frequency":26.92735682920287,"frontendQuestionId":"469","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"凸多边形","titleSlug":"convex-polygon"},{"acceptance":0.5462197571685066,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[470]用 Rand7() 实现 Rand10()","frequency":45.25379995446684,"frontendQuestionId":"470","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"用 Rand7() 实现 Rand10()","titleSlug":"implement-rand10-using-rand7"},{"acceptance":0.6168734491315137,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[471]编码最短长度的字符串","frequency":14.854916490623221,"frontendQuestionId":"471","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"编码最短长度的字符串","titleSlug":"encode-string-with-shortest-length"},{"acceptance":0.4019225936164866,"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.42024773799954657,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[473]火柴拼正方形","frequency":37.550349817636906,"frontendQuestionId":"473","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"火柴拼正方形","titleSlug":"matchsticks-to-square"},{"acceptance":0.6108180294961761,"acs":0,"articleLive":2,"columnArticles":590,"formTitle":"[474]一和零","frequency":62.81228771772924,"frontendQuestionId":"474","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"一和零","titleSlug":"ones-and-zeroes"},{"acceptance":0.33049356117296846,"acs":0,"articleLive":2,"columnArticles":228,"formTitle":"[475]供暖器","frequency":31.008249446544394,"frontendQuestionId":"475","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"供暖器","titleSlug":"heaters"},{"acceptance":0.7012918633295098,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[476]数字的补数","frequency":5.522175928223974,"frontendQuestionId":"476","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数字的补数","titleSlug":"number-complement"},{"acceptance":0.6038531852060188,"acs":0,"articleLive":2,"columnArticles":329,"formTitle":"[477]汉明距离总和","frequency":47.67636054432939,"frontendQuestionId":"477","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"汉明距离总和","titleSlug":"total-hamming-distance"},{"acceptance":0.43710948111926107,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[478]在圆内随机生成点","frequency":30.333498337885196,"frontendQuestionId":"478","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在圆内随机生成点","titleSlug":"generate-random-point-in-a-circle"},{"acceptance":0.41468832430931557,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[479]最大回文数乘积","frequency":11.3912736416566,"frontendQuestionId":"479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大回文数乘积","titleSlug":"largest-palindrome-product"},{"acceptance":0.44813042544707216,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[480]滑动窗口中位数","frequency":41.94961522499853,"frontendQuestionId":"480","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"滑动窗口中位数","titleSlug":"sliding-window-median"},{"acceptance":0.5363448071801953,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[481]神奇字符串","frequency":6.061429485312524,"frontendQuestionId":"481","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"神奇字符串","titleSlug":"magical-string"},{"acceptance":0.4261819653335132,"acs":0,"articleLive":2,"columnArticles":223,"formTitle":"[482]密钥格式化","frequency":16.208607595358924,"frontendQuestionId":"482","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"密钥格式化","titleSlug":"license-key-formatting"},{"acceptance":0.5903214602709065,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[483]最小好进制","frequency":34.64949327968721,"frontendQuestionId":"483","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最小好进制","titleSlug":"smallest-good-base"},{"acceptance":0.6404545454545455,"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.6066315072295542,"acs":0,"articleLive":2,"columnArticles":976,"formTitle":"[485]最大连续 1 的个数","frequency":50.03572266522871,"frontendQuestionId":"485","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续 1 的个数","titleSlug":"max-consecutive-ones"},{"acceptance":0.5870425512716398,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[486]预测赢家","frequency":44.600867017579276,"frontendQuestionId":"486","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"预测赢家","titleSlug":"predict-the-winner"},{"acceptance":0.5766392127500267,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[487]最大连续1的个数 II","frequency":36.90760470819734,"frontendQuestionId":"487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大连续1的个数 II","titleSlug":"max-consecutive-ones-ii"},{"acceptance":0.3872189077558513,"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.7177232762609903,"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.4817739079102715,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[490]迷宫","frequency":18.035896247680004,"frontendQuestionId":"490","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫","titleSlug":"the-maze"},{"acceptance":0.5471400771241987,"acs":0,"articleLive":2,"columnArticles":387,"formTitle":"[491]递增子序列","frequency":50.672965981421456,"frontendQuestionId":"491","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"递增子序列","titleSlug":"increasing-subsequences"},{"acceptance":0.5514392630972942,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[492]构造矩形","frequency":5.522175928223974,"frontendQuestionId":"492","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"构造矩形","titleSlug":"construct-the-rectangle"},{"acceptance":0.3446668422438767,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[493]翻转对","frequency":36.78166698742219,"frontendQuestionId":"493","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转对","titleSlug":"reverse-pairs"},{"acceptance":0.49518913438442014,"acs":0,"articleLive":2,"columnArticles":1013,"formTitle":"[494]目标和","frequency":75.92225057120832,"frontendQuestionId":"494","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"目标和","titleSlug":"target-sum"},{"acceptance":0.5420599339310995,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[495]提莫攻击","frequency":29.683142518751797,"frontendQuestionId":"495","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"提莫攻击","titleSlug":"teemo-attacking"},{"acceptance":0.6873692378036108,"acs":0,"articleLive":2,"columnArticles":1014,"formTitle":"[496]下一个更大元素 I","frequency":42.50786916111621,"frontendQuestionId":"496","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 I","titleSlug":"next-greater-element-i"},{"acceptance":0.40508998875140606,"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.46435046313083034,"acs":0,"articleLive":2,"columnArticles":440,"formTitle":"[498]对角线遍历","frequency":51.33164110939982,"frontendQuestionId":"498","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历","titleSlug":"diagonal-traverse"},{"acceptance":0.3707093821510298,"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.7089011170677562,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[500]键盘行","frequency":16.794658773886972,"frontendQuestionId":"500","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"键盘行","titleSlug":"keyboard-row"},{"acceptance":0.5118827494016601,"acs":0,"articleLive":2,"columnArticles":529,"formTitle":"[501]二叉搜索树中的众数","frequency":46.38693405061856,"frontendQuestionId":"501","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的众数","titleSlug":"find-mode-in-binary-search-tree"},{"acceptance":0.4406912322165779,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[502]IPO","frequency":30.114085212510055,"frontendQuestionId":"502","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"IPO","titleSlug":"ipo"},{"acceptance":0.6345806110169545,"acs":0,"articleLive":2,"columnArticles":956,"formTitle":"[503]下一个更大元素 II","frequency":47.67636054432939,"frontendQuestionId":"503","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"下一个更大元素 II","titleSlug":"next-greater-element-ii"},{"acceptance":0.5044316381896,"acs":0,"articleLive":2,"columnArticles":312,"formTitle":"[504]七进制数","frequency":24.230923379013827,"frontendQuestionId":"504","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"七进制数","titleSlug":"base-7"},{"acceptance":0.48284960422163586,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[505]迷宫 II","frequency":18.035896247680004,"frontendQuestionId":"505","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷宫 II","titleSlug":"the-maze-ii"},{"acceptance":0.5642117251477846,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[506]相对名次","frequency":5.522175928223974,"frontendQuestionId":"506","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"相对名次","titleSlug":"relative-ranks"},{"acceptance":0.41123829641470655,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[507]完美数","frequency":17.40322030163009,"frontendQuestionId":"507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完美数","titleSlug":"perfect-number"},{"acceptance":0.6760921815354164,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[508]出现次数最多的子树元素和","frequency":17.40322030163009,"frontendQuestionId":"508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"出现次数最多的子树元素和","titleSlug":"most-frequent-subtree-sum"},{"acceptance":0.6759749962062405,"acs":0,"articleLive":2,"columnArticles":1424,"formTitle":"[509]斐波那契数","frequency":63.21454576307141,"frontendQuestionId":"509","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"斐波那契数","titleSlug":"fibonacci-number"},{"acceptance":0.6084555322795658,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[510]二叉搜索树中的中序后继 II","frequency":7.826061825326265,"frontendQuestionId":"510","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继 II","titleSlug":"inorder-successor-in-bst-ii"},{"acceptance":0.7337592761617524,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[511]游戏玩法分析 I","frequency":41.255068326624084,"frontendQuestionId":"511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 I","titleSlug":"game-play-analysis-i"},{"acceptance":0.5381293188548865,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[512]游戏玩法分析 II","frequency":6.061429485312524,"frontendQuestionId":"512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 II","titleSlug":"game-play-analysis-ii"},{"acceptance":0.7307369179068651,"acs":0,"articleLive":2,"columnArticles":549,"formTitle":"[513]找树左下角的值","frequency":5.522175928223974,"frontendQuestionId":"513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找树左下角的值","titleSlug":"find-bottom-left-tree-value"},{"acceptance":0.5011639335781904,"acs":0,"articleLive":2,"columnArticles":238,"formTitle":"[514]自由之路","frequency":50.26505379655652,"frontendQuestionId":"514","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"自由之路","titleSlug":"freedom-trail"},{"acceptance":0.6438434682924288,"acs":0,"articleLive":2,"columnArticles":409,"formTitle":"[515]在每个树行中找最大值","frequency":24.866724145644405,"frontendQuestionId":"515","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在每个树行中找最大值","titleSlug":"find-largest-value-in-each-tree-row"},{"acceptance":0.6524642463386218,"acs":0,"articleLive":2,"columnArticles":602,"formTitle":"[516]最长回文子序列","frequency":59.11423826900726,"frontendQuestionId":"516","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长回文子序列","titleSlug":"longest-palindromic-subsequence"},{"acceptance":0.44017446658021925,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[517]超级洗衣机","frequency":0.0,"frontendQuestionId":"517","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级洗衣机","titleSlug":"super-washing-machines"},{"acceptance":0.6537523706312652,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[518]零钱兑换 II","frequency":70.44596823299793,"frontendQuestionId":"518","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"零钱兑换 II","titleSlug":"coin-change-2"},{"acceptance":0.3953453226537706,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[519]随机翻转矩阵","frequency":20.846558285770143,"frontendQuestionId":"519","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"随机翻转矩阵","titleSlug":"random-flip-matrix"},{"acceptance":0.5633704137950757,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[520]检测大写字母","frequency":6.061429485312524,"frontendQuestionId":"520","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检测大写字母","titleSlug":"detect-capital"},{"acceptance":0.7128397588991243,"acs":0,"articleLive":2,"columnArticles":246,"formTitle":"[521]最长特殊序列 Ⅰ","frequency":16.794658773886972,"frontendQuestionId":"521","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 Ⅰ","titleSlug":"longest-uncommon-subsequence-i"},{"acceptance":0.36009956171202856,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[522]最长特殊序列 II","frequency":16.794658773886972,"frontendQuestionId":"522","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长特殊序列 II","titleSlug":"longest-uncommon-subsequence-ii"},{"acceptance":0.2744647916355127,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[523]连续的子数组和","frequency":57.8170952972324,"frontendQuestionId":"523","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续的子数组和","titleSlug":"continuous-subarray-sum"},{"acceptance":0.5368016160052254,"acs":0,"articleLive":2,"columnArticles":508,"formTitle":"[525]连续数组","frequency":67.95917076428083,"frontendQuestionId":"525","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"连续数组","titleSlug":"contiguous-array"},{"acceptance":0.7350275896101566,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[526]优美的排列","frequency":35.90818103361991,"frontendQuestionId":"526","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优美的排列","titleSlug":"beautiful-arrangement"},{"acceptance":0.5767757147067492,"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.4767892130393866,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[528]按权重随机选择","frequency":24.57480965398889,"frontendQuestionId":"528","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"按权重随机选择","titleSlug":"random-pick-with-weight"},{"acceptance":0.6458980117577119,"acs":0,"articleLive":2,"columnArticles":459,"formTitle":"[529]扫雷游戏","frequency":34.64949327968721,"frontendQuestionId":"529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扫雷游戏","titleSlug":"minesweeper"},{"acceptance":0.6207649389504326,"acs":0,"articleLive":2,"columnArticles":633,"formTitle":"[530]二叉搜索树的最小绝对差","frequency":5.004603235121968,"frontendQuestionId":"530","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的最小绝对差","titleSlug":"minimum-absolute-difference-in-bst"},{"acceptance":0.6610774170531574,"acs":0,"articleLive":2,"columnArticles":75,"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.37321207971780257,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[532]数组中的 k-diff 数对","frequency":17.40322030163009,"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.5234042553191489,"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.6755655886538745,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[534]游戏玩法分析 III","frequency":16.794658773886972,"frontendQuestionId":"534","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 III","titleSlug":"game-play-analysis-iii"},{"acceptance":0.8414673736608592,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[535]TinyURL 的加密与解密","frequency":24.230923379013827,"frontendQuestionId":"535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"TinyURL 的加密与解密","titleSlug":"encode-and-decode-tinyurl"},{"acceptance":0.5351351351351351,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[536]从字符串生成二叉树","frequency":9.855093570160312,"frontendQuestionId":"536","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从字符串生成二叉树","titleSlug":"construct-binary-tree-from-string"},{"acceptance":0.7127034218179568,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[537]复数乘法","frequency":5.004603235121968,"frontendQuestionId":"537","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复数乘法","titleSlug":"complex-number-multiplication"},{"acceptance":0.6978226999567944,"acs":0,"articleLive":2,"columnArticles":814,"formTitle":"[538]把二叉搜索树转换为累加树","frequency":37.550349817636906,"frontendQuestionId":"538","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"convert-bst-to-greater-tree"},{"acceptance":0.5958945811950944,"acs":0,"articleLive":2,"columnArticles":176,"formTitle":"[539]最小时间差","frequency":33.990080073438854,"frontendQuestionId":"539","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小时间差","titleSlug":"minimum-time-difference"},{"acceptance":0.5804472683453575,"acs":0,"articleLive":2,"columnArticles":388,"formTitle":"[540]有序数组中的单一元素","frequency":47.02093428419921,"frontendQuestionId":"540","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组中的单一元素","titleSlug":"single-element-in-a-sorted-array"},{"acceptance":0.6083330458481389,"acs":0,"articleLive":2,"columnArticles":786,"formTitle":"[541]反转字符串 II","frequency":28.902070385143347,"frontendQuestionId":"541","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串 II","titleSlug":"reverse-string-ii"},{"acceptance":0.4587867962670654,"acs":0,"articleLive":2,"columnArticles":619,"formTitle":"[542]01 矩阵","frequency":45.57266560129181,"frontendQuestionId":"542","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"01 矩阵","titleSlug":"01-matrix"},{"acceptance":0.5503637391703635,"acs":0,"articleLive":2,"columnArticles":1209,"formTitle":"[543]二叉树的直径","frequency":73.46074322718289,"frontendQuestionId":"543","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的直径","titleSlug":"diameter-of-binary-tree"},{"acceptance":0.7083988675684177,"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.4171010176222388,"acs":0,"articleLive":2,"columnArticles":78,"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.6308452667595995,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[546]移除盒子","frequency":26.213058161373958,"frontendQuestionId":"546","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除盒子","titleSlug":"remove-boxes"},{"acceptance":0.6183836084234491,"acs":0,"articleLive":2,"columnArticles":1106,"formTitle":"[547]省份数量","frequency":47.170234112350414,"frontendQuestionId":"547","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"省份数量","titleSlug":"number-of-provinces"},{"acceptance":0.35612406610821823,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[548]将数组分割成和相等的子数组","frequency":10.602574332326324,"frontendQuestionId":"548","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组分割成和相等的子数组","titleSlug":"split-array-with-equal-sum"},{"acceptance":0.48388614443660316,"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.43866238127911594,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[550]游戏玩法分析 IV","frequency":24.866724145644405,"frontendQuestionId":"550","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 IV","titleSlug":"game-play-analysis-iv"},{"acceptance":0.5673111576486631,"acs":0,"articleLive":2,"columnArticles":747,"formTitle":"[551]学生出勤记录 I","frequency":18.790774033037895,"frontendQuestionId":"551","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 I","titleSlug":"student-attendance-record-i"},{"acceptance":0.5784750091207589,"acs":0,"articleLive":2,"columnArticles":285,"formTitle":"[552]学生出勤记录 II","frequency":28.987187487437797,"frontendQuestionId":"552","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"学生出勤记录 II","titleSlug":"student-attendance-record-ii"},{"acceptance":0.6028828076039273,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[553]最优除法","frequency":6.061429485312524,"frontendQuestionId":"553","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最优除法","titleSlug":"optimal-division"},{"acceptance":0.501883260157347,"acs":0,"articleLive":2,"columnArticles":487,"formTitle":"[554]砖墙","frequency":61.298938862228304,"frontendQuestionId":"554","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"砖墙","titleSlug":"brick-wall"},{"acceptance":0.3424185463659148,"acs":0,"articleLive":2,"columnArticles":23,"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.326075508849051,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[556]下一个更大元素 III","frequency":41.255068326624084,"frontendQuestionId":"556","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下一个更大元素 III","titleSlug":"next-greater-element-iii"},{"acceptance":0.7454182308210607,"acs":0,"articleLive":2,"columnArticles":1255,"formTitle":"[557]反转字符串中的单词 III","frequency":59.353956893054715,"frontendQuestionId":"557","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转字符串中的单词 III","titleSlug":"reverse-words-in-a-string-iii"},{"acceptance":0.5036880927291886,"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.727569291444013,"acs":0,"articleLive":2,"columnArticles":543,"formTitle":"[559]N 叉树的最大深度","frequency":32.73827882206933,"frontendQuestionId":"559","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的最大深度","titleSlug":"maximum-depth-of-n-ary-tree"},{"acceptance":0.44655286124020305,"acs":0,"articleLive":2,"columnArticles":894,"formTitle":"[560]和为 K 的子数组","frequency":81.44630307224472,"frontendQuestionId":"560","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为 K 的子数组","titleSlug":"subarray-sum-equals-k"},{"acceptance":0.7742017144154053,"acs":0,"articleLive":2,"columnArticles":736,"formTitle":"[561]数组拆分 I","frequency":16.208607595358924,"frontendQuestionId":"561","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组拆分 I","titleSlug":"array-partition-i"},{"acceptance":0.46239347906632083,"acs":0,"articleLive":2,"columnArticles":57,"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.6051849594270258,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[563]二叉树的坡度","frequency":5.522175928223974,"frontendQuestionId":"563","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的坡度","titleSlug":"binary-tree-tilt"},{"acceptance":0.179172857850421,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[564]寻找最近的回文数","frequency":25.52684182318494,"frontendQuestionId":"564","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"寻找最近的回文数","titleSlug":"find-the-closest-palindrome"},{"acceptance":0.6115583165631289,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[565]数组嵌套","frequency":16.794658773886972,"frontendQuestionId":"565","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组嵌套","titleSlug":"array-nesting"},{"acceptance":0.6938151800623839,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[566]重塑矩阵","frequency":29.683142518751797,"frontendQuestionId":"566","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重塑矩阵","titleSlug":"reshape-the-matrix"},{"acceptance":0.4308807643738494,"acs":0,"articleLive":2,"columnArticles":1028,"formTitle":"[567]字符串的排列","frequency":54.603758450947815,"frontendQuestionId":"567","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"permutation-in-string"},{"acceptance":0.5039370078740157,"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.5634122995932042,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[569]员工薪水中位数","frequency":30.333498337885196,"frontendQuestionId":"569","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工薪水中位数","titleSlug":"median-employee-salary"},{"acceptance":0.6626830318690784,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[570]至少有5名直接下属的经理","frequency":16.208607595358924,"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.4871488344291692,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[571]给定数字的频率查询中位数","frequency":6.061429485312524,"frontendQuestionId":"571","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字的频率查询中位数","titleSlug":"find-median-given-frequency-of-numbers"},{"acceptance":0.47385387027888815,"acs":0,"articleLive":2,"columnArticles":711,"formTitle":"[572]另一棵树的子树","frequency":49.418591143090104,"frontendQuestionId":"572","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"另一棵树的子树","titleSlug":"subtree-of-another-tree"},{"acceptance":0.6611950098489823,"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.6477042718653457,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[574]当选者","frequency":0.0,"frontendQuestionId":"574","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"当选者","titleSlug":"winning-candidate"},{"acceptance":0.6846208597487295,"acs":0,"articleLive":2,"columnArticles":422,"formTitle":"[575]分糖果","frequency":29.683142518751797,"frontendQuestionId":"575","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果","titleSlug":"distribute-candies"},{"acceptance":0.46973029927722426,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[576]出界的路径数","frequency":40.177895416503176,"frontendQuestionId":"576","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"出界的路径数","titleSlug":"out-of-boundary-paths"},{"acceptance":0.7055708120831699,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[577]员工奖金","frequency":24.230923379013827,"frontendQuestionId":"577","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"员工奖金","titleSlug":"employee-bonus"},{"acceptance":0.49743723849372384,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[578]查询回答率最高的问题","frequency":6.061429485312524,"frontendQuestionId":"578","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询回答率最高的问题","titleSlug":"get-highest-answer-rate-question"},{"acceptance":0.4115691489361702,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[579]查询员工的累计薪水","frequency":26.92735682920287,"frontendQuestionId":"579","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询员工的累计薪水","titleSlug":"find-cumulative-salary-of-an-employee"},{"acceptance":0.5239186167021218,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[580]统计各专业学生人数","frequency":16.794658773886972,"frontendQuestionId":"580","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计各专业学生人数","titleSlug":"count-student-number-in-departments"},{"acceptance":0.40443977626061806,"acs":0,"articleLive":2,"columnArticles":844,"formTitle":"[581]最短无序连续子数组","frequency":63.79162469031737,"frontendQuestionId":"581","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最短无序连续子数组","titleSlug":"shortest-unsorted-continuous-subarray"},{"acceptance":0.40524518637958834,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[582]杀掉进程","frequency":0.0,"frontendQuestionId":"582","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"杀掉进程","titleSlug":"kill-process"},{"acceptance":0.5871144116206953,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[583]两个字符串的删除操作","frequency":45.57266560129181,"frontendQuestionId":"583","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两个字符串的删除操作","titleSlug":"delete-operation-for-two-strings"},{"acceptance":0.7745270825989895,"acs":0,"articleLive":2,"columnArticles":59,"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.5953140060799288,"acs":0,"articleLive":2,"columnArticles":97,"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.7486533074768369,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[586]订单最多的客户","frequency":24.866724145644405,"frontendQuestionId":"586","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"订单最多的客户","titleSlug":"customer-placing-the-largest-number-of-orders"},{"acceptance":0.38400589644370736,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[587]安装栅栏","frequency":8.469811387364896,"frontendQuestionId":"587","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安装栅栏","titleSlug":"erect-the-fence"},{"acceptance":0.42330917874396135,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[588]设计内存文件系统","frequency":10.602574332326324,"frontendQuestionId":"588","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计内存文件系统","titleSlug":"design-in-memory-file-system"},{"acceptance":0.7453273835063932,"acs":0,"articleLive":2,"columnArticles":556,"formTitle":"[589]N 叉树的前序遍历","frequency":43.22942487860522,"frontendQuestionId":"589","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的前序遍历","titleSlug":"n-ary-tree-preorder-traversal"},{"acceptance":0.7603260802335506,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[590]N 叉树的后序遍历","frequency":16.208607595358924,"frontendQuestionId":"590","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"N 叉树的后序遍历","titleSlug":"n-ary-tree-postorder-traversal"},{"acceptance":0.34049199531433033,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[591]标签验证器","frequency":0.0,"frontendQuestionId":"591","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"标签验证器","titleSlug":"tag-validator"},{"acceptance":0.5211469534050179,"acs":0,"articleLive":2,"columnArticles":106,"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.4409311453960639,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[593]有效的正方形","frequency":24.230923379013827,"frontendQuestionId":"593","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的正方形","titleSlug":"valid-square"},{"acceptance":0.5168365770775409,"acs":0,"articleLive":2,"columnArticles":266,"formTitle":"[594]最长和谐子序列","frequency":6.061429485312524,"frontendQuestionId":"594","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长和谐子序列","titleSlug":"longest-harmonious-subsequence"},{"acceptance":0.796503023050762,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[595]大的国家","frequency":39.93777251719928,"frontendQuestionId":"595","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"大的国家","titleSlug":"big-countries"},{"acceptance":0.4207809278487118,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[596]超过5名学生的课","frequency":23.617833197594297,"frontendQuestionId":"596","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"超过5名学生的课","titleSlug":"classes-more-than-5-students"},{"acceptance":0.44127524291407333,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[597]好友申请 I：总体通过率","frequency":16.794658773886972,"frontendQuestionId":"597","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好友申请 I：总体通过率","titleSlug":"friend-requests-i-overall-acceptance-rate"},{"acceptance":0.5174735597451225,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[598]范围求和 II","frequency":16.794658773886972,"frontendQuestionId":"598","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"范围求和 II","titleSlug":"range-addition-ii"},{"acceptance":0.5222111074061724,"acs":0,"articleLive":2,"columnArticles":263,"formTitle":"[599]两个列表的最小索引总和","frequency":16.794658773886972,"frontendQuestionId":"599","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个列表的最小索引总和","titleSlug":"minimum-index-sum-of-two-lists"},{"acceptance":0.48050836467384256,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[600]不含连续1的非负整数","frequency":31.260004101378936,"frontendQuestionId":"600","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"不含连续1的非负整数","titleSlug":"non-negative-integers-without-consecutive-ones"},{"acceptance":0.49886647018816593,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[601]体育馆的人流量","frequency":52.28177000236804,"frontendQuestionId":"601","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"体育馆的人流量","titleSlug":"human-traffic-of-stadium"},{"acceptance":0.6282735208535403,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[602]好友申请 II ：谁有最多的好友","frequency":18.035896247680004,"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.6709042670793721,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[603]连续空余座位","frequency":24.866724145644405,"frontendQuestionId":"603","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续空余座位","titleSlug":"consecutive-available-seats"},{"acceptance":0.37272006344171293,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[604]迭代压缩字符串","frequency":7.211508204687712,"frontendQuestionId":"604","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"迭代压缩字符串","titleSlug":"design-compressed-string-iterator"},{"acceptance":0.3344030226542683,"acs":0,"articleLive":2,"columnArticles":1242,"formTitle":"[605]种花问题","frequency":53.13439234021252,"frontendQuestionId":"605","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"种花问题","titleSlug":"can-place-flowers"},{"acceptance":0.5685792127521145,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[606]根据二叉树创建字符串","frequency":5.522175928223974,"frontendQuestionId":"606","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"根据二叉树创建字符串","titleSlug":"construct-string-from-binary-tree"},{"acceptance":0.6637147917499857,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[607]销售员","frequency":6.061429485312524,"frontendQuestionId":"607","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售员","titleSlug":"sales-person"},{"acceptance":0.6570221942672297,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[608]树节点","frequency":5.522175928223974,"frontendQuestionId":"608","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树节点","titleSlug":"tree-node"},{"acceptance":0.4842719624043053,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[609]在系统中查找重复文件","frequency":0.0,"frontendQuestionId":"609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在系统中查找重复文件","titleSlug":"find-duplicate-file-in-system"},{"acceptance":0.667153672466463,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[610]判断三角形","frequency":6.62395241264668,"frontendQuestionId":"610","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断三角形","titleSlug":"triangle-judgement"},{"acceptance":0.5320004757631133,"acs":0,"articleLive":2,"columnArticles":382,"formTitle":"[611]有效三角形的个数","frequency":76.58505458074951,"frontendQuestionId":"611","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效三角形的个数","titleSlug":"valid-triangle-number"},{"acceptance":0.6681775259678943,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[612]平面上的最近距离","frequency":6.62395241264668,"frontendQuestionId":"612","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平面上的最近距离","titleSlug":"shortest-distance-in-a-plane"},{"acceptance":0.81710248379343,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[613]直线上的最近距离","frequency":5.522175928223974,"frontendQuestionId":"613","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"直线上的最近距离","titleSlug":"shortest-distance-in-a-line"},{"acceptance":0.34620340338561334,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[614]二级关注者","frequency":17.40322030163009,"frontendQuestionId":"614","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二级关注者","titleSlug":"second-degree-follower"},{"acceptance":0.4243031213486897,"acs":0,"articleLive":2,"columnArticles":87,"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.46007380073800735,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[616]给字符串添加加粗标签","frequency":34.64949327968721,"frontendQuestionId":"616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给字符串添加加粗标签","titleSlug":"add-bold-tag-in-string"},{"acceptance":0.7880840595277282,"acs":0,"articleLive":2,"columnArticles":1203,"formTitle":"[617]合并二叉树","frequency":63.71891101185313,"frontendQuestionId":"617","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"合并二叉树","titleSlug":"merge-two-binary-trees"},{"acceptance":0.6196868008948546,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[618]学生地理信息报告","frequency":17.40322030163009,"frontendQuestionId":"618","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"学生地理信息报告","titleSlug":"students-report-by-geography"},{"acceptance":0.46588385994876175,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[619]只出现一次的最大数字","frequency":6.061429485312524,"frontendQuestionId":"619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的最大数字","titleSlug":"biggest-single-number"},{"acceptance":0.7728892462651826,"acs":0,"articleLive":2,"columnArticles":304,"formTitle":"[620]有趣的电影","frequency":40.58498988108451,"frontendQuestionId":"620","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有趣的电影","titleSlug":"not-boring-movies"},{"acceptance":0.5696683100745128,"acs":0,"articleLive":2,"columnArticles":493,"formTitle":"[621]任务调度器","frequency":63.052672164226934,"frontendQuestionId":"621","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任务调度器","titleSlug":"task-scheduler"},{"acceptance":0.43671278133388397,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[622]设计循环队列","frequency":47.67636054432939,"frontendQuestionId":"622","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计循环队列","titleSlug":"design-circular-queue"},{"acceptance":0.5454268910971405,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[623]在二叉树中增加一行","frequency":0.0,"frontendQuestionId":"623","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中增加一行","titleSlug":"add-one-row-to-tree"},{"acceptance":0.4163568773234201,"acs":0,"articleLive":2,"columnArticles":48,"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.3402960298796514,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[625]最小因式分解","frequency":0.0,"frontendQuestionId":"625","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小因式分解","titleSlug":"minimum-factorization"},{"acceptance":0.6831235035143276,"acs":0,"articleLive":2,"columnArticles":340,"formTitle":"[626]换座位","frequency":42.578812263600504,"frontendQuestionId":"626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"换座位","titleSlug":"exchange-seats"},{"acceptance":0.8075638848143287,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[627]变更性别","frequency":29.683142518751797,"frontendQuestionId":"627","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"变更性别","titleSlug":"swap-salary"},{"acceptance":0.5250930543810469,"acs":0,"articleLive":2,"columnArticles":753,"formTitle":"[628]三个数的最大乘积","frequency":34.64949327968721,"frontendQuestionId":"628","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三个数的最大乘积","titleSlug":"maximum-product-of-three-numbers"},{"acceptance":0.40425746569814364,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[629]K个逆序对数组","frequency":25.52684182318494,"frontendQuestionId":"629","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K个逆序对数组","titleSlug":"k-inverse-pairs-array"},{"acceptance":0.3673725771715721,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[630]课程表 III","frequency":7.211508204687712,"frontendQuestionId":"630","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 III","titleSlug":"course-schedule-iii"},{"acceptance":0.28474484256243215,"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.597170656766099,"acs":0,"articleLive":2,"columnArticles":236,"formTitle":"[632]最小区间","frequency":17.40322030163009,"frontendQuestionId":"632","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小区间","titleSlug":"smallest-range-covering-elements-from-k-lists"},{"acceptance":0.3989730744069139,"acs":0,"articleLive":2,"columnArticles":755,"formTitle":"[633]平方数之和","frequency":63.33097551881593,"frontendQuestionId":"633","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"平方数之和","titleSlug":"sum-of-square-numbers"},{"acceptance":0.44018354637823665,"acs":0,"articleLive":2,"columnArticles":20,"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.5565368466772839,"acs":0,"articleLive":2,"columnArticles":63,"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.5503197188778155,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[636]函数的独占时间","frequency":6.061429485312524,"frontendQuestionId":"636","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"函数的独占时间","titleSlug":"exclusive-time-of-functions"},{"acceptance":0.6894281024170268,"acs":0,"articleLive":2,"columnArticles":640,"formTitle":"[637]二叉树的层平均值","frequency":21.900949634400796,"frontendQuestionId":"637","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的层平均值","titleSlug":"average-of-levels-in-binary-tree"},{"acceptance":0.5929208208049797,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[638]大礼包","frequency":6.061429485312524,"frontendQuestionId":"638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大礼包","titleSlug":"shopping-offers"},{"acceptance":0.30983509136829596,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[639]解码方法 II","frequency":29.683142518751797,"frontendQuestionId":"639","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解码方法 II","titleSlug":"decode-ways-ii"},{"acceptance":0.4243836380292349,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[640]求解方程","frequency":23.617833197594297,"frontendQuestionId":"640","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求解方程","titleSlug":"solve-the-equation"},{"acceptance":0.5329286566936733,"acs":0,"articleLive":2,"columnArticles":234,"formTitle":"[641]设计循环双端队列","frequency":15.643615799953498,"frontendQuestionId":"641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计循环双端队列","titleSlug":"design-circular-deque"},{"acceptance":0.4895293385859424,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[642]设计搜索自动补全系统","frequency":9.855093570160312,"frontendQuestionId":"642","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计搜索自动补全系统","titleSlug":"design-search-autocomplete-system"},{"acceptance":0.45144368334344925,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[643]子数组最大平均数 I","frequency":37.550349817636906,"frontendQuestionId":"643","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组最大平均数 I","titleSlug":"maximum-average-subarray-i"},{"acceptance":0.398989898989899,"acs":0,"articleLive":2,"columnArticles":24,"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.4349752997478516,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[645]错误的集合","frequency":41.94961522499853,"frontendQuestionId":"645","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"错误的集合","titleSlug":"set-mismatch"},{"acceptance":0.5757148556988961,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[646]最长数对链","frequency":4.507275614106019,"frontendQuestionId":"646","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长数对链","titleSlug":"maximum-length-of-pair-chain"},{"acceptance":0.6564909287753027,"acs":0,"articleLive":2,"columnArticles":890,"formTitle":"[647]回文子串","frequency":57.85034412522395,"frontendQuestionId":"647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子串","titleSlug":"palindromic-substrings"},{"acceptance":0.5832374322845033,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[648]单词替换","frequency":6.62395241264668,"frontendQuestionId":"648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词替换","titleSlug":"replace-words"},{"acceptance":0.48168882668532775,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[649]Dota2 参议院","frequency":6.061429485312524,"frontendQuestionId":"649","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"Dota2 参议院","titleSlug":"dota2-senate"},{"acceptance":0.5360719395054159,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[650]只有两个键的键盘","frequency":17.40322030163009,"frontendQuestionId":"650","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只有两个键的键盘","titleSlug":"2-keys-keyboard"},{"acceptance":0.5806758686339838,"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.5713008575077541,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[652]寻找重复的子树","frequency":53.773972533476254,"frontendQuestionId":"652","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"寻找重复的子树","titleSlug":"find-duplicate-subtrees"},{"acceptance":0.5962777920333278,"acs":0,"articleLive":2,"columnArticles":374,"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.8097382493667323,"acs":0,"articleLive":2,"columnArticles":587,"formTitle":"[654]最大二叉树","frequency":44.28753104797218,"frontendQuestionId":"654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大二叉树","titleSlug":"maximum-binary-tree"},{"acceptance":0.59652621421679,"acs":0,"articleLive":2,"columnArticles":135,"formTitle":"[655]输出二叉树","frequency":17.40322030163009,"frontendQuestionId":"655","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"输出二叉树","titleSlug":"print-binary-tree"},{"acceptance":0.3074311580535647,"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.7834699124673798,"acs":0,"articleLive":2,"columnArticles":616,"formTitle":"[657]机器人能否返回原点","frequency":5.522175928223974,"frontendQuestionId":"657","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人能否返回原点","titleSlug":"robot-return-to-origin"},{"acceptance":0.45393825710428976,"acs":0,"articleLive":2,"columnArticles":235,"formTitle":"[658]找到 K 个最接近的元素","frequency":31.709178233000372,"frontendQuestionId":"658","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 K 个最接近的元素","titleSlug":"find-k-closest-elements"},{"acceptance":0.5418553125903092,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[659]分割数组为连续子序列","frequency":5.522175928223974,"frontendQuestionId":"659","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组为连续子序列","titleSlug":"split-array-into-consecutive-subsequences"},{"acceptance":0.6503428011753183,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[660]移除 9","frequency":15.643615799953498,"frontendQuestionId":"660","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"移除 9","titleSlug":"remove-9"},{"acceptance":0.5603686317824106,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[661]图片平滑器","frequency":6.061429485312524,"frontendQuestionId":"661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"图片平滑器","titleSlug":"image-smoother"},{"acceptance":0.40724511095649085,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[662]二叉树最大宽度","frequency":51.914376137555564,"frontendQuestionId":"662","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树最大宽度","titleSlug":"maximum-width-of-binary-tree"},{"acceptance":0.4617877396705374,"acs":0,"articleLive":2,"columnArticles":35,"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.6551403829442963,"acs":0,"articleLive":2,"columnArticles":188,"formTitle":"[664]奇怪的打印机","frequency":55.118893273612976,"frontendQuestionId":"664","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"奇怪的打印机","titleSlug":"strange-printer"},{"acceptance":0.27034968822272315,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[665]非递减数列","frequency":50.26505379655652,"frontendQuestionId":"665","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"非递减数列","titleSlug":"non-decreasing-array"},{"acceptance":0.6180048661800487,"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.6242975860704393,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[667]优美的排列 II","frequency":0.0,"frontendQuestionId":"667","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"优美的排列 II","titleSlug":"beautiful-arrangement-ii"},{"acceptance":0.5075625142509691,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[668]乘法表中第k小的数","frequency":35.33334009083937,"frontendQuestionId":"668","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"乘法表中第k小的数","titleSlug":"kth-smallest-number-in-multiplication-table"},{"acceptance":0.6664263078995807,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[669]修剪二叉搜索树","frequency":24.230923379013827,"frontendQuestionId":"669","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修剪二叉搜索树","titleSlug":"trim-a-binary-search-tree"},{"acceptance":0.4498537504337911,"acs":0,"articleLive":2,"columnArticles":274,"formTitle":"[670]最大交换","frequency":61.298938862228304,"frontendQuestionId":"670","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大交换","titleSlug":"maximum-swap"},{"acceptance":0.48643194781022236,"acs":0,"articleLive":2,"columnArticles":660,"formTitle":"[671]二叉树中第二小的节点","frequency":47.02093428419921,"frontendQuestionId":"671","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中第二小的节点","titleSlug":"second-minimum-node-in-a-binary-tree"},{"acceptance":0.5497995683009559,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[672]灯泡开关 Ⅱ","frequency":5.522175928223974,"frontendQuestionId":"672","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 Ⅱ","titleSlug":"bulb-switcher-ii"},{"acceptance":0.3919969759153256,"acs":0,"articleLive":2,"columnArticles":272,"formTitle":"[673]最长递增子序列的个数","frequency":54.212181038711336,"frontendQuestionId":"673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长递增子序列的个数","titleSlug":"number-of-longest-increasing-subsequence"},{"acceptance":0.49353246953062324,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[674]最长连续递增序列","frequency":35.68497562644718,"frontendQuestionId":"674","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续递增序列","titleSlug":"longest-continuous-increasing-subsequence"},{"acceptance":0.3996316758747698,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[675]为高尔夫比赛砍树","frequency":7.211508204687712,"frontendQuestionId":"675","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"为高尔夫比赛砍树","titleSlug":"cut-off-trees-for-golf-event"},{"acceptance":0.5883678599289244,"acs":0,"articleLive":2,"columnArticles":120,"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.6165781083953241,"acs":0,"articleLive":2,"columnArticles":238,"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.3842609467732137,"acs":0,"articleLive":2,"columnArticles":454,"formTitle":"[678]有效的括号字符串","frequency":58.527268521626674,"frontendQuestionId":"678","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有效的括号字符串","titleSlug":"valid-parenthesis-string"},{"acceptance":0.5413378268845186,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[679]24 点游戏","frequency":70.57085010357656,"frontendQuestionId":"679","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"24 点游戏","titleSlug":"24-game"},{"acceptance":0.4015308056872038,"acs":0,"articleLive":2,"columnArticles":806,"formTitle":"[680]验证回文字符串 Ⅱ","frequency":47.67636054432939,"frontendQuestionId":"680","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证回文字符串 Ⅱ","titleSlug":"valid-palindrome-ii"},{"acceptance":0.5001999200319872,"acs":0,"articleLive":2,"columnArticles":61,"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.6951322604939979,"acs":0,"articleLive":2,"columnArticles":507,"formTitle":"[682]棒球比赛","frequency":30.333498337885196,"frontendQuestionId":"682","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"棒球比赛","titleSlug":"baseball-game"},{"acceptance":0.43069804868235767,"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.6654203066045753,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[684]冗余连接","frequency":29.055575031812968,"frontendQuestionId":"684","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接","titleSlug":"redundant-connection"},{"acceptance":0.4322790474319516,"acs":0,"articleLive":2,"columnArticles":253,"formTitle":"[685]冗余连接 II","frequency":31.008249446544394,"frontendQuestionId":"685","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"冗余连接 II","titleSlug":"redundant-connection-ii"},{"acceptance":0.3552121136278313,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[686]重复叠加字符串匹配","frequency":5.522175928223974,"frontendQuestionId":"686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重复叠加字符串匹配","titleSlug":"repeated-string-match"},{"acceptance":0.4405388537581988,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[687]最长同值路径","frequency":51.33164110939982,"frontendQuestionId":"687","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长同值路径","titleSlug":"longest-univalue-path"},{"acceptance":0.5115659519168291,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[688]“马”在棋盘上的概率","frequency":17.40322030163009,"frontendQuestionId":"688","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"“马”在棋盘上的概率","titleSlug":"knight-probability-in-chessboard"},{"acceptance":0.4850700792199878,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[689]三个无重叠子数组的最大和","frequency":36.78166698742219,"frontendQuestionId":"689","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三个无重叠子数组的最大和","titleSlug":"maximum-sum-of-3-non-overlapping-subarrays"},{"acceptance":0.6470698546647914,"acs":0,"articleLive":2,"columnArticles":561,"formTitle":"[690]员工的重要性","frequency":65.18042779242727,"frontendQuestionId":"690","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"员工的重要性","titleSlug":"employee-importance"},{"acceptance":0.49057134815648745,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[691]贴纸拼词","frequency":7.211508204687712,"frontendQuestionId":"691","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"贴纸拼词","titleSlug":"stickers-to-spell-word"},{"acceptance":0.5789588192292965,"acs":0,"articleLive":2,"columnArticles":726,"formTitle":"[692]前K个高频单词","frequency":64.49095551414584,"frontendQuestionId":"692","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"前K个高频单词","titleSlug":"top-k-frequent-words"},{"acceptance":0.6097351876547914,"acs":0,"articleLive":2,"columnArticles":276,"formTitle":"[693]交替位二进制数","frequency":6.061429485312524,"frontendQuestionId":"693","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替位二进制数","titleSlug":"binary-number-with-alternating-bits"},{"acceptance":0.5308423913043478,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[694]不同岛屿的数量","frequency":6.061429485312524,"frontendQuestionId":"694","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同岛屿的数量","titleSlug":"number-of-distinct-islands"},{"acceptance":0.6634679109664696,"acs":0,"articleLive":2,"columnArticles":1230,"formTitle":"[695]岛屿的最大面积","frequency":64.90948007813166,"frontendQuestionId":"695","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"岛屿的最大面积","titleSlug":"max-area-of-island"},{"acceptance":0.6312802990119284,"acs":0,"articleLive":2,"columnArticles":471,"formTitle":"[696]计数二进制子串","frequency":24.230923379013827,"frontendQuestionId":"696","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计数二进制子串","titleSlug":"count-binary-substrings"},{"acceptance":0.6055499765065736,"acs":0,"articleLive":2,"columnArticles":834,"formTitle":"[697]数组的度","frequency":24.866724145644405,"frontendQuestionId":"697","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的度","titleSlug":"degree-of-an-array"},{"acceptance":0.44471621979528564,"acs":0,"articleLive":2,"columnArticles":209,"formTitle":"[698]划分为k个相等的子集","frequency":57.13142152277937,"frontendQuestionId":"698","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分为k个相等的子集","titleSlug":"partition-to-k-equal-sum-subsets"},{"acceptance":0.47546442341395023,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[699]掉落的方块","frequency":0.0,"frontendQuestionId":"699","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"掉落的方块","titleSlug":"falling-squares"},{"acceptance":0.759103559964701,"acs":0,"articleLive":2,"columnArticles":498,"formTitle":"[700]二叉搜索树中的搜索","frequency":22.454106114617538,"frontendQuestionId":"700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的搜索","titleSlug":"search-in-a-binary-search-tree"},{"acceptance":0.7238958007793184,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[701]二叉搜索树中的插入操作","frequency":31.008249446544394,"frontendQuestionId":"701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的插入操作","titleSlug":"insert-into-a-binary-search-tree"},{"acceptance":0.7411806417301897,"acs":0,"articleLive":2,"columnArticles":76,"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.5127991891681176,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[703]数据流中的第 K 大元素","frequency":33.990080073438854,"frontendQuestionId":"703","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数据流中的第 K 大元素","titleSlug":"kth-largest-element-in-a-stream"},{"acceptance":0.559281922130188,"acs":0,"articleLive":2,"columnArticles":1333,"formTitle":"[704]二分查找","frequency":68.90111084462124,"frontendQuestionId":"704","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二分查找","titleSlug":"binary-search"},{"acceptance":0.6458930512997925,"acs":0,"articleLive":2,"columnArticles":426,"formTitle":"[705]设计哈希集合","frequency":45.57266560129181,"frontendQuestionId":"705","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希集合","titleSlug":"design-hashset"},{"acceptance":0.6447294201613925,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[706]设计哈希映射","frequency":29.055575031812968,"frontendQuestionId":"706","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计哈希映射","titleSlug":"design-hashmap"},{"acceptance":0.319366566676913,"acs":0,"articleLive":2,"columnArticles":423,"formTitle":"[707]设计链表","frequency":60.20244214546591,"frontendQuestionId":"707","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计链表","titleSlug":"design-linked-list"},{"acceptance":0.33550230122202823,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[708]循环有序列表的插入","frequency":7.211508204687712,"frontendQuestionId":"708","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环有序列表的插入","titleSlug":"insert-into-a-sorted-circular-linked-list"},{"acceptance":0.7593262173338818,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[709]转换成小写字母","frequency":6.061429485312524,"frontendQuestionId":"709","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换成小写字母","titleSlug":"to-lower-case"},{"acceptance":0.3503798536859876,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[710]黑名单中的随机数","frequency":25.52684182318494,"frontendQuestionId":"710","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑名单中的随机数","titleSlug":"random-pick-with-blacklist"},{"acceptance":0.5724876441515651,"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.6717984281091077,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[712]两个字符串的最小ASCII删除和","frequency":36.04340313970188,"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.4084456525842866,"acs":0,"articleLive":2,"columnArticles":200,"formTitle":"[713]乘积小于K的子数组","frequency":36.90760470819734,"frontendQuestionId":"713","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"乘积小于K的子数组","titleSlug":"subarray-product-less-than-k"},{"acceptance":0.7193323791633122,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[714]买卖股票的最佳时机含手续费","frequency":44.600867017579276,"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.4032101167315175,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[715]Range 模块","frequency":7.211508204687712,"frontendQuestionId":"715","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Range 模块","titleSlug":"range-module"},{"acceptance":0.4606185068857212,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[716]最大栈","frequency":18.694466070773423,"frontendQuestionId":"716","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大栈","titleSlug":"max-stack"},{"acceptance":0.5110588389035905,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[717]1比特与2比特字符","frequency":17.40322030163009,"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.5646631756827238,"acs":0,"articleLive":2,"columnArticles":569,"formTitle":"[718]最长重复子数组","frequency":68.58622239402918,"frontendQuestionId":"718","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子数组","titleSlug":"maximum-length-of-repeated-subarray"},{"acceptance":0.3683510638297872,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[719]找出第 k 小的距离对","frequency":24.866724145644405,"frontendQuestionId":"719","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"找出第 k 小的距离对","titleSlug":"find-k-th-smallest-pair-distance"},{"acceptance":0.48591099090238504,"acs":0,"articleLive":2,"columnArticles":260,"formTitle":"[720]词典中最长的单词","frequency":8.469811387364896,"frontendQuestionId":"720","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"词典中最长的单词","titleSlug":"longest-word-in-dictionary"},{"acceptance":0.46906292648437115,"acs":0,"articleLive":2,"columnArticles":334,"formTitle":"[721]账户合并","frequency":37.550349817636906,"frontendQuestionId":"721","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"账户合并","titleSlug":"accounts-merge"},{"acceptance":0.32266772006057015,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[722]删除注释","frequency":38.90599085929966,"frontendQuestionId":"722","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除注释","titleSlug":"remove-comments"},{"acceptance":0.7219036697247706,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[723]粉碎糖果","frequency":0.0,"frontendQuestionId":"723","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉碎糖果","titleSlug":"candy-crush"},{"acceptance":0.45933147250245177,"acs":0,"articleLive":2,"columnArticles":841,"formTitle":"[724]寻找数组的中心下标","frequency":36.04340313970188,"frontendQuestionId":"724","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找数组的中心下标","titleSlug":"find-pivot-index"},{"acceptance":0.562592705954371,"acs":0,"articleLive":2,"columnArticles":309,"formTitle":"[725]分隔链表","frequency":16.794658773886972,"frontendQuestionId":"725","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分隔链表","titleSlug":"split-linked-list-in-parts"},{"acceptance":0.5540252878869483,"acs":0,"articleLive":2,"columnArticles":393,"formTitle":"[726]原子的数量","frequency":52.71925717990641,"frontendQuestionId":"726","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"原子的数量","titleSlug":"number-of-atoms"},{"acceptance":0.40796239165564857,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[727]最小窗口子序列","frequency":31.709178233000372,"frontendQuestionId":"727","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小窗口子序列","titleSlug":"minimum-window-subsequence"},{"acceptance":0.7594363133807603,"acs":0,"articleLive":2,"columnArticles":303,"formTitle":"[728]自除数","frequency":6.061429485312524,"frontendQuestionId":"728","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"自除数","titleSlug":"self-dividing-numbers"},{"acceptance":0.5103065883887802,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[729]我的日程安排表 I","frequency":25.52684182318494,"frontendQuestionId":"729","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 I","titleSlug":"my-calendar-i"},{"acceptance":0.4897338403041825,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[730]统计不同回文子序列","frequency":39.622276849619915,"frontendQuestionId":"730","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不同回文子序列","titleSlug":"count-different-palindromic-subsequences"},{"acceptance":0.5105180120957139,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[731]我的日程安排表 II","frequency":6.061429485312524,"frontendQuestionId":"731","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 II","titleSlug":"my-calendar-ii"},{"acceptance":0.6104672897196262,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[732]我的日程安排表 III","frequency":16.794658773886972,"frontendQuestionId":"732","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"我的日程安排表 III","titleSlug":"my-calendar-iii"},{"acceptance":0.5805281799306659,"acs":0,"articleLive":2,"columnArticles":524,"formTitle":"[733]图像渲染","frequency":46.50067431446574,"frontendQuestionId":"733","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"图像渲染","titleSlug":"flood-fill"},{"acceptance":0.47778587035688275,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[734]句子相似性","frequency":0.0,"frontendQuestionId":"734","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"句子相似性","titleSlug":"sentence-similarity"},{"acceptance":0.4116013427032771,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[735]行星碰撞","frequency":33.35349327229824,"frontendQuestionId":"735","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"行星碰撞","titleSlug":"asteroid-collision"},{"acceptance":0.4598496240601504,"acs":0,"articleLive":2,"columnArticles":46,"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.46150079569102703,"acs":0,"articleLive":2,"columnArticles":65,"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.5022515238213708,"acs":0,"articleLive":2,"columnArticles":580,"formTitle":"[738]单调递增的数字","frequency":24.230923379013827,"frontendQuestionId":"738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"单调递增的数字","titleSlug":"monotone-increasing-digits"},{"acceptance":0.6787745174076482,"acs":0,"articleLive":2,"columnArticles":1476,"formTitle":"[739]每日温度","frequency":82.79672438130493,"frontendQuestionId":"739","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"每日温度","titleSlug":"daily-temperatures"},{"acceptance":0.629832944986375,"acs":0,"articleLive":2,"columnArticles":559,"formTitle":"[740]删除并获得点数","frequency":63.27715465457088,"frontendQuestionId":"740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除并获得点数","titleSlug":"delete-and-earn"},{"acceptance":0.3664280331574981,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[741]摘樱桃","frequency":25.52684182318494,"frontendQuestionId":"741","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃","titleSlug":"cherry-pickup"},{"acceptance":0.4917600527356625,"acs":0,"articleLive":2,"columnArticles":43,"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.5190450342529854,"acs":0,"articleLive":2,"columnArticles":515,"formTitle":"[743]网络延迟时间","frequency":50.03572266522871,"frontendQuestionId":"743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"网络延迟时间","titleSlug":"network-delay-time"},{"acceptance":0.4590934091117426,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[744]寻找比目标字母大的最小字母","frequency":26.92735682920287,"frontendQuestionId":"744","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找比目标字母大的最小字母","titleSlug":"find-smallest-letter-greater-than-target"},{"acceptance":0.39057002111189304,"acs":0,"articleLive":2,"columnArticles":54,"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.5839798594548162,"acs":0,"articleLive":2,"columnArticles":1237,"formTitle":"[746]使用最小花费爬楼梯","frequency":50.03572266522871,"frontendQuestionId":"746","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"使用最小花费爬楼梯","titleSlug":"min-cost-climbing-stairs"},{"acceptance":0.4155009766800285,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[747]至少是其他数字两倍的最大数","frequency":6.061429485312524,"frontendQuestionId":"747","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"至少是其他数字两倍的最大数","titleSlug":"largest-number-at-least-twice-of-others"},{"acceptance":0.5999803285138192,"acs":0,"articleLive":2,"columnArticles":169,"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.5054054054054054,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[749]隔离病毒","frequency":0.0,"frontendQuestionId":"749","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"隔离病毒","titleSlug":"contain-virus"},{"acceptance":0.7210172026925954,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[750]角矩形的数量","frequency":20.097446297355418,"frontendQuestionId":"750","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"角矩形的数量","titleSlug":"number-of-corner-rectangles"},{"acceptance":0.5045537340619308,"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.530756740722237,"acs":0,"articleLive":2,"columnArticles":573,"formTitle":"[752]打开转盘锁","frequency":42.67041338153945,"frontendQuestionId":"752","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"打开转盘锁","titleSlug":"open-the-lock"},{"acceptance":0.5895410082768999,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[753]破解保险箱","frequency":6.061429485312524,"frontendQuestionId":"753","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"破解保险箱","titleSlug":"cracking-the-safe"},{"acceptance":0.42928161704452333,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[754]到达终点数字","frequency":0.0,"frontendQuestionId":"754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点数字","titleSlug":"reach-a-number"},{"acceptance":0.5021645021645021,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[755]倒水","frequency":0.0,"frontendQuestionId":"755","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"倒水","titleSlug":"pour-water"},{"acceptance":0.5691046658259773,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[756]金字塔转换矩阵","frequency":9.145226304517246,"frontendQuestionId":"756","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"金字塔转换矩阵","titleSlug":"pyramid-transition-matrix"},{"acceptance":0.416127339513731,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[757]设置交集大小至少为2","frequency":10.602574332326324,"frontendQuestionId":"757","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设置交集大小至少为2","titleSlug":"set-intersection-size-at-least-two"},{"acceptance":0.45931932996543473,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[758]字符串中的加粗单词","frequency":13.064156305005737,"frontendQuestionId":"758","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的加粗单词","titleSlug":"bold-words-in-string"},{"acceptance":0.6580976863753213,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[759]员工空闲时间","frequency":6.62395241264668,"frontendQuestionId":"759","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"员工空闲时间","titleSlug":"employee-free-time"},{"acceptance":0.8391894804914852,"acs":0,"articleLive":2,"columnArticles":90,"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.5895522388059702,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[761]特殊的二进制序列","frequency":10.602574332326324,"frontendQuestionId":"761","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊的二进制序列","titleSlug":"special-binary-string"},{"acceptance":0.6987841339445884,"acs":0,"articleLive":2,"columnArticles":138,"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.7634288034179773,"acs":0,"articleLive":2,"columnArticles":952,"formTitle":"[763]划分字母区间","frequency":66.44011489339573,"frontendQuestionId":"763","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"划分字母区间","titleSlug":"partition-labels"},{"acceptance":0.49546608632571637,"acs":0,"articleLive":2,"columnArticles":53,"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.6656022953399047,"acs":0,"articleLive":2,"columnArticles":435,"formTitle":"[765]情侣牵手","frequency":55.82729559973928,"frontendQuestionId":"765","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"情侣牵手","titleSlug":"couples-holding-hands"},{"acceptance":0.7081038961038961,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[766]托普利茨矩阵","frequency":0.0,"frontendQuestionId":"766","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"托普利茨矩阵","titleSlug":"toeplitz-matrix"},{"acceptance":0.4779529081854663,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[767]重构字符串","frequency":36.04340313970188,"frontendQuestionId":"767","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构字符串","titleSlug":"reorganize-string"},{"acceptance":0.5004661763182431,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[768]最多能完成排序的块 II","frequency":25.52684182318494,"frontendQuestionId":"768","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块 II","titleSlug":"max-chunks-to-make-sorted-ii"},{"acceptance":0.5879866299646087,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[769]最多能完成排序的块","frequency":0.0,"frontendQuestionId":"769","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最多能完成排序的块","titleSlug":"max-chunks-to-make-sorted"},{"acceptance":0.5529188419553868,"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.8515594312200487,"acs":0,"articleLive":2,"columnArticles":1104,"formTitle":"[771]宝石与石头","frequency":42.578812263600504,"frontendQuestionId":"771","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"宝石与石头","titleSlug":"jewels-and-stones"},{"acceptance":0.4905928589346935,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[772]基本计算器 III","frequency":19.380911113840813,"frontendQuestionId":"772","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"基本计算器 III","titleSlug":"basic-calculator-iii"},{"acceptance":0.7139483578286673,"acs":0,"articleLive":2,"columnArticles":325,"formTitle":"[773]滑动谜题","frequency":52.459567539501606,"frontendQuestionId":"773","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"滑动谜题","titleSlug":"sliding-puzzle"},{"acceptance":0.5888268156424581,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[774]最小化去加油站的最大距离","frequency":13.85285561433601,"frontendQuestionId":"774","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小化去加油站的最大距离","titleSlug":"minimize-max-distance-to-gas-station"},{"acceptance":0.4610407616230705,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[775]全局倒置与局部倒置","frequency":7.826061825326265,"frontendQuestionId":"775","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"全局倒置与局部倒置","titleSlug":"global-and-local-inversions"},{"acceptance":0.5693857653558662,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[776]拆分二叉搜索树","frequency":0.0,"frontendQuestionId":"776","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拆分二叉搜索树","titleSlug":"split-bst"},{"acceptance":0.3233947646437375,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[777]在LR字符串中交换相邻字符","frequency":17.40322030163009,"frontendQuestionId":"777","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在LR字符串中交换相邻字符","titleSlug":"swap-adjacent-in-lr-string"},{"acceptance":0.5956272934896969,"acs":0,"articleLive":2,"columnArticles":346,"formTitle":"[778]水位上升的泳池中游泳","frequency":7.826061825326265,"frontendQuestionId":"778","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水位上升的泳池中游泳","titleSlug":"swim-in-rising-water"},{"acceptance":0.4360574795630808,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[779]第K个语法符号","frequency":35.33334009083937,"frontendQuestionId":"779","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第K个语法符号","titleSlug":"k-th-symbol-in-grammar"},{"acceptance":0.2847127378676136,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[780]到达终点","frequency":20.097446297355418,"frontendQuestionId":"780","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"到达终点","titleSlug":"reaching-points"},{"acceptance":0.6195888472256671,"acs":0,"articleLive":2,"columnArticles":650,"formTitle":"[781]森林中的兔子","frequency":90.77039325483518,"frontendQuestionId":"781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"森林中的兔子","titleSlug":"rabbits-in-forest"},{"acceptance":0.4226560189293109,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[782]变为棋盘","frequency":33.990080073438854,"frontendQuestionId":"782","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变为棋盘","titleSlug":"transform-to-chessboard"},{"acceptance":0.5957330935935893,"acs":0,"articleLive":2,"columnArticles":664,"formTitle":"[783]二叉搜索树节点最小距离","frequency":33.990080073438854,"frontendQuestionId":"783","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树节点最小距离","titleSlug":"minimum-distance-between-bst-nodes"},{"acceptance":0.6852473988062233,"acs":0,"articleLive":2,"columnArticles":458,"formTitle":"[784]字母大小写全排列","frequency":28.449342063288796,"frontendQuestionId":"784","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字母大小写全排列","titleSlug":"letter-case-permutation"},{"acceptance":0.5119524235239242,"acs":0,"articleLive":2,"columnArticles":402,"formTitle":"[785]判断二分图","frequency":43.22942487860522,"frontendQuestionId":"785","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"判断二分图","titleSlug":"is-graph-bipartite"},{"acceptance":0.46803445930627974,"acs":0,"articleLive":2,"columnArticles":56,"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.39215537444139775,"acs":0,"articleLive":2,"columnArticles":392,"formTitle":"[787]K 站中转内最便宜的航班","frequency":32.65205722507952,"frontendQuestionId":"787","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"K 站中转内最便宜的航班","titleSlug":"cheapest-flights-within-k-stops"},{"acceptance":0.6073692946058091,"acs":0,"articleLive":2,"columnArticles":189,"formTitle":"[788]旋转数字","frequency":18.035896247680004,"frontendQuestionId":"788","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转数字","titleSlug":"rotated-digits"},{"acceptance":0.6923537632261928,"acs":0,"articleLive":2,"columnArticles":294,"formTitle":"[789]逃脱阻碍者","frequency":21.51669902303324,"frontendQuestionId":"789","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"逃脱阻碍者","titleSlug":"escape-the-ghosts"},{"acceptance":0.44886566100486996,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[790]多米诺和托米诺平铺","frequency":6.62395241264668,"frontendQuestionId":"790","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多米诺和托米诺平铺","titleSlug":"domino-and-tromino-tiling"},{"acceptance":0.6949862465616404,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[791]自定义字符串排序","frequency":34.64949327968721,"frontendQuestionId":"791","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"自定义字符串排序","titleSlug":"custom-sort-string"},{"acceptance":0.4512554205257241,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[792]匹配子序列的单词数","frequency":15.643615799953498,"frontendQuestionId":"792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"匹配子序列的单词数","titleSlug":"number-of-matching-subsequences"},{"acceptance":0.3944435470844775,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[793]阶乘函数后 K 个零","frequency":6.061429485312524,"frontendQuestionId":"793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘函数后 K 个零","titleSlug":"preimage-size-of-factorial-zeroes-function"},{"acceptance":0.34041244915334407,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[794]有效的井字游戏","frequency":6.061429485312524,"frontendQuestionId":"794","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的井字游戏","titleSlug":"valid-tic-tac-toe-state"},{"acceptance":0.5355885398688298,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[795]区间子数组个数","frequency":19.380911113840813,"frontendQuestionId":"795","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"区间子数组个数","titleSlug":"number-of-subarrays-with-bounded-maximum"},{"acceptance":0.5270370199195822,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[796]旋转字符串","frequency":41.94961522499853,"frontendQuestionId":"796","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转字符串","titleSlug":"rotate-string"},{"acceptance":0.7948174141055797,"acs":0,"articleLive":2,"columnArticles":511,"formTitle":"[797]所有可能的路径","frequency":25.28387711139017,"frontendQuestionId":"797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"所有可能的路径","titleSlug":"all-paths-from-source-to-target"},{"acceptance":0.4530308401276143,"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.40721153846153846,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[799]香槟塔","frequency":50.26505379655652,"frontendQuestionId":"799","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"香槟塔","titleSlug":"champagne-tower"},{"acceptance":0.706028898854011,"acs":0,"articleLive":2,"columnArticles":36,"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.41817536386226484,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[801]使序列递增的最小交换次数","frequency":0.0,"frontendQuestionId":"801","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"使序列递增的最小交换次数","titleSlug":"minimum-swaps-to-make-sequences-increasing"},{"acceptance":0.5765267890595729,"acs":0,"articleLive":2,"columnArticles":332,"formTitle":"[802]找到最终的安全状态","frequency":46.94945697795271,"frontendQuestionId":"802","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到最终的安全状态","titleSlug":"find-eventual-safe-states"},{"acceptance":0.4827353548182251,"acs":0,"articleLive":2,"columnArticles":125,"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.7703426229186687,"acs":0,"articleLive":2,"columnArticles":392,"formTitle":"[804]唯一摩尔斯密码词","frequency":24.230923379013827,"frontendQuestionId":"804","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一摩尔斯密码词","titleSlug":"unique-morse-code-words"},{"acceptance":0.2897959183673469,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[805]数组的均值分割","frequency":9.145226304517246,"frontendQuestionId":"805","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的均值分割","titleSlug":"split-array-with-same-average"},{"acceptance":0.657436154231347,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[806]写字符串需要的行数","frequency":17.40322030163009,"frontendQuestionId":"806","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"写字符串需要的行数","titleSlug":"number-of-lines-to-write-string"},{"acceptance":0.8443425713690352,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[807]保持城市天际线","frequency":5.522175928223974,"frontendQuestionId":"807","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保持城市天际线","titleSlug":"max-increase-to-keep-city-skyline"},{"acceptance":0.4795237035388382,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[808]分汤","frequency":31.008249446544394,"frontendQuestionId":"808","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分汤","titleSlug":"soup-servings"},{"acceptance":0.419121538190157,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[809]情感丰富的文字","frequency":16.794658773886972,"frontendQuestionId":"809","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"情感丰富的文字","titleSlug":"expressive-words"},{"acceptance":0.7357494407158837,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[810]黑板异或游戏","frequency":41.255068326624084,"frontendQuestionId":"810","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"黑板异或游戏","titleSlug":"chalkboard-xor-game"},{"acceptance":0.7039956262244293,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[811]子域名访问计数","frequency":16.794658773886972,"frontendQuestionId":"811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子域名访问计数","titleSlug":"subdomain-visit-count"},{"acceptance":0.6303673664122137,"acs":0,"articleLive":2,"columnArticles":94,"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.548174648345394,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[813]最大平均值和的分组","frequency":6.061429485312524,"frontendQuestionId":"813","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均值和的分组","titleSlug":"largest-sum-of-averages"},{"acceptance":0.7000906448285562,"acs":0,"articleLive":2,"columnArticles":342,"formTitle":"[814]二叉树剪枝","frequency":5.004603235121968,"frontendQuestionId":"814","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"binary-tree-pruning"},{"acceptance":0.4349477996564028,"acs":0,"articleLive":2,"columnArticles":313,"formTitle":"[815]公交路线","frequency":73.62351222464605,"frontendQuestionId":"815","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"公交路线","titleSlug":"bus-routes"},{"acceptance":0.508405203917556,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[816]模糊坐标","frequency":8.469811387364896,"frontendQuestionId":"816","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模糊坐标","titleSlug":"ambiguous-coordinates"},{"acceptance":0.5914250243859183,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[817]链表组件","frequency":6.061429485312524,"frontendQuestionId":"817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表组件","titleSlug":"linked-list-components"},{"acceptance":0.43023255813953487,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[818]赛车","frequency":0.0,"frontendQuestionId":"818","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"赛车","titleSlug":"race-car"},{"acceptance":0.420881495727343,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[819]最常见的单词","frequency":17.40322030163009,"frontendQuestionId":"819","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最常见的单词","titleSlug":"most-common-word"},{"acceptance":0.5067621915860753,"acs":0,"articleLive":2,"columnArticles":597,"formTitle":"[820]单词的压缩编码","frequency":38.90599085929966,"frontendQuestionId":"820","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词的压缩编码","titleSlug":"short-encoding-of-words"},{"acceptance":0.6933837536606864,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[821]字符的最短距离","frequency":35.33334009083937,"frontendQuestionId":"821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符的最短距离","titleSlug":"shortest-distance-to-a-character"},{"acceptance":0.5018935978358882,"acs":0,"articleLive":2,"columnArticles":38,"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.42953020134228187,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[823]带因子的二叉树","frequency":19.380911113840813,"frontendQuestionId":"823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"带因子的二叉树","titleSlug":"binary-trees-with-factors"},{"acceptance":0.6146065744459319,"acs":0,"articleLive":2,"columnArticles":237,"formTitle":"[824]山羊拉丁文","frequency":6.061429485312524,"frontendQuestionId":"824","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"山羊拉丁文","titleSlug":"goat-latin"},{"acceptance":0.391171808316059,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[825]适龄的朋友","frequency":6.62395241264668,"frontendQuestionId":"825","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"适龄的朋友","titleSlug":"friends-of-appropriate-ages"},{"acceptance":0.3723377599599098,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[826]安排工作以达到最大收益","frequency":17.40322030163009,"frontendQuestionId":"826","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排工作以达到最大收益","titleSlug":"most-profit-assigning-work"},{"acceptance":0.39113958314535774,"acs":0,"articleLive":2,"columnArticles":177,"formTitle":"[827]最大人工岛","frequency":30.333498337885196,"frontendQuestionId":"827","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大人工岛","titleSlug":"making-a-large-island"},{"acceptance":0.4918815663801337,"acs":0,"articleLive":2,"columnArticles":53,"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.3623857205050065,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[829]连续整数求和","frequency":30.333498337885196,"frontendQuestionId":"829","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续整数求和","titleSlug":"consecutive-numbers-sum"},{"acceptance":0.5431814356643945,"acs":0,"articleLive":2,"columnArticles":578,"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.4041662074286344,"acs":0,"articleLive":2,"columnArticles":71,"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.7955570917447476,"acs":0,"articleLive":2,"columnArticles":913,"formTitle":"[832]翻转图像","frequency":47.02093428419921,"frontendQuestionId":"832","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转图像","titleSlug":"flipping-an-image"},{"acceptance":0.4267886144114882,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[833]字符串中的查找与替换","frequency":6.061429485312524,"frontendQuestionId":"833","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中的查找与替换","titleSlug":"find-and-replace-in-string"},{"acceptance":0.5289312186179963,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[834]树中距离之和","frequency":25.52684182318494,"frontendQuestionId":"834","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"树中距离之和","titleSlug":"sum-of-distances-in-tree"},{"acceptance":0.5733606557377049,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[835]图像重叠","frequency":0.0,"frontendQuestionId":"835","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"图像重叠","titleSlug":"image-overlap"},{"acceptance":0.47821218984865643,"acs":0,"articleLive":2,"columnArticles":651,"formTitle":"[836]矩形重叠","frequency":18.694466070773423,"frontendQuestionId":"836","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形重叠","titleSlug":"rectangle-overlap"},{"acceptance":0.39646126941672666,"acs":0,"articleLive":2,"columnArticles":241,"formTitle":"[837]新21点","frequency":18.035896247680004,"frontendQuestionId":"837","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"新21点","titleSlug":"new-21-game"},{"acceptance":0.5004689416348027,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[838]推多米诺","frequency":33.35349327229824,"frontendQuestionId":"838","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推多米诺","titleSlug":"push-dominoes"},{"acceptance":0.5747534516765286,"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.3588315984830146,"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.6565298192262207,"acs":0,"articleLive":2,"columnArticles":534,"formTitle":"[841]钥匙和房间","frequency":25.52684182318494,"frontendQuestionId":"841","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"钥匙和房间","titleSlug":"keys-and-rooms"},{"acceptance":0.48916731923779694,"acs":0,"articleLive":2,"columnArticles":319,"formTitle":"[842]将数组拆分成斐波那契序列","frequency":43.90290732822527,"frontendQuestionId":"842","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将数组拆分成斐波那契序列","titleSlug":"split-array-into-fibonacci-sequence"},{"acceptance":0.37829176536157166,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[843]猜猜这个单词","frequency":7.211508204687712,"frontendQuestionId":"843","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猜猜这个单词","titleSlug":"guess-the-word"},{"acceptance":0.5143051771117166,"acs":0,"articleLive":2,"columnArticles":955,"formTitle":"[844]比较含退格的字符串","frequency":29.055575031812968,"frontendQuestionId":"844","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"比较含退格的字符串","titleSlug":"backspace-string-compare"},{"acceptance":0.4208770203476864,"acs":0,"articleLive":2,"columnArticles":551,"formTitle":"[845]数组中的最长山脉","frequency":38.90599085929966,"frontendQuestionId":"845","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的最长山脉","titleSlug":"longest-mountain-in-array"},{"acceptance":0.5110495574155477,"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.6832001775410563,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[847]访问所有节点的最短路径","frequency":56.51214290289459,"frontendQuestionId":"847","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"访问所有节点的最短路径","titleSlug":"shortest-path-visiting-all-nodes"},{"acceptance":0.44790553265129535,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[848]字母移位","frequency":6.061429485312524,"frontendQuestionId":"848","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母移位","titleSlug":"shifting-letters"},{"acceptance":0.42602606391607634,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[849]到最近的人的最大距离","frequency":0.0,"frontendQuestionId":"849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到最近的人的最大距离","titleSlug":"maximize-distance-to-closest-person"},{"acceptance":0.4479638009049774,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[850]矩形面积 II","frequency":17.40322030163009,"frontendQuestionId":"850","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积 II","titleSlug":"rectangle-area-ii"},{"acceptance":0.47863051470588236,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[851]喧闹和富有","frequency":6.62395241264668,"frontendQuestionId":"851","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"喧闹和富有","titleSlug":"loud-and-rich"},{"acceptance":0.7148816244214808,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[852]山脉数组的峰顶索引","frequency":60.91399886896638,"frontendQuestionId":"852","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"山脉数组的峰顶索引","titleSlug":"peak-index-in-a-mountain-array"},{"acceptance":0.38308285163776495,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[853]车队","frequency":35.33334009083937,"frontendQuestionId":"853","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"车队","titleSlug":"car-fleet"},{"acceptance":0.35842593366196007,"acs":0,"articleLive":2,"columnArticles":66,"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.4073741813940971,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[855]考场就座","frequency":16.208607595358924,"frontendQuestionId":"855","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"考场就座","titleSlug":"exam-room"},{"acceptance":0.6261229591438169,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[856]括号的分数","frequency":43.90290732822527,"frontendQuestionId":"856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"括号的分数","titleSlug":"score-of-parentheses"},{"acceptance":0.465982636148382,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[857]雇佣 K 名工人的最低成本","frequency":26.213058161373958,"frontendQuestionId":"857","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"雇佣 K 名工人的最低成本","titleSlug":"minimum-cost-to-hire-k-workers"},{"acceptance":0.5546518547907161,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[858]镜面反射","frequency":31.709178233000372,"frontendQuestionId":"858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"镜面反射","titleSlug":"mirror-reflection"},{"acceptance":0.3016574342741581,"acs":0,"articleLive":2,"columnArticles":354,"formTitle":"[859]亲密字符串","frequency":0.0,"frontendQuestionId":"859","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"亲密字符串","titleSlug":"buddy-strings"},{"acceptance":0.5873824766292556,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[860]柠檬水找零","frequency":29.055575031812968,"frontendQuestionId":"860","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"柠檬水找零","titleSlug":"lemonade-change"},{"acceptance":0.8090593956953642,"acs":0,"articleLive":2,"columnArticles":437,"formTitle":"[861]翻转矩阵后的得分","frequency":5.004603235121968,"frontendQuestionId":"861","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"翻转矩阵后的得分","titleSlug":"score-after-flipping-matrix"},{"acceptance":0.18994621779986284,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[862]和至少为 K 的最短子数组","frequency":51.70046581444997,"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.6034242032880729,"acs":0,"articleLive":2,"columnArticles":557,"formTitle":"[863]二叉树中所有距离为 K 的结点","frequency":57.95711561374669,"frontendQuestionId":"863","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中所有距离为 K 的结点","titleSlug":"all-nodes-distance-k-in-binary-tree"},{"acceptance":0.4536652835408022,"acs":0,"articleLive":2,"columnArticles":42,"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.6553731343283582,"acs":0,"articleLive":2,"columnArticles":126,"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.2240945597817851,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[866]回文素数","frequency":18.694466070773423,"frontendQuestionId":"866","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文素数","titleSlug":"prime-palindrome"},{"acceptance":0.6703672075149445,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[867]转置矩阵","frequency":41.255068326624084,"frontendQuestionId":"867","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转置矩阵","titleSlug":"transpose-matrix"},{"acceptance":0.6248689371286552,"acs":0,"articleLive":2,"columnArticles":229,"formTitle":"[868]二进制间距","frequency":0.0,"frontendQuestionId":"868","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制间距","titleSlug":"binary-gap"},{"acceptance":0.5511660285415941,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[869]重新排序得到 2 的幂","frequency":6.061429485312524,"frontendQuestionId":"869","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排序得到 2 的幂","titleSlug":"reordered-power-of-2"},{"acceptance":0.427010775733762,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[870]优势洗牌","frequency":6.061429485312524,"frontendQuestionId":"870","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"优势洗牌","titleSlug":"advantage-shuffle"},{"acceptance":0.3407264066686514,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[871]最低加油次数","frequency":40.366785410000055,"frontendQuestionId":"871","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最低加油次数","titleSlug":"minimum-number-of-refueling-stops"},{"acceptance":0.6520282762370854,"acs":0,"articleLive":2,"columnArticles":712,"formTitle":"[872]叶子相似的树","frequency":53.90441631970759,"frontendQuestionId":"872","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"叶子相似的树","titleSlug":"leaf-similar-trees"},{"acceptance":0.5090293843444632,"acs":0,"articleLive":2,"columnArticles":106,"formTitle":"[873]最长的斐波那契子序列的长度","frequency":42.67041338153945,"frontendQuestionId":"873","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的斐波那契子序列的长度","titleSlug":"length-of-longest-fibonacci-subsequence"},{"acceptance":0.41451712118105394,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[874]模拟行走机器人","frequency":38.21594276395469,"frontendQuestionId":"874","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"模拟行走机器人","titleSlug":"walking-robot-simulation"},{"acceptance":0.4784949226440067,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[875]爱吃香蕉的珂珂","frequency":47.02093428419921,"frontendQuestionId":"875","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱吃香蕉的珂珂","titleSlug":"koko-eating-bananas"},{"acceptance":0.7060140991677644,"acs":0,"articleLive":2,"columnArticles":1582,"formTitle":"[876]链表的中间结点","frequency":44.13275666767935,"frontendQuestionId":"876","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表的中间结点","titleSlug":"middle-of-the-linked-list"},{"acceptance":0.7567071720592066,"acs":0,"articleLive":2,"columnArticles":475,"formTitle":"[877]石子游戏","frequency":60.98656908722677,"frontendQuestionId":"877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"石子游戏","titleSlug":"stone-game"},{"acceptance":0.280603979003305,"acs":0,"articleLive":2,"columnArticles":60,"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.5553990242884349,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[879]盈利计划","frequency":63.052672164226934,"frontendQuestionId":"879","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"盈利计划","titleSlug":"profitable-schemes"},{"acceptance":0.25238604750695487,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[880]索引处的解码字符串","frequency":7.211508204687712,"frontendQuestionId":"880","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"索引处的解码字符串","titleSlug":"decoded-string-at-index"},{"acceptance":0.5380689960503781,"acs":0,"articleLive":2,"columnArticles":566,"formTitle":"[881]救生艇","frequency":42.822999800576504,"frontendQuestionId":"881","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"救生艇","titleSlug":"boats-to-save-people"},{"acceptance":0.4884779516358464,"acs":0,"articleLive":2,"columnArticles":32,"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.6874879133629859,"acs":0,"articleLive":2,"columnArticles":107,"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.6614036910079291,"acs":0,"articleLive":2,"columnArticles":247,"formTitle":"[884]两句话中的不常见单词","frequency":7.211508204687712,"frontendQuestionId":"884","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两句话中的不常见单词","titleSlug":"uncommon-words-from-two-sentences"},{"acceptance":0.6894543225015328,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[885]螺旋矩阵 III","frequency":30.333498337885196,"frontendQuestionId":"885","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"螺旋矩阵 III","titleSlug":"spiral-matrix-iii"},{"acceptance":0.4229923835812503,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[886]可能的二分法","frequency":6.62395241264668,"frontendQuestionId":"886","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可能的二分法","titleSlug":"possible-bipartition"},{"acceptance":0.29178722714751976,"acs":0,"articleLive":2,"columnArticles":331,"formTitle":"[887]鸡蛋掉落","frequency":63.17924445289742,"frontendQuestionId":"887","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"鸡蛋掉落","titleSlug":"super-egg-drop"},{"acceptance":0.6398746647043464,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[888]公平的糖果棒交换","frequency":6.061429485312524,"frontendQuestionId":"888","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公平的糖果棒交换","titleSlug":"fair-candy-swap"},{"acceptance":0.6778706395348837,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[889]根据前序和后序遍历构造二叉树","frequency":40.58498988108451,"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.7260858649259352,"acs":0,"articleLive":2,"columnArticles":120,"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.3298847872090289,"acs":0,"articleLive":2,"columnArticles":39,"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.6387088060507834,"acs":0,"articleLive":2,"columnArticles":680,"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.7241168892806292,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[893]特殊等价字符串组","frequency":7.211508204687712,"frontendQuestionId":"893","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特殊等价字符串组","titleSlug":"groups-of-special-equivalent-strings"},{"acceptance":0.7744243371610654,"acs":0,"articleLive":2,"columnArticles":120,"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.5444228274967574,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[895]最大频率栈","frequency":24.866724145644405,"frontendQuestionId":"895","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大频率栈","titleSlug":"maximum-frequency-stack"},{"acceptance":0.5866762248971993,"acs":0,"articleLive":2,"columnArticles":714,"formTitle":"[896]单调数列","frequency":18.035896247680004,"frontendQuestionId":"896","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单调数列","titleSlug":"monotonic-array"},{"acceptance":0.7449558638083228,"acs":0,"articleLive":2,"columnArticles":698,"formTitle":"[897]递增顺序搜索树","frequency":55.82729559973928,"frontendQuestionId":"897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"递增顺序搜索树","titleSlug":"increasing-order-search-tree"},{"acceptance":0.3363405336721728,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[898]子数组按位或操作","frequency":26.213058161373958,"frontendQuestionId":"898","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组按位或操作","titleSlug":"bitwise-ors-of-subarrays"},{"acceptance":0.5386024600889819,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[899]有序队列","frequency":6.061429485312524,"frontendQuestionId":"899","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"有序队列","titleSlug":"orderly-queue"},{"acceptance":0.4923819580630563,"acs":0,"articleLive":2,"columnArticles":43,"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.5433957789898032,"acs":0,"articleLive":2,"columnArticles":224,"formTitle":"[901]股票价格跨度","frequency":0.0,"frontendQuestionId":"901","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"股票价格跨度","titleSlug":"online-stock-span"},{"acceptance":0.32729833031583183,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[902]最大为 N 的数字组合","frequency":7.211508204687712,"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.5305336512011737,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[903]DI 序列的有效排列","frequency":13.85285561433601,"frontendQuestionId":"903","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"DI 序列的有效排列","titleSlug":"valid-permutations-for-di-sequence"},{"acceptance":0.4530776992936428,"acs":0,"articleLive":2,"columnArticles":261,"formTitle":"[904]水果成篮","frequency":38.21594276395469,"frontendQuestionId":"904","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水果成篮","titleSlug":"fruit-into-baskets"},{"acceptance":0.7012568600548804,"acs":0,"articleLive":2,"columnArticles":591,"formTitle":"[905]按奇偶排序数组","frequency":24.230923379013827,"frontendQuestionId":"905","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按奇偶排序数组","titleSlug":"sort-array-by-parity"},{"acceptance":0.27424964575550687,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[906]超级回文数","frequency":32.43826901177213,"frontendQuestionId":"906","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"超级回文数","titleSlug":"super-palindromes"},{"acceptance":0.3163097199341021,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[907]子数组的最小值之和","frequency":36.04340313970188,"frontendQuestionId":"907","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组的最小值之和","titleSlug":"sum-of-subarray-minimums"},{"acceptance":0.698645598194131,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[908]最小差值 I","frequency":6.061429485312524,"frontendQuestionId":"908","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差值 I","titleSlug":"smallest-range-i"},{"acceptance":0.4596675315787973,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[909]蛇梯棋","frequency":41.14173483881646,"frontendQuestionId":"909","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"蛇梯棋","titleSlug":"snakes-and-ladders"},{"acceptance":0.3178895705521472,"acs":0,"articleLive":2,"columnArticles":66,"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.4259913623871221,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[911]在线选举","frequency":0.0,"frontendQuestionId":"911","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在线选举","titleSlug":"online-election"},{"acceptance":0.5630833859956281,"acs":0,"articleLive":2,"columnArticles":1019,"formTitle":"[912]排序数组","frequency":82.7166779997441,"frontendQuestionId":"912","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"排序数组","titleSlug":"sort-an-array"},{"acceptance":0.40576881370635437,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[913]猫和老鼠","frequency":9.855093570160312,"frontendQuestionId":"913","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"猫和老鼠","titleSlug":"cat-and-mouse"},{"acceptance":0.3888192108900055,"acs":0,"articleLive":2,"columnArticles":612,"formTitle":"[914]卡牌分组","frequency":17.40322030163009,"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.46788990825688076,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[915]分割数组","frequency":16.794658773886972,"frontendQuestionId":"915","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割数组","titleSlug":"partition-array-into-disjoint-intervals"},{"acceptance":0.4407982573255569,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[916]单词子集","frequency":0.0,"frontendQuestionId":"916","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词子集","titleSlug":"word-subsets"},{"acceptance":0.5696434916498875,"acs":0,"articleLive":2,"columnArticles":431,"formTitle":"[917]仅仅反转字母","frequency":24.866724145644405,"frontendQuestionId":"917","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"仅仅反转字母","titleSlug":"reverse-only-letters"},{"acceptance":0.3576134486444466,"acs":0,"articleLive":2,"columnArticles":211,"formTitle":"[918]环形子数组的最大和","frequency":36.78166698742219,"frontendQuestionId":"918","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形子数组的最大和","titleSlug":"maximum-sum-circular-subarray"},{"acceptance":0.6281345565749236,"acs":0,"articleLive":2,"columnArticles":91,"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.48079470198675495,"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.7360023000071875,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[921]使括号有效的最少添加","frequency":6.061429485312524,"frontendQuestionId":"921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"使括号有效的最少添加","titleSlug":"minimum-add-to-make-parentheses-valid"},{"acceptance":0.7141427725213326,"acs":0,"articleLive":2,"columnArticles":820,"formTitle":"[922]按奇偶排序数组 II","frequency":18.035896247680004,"frontendQuestionId":"922","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"按奇偶排序数组 II","titleSlug":"sort-array-by-parity-ii"},{"acceptance":0.337928752619389,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[923]三数之和的多种可能","frequency":18.035896247680004,"frontendQuestionId":"923","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"三数之和的多种可能","titleSlug":"3sum-with-multiplicity"},{"acceptance":0.3595638078396699,"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.38795246232717107,"acs":0,"articleLive":2,"columnArticles":669,"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.5188314823756639,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[926]将字符串翻转到单调递增","frequency":18.035896247680004,"frontendQuestionId":"926","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串翻转到单调递增","titleSlug":"flip-string-to-monotone-increasing"},{"acceptance":0.33867755427205737,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[927]三等分","frequency":37.550349817636906,"frontendQuestionId":"927","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"三等分","titleSlug":"three-equal-parts"},{"acceptance":0.42023947470065665,"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.6430626639166858,"acs":0,"articleLive":2,"columnArticles":226,"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.5450153424299797,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[930]和相同的二元子数组","frequency":55.06543696082743,"frontendQuestionId":"930","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"和相同的二元子数组","titleSlug":"binary-subarrays-with-sum"},{"acceptance":0.6601235036395625,"acs":0,"articleLive":2,"columnArticles":248,"formTitle":"[931]下降路径最小和","frequency":23.026000412431554,"frontendQuestionId":"931","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"下降路径最小和","titleSlug":"minimum-falling-path-sum"},{"acceptance":0.6283841110682608,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[932]漂亮数组","frequency":6.061429485312524,"frontendQuestionId":"932","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"漂亮数组","titleSlug":"beautiful-array"},{"acceptance":0.7243731525311615,"acs":0,"articleLive":2,"columnArticles":298,"formTitle":"[933]最近的请求次数","frequency":34.64949327968721,"frontendQuestionId":"933","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的请求次数","titleSlug":"number-of-recent-calls"},{"acceptance":0.47527611499873534,"acs":0,"articleLive":2,"columnArticles":256,"formTitle":"[934]最短的桥","frequency":38.21594276395469,"frontendQuestionId":"934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短的桥","titleSlug":"shortest-bridge"},{"acceptance":0.47502393871688475,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[935]骑士拨号器","frequency":6.62395241264668,"frontendQuestionId":"935","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"骑士拨号器","titleSlug":"knight-dialer"},{"acceptance":0.3778331257783313,"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.5884844206917414,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[937]重新排列日志文件","frequency":17.40322030163009,"frontendQuestionId":"937","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列日志文件","titleSlug":"reorder-data-in-log-files"},{"acceptance":0.8183259191082477,"acs":0,"articleLive":2,"columnArticles":788,"formTitle":"[938]二叉搜索树的范围和","frequency":47.67636054432939,"frontendQuestionId":"938","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉搜索树的范围和","titleSlug":"range-sum-of-bst"},{"acceptance":0.4507829977628635,"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.41930761281433,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[940]不同的子序列 II","frequency":5.004603235121968,"frontendQuestionId":"940","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"不同的子序列 II","titleSlug":"distinct-subsequences-ii"},{"acceptance":0.39236193089366045,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[941]有效的山脉数组","frequency":6.62395241264668,"frontendQuestionId":"941","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的山脉数组","titleSlug":"valid-mountain-array"},{"acceptance":0.7295869829085064,"acs":0,"articleLive":2,"columnArticles":208,"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.4747501315097317,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[943]最短超级串","frequency":12.179972950986874,"frontendQuestionId":"943","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超级串","titleSlug":"find-the-shortest-superstring"},{"acceptance":0.6894658997534922,"acs":0,"articleLive":2,"columnArticles":178,"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.48629947794381684,"acs":0,"articleLive":2,"columnArticles":535,"formTitle":"[945]使数组唯一的最小增量","frequency":25.52684182318494,"frontendQuestionId":"945","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组唯一的最小增量","titleSlug":"minimum-increment-to-make-array-unique"},{"acceptance":0.6226397347567427,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[946]验证栈序列","frequency":49.58497580741732,"frontendQuestionId":"946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"验证栈序列","titleSlug":"validate-stack-sequences"},{"acceptance":0.6125721616420783,"acs":0,"articleLive":2,"columnArticles":333,"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.39108622097771556,"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.3695366637981793,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[949]给定数字能组成的最大时间","frequency":38.21594276395469,"frontendQuestionId":"949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"给定数字能组成的最大时间","titleSlug":"largest-time-for-given-digits"},{"acceptance":0.7740199228791774,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[950]按递增顺序显示卡牌","frequency":18.035896247680004,"frontendQuestionId":"950","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按递增顺序显示卡牌","titleSlug":"reveal-cards-in-increasing-order"},{"acceptance":0.6639006699858627,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[951]翻转等价二叉树","frequency":26.213058161373958,"frontendQuestionId":"951","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转等价二叉树","titleSlug":"flip-equivalent-binary-trees"},{"acceptance":0.34954657873042044,"acs":0,"articleLive":2,"columnArticles":54,"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.5529634041154968,"acs":0,"articleLive":2,"columnArticles":159,"formTitle":"[953]验证外星语词典","frequency":24.230923379013827,"frontendQuestionId":"953","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"验证外星语词典","titleSlug":"verifying-an-alien-dictionary"},{"acceptance":0.2997009491613574,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[954]二倍数对数组","frequency":30.333498337885196,"frontendQuestionId":"954","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二倍数对数组","titleSlug":"array-of-doubled-pairs"},{"acceptance":0.32831608654750705,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[955]删列造序 II","frequency":8.469811387364896,"frontendQuestionId":"955","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 II","titleSlug":"delete-columns-to-make-sorted-ii"},{"acceptance":0.4358409516466571,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[956]最高的广告牌","frequency":24.866724145644405,"frontendQuestionId":"956","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最高的广告牌","titleSlug":"tallest-billboard"},{"acceptance":0.3601481942069537,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[957]N 天后的牢房","frequency":31.008249446544394,"frontendQuestionId":"957","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"N 天后的牢房","titleSlug":"prison-cells-after-n-days"},{"acceptance":0.5363206800660171,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[958]二叉树的完全性检验","frequency":27.86312408616031,"frontendQuestionId":"958","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的完全性检验","titleSlug":"check-completeness-of-a-binary-tree"},{"acceptance":0.7434784264442668,"acs":0,"articleLive":2,"columnArticles":301,"formTitle":"[959]由斜杠划分区域","frequency":25.52684182318494,"frontendQuestionId":"959","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"由斜杠划分区域","titleSlug":"regions-cut-by-slashes"},{"acceptance":0.5530216647662486,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[960]删列造序 III","frequency":0.0,"frontendQuestionId":"960","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删列造序 III","titleSlug":"delete-columns-to-make-sorted-iii"},{"acceptance":0.6768631709006496,"acs":0,"articleLive":2,"columnArticles":295,"formTitle":"[961]重复 N 次的元素","frequency":18.035896247680004,"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.4415434694154347,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[962]最大宽度坡","frequency":18.694466070773423,"frontendQuestionId":"962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大宽度坡","titleSlug":"maximum-width-ramp"},{"acceptance":0.5008067769261799,"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.4260265700483092,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[964]表示数字的最少运算符","frequency":14.854916490623221,"frontendQuestionId":"964","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"表示数字的最少运算符","titleSlug":"least-operators-to-express-number"},{"acceptance":0.6841028453312522,"acs":0,"articleLive":2,"columnArticles":381,"formTitle":"[965]单值二叉树","frequency":6.62395241264668,"frontendQuestionId":"965","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"单值二叉树","titleSlug":"univalued-binary-tree"},{"acceptance":0.4016842668092501,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[966]元音拼写检查器","frequency":8.469811387364896,"frontendQuestionId":"966","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"元音拼写检查器","titleSlug":"vowel-spellchecker"},{"acceptance":0.4614108393756913,"acs":0,"articleLive":2,"columnArticles":145,"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.49774710195387706,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[968]监控二叉树","frequency":39.31196201051902,"frontendQuestionId":"968","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"监控二叉树","titleSlug":"binary-tree-cameras"},{"acceptance":0.6532342657342657,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[969]煎饼排序","frequency":5.522175928223974,"frontendQuestionId":"969","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"煎饼排序","titleSlug":"pancake-sorting"},{"acceptance":0.4145323468032631,"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.44157303370786516,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[971]翻转二叉树以匹配先序遍历","frequency":7.211508204687712,"frontendQuestionId":"971","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转二叉树以匹配先序遍历","titleSlug":"flip-binary-tree-to-match-preorder-traversal"},{"acceptance":0.4103481939472828,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[972]相等的有理数","frequency":14.854916490623221,"frontendQuestionId":"972","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"相等的有理数","titleSlug":"equal-rational-numbers"},{"acceptance":0.6395848591142119,"acs":0,"articleLive":2,"columnArticles":632,"formTitle":"[973]最接近原点的 K 个点","frequency":5.522175928223974,"frontendQuestionId":"973","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最接近原点的 K 个点","titleSlug":"k-closest-points-to-origin"},{"acceptance":0.465986178106426,"acs":0,"articleLive":2,"columnArticles":378,"formTitle":"[974]和可被 K 整除的子数组","frequency":53.773972533476254,"frontendQuestionId":"974","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和可被 K 整除的子数组","titleSlug":"subarray-sums-divisible-by-k"},{"acceptance":0.4460632818248712,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[975]奇偶跳","frequency":7.211508204687712,"frontendQuestionId":"975","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶跳","titleSlug":"odd-even-jump"},{"acceptance":0.5972222222222222,"acs":0,"articleLive":2,"columnArticles":494,"formTitle":"[976]三角形的最大周长","frequency":24.866724145644405,"frontendQuestionId":"976","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三角形的最大周长","titleSlug":"largest-perimeter-triangle"},{"acceptance":0.7140861624700511,"acs":0,"articleLive":2,"columnArticles":1241,"formTitle":"[977]有序数组的平方","frequency":50.351750794971615,"frontendQuestionId":"977","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"有序数组的平方","titleSlug":"squares-of-a-sorted-array"},{"acceptance":0.47328109285027464,"acs":0,"articleLive":2,"columnArticles":593,"formTitle":"[978]最长湍流子数组","frequency":6.061429485312524,"frontendQuestionId":"978","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长湍流子数组","titleSlug":"longest-turbulent-subarray"},{"acceptance":0.7122933884297521,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[979]在二叉树中分配硬币","frequency":25.52684182318494,"frontendQuestionId":"979","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"在二叉树中分配硬币","titleSlug":"distribute-coins-in-binary-tree"},{"acceptance":0.7337278106508875,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[980]不同路径 III","frequency":31.008249446544394,"frontendQuestionId":"980","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不同路径 III","titleSlug":"unique-paths-iii"},{"acceptance":0.5333873951496414,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[981]基于时间的键值存储","frequency":55.00325333791839,"frontendQuestionId":"981","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"基于时间的键值存储","titleSlug":"time-based-key-value-store"},{"acceptance":0.5437445319335084,"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.6338399350070343,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[983]最低票价","frequency":46.248819617080564,"frontendQuestionId":"983","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低票价","titleSlug":"minimum-cost-for-tickets"},{"acceptance":0.41657276995305165,"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.5997470049854899,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[985]查询后的偶数和","frequency":6.061429485312524,"frontendQuestionId":"985","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询后的偶数和","titleSlug":"sum-of-even-numbers-after-queries"},{"acceptance":0.677309007981756,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[986]区间列表的交集","frequency":44.28753104797218,"frontendQuestionId":"986","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"区间列表的交集","titleSlug":"interval-list-intersections"},{"acceptance":0.5323670137911624,"acs":0,"articleLive":2,"columnArticles":407,"formTitle":"[987]二叉树的垂序遍历","frequency":53.624524664341436,"frontendQuestionId":"987","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的垂序遍历","titleSlug":"vertical-order-traversal-of-a-binary-tree"},{"acceptance":0.4979007844437079,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[988]从叶结点开始的最小字符串","frequency":5.522175928223974,"frontendQuestionId":"988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从叶结点开始的最小字符串","titleSlug":"smallest-string-starting-from-leaf"},{"acceptance":0.4720029824689023,"acs":0,"articleLive":2,"columnArticles":586,"formTitle":"[989]数组形式的整数加法","frequency":17.40322030163009,"frontendQuestionId":"989","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组形式的整数加法","titleSlug":"add-to-array-form-of-integer"},{"acceptance":0.501932271220615,"acs":0,"articleLive":2,"columnArticles":492,"formTitle":"[990]等式方程的可满足性","frequency":6.061429485312524,"frontendQuestionId":"990","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等式方程的可满足性","titleSlug":"satisfiability-of-equality-equations"},{"acceptance":0.5174770198355104,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[991]坏了的计算器","frequency":17.40322030163009,"frontendQuestionId":"991","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"坏了的计算器","titleSlug":"broken-calculator"},{"acceptance":0.4517832276032802,"acs":0,"articleLive":2,"columnArticles":270,"formTitle":"[992]K 个不同整数的子数组","frequency":18.035896247680004,"frontendQuestionId":"992","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"K 个不同整数的子数组","titleSlug":"subarrays-with-k-different-integers"},{"acceptance":0.5570965636993044,"acs":0,"articleLive":2,"columnArticles":794,"formTitle":"[993]二叉树的堂兄弟节点","frequency":52.01320235718395,"frontendQuestionId":"993","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树的堂兄弟节点","titleSlug":"cousins-in-binary-tree"},{"acceptance":0.5090800804514655,"acs":0,"articleLive":2,"columnArticles":1364,"formTitle":"[994]腐烂的橘子","frequency":28.449342063288796,"frontendQuestionId":"994","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"腐烂的橘子","titleSlug":"rotting-oranges"},{"acceptance":0.5398577323241273,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[995]K 连续位的最小翻转次数","frequency":6.62395241264668,"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.49472202674173116,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[996]正方形数组的数目","frequency":20.097446297355418,"frontendQuestionId":"996","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"正方形数组的数目","titleSlug":"number-of-squareful-arrays"},{"acceptance":0.5111370602831703,"acs":0,"articleLive":2,"columnArticles":379,"formTitle":"[997]找到小镇的法官","frequency":16.208607595358924,"frontendQuestionId":"997","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到小镇的法官","titleSlug":"find-the-town-judge"},{"acceptance":0.6149715215622458,"acs":0,"articleLive":2,"columnArticles":108,"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.6909809475944625,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[999]可以被一步捕获的棋子数","frequency":6.061429485312524,"frontendQuestionId":"999","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"可以被一步捕获的棋子数","titleSlug":"available-captures-for-rook"},{"acceptance":0.4084855627578079,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1000]合并石头的最低成本","frequency":35.33334009083937,"frontendQuestionId":"1000","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并石头的最低成本","titleSlug":"minimum-cost-to-merge-stones"},{"acceptance":0.29240345169047954,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1001]网格照明","frequency":10.602574332326324,"frontendQuestionId":"1001","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"网格照明","titleSlug":"grid-illumination"},{"acceptance":0.7374658398150095,"acs":0,"articleLive":2,"columnArticles":594,"formTitle":"[1002]查找常用字符","frequency":39.31196201051902,"frontendQuestionId":"1002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查找常用字符","titleSlug":"find-common-characters"},{"acceptance":0.5763818854151659,"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.5974983613720778,"acs":0,"articleLive":2,"columnArticles":692,"formTitle":"[1004]最大连续1的个数 III","frequency":54.434988072590315,"frontendQuestionId":"1004","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大连续1的个数 III","titleSlug":"max-consecutive-ones-iii"},{"acceptance":0.5342498636115658,"acs":0,"articleLive":2,"columnArticles":404,"formTitle":"[1005]K 次取反后最大化的数组和","frequency":22.454106114617538,"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.6274727306341283,"acs":0,"articleLive":2,"columnArticles":598,"formTitle":"[1006]笨阶乘","frequency":50.969622837826975,"frontendQuestionId":"1006","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"笨阶乘","titleSlug":"clumsy-factorial"},{"acceptance":0.46452046608903497,"acs":0,"articleLive":2,"columnArticles":82,"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.7262664409428311,"acs":0,"articleLive":2,"columnArticles":216,"formTitle":"[1008]前序遍历构造二叉搜索树","frequency":40.58498988108451,"frontendQuestionId":"1008","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"前序遍历构造二叉搜索树","titleSlug":"construct-binary-search-tree-from-preorder-traversal"},{"acceptance":0.5931023634433128,"acs":0,"articleLive":2,"columnArticles":205,"formTitle":"[1009]十进制整数的反码","frequency":6.061429485312524,"frontendQuestionId":"1009","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十进制整数的反码","titleSlug":"complement-of-base-10-integer"},{"acceptance":0.4508494695452185,"acs":0,"articleLive":2,"columnArticles":240,"formTitle":"[1010]总持续时间可被 60 整除的歌曲","frequency":7.211508204687712,"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.6272359702787951,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[1011]在 D 天内送达包裹的能力","frequency":70.52967817412862,"frontendQuestionId":"1011","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"在 D 天内送达包裹的能力","titleSlug":"capacity-to-ship-packages-within-d-days"},{"acceptance":0.3309344552701506,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1012]至少有 1 位重复的数字","frequency":19.380911113840813,"frontendQuestionId":"1012","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"至少有 1 位重复的数字","titleSlug":"numbers-with-repeated-digits"},{"acceptance":0.39768006428119607,"acs":0,"articleLive":2,"columnArticles":915,"formTitle":"[1013]将数组分成和相等的三个部分","frequency":33.990080073438854,"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.548302244134137,"acs":0,"articleLive":2,"columnArticles":433,"formTitle":"[1014]最佳观光组合","frequency":16.794658773886972,"frontendQuestionId":"1014","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最佳观光组合","titleSlug":"best-sightseeing-pair"},{"acceptance":0.35414503930001484,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1015]可被 K 整除的最小整数","frequency":18.694466070773423,"frontendQuestionId":"1015","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被 K 整除的最小整数","titleSlug":"smallest-integer-divisible-by-k"},{"acceptance":0.5830960246041691,"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.5616438356164384,"acs":0,"articleLive":2,"columnArticles":54,"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.5166511122399556,"acs":0,"articleLive":2,"columnArticles":375,"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.5975334636787487,"acs":0,"articleLive":2,"columnArticles":258,"formTitle":"[1019]链表中的下一个更大节点","frequency":6.061429485312524,"frontendQuestionId":"1019","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表中的下一个更大节点","titleSlug":"next-greater-node-in-linked-list"},{"acceptance":0.5366652767022101,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1020]飞地的数量","frequency":24.866724145644405,"frontendQuestionId":"1020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞地的数量","titleSlug":"number-of-enclaves"},{"acceptance":0.7836209144943651,"acs":0,"articleLive":2,"columnArticles":648,"formTitle":"[1021]删除最外层的括号","frequency":25.52684182318494,"frontendQuestionId":"1021","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除最外层的括号","titleSlug":"remove-outermost-parentheses"},{"acceptance":0.7034515400859244,"acs":0,"articleLive":2,"columnArticles":255,"formTitle":"[1022]从根到叶的二进制数之和","frequency":6.061429485312524,"frontendQuestionId":"1022","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"从根到叶的二进制数之和","titleSlug":"sum-of-root-to-leaf-binary-numbers"},{"acceptance":0.565927750410509,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1023]驼峰式匹配","frequency":0.0,"frontendQuestionId":"1023","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"驼峰式匹配","titleSlug":"camelcase-matching"},{"acceptance":0.5580130160667074,"acs":0,"articleLive":2,"columnArticles":376,"formTitle":"[1024]视频拼接","frequency":17.40322030163009,"frontendQuestionId":"1024","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"视频拼接","titleSlug":"video-stitching"},{"acceptance":0.7095966567346045,"acs":0,"articleLive":2,"columnArticles":643,"formTitle":"[1025]除数博弈","frequency":39.93777251719928,"frontendQuestionId":"1025","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"除数博弈","titleSlug":"divisor-game"},{"acceptance":0.6692989081919934,"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.4330793245828997,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1027]最长等差数列","frequency":36.04340313970188,"frontendQuestionId":"1027","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长等差数列","titleSlug":"longest-arithmetic-subsequence"},{"acceptance":0.7314346068397859,"acs":0,"articleLive":2,"columnArticles":420,"formTitle":"[1028]从先序遍历还原二叉树","frequency":24.866724145644405,"frontendQuestionId":"1028","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从先序遍历还原二叉树","titleSlug":"recover-a-tree-from-preorder-traversal"},{"acceptance":0.6545418484728283,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1029]两地调度","frequency":5.004603235121968,"frontendQuestionId":"1029","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"两地调度","titleSlug":"two-city-scheduling"},{"acceptance":0.7114419951957044,"acs":0,"articleLive":2,"columnArticles":442,"formTitle":"[1030]距离顺序排列矩阵单元格","frequency":0.0,"frontendQuestionId":"1030","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"距离顺序排列矩阵单元格","titleSlug":"matrix-cells-in-distance-order"},{"acceptance":0.5665752771486471,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1031]两个非重叠子数组的最大和","frequency":6.62395241264668,"frontendQuestionId":"1031","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个非重叠子数组的最大和","titleSlug":"maximum-sum-of-two-non-overlapping-subarrays"},{"acceptance":0.39595605795255534,"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.38995764841002084,"acs":0,"articleLive":2,"columnArticles":162,"formTitle":"[1033]移动石子直到连续","frequency":7.211508204687712,"frontendQuestionId":"1033","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移动石子直到连续","titleSlug":"moving-stones-until-consecutive"},{"acceptance":0.43267986864364616,"acs":0,"articleLive":2,"columnArticles":93,"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.6306954873514616,"acs":0,"articleLive":2,"columnArticles":372,"formTitle":"[1035]不相交的线","frequency":58.20850156820199,"frontendQuestionId":"1035","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不相交的线","titleSlug":"uncrossed-lines"},{"acceptance":0.29934985395269953,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1036]逃离大迷宫","frequency":0.0,"frontendQuestionId":"1036","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"逃离大迷宫","titleSlug":"escape-a-large-maze"},{"acceptance":0.4380296116956886,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1037]有效的回旋镖","frequency":0.0,"frontendQuestionId":"1037","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有效的回旋镖","titleSlug":"valid-boomerang"},{"acceptance":0.7930082501364322,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1038]把二叉搜索树转换为累加树","frequency":4.028891143876636,"frontendQuestionId":"1038","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"把二叉搜索树转换为累加树","titleSlug":"binary-search-tree-to-greater-sum-tree"},{"acceptance":0.5546875,"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.5234657039711191,"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.4818615406850701,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1041]困于环中的机器人","frequency":30.333498337885196,"frontendQuestionId":"1041","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"困于环中的机器人","titleSlug":"robot-bounded-in-circle"},{"acceptance":0.5288257235941263,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1042]不邻接植花","frequency":18.035896247680004,"frontendQuestionId":"1042","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不邻接植花","titleSlug":"flower-planting-with-no-adjacent"},{"acceptance":0.6917575868708169,"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.20941113816189896,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1044]最长重复子串","frequency":56.51214290289459,"frontendQuestionId":"1044","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长重复子串","titleSlug":"longest-duplicate-substring"},{"acceptance":0.6430205949656751,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1045]买下所有产品的客户","frequency":6.62395241264668,"frontendQuestionId":"1045","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"买下所有产品的客户","titleSlug":"customers-who-bought-all-products"},{"acceptance":0.6597111568947844,"acs":0,"articleLive":2,"columnArticles":902,"formTitle":"[1046]最后一块石头的重量","frequency":28.449342063288796,"frontendQuestionId":"1046","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一块石头的重量","titleSlug":"last-stone-weight"},{"acceptance":0.7254586167680321,"acs":0,"articleLive":2,"columnArticles":965,"formTitle":"[1047]删除字符串中的所有相邻重复项","frequency":59.30324959196862,"frontendQuestionId":"1047","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项","titleSlug":"remove-all-adjacent-duplicates-in-string"},{"acceptance":0.4517704517704518,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1048]最长字符串链","frequency":39.622276849619915,"frontendQuestionId":"1048","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长字符串链","titleSlug":"longest-string-chain"},{"acceptance":0.6438268622285955,"acs":0,"articleLive":2,"columnArticles":394,"formTitle":"[1049]最后一块石头的重量 II","frequency":60.49237146123957,"frontendQuestionId":"1049","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最后一块石头的重量 II","titleSlug":"last-stone-weight-ii"},{"acceptance":0.7575694299436208,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1050]合作过至少三次的演员和导演","frequency":6.061429485312524,"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.7530779586341941,"acs":0,"articleLive":2,"columnArticles":363,"formTitle":"[1051]高度检查器","frequency":6.62395241264668,"frontendQuestionId":"1051","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"高度检查器","titleSlug":"height-checker"},{"acceptance":0.5811098860712973,"acs":0,"articleLive":2,"columnArticles":742,"formTitle":"[1052]爱生气的书店老板","frequency":26.213058161373958,"frontendQuestionId":"1052","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"爱生气的书店老板","titleSlug":"grumpy-bookstore-owner"},{"acceptance":0.4581642210427724,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1053]交换一次的先前排列","frequency":18.035896247680004,"frontendQuestionId":"1053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换一次的先前排列","titleSlug":"previous-permutation-with-one-swap"},{"acceptance":0.37630578154334954,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1054]距离相等的条形码","frequency":17.40322030163009,"frontendQuestionId":"1054","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"距离相等的条形码","titleSlug":"distant-barcodes"},{"acceptance":0.5835086796422936,"acs":0,"articleLive":2,"columnArticles":81,"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.40793376173999013,"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.4650474855986299,"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.33976531942633637,"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.36054758370443674,"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.528163677696388,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1060]有序数组中的缺失元素","frequency":6.62395241264668,"frontendQuestionId":"1060","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"有序数组中的缺失元素","titleSlug":"missing-element-in-sorted-array"},{"acceptance":0.6019200714445189,"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.5384615384615384,"acs":0,"articleLive":2,"columnArticles":43,"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.700507614213198,"acs":0,"articleLive":2,"columnArticles":38,"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.650896551724138,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1064]不动点","frequency":0.0,"frontendQuestionId":"1064","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不动点","titleSlug":"fixed-point"},{"acceptance":0.5384615384615384,"acs":0,"articleLive":2,"columnArticles":66,"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.47393364928909953,"acs":0,"articleLive":2,"columnArticles":39,"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.421218487394958,"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.8640684410646388,"acs":0,"articleLive":2,"columnArticles":60,"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.8202504581551618,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1069]产品销售分析 II","frequency":6.061429485312524,"frontendQuestionId":"1069","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 II","titleSlug":"product-sales-analysis-ii"},{"acceptance":0.48407028383857886,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1070]产品销售分析 III","frequency":6.061429485312524,"frontendQuestionId":"1070","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"产品销售分析 III","titleSlug":"product-sales-analysis-iii"},{"acceptance":0.5865284620761375,"acs":0,"articleLive":2,"columnArticles":663,"formTitle":"[1071]字符串的最大公因子","frequency":18.035896247680004,"frontendQuestionId":"1071","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的最大公因子","titleSlug":"greatest-common-divisor-of-strings"},{"acceptance":0.5790224759186586,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1072]按列翻转得到最大值等行数","frequency":9.145226304517246,"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.33597621407333994,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1073]负二进制数相加","frequency":0.0,"frontendQuestionId":"1073","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"负二进制数相加","titleSlug":"adding-two-negabinary-numbers"},{"acceptance":0.6695620437956205,"acs":0,"articleLive":2,"columnArticles":184,"formTitle":"[1074]元素和为目标值的子矩阵数量","frequency":46.248819617080564,"frontendQuestionId":"1074","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"元素和为目标值的子矩阵数量","titleSlug":"number-of-submatrices-that-sum-to-target"},{"acceptance":0.6940944284196144,"acs":0,"articleLive":2,"columnArticles":69,"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.4953822861468584,"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.7219950124688279,"acs":0,"articleLive":2,"columnArticles":86,"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.6215808744346328,"acs":0,"articleLive":2,"columnArticles":176,"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.7335331335331335,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[1079]活字印刷","frequency":6.061429485312524,"frontendQuestionId":"1079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活字印刷","titleSlug":"letter-tile-possibilities"},{"acceptance":0.4896821631878558,"acs":0,"articleLive":2,"columnArticles":84,"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.5712853016688062,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1081]不同字符的最小子序列","frequency":41.255068326624084,"frontendQuestionId":"1081","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"不同字符的最小子序列","titleSlug":"smallest-subsequence-of-distinct-characters"},{"acceptance":0.7601267566822816,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1082]销售分析 I ","frequency":6.061429485312524,"frontendQuestionId":"1082","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 I ","titleSlug":"sales-analysis-i"},{"acceptance":0.5280322462440454,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1083]销售分析 II","frequency":18.035896247680004,"frontendQuestionId":"1083","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"销售分析 II","titleSlug":"sales-analysis-ii"},{"acceptance":0.5372219207813348,"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.7724317295188556,"acs":0,"articleLive":2,"columnArticles":72,"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.6891985101393295,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1086]前五科的均分","frequency":0.0,"frontendQuestionId":"1086","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前五科的均分","titleSlug":"high-five"},{"acceptance":0.5323502858862473,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1087]花括号展开","frequency":0.0,"frontendQuestionId":"1087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"花括号展开","titleSlug":"brace-expansion"},{"acceptance":0.4450307827616535,"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.5853507714188542,"acs":0,"articleLive":2,"columnArticles":278,"formTitle":"[1089]复写零","frequency":6.061429485312524,"frontendQuestionId":"1089","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"复写零","titleSlug":"duplicate-zeros"},{"acceptance":0.5432307043441585,"acs":0,"articleLive":2,"columnArticles":77,"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.37801310137150523,"acs":0,"articleLive":2,"columnArticles":273,"formTitle":"[1091]二进制矩阵中的最短路径","frequency":43.22942487860522,"frontendQuestionId":"1091","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二进制矩阵中的最短路径","titleSlug":"shortest-path-in-binary-matrix"},{"acceptance":0.48776290630975144,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1092]最短公共超序列","frequency":18.694466070773423,"frontendQuestionId":"1092","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最短公共超序列","titleSlug":"shortest-common-supersequence"},{"acceptance":0.3804382010692945,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1093]大样本统计","frequency":0.0,"frontendQuestionId":"1093","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"大样本统计","titleSlug":"statistics-from-a-large-sample"},{"acceptance":0.6123892540725921,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1094]拼车","frequency":29.055575031812968,"frontendQuestionId":"1094","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"拼车","titleSlug":"car-pooling"},{"acceptance":0.3726267192459363,"acs":0,"articleLive":2,"columnArticles":380,"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.5537942664418213,"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.5178002125398512,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1097]游戏玩法分析 V","frequency":36.78166698742219,"frontendQuestionId":"1097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游戏玩法分析 V","titleSlug":"game-play-analysis-v"},{"acceptance":0.471321361565264,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1098]小众书籍","frequency":6.061429485312524,"frontendQuestionId":"1098","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小众书籍","titleSlug":"unpopular-books"},{"acceptance":0.5791220951678347,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1099]小于 K 的两数之和","frequency":6.62395241264668,"frontendQuestionId":"1099","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"小于 K 的两数之和","titleSlug":"two-sum-less-than-k"},{"acceptance":0.7003101212292078,"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.668769716088328,"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.3676159953383349,"acs":0,"articleLive":2,"columnArticles":64,"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.6367987573601127,"acs":0,"articleLive":2,"columnArticles":1094,"formTitle":"[1103]分糖果 II","frequency":16.794658773886972,"frontendQuestionId":"1103","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分糖果 II","titleSlug":"distribute-candies-to-people"},{"acceptance":0.760874802580507,"acs":0,"articleLive":2,"columnArticles":666,"formTitle":"[1104]二叉树寻路","frequency":44.9193875045881,"frontendQuestionId":"1104","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树寻路","titleSlug":"path-in-zigzag-labelled-binary-tree"},{"acceptance":0.5567757522512629,"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.5735723218007504,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1106]解析布尔表达式","frequency":18.694466070773423,"frontendQuestionId":"1106","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"解析布尔表达式","titleSlug":"parsing-a-boolean-expression"},{"acceptance":0.4098561568728633,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1107]每日新用户统计","frequency":6.061429485312524,"frontendQuestionId":"1107","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每日新用户统计","titleSlug":"new-users-daily-count"},{"acceptance":0.8392634010274016,"acs":0,"articleLive":2,"columnArticles":677,"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.5756892961685092,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[1109]航班预订统计","frequency":27.86312408616031,"frontendQuestionId":"1109","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"航班预订统计","titleSlug":"corporate-flight-bookings"},{"acceptance":0.6286441462285979,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1110]删点成林","frequency":24.230923379013827,"frontendQuestionId":"1110","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删点成林","titleSlug":"delete-nodes-and-return-forest"},{"acceptance":0.7715607233482157,"acs":0,"articleLive":2,"columnArticles":396,"formTitle":"[1111]有效括号的嵌套深度","frequency":25.52684182318494,"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.6425942156003506,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1112]每位学生的最高成绩","frequency":18.035896247680004,"frontendQuestionId":"1112","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每位学生的最高成绩","titleSlug":"highest-grade-for-each-student"},{"acceptance":0.5405183727034121,"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.6531961539125481,"acs":0,"articleLive":2,"columnArticles":570,"formTitle":"[1114]按序打印","frequency":79.5124077210264,"frontendQuestionId":"1114","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按序打印","titleSlug":"print-in-order"},{"acceptance":0.5619411662501169,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1115]交替打印FooBar","frequency":48.927781421700644,"frontendQuestionId":"1115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印FooBar","titleSlug":"print-foobar-alternately"},{"acceptance":0.5172680775186523,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1116]打印零与奇偶数","frequency":59.75518324128801,"frontendQuestionId":"1116","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"打印零与奇偶数","titleSlug":"print-zero-even-odd"},{"acceptance":0.5205121103006801,"acs":0,"articleLive":2,"columnArticles":249,"formTitle":"[1117]H2O 生成","frequency":45.57266560129181,"frontendQuestionId":"1117","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"H2O 生成","titleSlug":"building-h2o"},{"acceptance":0.6412556053811659,"acs":0,"articleLive":2,"columnArticles":35,"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.8661210785856678,"acs":0,"articleLive":2,"columnArticles":143,"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.607861709685058,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1120]子树的最大平均值","frequency":9.145226304517246,"frontendQuestionId":"1120","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子树的最大平均值","titleSlug":"maximum-average-subtree"},{"acceptance":0.5741728922091782,"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.7070240091799805,"acs":0,"articleLive":2,"columnArticles":862,"formTitle":"[1122]数组的相对排序","frequency":52.01320235718395,"frontendQuestionId":"1122","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的相对排序","titleSlug":"relative-sort-array"},{"acceptance":0.7049986586783511,"acs":0,"articleLive":2,"columnArticles":101,"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.31662028838856565,"acs":0,"articleLive":2,"columnArticles":126,"formTitle":"[1124]表现良好的最长时间段","frequency":7.211508204687712,"frontendQuestionId":"1124","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"表现良好的最长时间段","titleSlug":"longest-well-performing-interval"},{"acceptance":0.4905349794238683,"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.693836026331538,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1126]查询活跃业务","frequency":17.40322030163009,"frontendQuestionId":"1126","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询活跃业务","titleSlug":"active-businesses"},{"acceptance":0.4132764654418198,"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.5446858832224686,"acs":0,"articleLive":2,"columnArticles":476,"formTitle":"[1128]等价多米诺骨牌对的数量","frequency":16.794658773886972,"frontendQuestionId":"1128","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"等价多米诺骨牌对的数量","titleSlug":"number-of-equivalent-domino-pairs"},{"acceptance":0.3795679511921808,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1129]颜色交替的最短路径","frequency":9.145226304517246,"frontendQuestionId":"1129","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色交替的最短路径","titleSlug":"shortest-path-with-alternating-colors"},{"acceptance":0.628770554285092,"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.4542030732148237,"acs":0,"articleLive":2,"columnArticles":45,"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.38812745525971193,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1132]报告的记录 II","frequency":17.40322030163009,"frontendQuestionId":"1132","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"报告的记录 II","titleSlug":"reported-posts-ii"},{"acceptance":0.6450089928057554,"acs":0,"articleLive":2,"columnArticles":61,"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.7744585511575803,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1134]阿姆斯特朗数","frequency":0.0,"frontendQuestionId":"1134","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阿姆斯特朗数","titleSlug":"armstrong-number"},{"acceptance":0.5338781966780912,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1135]最低成本联通所有城市","frequency":26.213058161373958,"frontendQuestionId":"1135","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最低成本联通所有城市","titleSlug":"connecting-cities-with-minimum-cost"},{"acceptance":0.5678240241535476,"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.6067723015559128,"acs":0,"articleLive":2,"columnArticles":819,"formTitle":"[1137]第 N 个泰波那契数","frequency":35.940287638793734,"frontendQuestionId":"1137","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"第 N 个泰波那契数","titleSlug":"n-th-tribonacci-number"},{"acceptance":0.43212264488860236,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1138]字母板上的路径","frequency":6.62395241264668,"frontendQuestionId":"1138","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母板上的路径","titleSlug":"alphabet-board-path"},{"acceptance":0.4763213859640023,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1139]最大的以 1 为边界的正方形","frequency":17.40322030163009,"frontendQuestionId":"1139","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的以 1 为边界的正方形","titleSlug":"largest-1-bordered-square"},{"acceptance":0.6529121421520236,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1140]石子游戏 II","frequency":7.211508204687712,"frontendQuestionId":"1140","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 II","titleSlug":"stone-game-ii"},{"acceptance":0.5107626893436088,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1141]查询近30天活跃用户数","frequency":18.035896247680004,"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.37101707167880776,"acs":0,"articleLive":2,"columnArticles":50,"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.6340627291111093,"acs":0,"articleLive":2,"columnArticles":1069,"formTitle":"[1143]最长公共子序列","frequency":83.54204119523726,"frontendQuestionId":"1143","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最长公共子序列","titleSlug":"longest-common-subsequence"},{"acceptance":0.441484753984754,"acs":0,"articleLive":2,"columnArticles":144,"formTitle":"[1144]递减元素使数组呈锯齿状","frequency":24.866724145644405,"frontendQuestionId":"1144","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"递减元素使数组呈锯齿状","titleSlug":"decrease-elements-to-make-array-zigzag"},{"acceptance":0.46919976971790445,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1145]二叉树着色游戏","frequency":20.097446297355418,"frontendQuestionId":"1145","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树着色游戏","titleSlug":"binary-tree-coloring-game"},{"acceptance":0.2863661892726762,"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.5618980169971671,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1147]段式回文","frequency":36.04340313970188,"frontendQuestionId":"1147","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"段式回文","titleSlug":"longest-chunked-palindrome-decomposition"},{"acceptance":0.7172604833317413,"acs":0,"articleLive":2,"columnArticles":33,"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.4420760765964821,"acs":0,"articleLive":2,"columnArticles":45,"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.6064567769477054,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1150]检查一个数是否在数组中占绝大多数","frequency":18.694466070773423,"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.4832582491172531,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1151]最少交换次数来组合所有的 1","frequency":18.694466070773423,"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.3857853173442527,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1152]用户网站访问行为分析","frequency":13.85285561433601,"frontendQuestionId":"1152","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"用户网站访问行为分析","titleSlug":"analyze-user-website-visit-pattern"},{"acceptance":0.3709964412811388,"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.5674399674399674,"acs":0,"articleLive":2,"columnArticles":218,"formTitle":"[1154]一年中的第几天","frequency":5.522175928223974,"frontendQuestionId":"1154","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一年中的第几天","titleSlug":"day-of-the-year"},{"acceptance":0.4798446840034742,"acs":0,"articleLive":2,"columnArticles":124,"formTitle":"[1155]掷骰子的N种方法","frequency":6.62395241264668,"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.4343379978471475,"acs":0,"articleLive":2,"columnArticles":76,"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.3168894546997666,"acs":0,"articleLive":2,"columnArticles":44,"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.5497223095462643,"acs":0,"articleLive":2,"columnArticles":60,"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.4884886240520043,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1159]市场分析 II","frequency":18.035896247680004,"frontendQuestionId":"1159","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"市场分析 II","titleSlug":"market-analysis-ii"},{"acceptance":0.6870598386269298,"acs":0,"articleLive":2,"columnArticles":904,"formTitle":"[1160]拼写单词","frequency":16.794658773886972,"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.6327794469311423,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1161]最大层内元素和","frequency":18.035896247680004,"frontendQuestionId":"1161","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大层内元素和","titleSlug":"maximum-level-sum-of-a-binary-tree"},{"acceptance":0.4692161514289618,"acs":0,"articleLive":2,"columnArticles":490,"formTitle":"[1162]地图分析","frequency":18.035896247680004,"frontendQuestionId":"1162","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图分析","titleSlug":"as-far-from-land-as-possible"},{"acceptance":0.26716431665284307,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1163]按字典序排在最后的子串","frequency":0.0,"frontendQuestionId":"1163","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"按字典序排在最后的子串","titleSlug":"last-substring-in-lexicographical-order"},{"acceptance":0.6097971079475395,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1164]指定日期的产品价格","frequency":18.035896247680004,"frontendQuestionId":"1164","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"指定日期的产品价格","titleSlug":"product-price-at-a-given-date"},{"acceptance":0.8389659803043867,"acs":0,"articleLive":2,"columnArticles":112,"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.48721804511278194,"acs":0,"articleLive":2,"columnArticles":46,"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.4276729559748428,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1167]连接棒材的最低费用","frequency":9.855093570160312,"frontendQuestionId":"1167","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接棒材的最低费用","titleSlug":"minimum-cost-to-connect-sticks"},{"acceptance":0.5710584752035529,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1168]水资源分配优化","frequency":10.602574332326324,"frontendQuestionId":"1168","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"水资源分配优化","titleSlug":"optimize-water-distribution-in-a-village"},{"acceptance":0.3226262429323455,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1169]查询无效交易","frequency":18.694466070773423,"frontendQuestionId":"1169","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询无效交易","titleSlug":"invalid-transactions"},{"acceptance":0.6169486899563319,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1170]比较字符串最小字母出现频次","frequency":6.62395241264668,"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.4730067529754132,"acs":0,"articleLive":2,"columnArticles":151,"formTitle":"[1171]从链表中删去总和值为零的连续节点","frequency":24.866724145644405,"frontendQuestionId":"1171","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从链表中删去总和值为零的连续节点","titleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list"},{"acceptance":0.26890569395017794,"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.7563090714216116,"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.6184541959432587,"acs":0,"articleLive":2,"columnArticles":58,"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.488962472406181,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1175]质数排列","frequency":0.0,"frontendQuestionId":"1175","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"质数排列","titleSlug":"prime-arrangements"},{"acceptance":0.4470065580706579,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1176]健身计划评估","frequency":0.0,"frontendQuestionId":"1176","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"健身计划评估","titleSlug":"diet-plan-performance"},{"acceptance":0.263745854424856,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1177]构建回文串检测","frequency":7.211508204687712,"frontendQuestionId":"1177","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构建回文串检测","titleSlug":"can-make-palindrome-from-substring"},{"acceptance":0.4619893250860478,"acs":0,"articleLive":2,"columnArticles":182,"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.6349338989950933,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1179]重新格式化部门表","frequency":53.624524664341436,"frontendQuestionId":"1179","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化部门表","titleSlug":"reformat-department-table"},{"acceptance":0.7746264877184097,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1180]统计只含单一字母的子串","frequency":10.602574332326324,"frontendQuestionId":"1180","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只含单一字母的子串","titleSlug":"count-substrings-with-only-one-distinct-letter"},{"acceptance":0.3706046040981533,"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.3878342518881404,"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.6024667931688804,"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.5857798369492583,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[1184]公交站间的距离","frequency":5.522175928223974,"frontendQuestionId":"1184","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"公交站间的距离","titleSlug":"distance-between-bus-stops"},{"acceptance":0.609488043298172,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1185]一周中的第几天","frequency":17.40322030163009,"frontendQuestionId":"1185","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"一周中的第几天","titleSlug":"day-of-the-week"},{"acceptance":0.3921252218815556,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1186]删除一次得到子数组最大和","frequency":30.333498337885196,"frontendQuestionId":"1186","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除一次得到子数组最大和","titleSlug":"maximum-subarray-sum-with-one-deletion"},{"acceptance":0.44098320759308834,"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.6928290336685614,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1188]设计有限阻塞队列","frequency":22.454106114617538,"frontendQuestionId":"1188","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有限阻塞队列","titleSlug":"design-bounded-blocking-queue"},{"acceptance":0.6448350817503071,"acs":0,"articleLive":2,"columnArticles":315,"formTitle":"[1189]“气球” 的最大数量","frequency":5.522175928223974,"frontendQuestionId":"1189","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"“气球” 的最大数量","titleSlug":"maximum-number-of-balloons"},{"acceptance":0.6506954720331459,"acs":0,"articleLive":2,"columnArticles":607,"formTitle":"[1190]反转每对括号间的子串","frequency":93.22068468899253,"frontendQuestionId":"1190","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"反转每对括号间的子串","titleSlug":"reverse-substrings-between-each-pair-of-parentheses"},{"acceptance":0.2674487069160741,"acs":0,"articleLive":2,"columnArticles":93,"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.5014641288433382,"acs":0,"articleLive":2,"columnArticles":45,"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.6069680063759535,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1193]每月交易 I","frequency":7.211508204687712,"frontendQuestionId":"1193","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易 I","titleSlug":"monthly-transactions-i"},{"acceptance":0.5116349350256875,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1194]锦标赛优胜者","frequency":7.211508204687712,"frontendQuestionId":"1194","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"锦标赛优胜者","titleSlug":"tournament-winners"},{"acceptance":0.6347908295911132,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[1195]交替打印字符串","frequency":30.333498337885196,"frontendQuestionId":"1195","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交替打印字符串","titleSlug":"fizz-buzz-multithreaded"},{"acceptance":0.6902817476521029,"acs":0,"articleLive":2,"columnArticles":55,"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.3685296919657034,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1197]进击的骑士","frequency":18.035896247680004,"frontendQuestionId":"1197","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"进击的骑士","titleSlug":"minimum-knight-moves"},{"acceptance":0.7470924502266904,"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.43393939393939396,"acs":0,"articleLive":2,"columnArticles":17,"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.6862183885512645,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[1200]最小绝对差","frequency":24.230923379013827,"frontendQuestionId":"1200","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小绝对差","titleSlug":"minimum-absolute-difference"},{"acceptance":0.24692910744979668,"acs":0,"articleLive":2,"columnArticles":84,"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.5032357880039999,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1202]交换字符串中的元素","frequency":6.62395241264668,"frontendQuestionId":"1202","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换字符串中的元素","titleSlug":"smallest-string-with-swaps"},{"acceptance":0.6231291107773577,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1203]项目管理","frequency":7.826061825326265,"frontendQuestionId":"1203","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"项目管理","titleSlug":"sort-items-by-groups-respecting-dependencies"},{"acceptance":0.7271259418729817,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1204]最后一个能进入电梯的人","frequency":7.826061825326265,"frontendQuestionId":"1204","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后一个能进入电梯的人","titleSlug":"last-person-to-fit-in-the-bus"},{"acceptance":0.46172907488986786,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1205]每月交易II","frequency":26.213058161373958,"frontendQuestionId":"1205","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每月交易II","titleSlug":"monthly-transactions-ii"},{"acceptance":0.6188383645395491,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1206]设计跳表","frequency":18.694466070773423,"frontendQuestionId":"1206","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"设计跳表","titleSlug":"design-skiplist"},{"acceptance":0.7303846201153738,"acs":0,"articleLive":2,"columnArticles":824,"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.49675935828877005,"acs":0,"articleLive":2,"columnArticles":601,"formTitle":"[1208]尽可能使字符串相等","frequency":18.035896247680004,"frontendQuestionId":"1208","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"尽可能使字符串相等","titleSlug":"get-equal-substrings-within-budget"},{"acceptance":0.5320541760722347,"acs":0,"articleLive":2,"columnArticles":157,"formTitle":"[1209]删除字符串中的所有相邻重复项 II","frequency":34.64949327968721,"frontendQuestionId":"1209","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"删除字符串中的所有相邻重复项 II","titleSlug":"remove-all-adjacent-duplicates-in-string-ii"},{"acceptance":0.4503448275862069,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1210]穿过迷宫的最少移动次数","frequency":12.179972950986874,"frontendQuestionId":"1210","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"穿过迷宫的最少移动次数","titleSlug":"minimum-moves-to-reach-target-with-rotations"},{"acceptance":0.6552270819733284,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1211]查询结果的质量和占比","frequency":18.035896247680004,"frontendQuestionId":"1211","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"查询结果的质量和占比","titleSlug":"queries-quality-and-percentage"},{"acceptance":0.5127607751773801,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1212]查询球队积分","frequency":6.061429485312524,"frontendQuestionId":"1212","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询球队积分","titleSlug":"team-scores-in-football-tournament"},{"acceptance":0.7730126920507682,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1213]三个有序数组的交集","frequency":19.380911113840813,"frontendQuestionId":"1213","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三个有序数组的交集","titleSlug":"intersection-of-three-sorted-arrays"},{"acceptance":0.634108825225918,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1214]查找两棵二叉搜索树之和","frequency":7.211508204687712,"frontendQuestionId":"1214","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找两棵二叉搜索树之和","titleSlug":"two-sum-bsts"},{"acceptance":0.4101745423584504,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1215]步进数","frequency":0.0,"frontendQuestionId":"1215","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"步进数","titleSlug":"stepping-numbers"},{"acceptance":0.5337099811676083,"acs":0,"articleLive":2,"columnArticles":37,"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.6955070020746889,"acs":0,"articleLive":2,"columnArticles":347,"formTitle":"[1217]玩筹码","frequency":34.64949327968721,"frontendQuestionId":"1217","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"玩筹码","titleSlug":"minimum-cost-to-move-chips-to-the-same-position"},{"acceptance":0.4207971912432879,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1218]最长定差子序列","frequency":6.061429485312524,"frontendQuestionId":"1218","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长定差子序列","titleSlug":"longest-arithmetic-subsequence-of-given-difference"},{"acceptance":0.6310783370738484,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[1219]黄金矿工","frequency":34.64949327968721,"frontendQuestionId":"1219","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黄金矿工","titleSlug":"path-with-maximum-gold"},{"acceptance":0.5266444629475437,"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.8438333146633807,"acs":0,"articleLive":2,"columnArticles":1101,"formTitle":"[1221]分割平衡字符串","frequency":19.807068844409713,"frontendQuestionId":"1221","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"分割平衡字符串","titleSlug":"split-a-string-in-balanced-strings"},{"acceptance":0.6726593509222507,"acs":0,"articleLive":2,"columnArticles":125,"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.4728393292245951,"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.32569742112290073,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1224]最大相等频率","frequency":29.262324829840008,"frontendQuestionId":"1224","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大相等频率","titleSlug":"maximum-equal-frequency"},{"acceptance":0.5421748840405428,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1225]报告系统状态的连续日期","frequency":18.694466070773423,"frontendQuestionId":"1225","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"报告系统状态的连续日期","titleSlug":"report-contiguous-dates"},{"acceptance":0.5997818408477041,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1226]哲学家进餐","frequency":50.26505379655652,"frontendQuestionId":"1226","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"哲学家进餐","titleSlug":"the-dining-philosophers"},{"acceptance":0.6629901136592912,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1227]飞机座位分配概率","frequency":5.004603235121968,"frontendQuestionId":"1227","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"飞机座位分配概率","titleSlug":"airplane-seat-assignment-probability"},{"acceptance":0.5395951704545454,"acs":0,"articleLive":2,"columnArticles":50,"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.41406945681211044,"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.4907881269191402,"acs":0,"articleLive":2,"columnArticles":56,"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.5589271730618638,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1231]分享巧克力","frequency":19.380911113840813,"frontendQuestionId":"1231","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分享巧克力","titleSlug":"divide-chocolate"},{"acceptance":0.46924647572163797,"acs":0,"articleLive":2,"columnArticles":417,"formTitle":"[1232]缀点成线","frequency":16.208607595358924,"frontendQuestionId":"1232","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"缀点成线","titleSlug":"check-if-it-is-a-straight-line"},{"acceptance":0.4826924267756517,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1233]删除子文件夹","frequency":6.62395241264668,"frontendQuestionId":"1233","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子文件夹","titleSlug":"remove-sub-folders-from-the-filesystem"},{"acceptance":0.34223430023040113,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1234]替换子串得到平衡字符串","frequency":24.866724145644405,"frontendQuestionId":"1234","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"替换子串得到平衡字符串","titleSlug":"replace-the-substring-for-balanced-string"},{"acceptance":0.45410552606931004,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1235]规划兼职工作","frequency":39.622276849619915,"frontendQuestionId":"1235","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"规划兼职工作","titleSlug":"maximum-profit-in-job-scheduling"},{"acceptance":0.56047197640118,"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.7107286449883614,"acs":0,"articleLive":2,"columnArticles":128,"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.6579061685490878,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1238]循环码排列","frequency":5.522175928223974,"frontendQuestionId":"1238","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环码排列","titleSlug":"circular-permutation-in-binary-representation"},{"acceptance":0.4906737452012958,"acs":0,"articleLive":2,"columnArticles":384,"formTitle":"[1239]串联字符串的最大长度","frequency":41.94961522499853,"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.4962211614956245,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1240]铺瓷砖","frequency":29.262324829840008,"frontendQuestionId":"1240","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"铺瓷砖","titleSlug":"tiling-a-rectangle-with-the-fewest-squares"},{"acceptance":0.5946863182391157,"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.469743987587277,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1242]多线程网页爬虫","frequency":15.643615799953498,"frontendQuestionId":"1242","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多线程网页爬虫","titleSlug":"web-crawler-multithreaded"},{"acceptance":0.5395987328405492,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1243]数组变换","frequency":0.0,"frontendQuestionId":"1243","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组变换","titleSlug":"array-transformation"},{"acceptance":0.6192105263157894,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1244]力扣排行榜","frequency":9.855093570160312,"frontendQuestionId":"1244","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"力扣排行榜","titleSlug":"design-a-leaderboard"},{"acceptance":0.5085168869309838,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1245]树的直径","frequency":7.211508204687712,"frontendQuestionId":"1245","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的直径","titleSlug":"tree-diameter"},{"acceptance":0.4801455989410986,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1246]删除回文子数组","frequency":9.855093570160312,"frontendQuestionId":"1246","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除回文子数组","titleSlug":"palindrome-removal"},{"acceptance":0.6167191274430862,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1247]交换字符使得字符串相同","frequency":24.866724145644405,"frontendQuestionId":"1247","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换字符使得字符串相同","titleSlug":"minimum-swaps-to-make-strings-equal"},{"acceptance":0.5588920570264766,"acs":0,"articleLive":2,"columnArticles":467,"formTitle":"[1248]统计「优美子数组」","frequency":17.40322030163009,"frontendQuestionId":"1248","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计「优美子数组」","titleSlug":"count-number-of-nice-subarrays"},{"acceptance":0.5726493465262712,"acs":0,"articleLive":2,"columnArticles":311,"formTitle":"[1249]移除无效的括号","frequency":36.286253269868816,"frontendQuestionId":"1249","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"移除无效的括号","titleSlug":"minimum-remove-to-make-valid-parentheses"},{"acceptance":0.5622609434764131,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1250]检查「好数组」","frequency":9.855093570160312,"frontendQuestionId":"1250","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"检查「好数组」","titleSlug":"check-if-it-is-a-good-array"},{"acceptance":0.7707753479125249,"acs":0,"articleLive":2,"columnArticles":93,"formTitle":"[1251]平均售价","frequency":0.0,"frontendQuestionId":"1251","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"平均售价","titleSlug":"average-selling-price"},{"acceptance":0.7497269137047307,"acs":0,"articleLive":2,"columnArticles":309,"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.3936689549961861,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1253]重构 2 行二进制矩阵","frequency":19.380911113840813,"frontendQuestionId":"1253","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重构 2 行二进制矩阵","titleSlug":"reconstruct-a-2-row-binary-matrix"},{"acceptance":0.5980677551364806,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1254]统计封闭岛屿的数目","frequency":5.522175928223974,"frontendQuestionId":"1254","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计封闭岛屿的数目","titleSlug":"number-of-closed-islands"},{"acceptance":0.6788063909774437,"acs":0,"articleLive":2,"columnArticles":63,"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.6646153846153846,"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.5646279949558638,"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.5574151557415156,"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.4758163515835993,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[1259]不相交的握手","frequency":14.854916490623221,"frontendQuestionId":"1259","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"不相交的握手","titleSlug":"handshakes-that-dont-cross"},{"acceptance":0.6042857853129816,"acs":0,"articleLive":2,"columnArticles":248,"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.7279041004661783,"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.5251804529992533,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1262]可被三整除的最大和","frequency":41.255068326624084,"frontendQuestionId":"1262","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可被三整除的最大和","titleSlug":"greatest-sum-divisible-by-three"},{"acceptance":0.41566014160766346,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1263]推箱子","frequency":8.469811387364896,"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.5699975568043,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1264]页面推荐","frequency":7.211508204687712,"frontendQuestionId":"1264","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐","titleSlug":"page-recommendations"},{"acceptance":0.9200418994413407,"acs":0,"articleLive":2,"columnArticles":64,"formTitle":"[1265]逆序打印不可变链表","frequency":8.469811387364896,"frontendQuestionId":"1265","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"逆序打印不可变链表","titleSlug":"print-immutable-linked-list-in-reverse"},{"acceptance":0.823890462700661,"acs":0,"articleLive":2,"columnArticles":452,"formTitle":"[1266]访问所有点的最小时间","frequency":6.061429485312524,"frontendQuestionId":"1266","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"访问所有点的最小时间","titleSlug":"minimum-time-visiting-all-points"},{"acceptance":0.6080965253510912,"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.5829126798764409,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1268]搜索推荐系统","frequency":7.211508204687712,"frontendQuestionId":"1268","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"搜索推荐系统","titleSlug":"search-suggestions-system"},{"acceptance":0.49166353675065727,"acs":0,"articleLive":2,"columnArticles":320,"formTitle":"[1269]停在原地的方案数","frequency":48.431515106396205,"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.8046744574290484,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1270]向公司CEO汇报工作的所有人","frequency":0.0,"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.5056438127090301,"acs":0,"articleLive":2,"columnArticles":39,"formTitle":"[1271]十六进制魔术数字","frequency":0.0,"frontendQuestionId":"1271","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"十六进制魔术数字","titleSlug":"hexspeak"},{"acceptance":0.5192497532082923,"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.5443661971830986,"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.6005025125628141,"acs":0,"articleLive":2,"columnArticles":25,"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.5399797228793511,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1275]找出井字棋的获胜者","frequency":17.40322030163009,"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.5016403686923918,"acs":0,"articleLive":2,"columnArticles":96,"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.724520804114072,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[1277]统计全为 1 的正方形子矩阵","frequency":33.35349327229824,"frontendQuestionId":"1277","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全为 1 的正方形子矩阵","titleSlug":"count-square-submatrices-with-all-ones"},{"acceptance":0.5979187990446947,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1278]分割回文串 III","frequency":59.04427824711437,"frontendQuestionId":"1278","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文串 III","titleSlug":"palindrome-partitioning-iii"},{"acceptance":0.6231707317073171,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1279]红绿灯路口","frequency":0.0,"frontendQuestionId":"1279","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"红绿灯路口","titleSlug":"traffic-light-controlled-intersection"},{"acceptance":0.5049807828064946,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1280]学生们参加各科测试的次数","frequency":18.035896247680004,"frontendQuestionId":"1280","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"学生们参加各科测试的次数","titleSlug":"students-and-examinations"},{"acceptance":0.8317478531240746,"acs":0,"articleLive":2,"columnArticles":609,"formTitle":"[1281]整数的各位积和之差","frequency":6.061429485312524,"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.8112571621166161,"acs":0,"articleLive":2,"columnArticles":226,"formTitle":"[1282]用户分组","frequency":0.0,"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.4166970691961571,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1283]使结果不超过阈值的最小除数","frequency":18.035896247680004,"frontendQuestionId":"1283","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使结果不超过阈值的最小除数","titleSlug":"find-the-smallest-divisor-given-a-threshold"},{"acceptance":0.6602195504443282,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1284]转化为全零矩阵的最少反转次数","frequency":16.794658773886972,"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.8107745398773006,"acs":0,"articleLive":2,"columnArticles":58,"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.6456747404844291,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1286]字母组合迭代器","frequency":6.061429485312524,"frontendQuestionId":"1286","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字母组合迭代器","titleSlug":"iterator-for-combination"},{"acceptance":0.6038530287984111,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1287]有序数组中出现次数超过25%的元素","frequency":16.794658773886972,"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.5634995296331138,"acs":0,"articleLive":2,"columnArticles":168,"formTitle":"[1288]删除被覆盖区间","frequency":24.866724145644405,"frontendQuestionId":"1288","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除被覆盖区间","titleSlug":"remove-covered-intervals"},{"acceptance":0.6272532844485181,"acs":0,"articleLive":2,"columnArticles":91,"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.8092690255718403,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[1290]二进制链表转整数","frequency":5.004603235121968,"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.5192133131618759,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1291]顺次数","frequency":0.0,"frontendQuestionId":"1291","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顺次数","titleSlug":"sequential-digits"},{"acceptance":0.4679897567221511,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1292]元素和小于等于阈值的正方形的最大边长","frequency":6.061429485312524,"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.3563994531097408,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1293]网格中的最短路径","frequency":57.13142152277937,"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.6581263446117739,"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.8091097801674266,"acs":0,"articleLive":2,"columnArticles":628,"formTitle":"[1295]统计位数为偶数的数字","frequency":17.40322030163009,"frontendQuestionId":"1295","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计位数为偶数的数字","titleSlug":"find-numbers-with-even-number-of-digits"},{"acceptance":0.45329176160211054,"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.4572455951096728,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1297]子串的最大出现次数","frequency":26.92735682920287,"frontendQuestionId":"1297","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子串的最大出现次数","titleSlug":"maximum-number-of-occurrences-of-a-substring"},{"acceptance":0.5962732919254659,"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.7855685741186317,"acs":0,"articleLive":2,"columnArticles":427,"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.4672246283506965,"acs":0,"articleLive":2,"columnArticles":362,"formTitle":"[1300]转变数组后最接近目标值的数组和","frequency":4.507275614106019,"frontendQuestionId":"1300","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"转变数组后最接近目标值的数组和","titleSlug":"sum-of-mutated-array-closest-to-target"},{"acceptance":0.3609426038264116,"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.817035237973497,"acs":0,"articleLive":2,"columnArticles":290,"formTitle":"[1302]层数最深叶子节点的和","frequency":24.866724145644405,"frontendQuestionId":"1302","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"层数最深叶子节点的和","titleSlug":"deepest-leaves-sum"},{"acceptance":0.822312060833574,"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.7246907608320089,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[1304]和为零的N个唯一整数","frequency":6.061429485312524,"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.7464710063978877,"acs":0,"articleLive":2,"columnArticles":221,"formTitle":"[1305]两棵二叉搜索树中的所有元素","frequency":6.061429485312524,"frontendQuestionId":"1305","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两棵二叉搜索树中的所有元素","titleSlug":"all-elements-in-two-binary-search-trees"},{"acceptance":0.5748576078112286,"acs":0,"articleLive":2,"columnArticles":264,"formTitle":"[1306]跳跃游戏 III","frequency":30.333498337885196,"frontendQuestionId":"1306","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 III","titleSlug":"jump-game-iii"},{"acceptance":0.33266313288247124,"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.7517211073678043,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[1308]不同性别每日分数总计","frequency":6.62395241264668,"frontendQuestionId":"1308","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"不同性别每日分数总计","titleSlug":"running-total-for-different-genders"},{"acceptance":0.7557188409815611,"acs":0,"articleLive":2,"columnArticles":285,"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.712586183587941,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[1310]子数组异或查询","frequency":53.624524664341436,"frontendQuestionId":"1310","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组异或查询","titleSlug":"xor-queries-of-a-subarray"},{"acceptance":0.37801423340012436,"acs":0,"articleLive":2,"columnArticles":85,"formTitle":"[1311]获取你好友已观看的视频","frequency":7.211508204687712,"frontendQuestionId":"1311","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"获取你好友已观看的视频","titleSlug":"get-watched-videos-by-your-friends"},{"acceptance":0.6662528585429598,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1312]让字符串成为回文串的最少插入次数","frequency":37.550349817636906,"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.8316490253364625,"acs":0,"articleLive":2,"columnArticles":540,"formTitle":"[1313]解压缩编码列表","frequency":5.004603235121968,"frontendQuestionId":"1313","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"解压缩编码列表","titleSlug":"decompress-run-length-encoded-list"},{"acceptance":0.7351810641310945,"acs":0,"articleLive":2,"columnArticles":183,"formTitle":"[1314]矩阵区域和","frequency":34.64949327968721,"frontendQuestionId":"1314","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵区域和","titleSlug":"matrix-block-sum"},{"acceptance":0.8102021174205968,"acs":0,"articleLive":2,"columnArticles":258,"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.43972999035679844,"acs":0,"articleLive":2,"columnArticles":57,"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.6139438085327783,"acs":0,"articleLive":2,"columnArticles":189,"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.6538909475913182,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1318]或运算的最小翻转次数","frequency":49.05746146123761,"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.6173136865967697,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[1319]连通网络的操作次数","frequency":6.62395241264668,"frontendQuestionId":"1319","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连通网络的操作次数","titleSlug":"number-of-operations-to-make-network-connected"},{"acceptance":0.5892509727626459,"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.6167247386759582,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1321]餐馆营业额变化增长","frequency":5.522175928223974,"frontendQuestionId":"1321","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"餐馆营业额变化增长","titleSlug":"restaurant-growth"},{"acceptance":0.5926998841251448,"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.7552191737622201,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[1323]6 和 9 组成的最大数字","frequency":24.866724145644405,"frontendQuestionId":"1323","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"6 和 9 组成的最大数字","titleSlug":"maximum-69-number"},{"acceptance":0.5898528665651953,"acs":0,"articleLive":2,"columnArticles":113,"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.728302162478083,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1325]删除给定值的叶子节点","frequency":6.061429485312524,"frontendQuestionId":"1325","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除给定值的叶子节点","titleSlug":"delete-leaves-with-a-given-value"},{"acceptance":0.47445939043078494,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1326]灌溉花园的最少水龙头数目","frequency":6.62395241264668,"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.6905753709971362,"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.4591414944356121,"acs":0,"articleLive":2,"columnArticles":115,"formTitle":"[1328]破坏回文串","frequency":17.40322030163009,"frontendQuestionId":"1328","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"破坏回文串","titleSlug":"break-a-palindrome"},{"acceptance":0.7708497467642094,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1329]将矩阵按对角线排序","frequency":7.211508204687712,"frontendQuestionId":"1329","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将矩阵按对角线排序","titleSlug":"sort-the-matrix-diagonally"},{"acceptance":0.3785831960461285,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1330]翻转子数组得到最大的数组值","frequency":14.854916490623221,"frontendQuestionId":"1330","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转子数组得到最大的数组值","titleSlug":"reverse-subarray-to-maximize-array-value"},{"acceptance":0.5360059391239792,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1331]数组序号转换","frequency":17.40322030163009,"frontendQuestionId":"1331","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组序号转换","titleSlug":"rank-transform-of-an-array"},{"acceptance":0.6849192768395209,"acs":0,"articleLive":2,"columnArticles":131,"formTitle":"[1332]删除回文子序列","frequency":6.061429485312524,"frontendQuestionId":"1332","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除回文子序列","titleSlug":"remove-palindromic-subsequences"},{"acceptance":0.5430346051464063,"acs":0,"articleLive":2,"columnArticles":116,"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.49014209591474245,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1334]阈值距离内邻居最少的城市","frequency":50.26505379655652,"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.5856277056277056,"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.4245933957614588,"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.7060783595752471,"acs":0,"articleLive":2,"columnArticles":614,"formTitle":"[1337]矩阵中战斗力最弱的 K 行","frequency":38.21594276395469,"frontendQuestionId":"1337","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"矩阵中战斗力最弱的 K 行","titleSlug":"the-k-weakest-rows-in-a-matrix"},{"acceptance":0.6404193781634129,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1338]数组大小减半","frequency":6.061429485312524,"frontendQuestionId":"1338","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组大小减半","titleSlug":"reduce-array-size-to-the-half"},{"acceptance":0.3979213428320484,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1339]分裂二叉树的最大乘积","frequency":6.62395241264668,"frontendQuestionId":"1339","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分裂二叉树的最大乘积","titleSlug":"maximum-product-of-splitted-binary-tree"},{"acceptance":0.5723833712070578,"acs":0,"articleLive":2,"columnArticles":95,"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.480777728678745,"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.8205350972455326,"acs":0,"articleLive":2,"columnArticles":634,"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.5438793103448276,"acs":0,"articleLive":2,"columnArticles":212,"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.5936646088452586,"acs":0,"articleLive":2,"columnArticles":120,"formTitle":"[1344]时钟指针的夹角","frequency":6.061429485312524,"frontendQuestionId":"1344","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"时钟指针的夹角","titleSlug":"angle-between-hands-of-a-clock"},{"acceptance":0.3667462725101659,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1345]跳跃游戏 IV","frequency":6.62395241264668,"frontendQuestionId":"1345","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 IV","titleSlug":"jump-game-iv"},{"acceptance":0.4356314652722519,"acs":0,"articleLive":2,"columnArticles":265,"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.7393488551830741,"acs":0,"articleLive":2,"columnArticles":111,"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.3039368544143442,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1348]推文计数","frequency":8.469811387364896,"frontendQuestionId":"1348","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"推文计数","titleSlug":"tweet-counts-per-frequency"},{"acceptance":0.5042763157894737,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1349]参加考试的最大学生数","frequency":7.826061825326265,"frontendQuestionId":"1349","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"参加考试的最大学生数","titleSlug":"maximum-students-taking-exam"},{"acceptance":0.8490585665244981,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1350]院系无效的学生","frequency":6.62395241264668,"frontendQuestionId":"1350","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"院系无效的学生","titleSlug":"students-with-invalid-departments"},{"acceptance":0.7551587505789121,"acs":0,"articleLive":2,"columnArticles":541,"formTitle":"[1351]统计有序矩阵中的负数","frequency":6.061429485312524,"frontendQuestionId":"1351","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计有序矩阵中的负数","titleSlug":"count-negative-numbers-in-a-sorted-matrix"},{"acceptance":0.44287477712247975,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1352]最后 K 个数的乘积","frequency":6.061429485312524,"frontendQuestionId":"1352","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最后 K 个数的乘积","titleSlug":"product-of-the-last-k-numbers"},{"acceptance":0.28280612244897957,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1353]最多可以参加的会议数目","frequency":55.06543696082743,"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.2818307631474891,"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.662547017732402,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1355]活动参与者","frequency":0.0,"frontendQuestionId":"1355","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活动参与者","titleSlug":"activity-participants"},{"acceptance":0.7315347760378147,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1356]根据数字二进制下 1 的数目排序","frequency":16.794658773886972,"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.5290102389078498,"acs":0,"articleLive":2,"columnArticles":41,"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.4890431959599603,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1358]包含所有三种字符的子字符串数目","frequency":6.62395241264668,"frontendQuestionId":"1358","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有三种字符的子字符串数目","titleSlug":"number-of-substrings-containing-all-three-characters"},{"acceptance":0.547518585493269,"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.5035880118193331,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1360]日期之间隔几天","frequency":30.333498337885196,"frontendQuestionId":"1360","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"日期之间隔几天","titleSlug":"number-of-days-between-two-dates"},{"acceptance":0.4015394838852586,"acs":0,"articleLive":2,"columnArticles":193,"formTitle":"[1361]验证二叉树","frequency":6.061429485312524,"frontendQuestionId":"1361","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"验证二叉树","titleSlug":"validate-binary-tree-nodes"},{"acceptance":0.5237567948459835,"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.36340718105423986,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1363]形成三的最大倍数","frequency":31.709178233000372,"frontendQuestionId":"1363","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"形成三的最大倍数","titleSlug":"largest-multiple-of-three"},{"acceptance":0.6761150479366402,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1364]顾客的可信联系人数量","frequency":6.62395241264668,"frontendQuestionId":"1364","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"顾客的可信联系人数量","titleSlug":"number-of-trusted-contacts-of-a-customer"},{"acceptance":0.8250296269453395,"acs":0,"articleLive":2,"columnArticles":1080,"formTitle":"[1365]有多少小于当前数字的数字","frequency":24.866724145644405,"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.5377300139168084,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1366]通过投票对团队排名","frequency":18.694466070773423,"frontendQuestionId":"1366","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"通过投票对团队排名","titleSlug":"rank-teams-by-votes"},{"acceptance":0.41744940176674494,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[1367]二叉树中的列表","frequency":17.40322030163009,"frontendQuestionId":"1367","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"二叉树中的列表","titleSlug":"linked-list-in-binary-tree"},{"acceptance":0.5223902728351127,"acs":0,"articleLive":2,"columnArticles":86,"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.6098136352913422,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1369]获取最近第二次的活动","frequency":6.62395241264668,"frontendQuestionId":"1369","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"获取最近第二次的活动","titleSlug":"get-the-second-most-recent-activity"},{"acceptance":0.7905562806681316,"acs":0,"articleLive":2,"columnArticles":574,"formTitle":"[1370]上升下降字符串","frequency":6.061429485312524,"frontendQuestionId":"1370","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"上升下降字符串","titleSlug":"increasing-decreasing-string"},{"acceptance":0.57985603574285,"acs":0,"articleLive":2,"columnArticles":262,"formTitle":"[1371]每个元音包含偶数次的最长子字符串","frequency":41.94961522499853,"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.5131182243889922,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1372]二叉树中的最长交错路径","frequency":6.061429485312524,"frontendQuestionId":"1372","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树中的最长交错路径","titleSlug":"longest-zigzag-path-in-a-binary-tree"},{"acceptance":0.3988317757009346,"acs":0,"articleLive":2,"columnArticles":155,"formTitle":"[1373]二叉搜索子树的最大键值和","frequency":30.333498337885196,"frontendQuestionId":"1373","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索子树的最大键值和","titleSlug":"maximum-sum-bst-in-binary-tree"},{"acceptance":0.7394266501504159,"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.5730087003439671,"acs":0,"articleLive":2,"columnArticles":170,"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.5022161609273781,"acs":0,"articleLive":2,"columnArticles":152,"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.3249251142992275,"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.8619884478308959,"acs":0,"articleLive":2,"columnArticles":59,"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.8368533071381794,"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.7279382403833355,"acs":0,"articleLive":2,"columnArticles":247,"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.7315204421277397,"acs":0,"articleLive":2,"columnArticles":149,"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.6913065777663803,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1382]将二叉搜索树变平衡","frequency":0.0,"frontendQuestionId":"1382","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将二叉搜索树变平衡","titleSlug":"balance-a-binary-search-tree"},{"acceptance":0.3238061041292639,"acs":0,"articleLive":2,"columnArticles":86,"formTitle":"[1383]最大的团队表现值","frequency":7.826061825326265,"frontendQuestionId":"1383","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大的团队表现值","titleSlug":"maximum-performance-of-a-team"},{"acceptance":0.5436046511627907,"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.7028397565922921,"acs":0,"articleLive":2,"columnArticles":197,"formTitle":"[1385]两个数组间的距离值","frequency":6.061429485312524,"frontendQuestionId":"1385","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组间的距离值","titleSlug":"find-the-distance-value-between-two-arrays"},{"acceptance":0.31104827307614624,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1386]安排电影院座位","frequency":19.380911113840813,"frontendQuestionId":"1386","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"安排电影院座位","titleSlug":"cinema-seat-allocation"},{"acceptance":0.6941439492283283,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1387]将整数按权重排序","frequency":18.694466070773423,"frontendQuestionId":"1387","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将整数按权重排序","titleSlug":"sort-integers-by-the-power-value"},{"acceptance":0.5385022492722943,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1388]3n 块披萨","frequency":24.866724145644405,"frontendQuestionId":"1388","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"3n 块披萨","titleSlug":"pizza-with-3n-slices"},{"acceptance":0.8308788456952063,"acs":0,"articleLive":2,"columnArticles":477,"formTitle":"[1389]按既定顺序创建目标数组","frequency":16.794658773886972,"frontendQuestionId":"1389","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按既定顺序创建目标数组","titleSlug":"create-target-array-in-the-given-order"},{"acceptance":0.35312127912910357,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1390]四因数","frequency":0.0,"frontendQuestionId":"1390","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"四因数","titleSlug":"four-divisors"},{"acceptance":0.4004784395510029,"acs":0,"articleLive":2,"columnArticles":201,"formTitle":"[1391]检查网格中是否存在有效路径","frequency":19.380911113840813,"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.40114720703334406,"acs":0,"articleLive":2,"columnArticles":136,"formTitle":"[1392]最长快乐前缀","frequency":6.62395241264668,"frontendQuestionId":"1392","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐前缀","titleSlug":"longest-happy-prefix"},{"acceptance":0.8562077241981235,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1393]股票的资本损益","frequency":0.0,"frontendQuestionId":"1393","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"股票的资本损益","titleSlug":"capital-gainloss"},{"acceptance":0.6639578212954887,"acs":0,"articleLive":2,"columnArticles":269,"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.7489577765900588,"acs":0,"articleLive":2,"columnArticles":210,"formTitle":"[1395]统计作战单位数","frequency":6.62395241264668,"frontendQuestionId":"1395","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计作战单位数","titleSlug":"count-number-of-teams"},{"acceptance":0.41400940930475694,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1396]设计地铁系统","frequency":19.380911113840813,"frontendQuestionId":"1396","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"设计地铁系统","titleSlug":"design-underground-system"},{"acceptance":0.36958934517203107,"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.7711306256860593,"acs":0,"articleLive":2,"columnArticles":63,"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.6693325578013669,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1399]统计最大组的数目","frequency":6.061429485312524,"frontendQuestionId":"1399","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计最大组的数目","titleSlug":"count-largest-group"},{"acceptance":0.6048689138576779,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1400]构造 K 个回文字符串","frequency":6.061429485312524,"frontendQuestionId":"1400","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"构造 K 个回文字符串","titleSlug":"construct-k-palindrome-strings"},{"acceptance":0.41715336361669914,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1401]圆和矩形是否有重叠","frequency":0.0,"frontendQuestionId":"1401","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"圆和矩形是否有重叠","titleSlug":"circle-and-rectangle-overlapping"},{"acceptance":0.7519528136457835,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1402]做菜顺序","frequency":5.522175928223974,"frontendQuestionId":"1402","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"做菜顺序","titleSlug":"reducing-dishes"},{"acceptance":0.6915020548853241,"acs":0,"articleLive":2,"columnArticles":358,"formTitle":"[1403]非递增顺序的最小子序列","frequency":16.794658773886972,"frontendQuestionId":"1403","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"非递增顺序的最小子序列","titleSlug":"minimum-subsequence-in-non-increasing-order"},{"acceptance":0.492587974508174,"acs":0,"articleLive":2,"columnArticles":152,"formTitle":"[1404]将二进制表示减到 1 的步骤数","frequency":7.211508204687712,"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.5063349671691483,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1405]最长快乐字符串","frequency":18.035896247680004,"frontendQuestionId":"1405","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长快乐字符串","titleSlug":"longest-happy-string"},{"acceptance":0.5686461942884454,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1406]石子游戏 III","frequency":7.826061825326265,"frontendQuestionId":"1406","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 III","titleSlug":"stone-game-iii"},{"acceptance":0.6672127311022701,"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.6146650998824912,"acs":0,"articleLive":2,"columnArticles":198,"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.8057010475423045,"acs":0,"articleLive":2,"columnArticles":128,"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.4754108968551831,"acs":0,"articleLive":2,"columnArticles":117,"formTitle":"[1410]HTML 实体解析器","frequency":6.62395241264668,"frontendQuestionId":"1410","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"HTML 实体解析器","titleSlug":"html-entity-parser"},{"acceptance":0.5499534483993411,"acs":0,"articleLive":2,"columnArticles":140,"formTitle":"[1411]给 N x 3 网格图涂色的方案数","frequency":37.550349817636906,"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.5509481141904563,"acs":0,"articleLive":2,"columnArticles":65,"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.6922573466849925,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1413]逐步求和得到正数的最小值","frequency":16.208607595358924,"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.6020442080771149,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1414]和为 K 的最少斐波那契数字数目","frequency":24.866724145644405,"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.6840717299578059,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1415]长度为 n 的开心字符串中字典序第 k 小的字符串","frequency":7.211508204687712,"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.4082901554404145,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1416]恢复数组","frequency":18.035896247680004,"frontendQuestionId":"1416","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复数组","titleSlug":"restore-the-array"},{"acceptance":0.518470034771937,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1417]重新格式化字符串","frequency":6.62395241264668,"frontendQuestionId":"1417","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新格式化字符串","titleSlug":"reformat-the-string"},{"acceptance":0.7327171903881701,"acs":0,"articleLive":2,"columnArticles":412,"formTitle":"[1418]点菜展示表","frequency":49.05746146123761,"frontendQuestionId":"1418","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"点菜展示表","titleSlug":"display-table-of-food-orders-in-a-restaurant"},{"acceptance":0.4190512048192771,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1419]数青蛙","frequency":34.64949327968721,"frontendQuestionId":"1419","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数青蛙","titleSlug":"minimum-number-of-frogs-croaking"},{"acceptance":0.5948577134298553,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1420]生成数组","frequency":24.230923379013827,"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.7490837327318861,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1421]净现值查询","frequency":0.0,"frontendQuestionId":"1421","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"净现值查询","titleSlug":"npv-queries"},{"acceptance":0.5408468440107036,"acs":0,"articleLive":2,"columnArticles":191,"formTitle":"[1422]分割字符串的最大得分","frequency":31.008249446544394,"frontendQuestionId":"1422","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分割字符串的最大得分","titleSlug":"maximum-score-after-splitting-a-string"},{"acceptance":0.5542909576780051,"acs":0,"articleLive":2,"columnArticles":503,"formTitle":"[1423]可获得的最大点数","frequency":6.061429485312524,"frontendQuestionId":"1423","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可获得的最大点数","titleSlug":"maximum-points-you-can-obtain-from-cards"},{"acceptance":0.3970784337495454,"acs":0,"articleLive":2,"columnArticles":137,"formTitle":"[1424]对角线遍历 II","frequency":18.035896247680004,"frontendQuestionId":"1424","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"对角线遍历 II","titleSlug":"diagonal-traverse-ii"},{"acceptance":0.43478260869565216,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1425]带限制的子序列和","frequency":7.211508204687712,"frontendQuestionId":"1425","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"带限制的子序列和","titleSlug":"constrained-subsequence-sum"},{"acceptance":0.7049595141700404,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1426]数元素","frequency":19.380911113840813,"frontendQuestionId":"1426","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数元素","titleSlug":"counting-elements"},{"acceptance":0.6597614563716259,"acs":0,"articleLive":2,"columnArticles":44,"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.5901639344262295,"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.4997758852532497,"acs":0,"articleLive":2,"columnArticles":38,"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.5782493368700266,"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.8463484274408051,"acs":0,"articleLive":2,"columnArticles":1026,"formTitle":"[1431]拥有最多糖果的孩子","frequency":6.061429485312524,"frontendQuestionId":"1431","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拥有最多糖果的孩子","titleSlug":"kids-with-the-greatest-number-of-candies"},{"acceptance":0.3931571037043586,"acs":0,"articleLive":2,"columnArticles":99,"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.6430443328237606,"acs":0,"articleLive":2,"columnArticles":99,"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.4560975609756098,"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.6196481394986766,"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.783617949286612,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1436]旅行终点站","frequency":0.0,"frontendQuestionId":"1436","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"旅行终点站","titleSlug":"destination-city"},{"acceptance":0.5891008491334186,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[1437]是否所有 1 都至少相隔 k 个元素","frequency":6.62395241264668,"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.48243365388889714,"acs":0,"articleLive":2,"columnArticles":461,"formTitle":"[1438]绝对差不超过限制的最长连续子数组","frequency":35.68497562644718,"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.5609456555112067,"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.6989422294548413,"acs":0,"articleLive":2,"columnArticles":34,"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.6476912880182635,"acs":0,"articleLive":2,"columnArticles":369,"formTitle":"[1441]用栈操作构建数组","frequency":7.211508204687712,"frontendQuestionId":"1441","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"用栈操作构建数组","titleSlug":"build-an-array-with-stack-operations"},{"acceptance":0.7918453459306992,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1442]形成两个异或相等数组的三元组数目","frequency":52.94170328824299,"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.41032123735871506,"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.5244626407369498,"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.8596846846846847,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1445]苹果和桔子","frequency":0.0,"frontendQuestionId":"1445","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和桔子","titleSlug":"apples-oranges"},{"acceptance":0.5726420349053101,"acs":0,"articleLive":2,"columnArticles":212,"formTitle":"[1446]连续字符","frequency":0.0,"frontendQuestionId":"1446","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续字符","titleSlug":"consecutive-characters"},{"acceptance":0.617046180038306,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1447]最简分数","frequency":0.0,"frontendQuestionId":"1447","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最简分数","titleSlug":"simplified-fractions"},{"acceptance":0.712651567147106,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1448]统计二叉树中好节点的数目","frequency":5.004603235121968,"frontendQuestionId":"1448","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计二叉树中好节点的数目","titleSlug":"count-good-nodes-in-binary-tree"},{"acceptance":0.6276333999692449,"acs":0,"articleLive":2,"columnArticles":206,"formTitle":"[1449]数位成本和为目标值的最大数字","frequency":36.04340313970188,"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.8024574987375863,"acs":0,"articleLive":2,"columnArticles":339,"formTitle":"[1450]在既定时间做作业的学生人数","frequency":5.522175928223974,"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.5218032441542027,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1451]重新排列句子中的单词","frequency":6.62395241264668,"frontendQuestionId":"1451","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列句子中的单词","titleSlug":"rearrange-words-in-a-sentence"},{"acceptance":0.49804321932958995,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1452]收藏清单","frequency":7.211508204687712,"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.3627141568981064,"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.4026471322733705,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1454]活跃用户","frequency":19.380911113840813,"frontendQuestionId":"1454","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"活跃用户","titleSlug":"active-users"},{"acceptance":0.6335273197542839,"acs":0,"articleLive":2,"columnArticles":199,"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.5199886589169266,"acs":0,"articleLive":2,"columnArticles":202,"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.6346573901787881,"acs":0,"articleLive":2,"columnArticles":136,"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.4413567959232423,"acs":0,"articleLive":2,"columnArticles":88,"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.5945063910796845,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1459]矩形面积","frequency":0.0,"frontendQuestionId":"1459","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩形面积","titleSlug":"rectangles-area"},{"acceptance":0.7445393169181891,"acs":0,"articleLive":2,"columnArticles":307,"formTitle":"[1460]通过翻转子数组使两个数组相等","frequency":0.0,"frontendQuestionId":"1460","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"通过翻转子数组使两个数组相等","titleSlug":"make-two-arrays-equal-by-reversing-sub-arrays"},{"acceptance":0.5004793863854267,"acs":0,"articleLive":2,"columnArticles":83,"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.42734313934484475,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1462]课程表 IV","frequency":5.522175928223974,"frontendQuestionId":"1462","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程表 IV","titleSlug":"course-schedule-iv"},{"acceptance":0.5903103371288234,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1463]摘樱桃 II","frequency":9.145226304517246,"frontendQuestionId":"1463","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"摘樱桃 II","titleSlug":"cherry-pickup-ii"},{"acceptance":0.768344218209758,"acs":0,"articleLive":2,"columnArticles":361,"formTitle":"[1464]数组中两元素的最大乘积","frequency":16.794658773886972,"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.3082970727848101,"acs":0,"articleLive":2,"columnArticles":79,"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.48534201954397393,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1466]重新规划路线","frequency":18.035896247680004,"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.6145357686453576,"acs":0,"articleLive":2,"columnArticles":47,"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.7117925704313138,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1468]计算税后工资","frequency":0.0,"frontendQuestionId":"1468","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算税后工资","titleSlug":"calculate-salaries"},{"acceptance":0.8019504876219055,"acs":0,"articleLive":2,"columnArticles":81,"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.8433406635433598,"acs":0,"articleLive":2,"columnArticles":722,"formTitle":"[1470]重新排列数组","frequency":41.255068326624084,"frontendQuestionId":"1470","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列数组","titleSlug":"shuffle-the-array"},{"acceptance":0.543057210965435,"acs":0,"articleLive":2,"columnArticles":104,"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.6173813979982098,"acs":0,"articleLive":2,"columnArticles":125,"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.6746097678282541,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1473]粉刷房子 III","frequency":46.86047926100072,"frontendQuestionId":"1473","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子 III","titleSlug":"paint-house-iii"},{"acceptance":0.7190402476780186,"acs":0,"articleLive":2,"columnArticles":61,"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.7208581287193079,"acs":0,"articleLive":2,"columnArticles":224,"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.8648330331162533,"acs":0,"articleLive":2,"columnArticles":114,"formTitle":"[1476]子矩形查询","frequency":18.694466070773423,"frontendQuestionId":"1476","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子矩形查询","titleSlug":"subrectangle-queries"},{"acceptance":0.2894482090997096,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1477]找两个和为目标值且不重叠的子数组","frequency":17.40322030163009,"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.5762900355871886,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[1478]安排邮筒","frequency":19.380911113840813,"frontendQuestionId":"1478","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"安排邮筒","titleSlug":"allocate-mailboxes"},{"acceptance":0.5729198649063555,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1479]周内每天的销售情况","frequency":6.061429485312524,"frontendQuestionId":"1479","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"周内每天的销售情况","titleSlug":"sales-by-day-of-the-week"},{"acceptance":0.8694948474025309,"acs":0,"articleLive":2,"columnArticles":1278,"formTitle":"[1480]一维数组的动态和","frequency":31.59668650322046,"frontendQuestionId":"1480","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"一维数组的动态和","titleSlug":"running-sum-of-1d-array"},{"acceptance":0.5126542889741728,"acs":0,"articleLive":2,"columnArticles":143,"formTitle":"[1481]不同整数的最少数目","frequency":34.64949327968721,"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.5869090356525538,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[1482]制作 m 束花所需的最少天数","frequency":48.35466712349478,"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.299390694239291,"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.8053191489361702,"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.6592686920138258,"acs":0,"articleLive":2,"columnArticles":44,"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.8586163644555939,"acs":0,"articleLive":2,"columnArticles":674,"formTitle":"[1486]数组异或操作","frequency":48.35466712349478,"frontendQuestionId":"1486","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"数组异或操作","titleSlug":"xor-operation-in-an-array"},{"acceptance":0.30855139805983534,"acs":0,"articleLive":2,"columnArticles":103,"formTitle":"[1487]保证文件名唯一","frequency":24.866724145644405,"frontendQuestionId":"1487","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"保证文件名唯一","titleSlug":"making-file-names-unique"},{"acceptance":0.23577154308617235,"acs":0,"articleLive":2,"columnArticles":110,"formTitle":"[1488]避免洪水泛滥","frequency":61.298938862228304,"frontendQuestionId":"1488","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"避免洪水泛滥","titleSlug":"avoid-flood-in-the-city"},{"acceptance":0.6919225432828618,"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.8582375478927203,"acs":0,"articleLive":2,"columnArticles":29,"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.6718064692982456,"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.665758591785415,"acs":0,"articleLive":2,"columnArticles":75,"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.566141611867258,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[1493]删掉一个元素以后全为 1 的最长子数组","frequency":24.866724145644405,"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.3667058625902906,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1494]并行课程 II","frequency":28.449342063288796,"frontendQuestionId":"1494","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"并行课程 II","titleSlug":"parallel-courses-ii"},{"acceptance":0.5428040588823781,"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.5380858883350954,"acs":0,"articleLive":2,"columnArticles":161,"formTitle":"[1496]判断路径是否相交","frequency":6.62395241264668,"frontendQuestionId":"1496","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断路径是否相交","titleSlug":"path-crossing"},{"acceptance":0.39056050131794895,"acs":0,"articleLive":2,"columnArticles":107,"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.33281148075668626,"acs":0,"articleLive":2,"columnArticles":65,"formTitle":"[1498]满足条件的子序列数目","frequency":20.097446297355418,"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.3767636049524906,"acs":0,"articleLive":2,"columnArticles":58,"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.3027681660899654,"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.5913266074386387,"acs":0,"articleLive":2,"columnArticles":57,"formTitle":"[1501]可以放心投资的国家","frequency":24.866724145644405,"frontendQuestionId":"1501","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以放心投资的国家","titleSlug":"countries-you-can-safely-invest-in"},{"acceptance":0.7170617064572525,"acs":0,"articleLive":2,"columnArticles":299,"formTitle":"[1502]判断能否形成等差数列","frequency":34.64949327968721,"frontendQuestionId":"1502","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判断能否形成等差数列","titleSlug":"can-make-arithmetic-progression-from-sequence"},{"acceptance":0.5121906730710768,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1503]所有蚂蚁掉下来前的最后一刻","frequency":18.035896247680004,"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.5924749572440753,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1504]统计全 1 子矩形","frequency":33.990080073438854,"frontendQuestionId":"1504","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计全 1 子矩形","titleSlug":"count-submatrices-with-all-ones"},{"acceptance":0.361367940291857,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[1505]最多 K 次交换相邻数位后得到的最小整数","frequency":33.19773971775239,"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.8435054773082942,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1506]找到 N 叉树的根节点","frequency":27.29571981918943,"frontendQuestionId":"1506","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到 N 叉树的根节点","titleSlug":"find-root-of-n-ary-tree"},{"acceptance":0.5886281363125702,"acs":0,"articleLive":2,"columnArticles":130,"formTitle":"[1507]转变日期格式","frequency":30.333498337885196,"frontendQuestionId":"1507","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转变日期格式","titleSlug":"reformat-date"},{"acceptance":0.5522125532308831,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1508]子数组和排序后的区间和","frequency":7.211508204687712,"frontendQuestionId":"1508","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"子数组和排序后的区间和","titleSlug":"range-sum-of-sorted-subarray-sums"},{"acceptance":0.5459051481356314,"acs":0,"articleLive":2,"columnArticles":74,"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.5777906976744186,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1510]石子游戏 IV","frequency":30.333498337885196,"frontendQuestionId":"1510","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 IV","titleSlug":"stone-game-iv"},{"acceptance":0.6821078009299122,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1511]消费者下单频率","frequency":6.62395241264668,"frontendQuestionId":"1511","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消费者下单频率","titleSlug":"customer-order-frequency"},{"acceptance":0.8488249582955311,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[1512]好数对的数目","frequency":5.522175928223974,"frontendQuestionId":"1512","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"好数对的数目","titleSlug":"number-of-good-pairs"},{"acceptance":0.37881887852411833,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1513]仅含 1 的子串数","frequency":5.522175928223974,"frontendQuestionId":"1513","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"仅含 1 的子串数","titleSlug":"number-of-substrings-with-only-1s"},{"acceptance":0.31832126118449083,"acs":0,"articleLive":2,"columnArticles":133,"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.3414874945151382,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1515]服务中心的最佳位置","frequency":0.0,"frontendQuestionId":"1515","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"服务中心的最佳位置","titleSlug":"best-position-for-a-service-centre"},{"acceptance":0.5767326732673267,"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.7314464007131714,"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.6740355797519866,"acs":0,"articleLive":2,"columnArticles":390,"formTitle":"[1518]换酒问题","frequency":24.866724145644405,"frontendQuestionId":"1518","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"换酒问题","titleSlug":"water-bottles"},{"acceptance":0.2961569910057236,"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.3322245875465673,"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.3948087431693989,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1521]找到最接近目标值的函数值","frequency":13.064156305005737,"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.7005235602094241,"acs":0,"articleLive":2,"columnArticles":27,"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.5772106824925816,"acs":0,"articleLive":2,"columnArticles":166,"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.42558723327954096,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1524]和为奇数的子数组数目","frequency":16.794658773886972,"frontendQuestionId":"1524","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和为奇数的子数组数目","titleSlug":"number-of-sub-arrays-with-odd-sum"},{"acceptance":0.6620270783246869,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1525]字符串的好分割数目","frequency":0.0,"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.6123224644928986,"acs":0,"articleLive":2,"columnArticles":48,"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.5063142437591777,"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.7844532349271245,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[1528]重新排列字符串","frequency":16.794658773886972,"frontendQuestionId":"1528","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列字符串","titleSlug":"shuffle-string"},{"acceptance":0.6893196264615867,"acs":0,"articleLive":2,"columnArticles":132,"formTitle":"[1529]灯泡开关 IV","frequency":7.211508204687712,"frontendQuestionId":"1529","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"灯泡开关 IV","titleSlug":"bulb-switcher-iv"},{"acceptance":0.566197369290766,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1530]好叶子节点对的数量","frequency":17.40322030163009,"frontendQuestionId":"1530","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"好叶子节点对的数量","titleSlug":"number-of-good-leaf-nodes-pairs"},{"acceptance":0.3244122965641953,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1531]压缩字符串 II","frequency":21.631051781307388,"frontendQuestionId":"1531","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"压缩字符串 II","titleSlug":"string-compression-ii"},{"acceptance":0.6196201009858139,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1532]最近的三笔订单","frequency":6.061429485312524,"frontendQuestionId":"1532","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的三笔订单","titleSlug":"the-most-recent-three-orders"},{"acceptance":0.610738255033557,"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.7897174401197605,"acs":0,"articleLive":2,"columnArticles":158,"formTitle":"[1534]统计好三元组","frequency":6.061429485312524,"frontendQuestionId":"1534","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好三元组","titleSlug":"count-good-triplets"},{"acceptance":0.45293711126468555,"acs":0,"articleLive":2,"columnArticles":179,"formTitle":"[1535]找出数组游戏的赢家","frequency":7.211508204687712,"frontendQuestionId":"1535","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出数组游戏的赢家","titleSlug":"find-the-winner-of-an-array-game"},{"acceptance":0.4388846860477683,"acs":0,"articleLive":2,"columnArticles":77,"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.36524349566377584,"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.6084656084656085,"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.5382818055602587,"acs":0,"articleLive":2,"columnArticles":239,"formTitle":"[1539]第 k 个缺失的正整数","frequency":24.866724145644405,"frontendQuestionId":"1539","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个缺失的正整数","titleSlug":"kth-missing-positive-number"},{"acceptance":0.3165152821056819,"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.45905292479108634,"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.38140119384228716,"acs":0,"articleLive":2,"columnArticles":47,"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.5491915059419443,"acs":0,"articleLive":2,"columnArticles":43,"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.5447978925303798,"acs":0,"articleLive":2,"columnArticles":314,"formTitle":"[1544]整理字符串","frequency":34.64949327968721,"frontendQuestionId":"1544","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"整理字符串","titleSlug":"make-the-string-great"},{"acceptance":0.5522655899506506,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1545]找出第 N 个二进制字符串中的第 K 位","frequency":18.694466070773423,"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.4115831370319227,"acs":0,"articleLive":2,"columnArticles":77,"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.5347492942599812,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1547]切棍子的最小成本","frequency":28.449342063288796,"frontendQuestionId":"1547","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切棍子的最小成本","titleSlug":"minimum-cost-to-cut-a-stick"},{"acceptance":0.7133757961783439,"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.6681779540946444,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1549]每件商品的最新订单","frequency":6.061429485312524,"frontendQuestionId":"1549","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"每件商品的最新订单","titleSlug":"the-most-recent-orders-for-each-product"},{"acceptance":0.6600544166033916,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[1550]存在连续三个奇数的数组","frequency":5.522175928223974,"frontendQuestionId":"1550","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"存在连续三个奇数的数组","titleSlug":"three-consecutive-odds"},{"acceptance":0.8176339285714286,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1551]使数组中所有元素相等的最小操作数","frequency":6.061429485312524,"frontendQuestionId":"1551","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组中所有元素相等的最小操作数","titleSlug":"minimum-operations-to-make-array-equal"},{"acceptance":0.5086354798124214,"acs":0,"articleLive":2,"columnArticles":122,"formTitle":"[1552]两球之间的磁力","frequency":16.794658773886972,"frontendQuestionId":"1552","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两球之间的磁力","titleSlug":"magnetic-force-between-two-balls"},{"acceptance":0.29484943611208,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[1553]吃掉 N 个橘子的最少天数","frequency":62.011079725802475,"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.703012912482066,"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.4349121239201668,"acs":0,"articleLive":2,"columnArticles":56,"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.5781714159973594,"acs":0,"articleLive":2,"columnArticles":160,"formTitle":"[1556]千位分隔数","frequency":45.57266560129181,"frontendQuestionId":"1556","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"千位分隔数","titleSlug":"thousand-separator"},{"acceptance":0.7639892628536031,"acs":0,"articleLive":2,"columnArticles":101,"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.6223103057757644,"acs":0,"articleLive":2,"columnArticles":68,"formTitle":"[1558]得到目标数组的最少函数调用次数","frequency":7.211508204687712,"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.36669599648042234,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1559]二维网格图中探测环","frequency":9.145226304517246,"frontendQuestionId":"1559","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二维网格图中探测环","titleSlug":"detect-cycles-in-2d-grid"},{"acceptance":0.5737439222042139,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1560]圆形赛道上经过次数最多的扇区","frequency":7.211508204687712,"frontendQuestionId":"1560","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"圆形赛道上经过次数最多的扇区","titleSlug":"most-visited-sector-in-a-circular-track"},{"acceptance":0.7795254051836149,"acs":0,"articleLive":2,"columnArticles":156,"formTitle":"[1561]你可以获得的最大硬币数目","frequency":16.794658773886972,"frontendQuestionId":"1561","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"你可以获得的最大硬币数目","titleSlug":"maximum-number-of-coins-you-can-get"},{"acceptance":0.3095938787522072,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1562]查找大小为 M 的最新分组","frequency":11.3912736416566,"frontendQuestionId":"1562","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查找大小为 M 的最新分组","titleSlug":"find-latest-group-of-size-m"},{"acceptance":0.3777216174183515,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1563]石子游戏 V","frequency":38.90599085929966,"frontendQuestionId":"1563","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 V","titleSlug":"stone-game-v"},{"acceptance":0.5888125613346418,"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.7255364300872436,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1565]按月统计订单数与顾客数","frequency":6.62395241264668,"frontendQuestionId":"1565","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按月统计订单数与顾客数","titleSlug":"unique-orders-and-customers-per-month"},{"acceptance":0.4462495679225717,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1566]重复至少 K 次且长度为 M 的模式","frequency":6.061429485312524,"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.3957692032357363,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1567]乘积为正数的最长子数组长度","frequency":24.230923379013827,"frontendQuestionId":"1567","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"乘积为正数的最长子数组长度","titleSlug":"maximum-length-of-subarray-with-positive-product"},{"acceptance":0.4551178269472927,"acs":0,"articleLive":2,"columnArticles":47,"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.4716585024492652,"acs":0,"articleLive":2,"columnArticles":45,"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.8969135802469136,"acs":0,"articleLive":2,"columnArticles":35,"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.7575127138233935,"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.8050373936215938,"acs":0,"articleLive":2,"columnArticles":316,"formTitle":"[1572]矩阵对角线元素的和","frequency":17.40322030163009,"frontendQuestionId":"1572","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵对角线元素的和","titleSlug":"matrix-diagonal-sum"},{"acceptance":0.2955006080259424,"acs":0,"articleLive":2,"columnArticles":64,"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.3258632840028189,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1574]删除最短的子数组使剩余数组有序","frequency":18.035896247680004,"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.5958904109589042,"acs":0,"articleLive":2,"columnArticles":64,"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.4758284127369301,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[1576]替换所有的问号","frequency":6.061429485312524,"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.32426157616406553,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1577]数的平方等于两数乘积的方法数","frequency":9.145226304517246,"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.5803776055876896,"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.6196601004248745,"acs":0,"articleLive":2,"columnArticles":293,"formTitle":"[1579]保证图可完全遍历","frequency":8.469811387364896,"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.630272952853598,"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.8089480048367593,"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.6717135476463835,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[1582]二进制矩阵中的特殊位置","frequency":6.62395241264668,"frontendQuestionId":"1582","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制矩阵中的特殊位置","titleSlug":"special-positions-in-a-binary-matrix"},{"acceptance":0.6861411033870729,"acs":0,"articleLive":2,"columnArticles":243,"formTitle":"[1583]统计不开心的朋友","frequency":47.67636054432939,"frontendQuestionId":"1583","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计不开心的朋友","titleSlug":"count-unhappy-friends"},{"acceptance":0.6662396402520327,"acs":0,"articleLive":2,"columnArticles":326,"formTitle":"[1584]连接所有点的最小费用","frequency":19.380911113840813,"frontendQuestionId":"1584","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接所有点的最小费用","titleSlug":"min-cost-to-connect-all-points"},{"acceptance":0.42896224694510304,"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.6174957118353345,"acs":0,"articleLive":2,"columnArticles":23,"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.824,"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.8389933703152482,"acs":0,"articleLive":2,"columnArticles":690,"formTitle":"[1588]所有奇数长度子数组的和","frequency":22.037543698911172,"frontendQuestionId":"1588","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"所有奇数长度子数组的和","titleSlug":"sum-of-all-odd-length-subarrays"},{"acceptance":0.29360050689054334,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1589]所有排列中的最大和","frequency":7.211508204687712,"frontendQuestionId":"1589","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有排列中的最大和","titleSlug":"maximum-sum-obtained-of-any-permutation"},{"acceptance":0.26560133292941535,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[1590]使数组和能被 P 整除","frequency":18.694466070773423,"frontendQuestionId":"1590","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组和能被 P 整除","titleSlug":"make-sum-divisible-by-p"},{"acceptance":0.5814576634512326,"acs":0,"articleLive":2,"columnArticles":32,"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.4446803491389479,"acs":0,"articleLive":2,"columnArticles":124,"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.5293346774193548,"acs":0,"articleLive":2,"columnArticles":88,"formTitle":"[1593]拆分字符串使唯一子字符串的数目最大","frequency":6.62395241264668,"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.3133647559677665,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1594]矩阵的最大非负积","frequency":7.211508204687712,"frontendQuestionId":"1594","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵的最大非负积","titleSlug":"maximum-non-negative-product-in-a-matrix"},{"acceptance":0.46155766350474287,"acs":0,"articleLive":2,"columnArticles":38,"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.7575459317585301,"acs":0,"articleLive":2,"columnArticles":39,"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.6666666666666666,"acs":0,"articleLive":2,"columnArticles":19,"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.6714089604392861,"acs":0,"articleLive":2,"columnArticles":148,"formTitle":"[1598]文件夹操作日志搜集器","frequency":6.061429485312524,"frontendQuestionId":"1598","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"文件夹操作日志搜集器","titleSlug":"crawler-log-folder"},{"acceptance":0.4193831632093074,"acs":0,"articleLive":2,"columnArticles":68,"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.679845904298459,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[1600]皇位继承顺序","frequency":18.694466070773423,"frontendQuestionId":"1600","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"皇位继承顺序","titleSlug":"throne-inheritance"},{"acceptance":0.48614318706697457,"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.7834319526627219,"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.8448518829455505,"acs":0,"articleLive":2,"columnArticles":450,"formTitle":"[1603]设计停车系统","frequency":61.298938862228304,"frontendQuestionId":"1603","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"设计停车系统","titleSlug":"design-parking-system"},{"acceptance":0.41380093065486323,"acs":0,"articleLive":2,"columnArticles":61,"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.7340449188347787,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1605]给定行和列的和求可行矩阵","frequency":0.0,"frontendQuestionId":"1605","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"给定行和列的和求可行矩阵","titleSlug":"find-valid-matrix-given-row-and-column-sums"},{"acceptance":0.3413800469985046,"acs":0,"articleLive":2,"columnArticles":33,"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.5456178878019565,"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.6399946477554024,"acs":0,"articleLive":2,"columnArticles":158,"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.512236225087925,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1609]奇偶树","frequency":5.522175928223974,"frontendQuestionId":"1609","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"奇偶树","titleSlug":"even-odd-tree"},{"acceptance":0.27080163838502047,"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.6097633136094674,"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.7328767123287672,"acs":0,"articleLive":2,"columnArticles":20,"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.7235587834770767,"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.8208895751357275,"acs":0,"articleLive":2,"columnArticles":280,"formTitle":"[1614]括号的最大嵌套深度","frequency":5.004603235121968,"frontendQuestionId":"1614","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"括号的最大嵌套深度","titleSlug":"maximum-nesting-depth-of-the-parentheses"},{"acceptance":0.4956140350877193,"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.2752186264134128,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1616]分割两个字符串得到回文串","frequency":7.211508204687712,"frontendQuestionId":"1616","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割两个字符串得到回文串","titleSlug":"split-two-strings-to-make-palindrome"},{"acceptance":0.6184163382300251,"acs":0,"articleLive":2,"columnArticles":32,"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.5877712031558185,"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.6740817872018174,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[1619]删除某些元素后的数组均值","frequency":0.0,"frontendQuestionId":"1619","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"删除某些元素后的数组均值","titleSlug":"mean-of-array-after-removing-some-elements"},{"acceptance":0.3706949569495695,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1620]网络信号最好的坐标","frequency":8.469811387364896,"frontendQuestionId":"1620","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"网络信号最好的坐标","titleSlug":"coordinate-with-maximum-network-quality"},{"acceptance":0.4382621951219512,"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.14759391493325055,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1622]奇妙序列","frequency":17.40322030163009,"frontendQuestionId":"1622","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"奇妙序列","titleSlug":"fancy-sequence"},{"acceptance":0.7819781264859724,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[1623]三人国家代表队","frequency":6.061429485312524,"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.627475317348378,"acs":0,"articleLive":2,"columnArticles":192,"formTitle":"[1624]两个相同字符之间的最长子字符串","frequency":17.40322030163009,"frontendQuestionId":"1624","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个相同字符之间的最长子字符串","titleSlug":"largest-substring-between-two-equal-characters"},{"acceptance":0.5422138836772983,"acs":0,"articleLive":2,"columnArticles":65,"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.38400889517840897,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1626]无矛盾的最佳球队","frequency":7.211508204687712,"frontendQuestionId":"1626","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无矛盾的最佳球队","titleSlug":"best-team-with-no-conflicts"},{"acceptance":0.3790973871733967,"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.8371040723981901,"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.5235412214234829,"acs":0,"articleLive":2,"columnArticles":94,"formTitle":"[1629]按键持续时间最长的键","frequency":0.0,"frontendQuestionId":"1629","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按键持续时间最长的键","titleSlug":"slowest-key"},{"acceptance":0.7686731799558777,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[1630]等差子数组","frequency":6.061429485312524,"frontendQuestionId":"1630","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"等差子数组","titleSlug":"arithmetic-subarrays"},{"acceptance":0.49243914555389967,"acs":0,"articleLive":2,"columnArticles":297,"formTitle":"[1631]最小体力消耗路径","frequency":24.230923379013827,"frontendQuestionId":"1631","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小体力消耗路径","titleSlug":"path-with-minimum-effort"},{"acceptance":0.3170301828596607,"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.6543615676359039,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1633]各赛事的用户注册率","frequency":0.0,"frontendQuestionId":"1633","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"各赛事的用户注册率","titleSlug":"percentage-of-users-attended-a-contest"},{"acceptance":0.5191545574636723,"acs":0,"articleLive":2,"columnArticles":24,"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.5438247011952191,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1635]Hopper 公司查询 I","frequency":8.469811387364896,"frontendQuestionId":"1635","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"Hopper 公司查询 I","titleSlug":"hopper-company-queries-i"},{"acceptance":0.7062970677775997,"acs":0,"articleLive":2,"columnArticles":172,"formTitle":"[1636]按照频率将数组升序排序","frequency":6.061429485312524,"frontendQuestionId":"1636","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按照频率将数组升序排序","titleSlug":"sort-array-by-increasing-frequency"},{"acceptance":0.8061585835257891,"acs":0,"articleLive":2,"columnArticles":69,"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.7108931337119256,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1638]统计只差一个字符的子串数目","frequency":9.145226304517246,"frontendQuestionId":"1638","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计只差一个字符的子串数目","titleSlug":"count-substrings-that-differ-by-one-character"},{"acceptance":0.402156158118262,"acs":0,"articleLive":2,"columnArticles":28,"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.6621098924389339,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[1640]能否连接形成数组","frequency":5.522175928223974,"frontendQuestionId":"1640","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"能否连接形成数组","titleSlug":"check-array-formation-through-concatenation"},{"acceptance":0.7694491033415043,"acs":0,"articleLive":2,"columnArticles":271,"formTitle":"[1641]统计字典序元音字符串的数目","frequency":38.90599085929966,"frontendQuestionId":"1641","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计字典序元音字符串的数目","titleSlug":"count-sorted-vowel-strings"},{"acceptance":0.45353455123113584,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[1642]可以到达的最远建筑","frequency":6.62395241264668,"frontendQuestionId":"1642","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"可以到达的最远建筑","titleSlug":"furthest-building-you-can-reach"},{"acceptance":0.45002048340843914,"acs":0,"articleLive":2,"columnArticles":48,"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.5403096636412174,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1644]二叉树的最近公共祖先 II","frequency":19.380911113840813,"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.41112911939492164,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1645]","frequency":8.469811387364896,"frontendQuestionId":"1645","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"hopper-company-queries-ii"},{"acceptance":0.537463773791807,"acs":0,"articleLive":2,"columnArticles":350,"formTitle":"[1646]获取生成数组中的最大值","frequency":21.190674365132658,"frontendQuestionId":"1646","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"获取生成数组中的最大值","titleSlug":"get-maximum-in-generated-array"},{"acceptance":0.5133713283647523,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[1647]字符频次唯一的最小删除次数","frequency":24.866724145644405,"frontendQuestionId":"1647","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"字符频次唯一的最小删除次数","titleSlug":"minimum-deletions-to-make-character-frequencies-unique"},{"acceptance":0.27715968586387435,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1648]销售价值减少的颜色球","frequency":19.380911113840813,"frontendQuestionId":"1648","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"销售价值减少的颜色球","titleSlug":"sell-diminishing-valued-colored-balls"},{"acceptance":0.47497621313035204,"acs":0,"articleLive":2,"columnArticles":63,"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.7950354609929078,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[1650]二叉树的最近公共祖先 III","frequency":7.826061825326265,"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.686829268292683,"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.660397794407247,"acs":0,"articleLive":2,"columnArticles":175,"formTitle":"[1652]拆炸弹","frequency":16.794658773886972,"frontendQuestionId":"1652","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拆炸弹","titleSlug":"defuse-the-bomb"},{"acceptance":0.5038693035253654,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1653]使字符串平衡的最少删除次数","frequency":6.061429485312524,"frontendQuestionId":"1653","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使字符串平衡的最少删除次数","titleSlug":"minimum-deletions-to-make-string-balanced"},{"acceptance":0.27315194230454026,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1654]到家的最少跳跃次数","frequency":17.40322030163009,"frontendQuestionId":"1654","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"到家的最少跳跃次数","titleSlug":"minimum-jumps-to-reach-home"},{"acceptance":0.3876984126984127,"acs":0,"articleLive":2,"columnArticles":32,"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.7810590631364562,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1656]设计有序流","frequency":5.522175928223974,"frontendQuestionId":"1656","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计有序流","titleSlug":"design-an-ordered-stream"},{"acceptance":0.4646159163570379,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1657]确定两个字符串是否接近","frequency":6.62395241264668,"frontendQuestionId":"1657","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"确定两个字符串是否接近","titleSlug":"determine-if-two-strings-are-close"},{"acceptance":0.2978553303903507,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[1658]将 x 减到 0 的最小操作数","frequency":6.061429485312524,"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.41032017407522536,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1659]最大化网格幸福感","frequency":15.643615799953498,"frontendQuestionId":"1659","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大化网格幸福感","titleSlug":"maximize-grid-happiness"},{"acceptance":0.7398058252427184,"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.7257865515114127,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1661]每台机器的进程平均运行时间","frequency":18.035896247680004,"frontendQuestionId":"1661","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每台机器的进程平均运行时间","titleSlug":"average-time-of-process-per-machine"},{"acceptance":0.8127697333924898,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1662]检查两个字符串数组是否相等","frequency":16.794658773886972,"frontendQuestionId":"1662","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查两个字符串数组是否相等","titleSlug":"check-if-two-string-arrays-are-equivalent"},{"acceptance":0.5722785872301472,"acs":0,"articleLive":2,"columnArticles":129,"formTitle":"[1663]具有给定数值的最小字符串","frequency":26.213058161373958,"frontendQuestionId":"1663","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"具有给定数值的最小字符串","titleSlug":"smallest-string-with-a-given-numeric-value"},{"acceptance":0.5454172226213692,"acs":0,"articleLive":2,"columnArticles":106,"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.6657953208730885,"acs":0,"articleLive":2,"columnArticles":79,"formTitle":"[1665]完成所有任务的最少初始能量","frequency":6.62395241264668,"frontendQuestionId":"1665","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"完成所有任务的最少初始能量","titleSlug":"minimum-initial-energy-to-finish-tasks"},{"acceptance":0.6859756097560976,"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.6002327611288915,"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.443013698630137,"acs":0,"articleLive":2,"columnArticles":125,"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.7643925944712148,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[1669]合并两个链表","frequency":6.061429485312524,"frontendQuestionId":"1669","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"合并两个链表","titleSlug":"merge-in-between-linked-lists"},{"acceptance":0.5292464878671775,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1670]设计前中后队列","frequency":6.061429485312524,"frontendQuestionId":"1670","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计前中后队列","titleSlug":"design-front-middle-back-queue"},{"acceptance":0.46501287151883924,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[1671]得到山形数组的最少删除次数","frequency":8.469811387364896,"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.8505184589255386,"acs":0,"articleLive":2,"columnArticles":438,"formTitle":"[1672]最富有客户的资产总量","frequency":0.0,"frontendQuestionId":"1672","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最富有客户的资产总量","titleSlug":"richest-customer-wealth"},{"acceptance":0.3515829564389431,"acs":0,"articleLive":2,"columnArticles":164,"formTitle":"[1673]找出最具竞争力的子序列","frequency":5.522175928223974,"frontendQuestionId":"1673","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出最具竞争力的子序列","titleSlug":"find-the-most-competitive-subsequence"},{"acceptance":0.3620587362800356,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1674]使数组互补的最少操作次数","frequency":19.380911113840813,"frontendQuestionId":"1674","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"使数组互补的最少操作次数","titleSlug":"minimum-moves-to-make-array-complementary"},{"acceptance":0.4347975882859604,"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.7648870636550308,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1676]二叉树的最近公共祖先 IV","frequency":9.855093570160312,"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.3950565563468789,"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.8302845528455285,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[1678]设计 Goal 解析器","frequency":5.522175928223974,"frontendQuestionId":"1678","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"设计 Goal 解析器","titleSlug":"goal-parser-interpretation"},{"acceptance":0.4956751209500073,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1679]K 和数对的最大数目","frequency":6.061429485312524,"frontendQuestionId":"1679","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"K 和数对的最大数目","titleSlug":"max-number-of-k-sum-pairs"},{"acceptance":0.46190809016250217,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1680]连接连续二进制数字","frequency":7.211508204687712,"frontendQuestionId":"1680","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"连接连续二进制数字","titleSlug":"concatenation-of-consecutive-binary-numbers"},{"acceptance":0.38356614626129826,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1681]最小不兼容性","frequency":0.0,"frontendQuestionId":"1681","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小不兼容性","titleSlug":"minimum-incompatibility"},{"acceptance":0.5225694444444444,"acs":0,"articleLive":2,"columnArticles":15,"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.8952922077922078,"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.828044466902476,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[1684]统计一致字符串的数目","frequency":24.866724145644405,"frontendQuestionId":"1684","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计一致字符串的数目","titleSlug":"count-the-number-of-consistent-strings"},{"acceptance":0.5964178105122196,"acs":0,"articleLive":2,"columnArticles":82,"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.4680344385418575,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1686]石子游戏 VI","frequency":6.62395241264668,"frontendQuestionId":"1686","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VI","titleSlug":"stone-game-vi"},{"acceptance":0.40363007778738114,"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.8052688083243869,"acs":0,"articleLive":2,"columnArticles":257,"formTitle":"[1688]比赛中的配对次数","frequency":16.794658773886972,"frontendQuestionId":"1688","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"比赛中的配对次数","titleSlug":"count-of-matches-in-tournament"},{"acceptance":0.8679336936061691,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[1689]十-二进制数的最少数目","frequency":16.208607595358924,"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.5164501638946218,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1690]石子游戏 VII","frequency":7.211508204687712,"frontendQuestionId":"1690","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"石子游戏 VII","titleSlug":"stone-game-vii"},{"acceptance":0.4862497453656549,"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.6363636363636364,"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.8027057497181511,"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.6342919609821729,"acs":0,"articleLive":2,"columnArticles":135,"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.45726791061967287,"acs":0,"articleLive":2,"columnArticles":128,"formTitle":"[1695]删除子数组的最大得分","frequency":6.061429485312524,"frontendQuestionId":"1695","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子数组的最大得分","titleSlug":"maximum-erasure-value"},{"acceptance":0.39667348689855453,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1696]跳跃游戏 VI","frequency":24.866724145644405,"frontendQuestionId":"1696","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"跳跃游戏 VI","titleSlug":"jump-game-vi"},{"acceptance":0.524822695035461,"acs":0,"articleLive":2,"columnArticles":41,"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.546583850931677,"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.8003866602223296,"acs":0,"articleLive":2,"columnArticles":40,"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.7123681687440077,"acs":0,"articleLive":2,"columnArticles":178,"formTitle":"[1700]无法吃午餐的学生数量","frequency":6.62395241264668,"frontendQuestionId":"1700","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"无法吃午餐的学生数量","titleSlug":"number-of-students-unable-to-eat-lunch"},{"acceptance":0.611254851228978,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1701]平均等待时间","frequency":18.035896247680004,"frontendQuestionId":"1701","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"平均等待时间","titleSlug":"average-waiting-time"},{"acceptance":0.47491638795986624,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1702]修改后的最大二进制字符串","frequency":20.846558285770143,"frontendQuestionId":"1702","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"修改后的最大二进制字符串","titleSlug":"maximum-binary-string-after-change"},{"acceptance":0.38580246913580246,"acs":0,"articleLive":2,"columnArticles":23,"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.7818517541545766,"acs":0,"articleLive":2,"columnArticles":181,"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.34786367004198565,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[1705]吃苹果的最大数目","frequency":18.035896247680004,"frontendQuestionId":"1705","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"吃苹果的最大数目","titleSlug":"maximum-number-of-eaten-apples"},{"acceptance":0.5833795013850416,"acs":0,"articleLive":2,"columnArticles":109,"formTitle":"[1706]球会落何处","frequency":17.40322030163009,"frontendQuestionId":"1706","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"球会落何处","titleSlug":"where-will-the-ball-fall"},{"acceptance":0.5032899442139894,"acs":0,"articleLive":2,"columnArticles":149,"formTitle":"[1707]与数组中元素的最大异或值","frequency":40.366785410000055,"frontendQuestionId":"1707","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"与数组中元素的最大异或值","titleSlug":"maximum-xor-with-an-element-from-array"},{"acceptance":0.6978756884343037,"acs":0,"articleLive":2,"columnArticles":24,"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.7135250266240681,"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.6936358536433336,"acs":0,"articleLive":2,"columnArticles":181,"formTitle":"[1710]卡车上的最大单元数","frequency":24.230923379013827,"frontendQuestionId":"1710","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"卡车上的最大单元数","titleSlug":"maximum-units-on-a-truck"},{"acceptance":0.3592043260872172,"acs":0,"articleLive":2,"columnArticles":360,"formTitle":"[1711]大餐计数","frequency":50.26505379655652,"frontendQuestionId":"1711","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"大餐计数","titleSlug":"count-good-meals"},{"acceptance":0.26394849785407726,"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.4969454661762354,"acs":0,"articleLive":2,"columnArticles":169,"formTitle":"[1713]得到子序列的最少操作次数","frequency":46.94945697795271,"frontendQuestionId":"1713","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"得到子序列的最少操作次数","titleSlug":"minimum-operations-to-make-a-subsequence"},{"acceptance":0.6398891966759003,"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.7366946778711485,"acs":0,"articleLive":2,"columnArticles":34,"formTitle":"[1715]苹果和橘子的个数","frequency":18.035896247680004,"frontendQuestionId":"1715","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"苹果和橘子的个数","titleSlug":"count-apples-and-oranges"},{"acceptance":0.6753400354819633,"acs":0,"articleLive":2,"columnArticles":187,"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.4308779011099899,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1717]删除子字符串的最大得分","frequency":7.211508204687712,"frontendQuestionId":"1717","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除子字符串的最大得分","titleSlug":"maximum-score-from-removing-substrings"},{"acceptance":0.4880677444187837,"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.36566265060240966,"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.8693273982421065,"acs":0,"articleLive":2,"columnArticles":483,"formTitle":"[1720]解码异或后的数组","frequency":57.13142152277937,"frontendQuestionId":"1720","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的数组","titleSlug":"decode-xored-array"},{"acceptance":0.6476641926027568,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[1721]交换链表中的节点","frequency":6.62395241264668,"frontendQuestionId":"1721","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"交换链表中的节点","titleSlug":"swapping-nodes-in-a-linked-list"},{"acceptance":0.5145641699518178,"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.5073967763303158,"acs":0,"articleLive":2,"columnArticles":174,"formTitle":"[1723]完成所有工作的最短时间","frequency":73.3697571282535,"frontendQuestionId":"1723","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"完成所有工作的最短时间","titleSlug":"find-minimum-time-to-finish-all-jobs"},{"acceptance":0.5583756345177665,"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.7877609037181118,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1725]可以形成最大正方形的矩形数目","frequency":6.061429485312524,"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.47839072382290937,"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.575298126064736,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1727]重新排列后的最大子矩阵","frequency":7.211508204687712,"frontendQuestionId":"1727","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重新排列后的最大子矩阵","titleSlug":"largest-submatrix-with-rearrangements"},{"acceptance":0.35471204188481675,"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.6232558139534884,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[1729]求关注者的数量","frequency":6.62395241264668,"frontendQuestionId":"1729","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"求关注者的数量","titleSlug":"find-followers-count"},{"acceptance":0.5305927342256214,"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.4727122381477398,"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.7928468058714079,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1732]找到最高海拔","frequency":34.64949327968721,"frontendQuestionId":"1732","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找到最高海拔","titleSlug":"find-the-highest-altitude"},{"acceptance":0.458249832999332,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1733]需要教语言的最少人数","frequency":8.469811387364896,"frontendQuestionId":"1733","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"需要教语言的最少人数","titleSlug":"minimum-number-of-people-to-teach"},{"acceptance":0.7232154440955915,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1734]解码异或后的排列","frequency":56.56197794872335,"frontendQuestionId":"1734","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"解码异或后的排列","titleSlug":"decode-xored-permutation"},{"acceptance":0.4838709677419355,"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.4491024605098468,"acs":0,"articleLive":2,"columnArticles":351,"formTitle":"[1736]替换隐藏数字得到的最晚时间","frequency":45.57266560129181,"frontendQuestionId":"1736","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"替换隐藏数字得到的最晚时间","titleSlug":"latest-time-by-replacing-hidden-digits"},{"acceptance":0.3095092826636451,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1737]满足三条件之一需改变的最少字符数","frequency":7.211508204687712,"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.6544301453569114,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1738]找出第 K 大的异或坐标值","frequency":39.31196201051902,"frontendQuestionId":"1738","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出第 K 大的异或坐标值","titleSlug":"find-kth-largest-xor-coordinate-value"},{"acceptance":0.47199429183018193,"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.7020997375328084,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[1740]找到二叉树中的距离","frequency":13.064156305005737,"frontendQuestionId":"1740","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找到二叉树中的距离","titleSlug":"find-distance-in-a-binary-tree"},{"acceptance":0.8439841339797267,"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.7077833019029659,"acs":0,"articleLive":2,"columnArticles":127,"formTitle":"[1742]盒子中小球的最大数量","frequency":5.522175928223974,"frontendQuestionId":"1742","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"盒子中小球的最大数量","titleSlug":"maximum-number-of-balls-in-a-box"},{"acceptance":0.6971226178535607,"acs":0,"articleLive":2,"columnArticles":324,"formTitle":"[1743]从相邻元素对还原数组","frequency":43.419447531069544,"frontendQuestionId":"1743","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"从相邻元素对还原数组","titleSlug":"restore-the-array-from-adjacent-pairs"},{"acceptance":0.36271221292619293,"acs":0,"articleLive":2,"columnArticles":366,"formTitle":"[1744]你能在你最喜欢的那天吃到你最喜欢的糖果吗？","frequency":55.82729559973928,"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.4841935009557418,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1745]回文串分割 IV","frequency":7.211508204687712,"frontendQuestionId":"1745","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"回文串分割 IV","titleSlug":"palindrome-partitioning-iv"},{"acceptance":0.587819947043248,"acs":0,"articleLive":2,"columnArticles":29,"formTitle":"[1746]经过一次操作后的最大子数组和","frequency":7.211508204687712,"frontendQuestionId":"1746","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"经过一次操作后的最大子数组和","titleSlug":"maximum-subarray-sum-after-one-operation"},{"acceptance":0.7034883720930233,"acs":0,"articleLive":2,"columnArticles":33,"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.7491019229414665,"acs":0,"articleLive":2,"columnArticles":215,"formTitle":"[1748]唯一元素的和","frequency":25.52684182318494,"frontendQuestionId":"1748","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"唯一元素的和","titleSlug":"sum-of-unique-elements"},{"acceptance":0.5306766917293233,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[1749]任意子数组和的绝对值的最大值","frequency":24.866724145644405,"frontendQuestionId":"1749","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"任意子数组和的绝对值的最大值","titleSlug":"maximum-absolute-sum-of-any-subarray"},{"acceptance":0.4582124201973302,"acs":0,"articleLive":2,"columnArticles":80,"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.4726615454134659,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[1751]最多可以参加的会议数目 II","frequency":19.380911113840813,"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.6834832200043869,"acs":0,"articleLive":2,"columnArticles":111,"formTitle":"[1752]检查数组是否经排序和轮转得到","frequency":6.061429485312524,"frontendQuestionId":"1752","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查数组是否经排序和轮转得到","titleSlug":"check-if-array-is-sorted-and-rotated"},{"acceptance":0.6284176533907427,"acs":0,"articleLive":2,"columnArticles":123,"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.42025730038799264,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1754]构造字典序最大的合并字符串","frequency":6.62395241264668,"frontendQuestionId":"1754","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"构造字典序最大的合并字符串","titleSlug":"largest-merge-of-two-strings"},{"acceptance":0.400087260034904,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1755]最接近目标值的子序列和","frequency":9.145226304517246,"frontendQuestionId":"1755","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标值的子序列和","titleSlug":"closest-subsequence-sum"},{"acceptance":0.8325123152709359,"acs":0,"articleLive":2,"columnArticles":12,"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.9237451737451737,"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.6364551863041289,"acs":0,"articleLive":2,"columnArticles":112,"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.4281919939290457,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1759]统计同构子字符串的数目","frequency":6.62395241264668,"frontendQuestionId":"1759","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计同构子字符串的数目","titleSlug":"count-number-of-homogenous-substrings"},{"acceptance":0.5382891788585739,"acs":0,"articleLive":2,"columnArticles":77,"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.42905462540165734,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1761]一个图中连通三元组的最小度数","frequency":12.179972950986874,"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.6740947075208914,"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.6088467614533966,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1763]最长的美好子字符串","frequency":6.061429485312524,"frontendQuestionId":"1763","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最长的美好子字符串","titleSlug":"longest-nice-substring"},{"acceptance":0.4772146507666099,"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.5523329129886507,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1765]地图中的最高点","frequency":6.62395241264668,"frontendQuestionId":"1765","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"地图中的最高点","titleSlug":"map-of-highest-peak"},{"acceptance":0.3752043596730245,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1766]互质树","frequency":13.064156305005737,"frontendQuestionId":"1766","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"互质树","titleSlug":"tree-of-coprimes"},{"acceptance":0.7901740020470829,"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.7672942817294282,"acs":0,"articleLive":2,"columnArticles":199,"formTitle":"[1768]交替合并字符串","frequency":17.40322030163009,"frontendQuestionId":"1768","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"交替合并字符串","titleSlug":"merge-strings-alternately"},{"acceptance":0.8556325823223571,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[1769]移动所有球到每个盒子所需的最小操作数","frequency":6.061429485312524,"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.36898152361882225,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1770]执行乘法运算的最大分数","frequency":10.602574332326324,"frontendQuestionId":"1770","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"执行乘法运算的最大分数","titleSlug":"maximum-score-from-performing-multiplication-operations"},{"acceptance":0.36503608660785886,"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.5179153094462541,"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.8420404007930129,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[1773]统计匹配检索规则的物品数量","frequency":23.617833197594297,"frontendQuestionId":"1773","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"统计匹配检索规则的物品数量","titleSlug":"count-items-matching-a-rule"},{"acceptance":0.5522402108433735,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1774]最接近目标价格的甜点成本","frequency":6.061429485312524,"frontendQuestionId":"1774","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最接近目标价格的甜点成本","titleSlug":"closest-dessert-cost"},{"acceptance":0.4736901791789521,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1775]通过最少操作次数使数组的和相等","frequency":7.826061825326265,"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.4617464179507975,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1776]车队 II","frequency":28.449342063288796,"frontendQuestionId":"1776","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"车队 II","titleSlug":"car-fleet-ii"},{"acceptance":0.7805777504609711,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1777]每家商店的产品价格","frequency":63.79162469031737,"frontendQuestionId":"1777","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每家商店的产品价格","titleSlug":"products-price-for-each-store"},{"acceptance":0.5232198142414861,"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.6463548662840396,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1779]找到最近的有相同 X 或 Y 坐标的点","frequency":6.061429485312524,"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.6629213483146067,"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.5176455435342607,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1781]所有子字符串美丽值之和","frequency":7.826061825326265,"frontendQuestionId":"1781","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子字符串美丽值之和","titleSlug":"sum-of-beauty-of-all-substrings"},{"acceptance":0.28750923872875095,"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.7936507936507936,"acs":0,"articleLive":2,"columnArticles":27,"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.42107057620184113,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[1784]检查二进制字符串字段","frequency":6.061429485312524,"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.34849913998779336,"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.3400408580183861,"acs":0,"articleLive":2,"columnArticles":87,"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.6543333891400189,"acs":0,"articleLive":2,"columnArticles":59,"formTitle":"[1787]使所有区间的异或结果为零","frequency":57.95711561374669,"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.6892430278884463,"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.7073536768384192,"acs":0,"articleLive":2,"columnArticles":29,"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.6482605177993528,"acs":0,"articleLive":2,"columnArticles":142,"formTitle":"[1790]仅执行一次字符串交换能否使两个字符串相等","frequency":0.0,"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.8092774762550882,"acs":0,"articleLive":2,"columnArticles":133,"formTitle":"[1791]找出星型图的中心节点","frequency":0.0,"frontendQuestionId":"1791","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出星型图的中心节点","titleSlug":"find-center-of-star-graph"},{"acceptance":0.5125345986555951,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[1792]最大平均通过率","frequency":36.04340313970188,"frontendQuestionId":"1792","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大平均通过率","titleSlug":"maximum-average-pass-ratio"},{"acceptance":0.41215195337794086,"acs":0,"articleLive":2,"columnArticles":92,"formTitle":"[1793]好子数组的最大分数","frequency":18.694466070773423,"frontendQuestionId":"1793","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好子数组的最大分数","titleSlug":"maximum-score-of-a-good-subarray"},{"acceptance":0.6995305164319249,"acs":0,"articleLive":2,"columnArticles":9,"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.7889995258416311,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1795]每个产品在不同商店的价格","frequency":25.52684182318494,"frontendQuestionId":"1795","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"每个产品在不同商店的价格","titleSlug":"rearrange-products-table"},{"acceptance":0.48692403486924035,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[1796]字符串中第二大的数字","frequency":6.061429485312524,"frontendQuestionId":"1796","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串中第二大的数字","titleSlug":"second-largest-digit-in-a-string"},{"acceptance":0.5747644408029496,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1797]设计一个验证系统","frequency":16.794658773886972,"frontendQuestionId":"1797","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"设计一个验证系统","titleSlug":"design-authentication-manager"},{"acceptance":0.5216863289382373,"acs":0,"articleLive":2,"columnArticles":51,"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.5168564920273349,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1799]N 次操作后的最大分数和","frequency":7.211508204687712,"frontendQuestionId":"1799","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"N 次操作后的最大分数和","titleSlug":"maximize-score-after-n-operations"},{"acceptance":0.6836064390384754,"acs":0,"articleLive":2,"columnArticles":153,"formTitle":"[1800]最大升序子数组和","frequency":17.40322030163009,"frontendQuestionId":"1800","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"最大升序子数组和","titleSlug":"maximum-ascending-subarray-sum"},{"acceptance":0.37708294326905073,"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.2624099917160517,"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.4071107638210588,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1803]统计异或值在范围内的数对有多少","frequency":24.230923379013827,"frontendQuestionId":"1803","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"统计异或值在范围内的数对有多少","titleSlug":"count-pairs-with-xor-in-a-range"},{"acceptance":0.5736543909348442,"acs":0,"articleLive":2,"columnArticles":25,"formTitle":"[1804]实现 Trie （前缀树） II","frequency":9.145226304517246,"frontendQuestionId":"1804","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"实现 Trie （前缀树） II","titleSlug":"implement-trie-ii-prefix-tree"},{"acceptance":0.4910583536720657,"acs":0,"articleLive":2,"columnArticles":145,"formTitle":"[1805]字符串中不同整数的数目","frequency":6.061429485312524,"frontendQuestionId":"1805","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串中不同整数的数目","titleSlug":"number-of-different-integers-in-a-string"},{"acceptance":0.6635027954752308,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1806]还原排列的最少操作步数","frequency":27.671955108945014,"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.5850708924103419,"acs":0,"articleLive":2,"columnArticles":86,"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.26731577782695287,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1808]好因子的最大数目","frequency":12.179972950986874,"frontendQuestionId":"1808","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"好因子的最大数目","titleSlug":"maximize-number-of-nice-divisors"},{"acceptance":0.6353820598006644,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1809]没有广告的剧集","frequency":24.866724145644405,"frontendQuestionId":"1809","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"没有广告的剧集","titleSlug":"ad-free-sessions"},{"acceptance":0.6285714285714286,"acs":0,"articleLive":2,"columnArticles":8,"formTitle":"[1810]隐藏网格下的最小消耗路径","frequency":20.846558285770143,"frontendQuestionId":"1810","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"隐藏网格下的最小消耗路径","titleSlug":"minimum-path-cost-in-a-hidden-grid"},{"acceptance":0.6637323943661971,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[1811]寻找面试候选人","frequency":7.211508204687712,"frontendQuestionId":"1811","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找面试候选人","titleSlug":"find-interview-candidates"},{"acceptance":0.7950533661740559,"acs":0,"articleLive":2,"columnArticles":182,"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.5150593544589425,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1813]句子相似性 III","frequency":26.213058161373958,"frontendQuestionId":"1813","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"句子相似性 III","titleSlug":"sentence-similarity-iii"},{"acceptance":0.34264896696277075,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1814]统计一个数组中好对子的数目","frequency":6.62395241264668,"frontendQuestionId":"1814","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个数组中好对子的数目","titleSlug":"count-nice-pairs-in-an-array"},{"acceptance":0.29768303985171457,"acs":0,"articleLive":2,"columnArticles":38,"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.7524552065372216,"acs":0,"articleLive":2,"columnArticles":147,"formTitle":"[1816]截断句子","frequency":6.061429485312524,"frontendQuestionId":"1816","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"截断句子","titleSlug":"truncate-sentence"},{"acceptance":0.697907949790795,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1817]查找用户活跃分钟数","frequency":6.061429485312524,"frontendQuestionId":"1817","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"查找用户活跃分钟数","titleSlug":"finding-the-users-active-minutes"},{"acceptance":0.37417523737070796,"acs":0,"articleLive":2,"columnArticles":338,"formTitle":"[1818]绝对差值和","frequency":46.248819617080564,"frontendQuestionId":"1818","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"绝对差值和","titleSlug":"minimum-absolute-sum-difference"},{"acceptance":0.3657669306610635,"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.5027932960893855,"acs":0,"articleLive":2,"columnArticles":8,"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.9020408163265307,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[1821]寻找今年具有正收入的客户","frequency":26.213058161373958,"frontendQuestionId":"1821","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"寻找今年具有正收入的客户","titleSlug":"find-customers-with-positive-revenue-this-year"},{"acceptance":0.8124532690869818,"acs":0,"articleLive":2,"columnArticles":195,"formTitle":"[1822]数组元素积的符号","frequency":16.208607595358924,"frontendQuestionId":"1822","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组元素积的符号","titleSlug":"sign-of-the-product-of-an-array"},{"acceptance":0.7095857771260997,"acs":0,"articleLive":2,"columnArticles":96,"formTitle":"[1823]找出游戏的获胜者","frequency":16.208607595358924,"frontendQuestionId":"1823","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"找出游戏的获胜者","titleSlug":"find-the-winner-of-the-circular-game"},{"acceptance":0.659282882261679,"acs":0,"articleLive":2,"columnArticles":152,"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.2867647058823529,"acs":0,"articleLive":2,"columnArticles":52,"formTitle":"[1825]求出 MK 平均值","frequency":11.3912736416566,"frontendQuestionId":"1825","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"求出 MK 平均值","titleSlug":"finding-mk-average"},{"acceptance":0.444022770398482,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1826]有缺陷的传感器","frequency":0.0,"frontendQuestionId":"1826","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"有缺陷的传感器","titleSlug":"faulty-sensor"},{"acceptance":0.7964671763775376,"acs":0,"articleLive":2,"columnArticles":135,"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.8689200329760923,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[1828]统计一个圆中点的数目","frequency":16.794658773886972,"frontendQuestionId":"1828","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"统计一个圆中点的数目","titleSlug":"queries-on-number-of-points-inside-a-circle"},{"acceptance":0.6795793163891324,"acs":0,"articleLive":2,"columnArticles":83,"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.48579710144927535,"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.7350746268656716,"acs":0,"articleLive":2,"columnArticles":23,"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.8226790876967556,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[1832]判断句子是否为全字母句","frequency":24.230923379013827,"frontendQuestionId":"1832","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"判断句子是否为全字母句","titleSlug":"check-if-the-sentence-is-pangram"},{"acceptance":0.6847918839480421,"acs":0,"articleLive":2,"columnArticles":386,"formTitle":"[1833]雪糕的最大数量","frequency":29.683142518751797,"frontendQuestionId":"1833","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"雪糕的最大数量","titleSlug":"maximum-ice-cream-bars"},{"acceptance":0.35069716907104487,"acs":0,"articleLive":2,"columnArticles":123,"formTitle":"[1834]单线程 CPU","frequency":31.008249446544394,"frontendQuestionId":"1834","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单线程 CPU","titleSlug":"single-threaded-cpu"},{"acceptance":0.5089196517767947,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1835]所有数对按位与结果的异或和","frequency":11.3912736416566,"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.710261569416499,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1836]从未排序的链表中移除重复元素","frequency":21.631051781307388,"frontendQuestionId":"1836","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从未排序的链表中移除重复元素","titleSlug":"remove-duplicates-from-an-unsorted-linked-list"},{"acceptance":0.7947733333333333,"acs":0,"articleLive":2,"columnArticles":83,"formTitle":"[1837]K 进制表示下的各位数字总和","frequency":6.061429485312524,"frontendQuestionId":"1837","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"K 进制表示下的各位数字总和","titleSlug":"sum-of-digits-in-base-k"},{"acceptance":0.42997321132950067,"acs":0,"articleLive":2,"columnArticles":300,"formTitle":"[1838]最高频元素的频数","frequency":58.527268521626674,"frontendQuestionId":"1838","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最高频元素的频数","titleSlug":"frequency-of-the-most-frequent-element"},{"acceptance":0.5765489913544669,"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.3879032258064516,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[1840]最高建筑高度","frequency":9.145226304517246,"frontendQuestionId":"1840","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"最高建筑高度","titleSlug":"maximum-building-height"},{"acceptance":0.5188866799204771,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[1841]联赛信息统计","frequency":25.52684182318494,"frontendQuestionId":"1841","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"联赛信息统计","titleSlug":"league-statistics"},{"acceptance":0.6917808219178082,"acs":0,"articleLive":2,"columnArticles":10,"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.5102230483271375,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[1843]","frequency":6.061429485312524,"frontendQuestionId":"1843","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"suspicious-bank-accounts"},{"acceptance":0.8027567699438888,"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.5648877223680373,"acs":0,"articleLive":2,"columnArticles":57,"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.633846510012733,"acs":0,"articleLive":2,"columnArticles":373,"formTitle":"[1846]减小和重新排列数组后的最大元素","frequency":41.255068326624084,"frontendQuestionId":"1846","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"减小和重新排列数组后的最大元素","titleSlug":"maximum-element-after-decreasing-and-rearranging"},{"acceptance":0.36010730629635473,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1847]最近的房间","frequency":8.469811387364896,"frontendQuestionId":"1847","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最近的房间","titleSlug":"closest-room"},{"acceptance":0.6850538723639378,"acs":0,"articleLive":2,"columnArticles":98,"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.3289066222010481,"acs":0,"articleLive":2,"columnArticles":107,"formTitle":"[1849]将字符串拆分为递减的连续值","frequency":6.62395241264668,"frontendQuestionId":"1849","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"将字符串拆分为递减的连续值","titleSlug":"splitting-a-string-into-descending-consecutive-values"},{"acceptance":0.6052009456264775,"acs":0,"articleLive":2,"columnArticles":49,"formTitle":"[1850]邻位交换的最小次数","frequency":7.826061825326265,"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.40106951871657753,"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.7095435684647303,"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.6483439041578577,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1853]转换日期格式","frequency":7.211508204687712,"frontendQuestionId":"1853","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"转换日期格式","titleSlug":"convert-date-format"},{"acceptance":0.791976639087812,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[1854]人口最多的年份","frequency":24.866724145644405,"frontendQuestionId":"1854","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"人口最多的年份","titleSlug":"maximum-population-year"},{"acceptance":0.6881204610566993,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[1855]下标对中的最大距离","frequency":24.230923379013827,"frontendQuestionId":"1855","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"下标对中的最大距离","titleSlug":"maximum-distance-between-a-pair-of-values"},{"acceptance":0.3557692307692308,"acs":0,"articleLive":2,"columnArticles":81,"formTitle":"[1856]子数组最小乘积的最大值","frequency":19.380911113840813,"frontendQuestionId":"1856","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子数组最小乘积的最大值","titleSlug":"maximum-subarray-min-product"},{"acceptance":0.44922879177377895,"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.6512141280353201,"acs":0,"articleLive":2,"columnArticles":16,"formTitle":"[1858]包含所有前缀的最长单词","frequency":12.179972950986874,"frontendQuestionId":"1858","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"包含所有前缀的最长单词","titleSlug":"longest-word-with-all-prefixes"},{"acceptance":0.7704243564123663,"acs":0,"articleLive":2,"columnArticles":141,"formTitle":"[1859]将句子排序","frequency":0.0,"frontendQuestionId":"1859","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"将句子排序","titleSlug":"sorting-the-sentence"},{"acceptance":0.7710510747387103,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1860]增长的内存泄露","frequency":5.522175928223974,"frontendQuestionId":"1860","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"增长的内存泄露","titleSlug":"incremental-memory-leak"},{"acceptance":0.6171964764458062,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1861]旋转盒子","frequency":6.62395241264668,"frontendQuestionId":"1861","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"旋转盒子","titleSlug":"rotating-the-box"},{"acceptance":0.3098932384341637,"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.9167795334838225,"acs":0,"articleLive":2,"columnArticles":138,"formTitle":"[1863]找出所有子集的异或总和再求和","frequency":41.94961522499853,"frontendQuestionId":"1863","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"找出所有子集的异或总和再求和","titleSlug":"sum-of-all-subset-xor-totals"},{"acceptance":0.38712321282214734,"acs":0,"articleLive":2,"columnArticles":105,"formTitle":"[1864]构成交替字符串需要的最小交换次数","frequency":6.62395241264668,"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.515859600278413,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[1865]找出和为指定值的下标对","frequency":4.507275614106019,"frontendQuestionId":"1865","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出和为指定值的下标对","titleSlug":"finding-pairs-with-a-certain-sum"},{"acceptance":0.5963075227335354,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[1866]恰有 K 根木棍可以看到的排列数目","frequency":21.631051781307388,"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.7513611615245009,"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.5272727272727272,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1868]两个行程编码数组的积","frequency":14.854916490623221,"frontendQuestionId":"1868","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个行程编码数组的积","titleSlug":"product-of-two-run-length-encoded-arrays"},{"acceptance":0.7926232114467409,"acs":0,"articleLive":2,"columnArticles":134,"formTitle":"[1869]哪种连续子字符串更长","frequency":30.333498337885196,"frontendQuestionId":"1869","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"哪种连续子字符串更长","titleSlug":"longer-contiguous-segments-of-ones-than-zeros"},{"acceptance":0.4592491127576116,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1870]准时到达的列车最小时速","frequency":7.826061825326265,"frontendQuestionId":"1870","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"准时到达的列车最小时速","titleSlug":"minimum-speed-to-arrive-on-time"},{"acceptance":0.2760950715872041,"acs":0,"articleLive":2,"columnArticles":125,"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.6273133375877473,"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.8052120141342756,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1873]计算特殊奖金","frequency":34.64949327968721,"frontendQuestionId":"1873","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"计算特殊奖金","titleSlug":"calculate-special-bonus"},{"acceptance":0.8805460750853242,"acs":0,"articleLive":2,"columnArticles":16,"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.7436440677966102,"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.7268186475409836,"acs":0,"articleLive":2,"columnArticles":90,"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.8189349432818042,"acs":0,"articleLive":2,"columnArticles":398,"formTitle":"[1877]数组中最大数对和的最小值","frequency":53.624524664341436,"frontendQuestionId":"1877","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"数组中最大数对和的最小值","titleSlug":"minimize-maximum-pair-sum-in-array"},{"acceptance":0.4293600490697199,"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.4095431931252827,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[1879]两个数组最小的异或值之和","frequency":8.469811387364896,"frontendQuestionId":"1879","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"两个数组最小的异或值之和","titleSlug":"minimum-xor-sum-of-two-arrays"},{"acceptance":0.7726003865149238,"acs":0,"articleLive":2,"columnArticles":95,"formTitle":"[1880]检查某单词是否等于两单词之和","frequency":5.522175928223974,"frontendQuestionId":"1880","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"检查某单词是否等于两单词之和","titleSlug":"check-if-word-equals-summation-of-two-words"},{"acceptance":0.35264105642256904,"acs":0,"articleLive":2,"columnArticles":63,"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.27863607990012484,"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.37380122057541415,"acs":0,"articleLive":2,"columnArticles":27,"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.6941176470588235,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1884]鸡蛋掉落-两枚鸡蛋","frequency":33.35349327229824,"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.5189873417721519,"acs":0,"articleLive":2,"columnArticles":10,"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.5719267654751525,"acs":0,"articleLive":2,"columnArticles":76,"formTitle":"[1886]判断矩阵经轮转后是否一致","frequency":17.40322030163009,"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.6411054885169326,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1887]使数组元素相等的减少操作次数","frequency":6.62395241264668,"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.31493317838466006,"acs":0,"articleLive":2,"columnArticles":63,"formTitle":"[1888]使二进制字符串字符交替的最少反转次数","frequency":8.469811387364896,"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.272294887039239,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1889]装包裹的最小浪费空间","frequency":18.035896247680004,"frontendQuestionId":"1889","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"装包裹的最小浪费空间","titleSlug":"minimum-space-wasted-from-packaging"},{"acceptance":0.7055793991416309,"acs":0,"articleLive":2,"columnArticles":18,"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.5132530120481927,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1891]割绳子","frequency":0.0,"frontendQuestionId":"1891","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"割绳子","titleSlug":"cutting-ribbons"},{"acceptance":0.3343949044585987,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[1892]页面推荐Ⅱ","frequency":7.211508204687712,"frontendQuestionId":"1892","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"页面推荐Ⅱ","titleSlug":"page-recommendations-ii"},{"acceptance":0.5915050116239186,"acs":0,"articleLive":2,"columnArticles":408,"formTitle":"[1893]检查是否区域内所有整数都被覆盖","frequency":45.57266560129181,"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.45846317549593374,"acs":0,"articleLive":2,"columnArticles":502,"formTitle":"[1894]找到需要补充粉笔的学生编号","frequency":12.615471401953974,"frontendQuestionId":"1894","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到需要补充粉笔的学生编号","titleSlug":"find-the-student-that-will-replace-the-chalk"},{"acceptance":0.5293329761585855,"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.5036540803897686,"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.5306603773584906,"acs":0,"articleLive":2,"columnArticles":74,"formTitle":"[1897]重新分配字符使所有字符串都相等","frequency":17.40322030163009,"frontendQuestionId":"1897","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"重新分配字符使所有字符串都相等","titleSlug":"redistribute-characters-to-make-all-strings-equal"},{"acceptance":0.3080671358960477,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1898]可移除字符的最大数目","frequency":8.469811387364896,"frontendQuestionId":"1898","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"可移除字符的最大数目","titleSlug":"maximum-number-of-removable-characters"},{"acceptance":0.6288194444444445,"acs":0,"articleLive":2,"columnArticles":42,"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.4305354558610709,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[1900]最佳运动员的比拼回合","frequency":27.29571981918943,"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.6626768226332971,"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.42948717948717946,"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.6456908344733242,"acs":0,"articleLive":2,"columnArticles":100,"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.2767745693600732,"acs":0,"articleLive":2,"columnArticles":69,"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.5695061571664339,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[1905]统计子岛屿","frequency":6.061429485312524,"frontendQuestionId":"1905","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计子岛屿","titleSlug":"count-sub-islands"},{"acceptance":0.4228630993745657,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1906]查询差绝对值的最小值","frequency":20.097446297355418,"frontendQuestionId":"1906","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"查询差绝对值的最小值","titleSlug":"minimum-absolute-difference-queries"},{"acceptance":0.5947136563876652,"acs":0,"articleLive":2,"columnArticles":16,"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.6804733727810651,"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.32684970449614725,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1909]删除一个元素使数组严格递增","frequency":7.826061825326265,"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.6750386398763524,"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.5695192129199925,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[1911]最大子序列交替和","frequency":16.794658773886972,"frontendQuestionId":"1911","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"最大子序列交替和","titleSlug":"maximum-alternating-subsequence-sum"},{"acceptance":0.2847110754414125,"acs":0,"articleLive":2,"columnArticles":37,"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.8429697036954833,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[1913]两个数对之间的最大乘积差","frequency":17.40322030163009,"frontendQuestionId":"1913","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"两个数对之间的最大乘积差","titleSlug":"maximum-product-difference-between-two-pairs"},{"acceptance":0.4419413155333055,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[1914]循环轮转矩阵","frequency":18.694466070773423,"frontendQuestionId":"1914","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"循环轮转矩阵","titleSlug":"cyclically-rotating-a-grid"},{"acceptance":0.3907997762863535,"acs":0,"articleLive":2,"columnArticles":56,"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.5480908651522475,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1916]统计为蚁群构筑房间的不同顺序","frequency":20.846558285770143,"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.2922868741542625,"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.4759825327510917,"acs":0,"articleLive":2,"columnArticles":3,"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.38321167883211676,"acs":0,"articleLive":2,"columnArticles":11,"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.9234597392256395,"acs":0,"articleLive":2,"columnArticles":80,"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.34332442408043784,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[1921]消灭怪物的最大数量","frequency":17.40322030163009,"frontendQuestionId":"1921","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"消灭怪物的最大数量","titleSlug":"eliminate-maximum-number-of-monsters"},{"acceptance":0.3616750258737362,"acs":0,"articleLive":2,"columnArticles":78,"formTitle":"[1922]统计好数字的数目","frequency":6.061429485312524,"frontendQuestionId":"1922","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"统计好数字的数目","titleSlug":"count-good-numbers"},{"acceptance":0.2366786531546257,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1923]最长公共子路径","frequency":26.92735682920287,"frontendQuestionId":"1923","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子路径","titleSlug":"longest-common-subpath"},{"acceptance":0.3858267716535433,"acs":0,"articleLive":2,"columnArticles":4,"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.6989298079949638,"acs":0,"articleLive":2,"columnArticles":54,"formTitle":"[1925]统计平方和三元组的数目","frequency":30.333498337885196,"frontendQuestionId":"1925","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计平方和三元组的数目","titleSlug":"count-square-sum-triples"},{"acceptance":0.34266919166749726,"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.41206150888995674,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1927]求和游戏","frequency":6.62395241264668,"frontendQuestionId":"1927","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"求和游戏","titleSlug":"sum-game"},{"acceptance":0.3967687394326508,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1928]规定时间内到达终点的最小花费","frequency":32.43826901177213,"frontendQuestionId":"1928","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"规定时间内到达终点的最小花费","titleSlug":"minimum-cost-to-reach-destination-in-time"},{"acceptance":0.9241248491119158,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[1929]数组串联","frequency":16.794658773886972,"frontendQuestionId":"1929","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"数组串联","titleSlug":"concatenation-of-array"},{"acceptance":0.475789286981199,"acs":0,"articleLive":2,"columnArticles":98,"formTitle":"[1930]长度为 3 的不同回文子序列","frequency":17.40322030163009,"frontendQuestionId":"1930","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"长度为 3 的不同回文子序列","titleSlug":"unique-length-3-palindromic-subsequences"},{"acceptance":0.5536273115220484,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1931]用三种不同颜色为网格涂色","frequency":9.855093570160312,"frontendQuestionId":"1931","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"用三种不同颜色为网格涂色","titleSlug":"painting-a-grid-with-three-different-colors"},{"acceptance":0.325909661229611,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1932]合并多棵二叉搜索树","frequency":22.454106114617538,"frontendQuestionId":"1932","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并多棵二叉搜索树","titleSlug":"merge-bsts-to-create-single-bst"},{"acceptance":0.5659574468085107,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[1933]判断字符串是否可分解为值均等的子串","frequency":10.602574332326324,"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.75177304964539,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[1934]","frequency":0.0,"frontendQuestionId":"1934","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"confirmation-rate"},{"acceptance":0.7405906195715113,"acs":0,"articleLive":2,"columnArticles":90,"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.44851501305483027,"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.24165091367359798,"acs":0,"articleLive":2,"columnArticles":62,"formTitle":"[1937]扣分后的最大得分","frequency":18.035896247680004,"frontendQuestionId":"1937","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"扣分后的最大得分","titleSlug":"maximum-number-of-points-with-cost"},{"acceptance":0.3398328690807799,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[1938]查询最大基因差","frequency":22.454106114617538,"frontendQuestionId":"1938","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"查询最大基因差","titleSlug":"maximum-genetic-difference-query"},{"acceptance":0.6123499142367067,"acs":0,"articleLive":2,"columnArticles":12,"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.8033573141486811,"acs":0,"articleLive":2,"columnArticles":22,"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.7731522314341154,"acs":0,"articleLive":2,"columnArticles":79,"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.39171511627906974,"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.40416480071652483,"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.5695095282724149,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1944]队列中可以看到的人数","frequency":6.62395241264668,"frontendQuestionId":"1944","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"队列中可以看到的人数","titleSlug":"number-of-visible-people-in-a-queue"},{"acceptance":0.6627025889286466,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1945]字符串转化后的各位数字之和","frequency":6.061429485312524,"frontendQuestionId":"1945","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"字符串转化后的各位数字之和","titleSlug":"sum-of-digits-of-string-after-convert"},{"acceptance":0.30313588850174217,"acs":0,"articleLive":2,"columnArticles":77,"formTitle":"[1946]子字符串突变后可能得到的最大整数","frequency":18.035896247680004,"frontendQuestionId":"1946","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"子字符串突变后可能得到的最大整数","titleSlug":"largest-number-after-mutating-substring"},{"acceptance":0.5405293058057364,"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.5123018042646255,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[1948]删除系统中的重复文件夹","frequency":10.602574332326324,"frontendQuestionId":"1948","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"删除系统中的重复文件夹","titleSlug":"delete-duplicate-folders-in-system"},{"acceptance":0.5031055900621118,"acs":0,"articleLive":2,"columnArticles":10,"formTitle":"[1949]","frequency":0.0,"frontendQuestionId":"1949","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"strong-friendship"},{"acceptance":0.5462962962962963,"acs":0,"articleLive":2,"columnArticles":7,"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.708904109589041,"acs":0,"articleLive":2,"columnArticles":11,"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.5453941357255586,"acs":0,"articleLive":2,"columnArticles":75,"formTitle":"[1952]三除数","frequency":6.061429485312524,"frontendQuestionId":"1952","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"三除数","titleSlug":"three-divisors"},{"acceptance":0.32289628180039137,"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.4800335771675261,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[1954]收集足够苹果的最小花园周长","frequency":6.061429485312524,"frontendQuestionId":"1954","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"收集足够苹果的最小花园周长","titleSlug":"minimum-garden-perimeter-to-collect-enough-apples"},{"acceptance":0.4940418050400469,"acs":0,"articleLive":2,"columnArticles":41,"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.43902439024390244,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[1956]感染 K 种病毒所需的最短时间","frequency":19.380911113840813,"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.610210574155431,"acs":0,"articleLive":2,"columnArticles":52,"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.4211260240543838,"acs":0,"articleLive":2,"columnArticles":43,"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.41045866199240433,"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.28278888347147735,"acs":0,"articleLive":2,"columnArticles":18,"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.5357315696080013,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[1961]检查字符串是否为数组前缀","frequency":5.522175928223974,"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.4249940376818507,"acs":0,"articleLive":2,"columnArticles":71,"formTitle":"[1962]移除石子使总数最小","frequency":17.40322030163009,"frontendQuestionId":"1962","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"移除石子使总数最小","titleSlug":"remove-stones-to-minimize-the-total"},{"acceptance":0.6125851819631724,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[1963]使字符串平衡的最小交换次数","frequency":6.62395241264668,"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.38258476166645816,"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.7535410764872521,"acs":0,"articleLive":2,"columnArticles":11,"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.7441860465116279,"acs":0,"articleLive":2,"columnArticles":5,"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.7759533179535893,"acs":0,"articleLive":2,"columnArticles":54,"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.35443037974683544,"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.2771659682292174,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[1969]数组元素的最小非零乘积","frequency":23.617833197594297,"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.47884136682507356,"acs":0,"articleLive":2,"columnArticles":47,"formTitle":"[1970]你能穿过矩阵的最后一天","frequency":16.794658773886972,"frontendQuestionId":"1970","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"你能穿过矩阵的最后一天","titleSlug":"last-day-where-you-can-still-cross"},{"acceptance":0.5546218487394958,"acs":0,"articleLive":2,"columnArticles":16,"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.5096525096525096,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1972]","frequency":9.145226304517246,"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.5196078431372549,"acs":0,"articleLive":2,"columnArticles":9,"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.749053428691628,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[1974]使用特殊打字机键入单词的最少时间","frequency":1.5773986186605509,"frontendQuestionId":"1974","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"使用特殊打字机键入单词的最少时间","titleSlug":"minimum-time-to-type-word-using-special-typewriter"},{"acceptance":0.37777777777777777,"acs":0,"articleLive":2,"columnArticles":44,"formTitle":"[1975]最大方阵和","frequency":12.179972950986874,"frontendQuestionId":"1975","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最大方阵和","titleSlug":"maximum-matrix-sum"},{"acceptance":0.28123530333908137,"acs":0,"articleLive":2,"columnArticles":33,"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.24431221561078054,"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.5714285714285714,"acs":0,"articleLive":2,"columnArticles":7,"formTitle":"[1978]","frequency":12.179972950986874,"frontendQuestionId":"1978","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"employees-whose-manager-left-the-company"},{"acceptance":0.8256475047378395,"acs":0,"articleLive":2,"columnArticles":72,"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.5793419408579759,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1980]找出不同的二进制字符串","frequency":10.602574332326324,"frontendQuestionId":"1980","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找出不同的二进制字符串","titleSlug":"find-unique-binary-string"},{"acceptance":0.29536533296604917,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[1981]最小化目标值与所选元素的差","frequency":21.365434826135544,"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.4568115942028986,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[1982]从子集的和还原数组","frequency":9.145226304517246,"frontendQuestionId":"1982","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"从子集的和还原数组","titleSlug":"find-array-given-subset-sums"},{"acceptance":0.6724137931034483,"acs":0,"articleLive":2,"columnArticles":3,"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.580711651117379,"acs":0,"articleLive":2,"columnArticles":57,"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.4090088676135918,"acs":0,"articleLive":2,"columnArticles":72,"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.2682356734101717,"acs":0,"articleLive":2,"columnArticles":69,"formTitle":"[1986]完成任务的最少工作时间段","frequency":5.004603235121968,"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.4518543722354542,"acs":0,"articleLive":2,"columnArticles":25,"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.6608695652173913,"acs":0,"articleLive":2,"columnArticles":3,"formTitle":"[1988]","frequency":29.683142518751797,"frontendQuestionId":"1988","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"find-cutoff-score-for-each-school"},{"acceptance":0.3972602739726027,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1989]","frequency":0.0,"frontendQuestionId":"1989","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"maximum-number-of-people-that-can-be-caught-in-tag"},{"acceptance":0.6496350364963503,"acs":0,"articleLive":2,"columnArticles":6,"formTitle":"[1990]","frequency":0.0,"frontendQuestionId":"1990","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"count-the-number-of-experiments"},{"acceptance":0.6629055007052186,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1991]找到数组的中间位置","frequency":0.0,"frontendQuestionId":"1991","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"找到数组的中间位置","titleSlug":"find-the-middle-index-in-array"},{"acceptance":0.5919384057971014,"acs":0,"articleLive":2,"columnArticles":51,"formTitle":"[1992]找到所有的农场组","frequency":0.0,"frontendQuestionId":"1992","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"找到所有的农场组","titleSlug":"find-all-groups-of-farmland"},{"acceptance":0.3826086956521739,"acs":0,"articleLive":2,"columnArticles":41,"formTitle":"[1993]树上的操作","frequency":0.0,"frontendQuestionId":"1993","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树上的操作","titleSlug":"operations-on-tree"},{"acceptance":0.35744962008589365,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[1994]好子集的数目","frequency":0.0,"frontendQuestionId":"1994","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"好子集的数目","titleSlug":"the-number-of-good-subsets"},{"acceptance":0.5429917550058893,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[1995]统计特殊四元组","frequency":0.0,"frontendQuestionId":"1995","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"统计特殊四元组","titleSlug":"count-special-quadruplets"},{"acceptance":0.23845723868082727,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[1996]游戏中弱角色的数量","frequency":0.0,"frontendQuestionId":"1996","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"游戏中弱角色的数量","titleSlug":"the-number-of-weak-characters-in-the-game"},{"acceptance":0.3376481312670921,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[1997]访问完所有房间的第一天","frequency":10.602574332326324,"frontendQuestionId":"1997","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"访问完所有房间的第一天","titleSlug":"first-day-where-you-have-been-in-all-the-rooms"},{"acceptance":0.4213799230085875,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[1998]数组的最大公因数排序","frequency":19.380911113840813,"frontendQuestionId":"1998","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"数组的最大公因数排序","titleSlug":"gcd-sort-of-an-array"},{"acceptance":0.782608695652174,"acs":0,"articleLive":2,"columnArticles":2,"formTitle":"[1999]","frequency":0.0,"frontendQuestionId":"1999","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"smallest-greater-multiple-made-of-two-digits"},{"acceptance":0.7965256277949776,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[2000]反转单词前缀","frequency":0.0,"frontendQuestionId":"2000","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转单词前缀","titleSlug":"reverse-prefix-of-word"},{"acceptance":0.3416010811670244,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[2001]可互换矩形的组数","frequency":0.0,"frontendQuestionId":"2001","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"可互换矩形的组数","titleSlug":"number-of-pairs-of-interchangeable-rectangles"},{"acceptance":0.5419411506368028,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[2002]两个回文子序列长度的最大乘积","frequency":0.0,"frontendQuestionId":"2002","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"两个回文子序列长度的最大乘积","titleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences"},{"acceptance":0.3689604685212299,"acs":0,"articleLive":2,"columnArticles":28,"formTitle":"[2003]每棵子树内缺失的最小基因值","frequency":0.0,"frontendQuestionId":"2003","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"每棵子树内缺失的最小基因值","titleSlug":"smallest-missing-genetic-value-in-each-subtree"},{"acceptance":0.4,"acs":0,"articleLive":2,"columnArticles":0,"formTitle":"[2004]","frequency":0.0,"frontendQuestionId":"2004","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"","titleSlug":"the-number-of-seniors-and-juniors-to-join-the-company"},{"acceptance":0.8447743966421826,"acs":0,"articleLive":2,"columnArticles":622,"formTitle":"[LCP 01]猜数字","frequency":38.21594276395469,"frontendQuestionId":"LCP 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"猜数字","titleSlug":"guess-numbers"},{"acceptance":0.6902047763965544,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[LCP 02]分式化简","frequency":29.055575031812968,"frontendQuestionId":"LCP 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"分式化简","titleSlug":"deep-dark-fraction"},{"acceptance":0.21856580551059962,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[LCP 03]机器人大冒险","frequency":24.230923379013827,"frontendQuestionId":"LCP 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"机器人大冒险","titleSlug":"programmable-robot"},{"acceptance":0.37716417910447764,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCP 04]覆盖","frequency":26.92735682920287,"frontendQuestionId":"LCP 04","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"覆盖","titleSlug":"broken-board-dominoes"},{"acceptance":0.19711633418921587,"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.8397403308435337,"acs":0,"articleLive":2,"columnArticles":649,"formTitle":"[LCP 06]拿硬币","frequency":34.64949327968721,"frontendQuestionId":"LCP 06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"拿硬币","titleSlug":"na-ying-bi"},{"acceptance":0.7703531019514058,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[LCP 07]传递信息","frequency":66.9857316809987,"frontendQuestionId":"LCP 07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"传递信息","titleSlug":"chuan-di-xin-xi"},{"acceptance":0.2851299187647635,"acs":0,"articleLive":2,"columnArticles":101,"formTitle":"[LCP 08]剧情触发时间","frequency":6.62395241264668,"frontendQuestionId":"LCP 08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剧情触发时间","titleSlug":"ju-qing-hong-fa-shi-jian"},{"acceptance":0.27076262083780883,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[LCP 09]最小跳跃次数","frequency":66.49803066411765,"frontendQuestionId":"LCP 09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小跳跃次数","titleSlug":"zui-xiao-tiao-yue-ci-shu"},{"acceptance":0.5835588633288228,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[LCP 10]二叉树任务调度","frequency":19.380911113840813,"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.6857318573185732,"acs":0,"articleLive":2,"columnArticles":66,"formTitle":"[LCP 11]期望个数统计","frequency":7.211508204687712,"frontendQuestionId":"LCP 11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"期望个数统计","titleSlug":"qi-wang-ge-shu-tong-ji"},{"acceptance":0.4077304261645193,"acs":0,"articleLive":2,"columnArticles":100,"formTitle":"[LCP 12]小张刷题计划","frequency":41.255068326624084,"frontendQuestionId":"LCP 12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"小张刷题计划","titleSlug":"xiao-zhang-shua-ti-ji-hua"},{"acceptance":0.6127601278622219,"acs":0,"articleLive":2,"columnArticles":84,"formTitle":"[LCP 13]寻宝","frequency":8.469811387364896,"frontendQuestionId":"LCP 13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"寻宝","titleSlug":"xun-bao"},{"acceptance":0.20745351402458242,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[LCP 14]切分数组","frequency":25.52684182318494,"frontendQuestionId":"LCP 14","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"切分数组","titleSlug":"qie-fen-shu-zu"},{"acceptance":0.5720221606648199,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 15]游乐园的迷宫","frequency":9.145226304517246,"frontendQuestionId":"LCP 15","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"游乐园的迷宫","titleSlug":"you-le-yuan-de-mi-gong"},{"acceptance":0.30293333333333333,"acs":0,"articleLive":2,"columnArticles":15,"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.798466141623964,"acs":0,"articleLive":2,"columnArticles":245,"formTitle":"[LCP 17]速算机器人","frequency":28.449342063288796,"frontendQuestionId":"LCP 17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"速算机器人","titleSlug":"nGK0Fy"},{"acceptance":0.2855923409098517,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[LCP 18]早餐组合","frequency":35.33334009083937,"frontendQuestionId":"LCP 18","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"早餐组合","titleSlug":"2vYnGI"},{"acceptance":0.5163548932572395,"acs":0,"articleLive":2,"columnArticles":202,"formTitle":"[LCP 19]秋叶收藏集","frequency":34.64949327968721,"frontendQuestionId":"LCP 19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"秋叶收藏集","titleSlug":"UlBDOe"},{"acceptance":0.30418319509556435,"acs":0,"articleLive":2,"columnArticles":30,"formTitle":"[LCP 20]快速公交","frequency":17.40322030163009,"frontendQuestionId":"LCP 20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"快速公交","titleSlug":"meChtZ"},{"acceptance":0.3282312925170068,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[LCP 21]追逐游戏","frequency":8.469811387364896,"frontendQuestionId":"LCP 21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"追逐游戏","titleSlug":"Za25hA"},{"acceptance":0.3328438017773761,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[LCP 22]黑白方格画","frequency":50.26505379655652,"frontendQuestionId":"LCP 22","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"黑白方格画","titleSlug":"ccw6C7"},{"acceptance":0.33897176345231755,"acs":0,"articleLive":2,"columnArticles":55,"formTitle":"[LCP 23]魔术排列","frequency":17.40322030163009,"frontendQuestionId":"LCP 23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术排列","titleSlug":"er94lq"},{"acceptance":0.27522935779816515,"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.3282442748091603,"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.3350286077558805,"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.3270205388103494,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 27]黑盒光线反射","frequency":13.064156305005737,"frontendQuestionId":"LCP 27","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"黑盒光线反射","titleSlug":"IQvJ9i"},{"acceptance":0.27710354815351196,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[LCP 28]采购方案","frequency":27.86312408616031,"frontendQuestionId":"LCP 28","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"采购方案","titleSlug":"4xy4Wx"},{"acceptance":0.18218125960061443,"acs":0,"articleLive":2,"columnArticles":119,"formTitle":"[LCP 29]乐团站位","frequency":49.58497580741732,"frontendQuestionId":"LCP 29","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"乐团站位","titleSlug":"SNJvJP"},{"acceptance":0.3453260940668542,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[LCP 30]魔塔游戏","frequency":5.004603235121968,"frontendQuestionId":"LCP 30","leaf":true,"level":2,"nodeType":"def","status":"tried","submitted":0,"title":"魔塔游戏","titleSlug":"p0NxJO"},{"acceptance":0.24620243645661002,"acs":0,"articleLive":2,"columnArticles":35,"formTitle":"[LCP 31]变换的迷宫","frequency":16.794658773886972,"frontendQuestionId":"LCP 31","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"变换的迷宫","titleSlug":"Db3wC1"},{"acceptance":0.3985239852398524,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 32]批量处理任务","frequency":18.035896247680004,"frontendQuestionId":"LCP 32","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"批量处理任务","titleSlug":"t3fKg1"},{"acceptance":0.20965407078320772,"acs":0,"articleLive":2,"columnArticles":82,"formTitle":"[LCP 33]蓄水","frequency":30.333498337885196,"frontendQuestionId":"LCP 33","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"蓄水","titleSlug":"o8SXZn"},{"acceptance":0.4720121028744327,"acs":0,"articleLive":2,"columnArticles":60,"formTitle":"[LCP 34]二叉树染色","frequency":30.333498337885196,"frontendQuestionId":"LCP 34","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树染色","titleSlug":"er-cha-shu-ran-se-UGC"},{"acceptance":0.38961038961038963,"acs":0,"articleLive":2,"columnArticles":18,"formTitle":"[LCP 35]电动车游城市","frequency":18.035896247680004,"frontendQuestionId":"LCP 35","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"电动车游城市","titleSlug":"DFPeFJ"},{"acceptance":0.25365853658536586,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 36]最多牌组数","frequency":36.78166698742219,"frontendQuestionId":"LCP 36","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"最多牌组数","titleSlug":"Up5XYM"},{"acceptance":0.19056356487549148,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[LCP 37]最小矩形面积","frequency":32.43826901177213,"frontendQuestionId":"LCP 37","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最小矩形面积","titleSlug":"zui-xiao-ju-xing-mian-ji"},{"acceptance":0.5454545454545454,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[LCP 38]守卫城堡","frequency":20.097446297355418,"frontendQuestionId":"LCP 38","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"守卫城堡","titleSlug":"7rLGCR"},{"acceptance":0.49464763603925066,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 39]无人机方阵","frequency":0.0,"frontendQuestionId":"LCP 39","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"无人机方阵","titleSlug":"0jQkd0"},{"acceptance":0.21131865068302202,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[LCP 40]心算挑战","frequency":0.0,"frontendQuestionId":"LCP 40","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"心算挑战","titleSlug":"uOAnQW"},{"acceptance":0.3923497267759563,"acs":0,"articleLive":2,"columnArticles":24,"formTitle":"[LCP 41]黑白翻转棋","frequency":0.0,"frontendQuestionId":"LCP 41","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"黑白翻转棋","titleSlug":"fHi6rV"},{"acceptance":0.17417809710428914,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[LCP 42]玩具套圈","frequency":0.0,"frontendQuestionId":"LCP 42","leaf":true,"level":3,"nodeType":"def","status":"tried","submitted":0,"title":"玩具套圈","titleSlug":"vFjcfV"},{"acceptance":0.3577749683944374,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[LCP 43]十字路口的交通","frequency":0.0,"frontendQuestionId":"LCP 43","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"十字路口的交通","titleSlug":"Y1VbOX"},{"acceptance":0.541258945523587,"acs":0,"articleLive":2,"columnArticles":90,"formTitle":"[LCS 01]下载插件","frequency":25.52684182318494,"frontendQuestionId":"LCS 01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"下载插件","titleSlug":"Ju9Xwi"},{"acceptance":0.7000453103760761,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[LCS 02]完成一半题目","frequency":18.035896247680004,"frontendQuestionId":"LCS 02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"完成一半题目","titleSlug":"WqXACV"},{"acceptance":0.41774443869632694,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[LCS 03]主题空间","frequency":7.211508204687712,"frontendQuestionId":"LCS 03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"主题空间","titleSlug":"YesdPw"},{"acceptance":0.678579952267303,"acs":0,"articleLive":2,"columnArticles":2727,"formTitle":"[剑指 Offer 03]数组中重复的数字","frequency":96.21770697332565,"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.40289871328536864,"acs":0,"articleLive":2,"columnArticles":2025,"formTitle":"[剑指 Offer 04]二维数组中的查找","frequency":74.88782436647628,"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.7614730387776983,"acs":0,"articleLive":2,"columnArticles":1885,"formTitle":"[剑指 Offer 05]替换空格","frequency":64.88892595833514,"frontendQuestionId":"剑指 Offer 05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"替换空格","titleSlug":"ti-huan-kong-ge-lcof"},{"acceptance":0.752239288432863,"acs":0,"articleLive":2,"columnArticles":2023,"formTitle":"[剑指 Offer 06]从尾到头打印链表","frequency":76.77442212404185,"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.6968584359764896,"acs":0,"articleLive":2,"columnArticles":1422,"formTitle":"[剑指 Offer 07]重建二叉树","frequency":79.80701099003632,"frontendQuestionId":"剑指 Offer 07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建二叉树","titleSlug":"zhong-jian-er-cha-shu-lcof"},{"acceptance":0.7168868929383654,"acs":0,"articleLive":2,"columnArticles":1601,"formTitle":"[剑指 Offer 09]用两个栈实现队列","frequency":91.92530947475981,"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.35959403553677194,"acs":0,"articleLive":2,"columnArticles":1825,"formTitle":"[剑指 Offer 10- I]斐波那契数列","frequency":55.35222127963099,"frontendQuestionId":"剑指 Offer 10- I","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"斐波那契数列","titleSlug":"fei-bo-na-qi-shu-lie-lcof"},{"acceptance":0.4427203915972898,"acs":0,"articleLive":2,"columnArticles":1286,"formTitle":"[剑指 Offer 10- II]青蛙跳台阶问题","frequency":68.95349070156868,"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.49326053841385553,"acs":0,"articleLive":2,"columnArticles":1593,"formTitle":"[剑指 Offer 11]旋转数组的最小数字","frequency":79.28865677612757,"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.45255428106063744,"acs":0,"articleLive":2,"columnArticles":1099,"formTitle":"[剑指 Offer 12]矩阵中的路径","frequency":61.174397632226885,"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.5259694157884665,"acs":0,"articleLive":2,"columnArticles":1676,"formTitle":"[剑指 Offer 13]机器人的运动范围","frequency":76.94557649011593,"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.5689058558256871,"acs":0,"articleLive":2,"columnArticles":1276,"formTitle":"[剑指 Offer 14- I]剪绳子","frequency":64.78355005672104,"frontendQuestionId":"剑指 Offer 14- I","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"剪绳子","titleSlug":"jian-sheng-zi-lcof"},{"acceptance":0.31135588916504436,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 14- II]剪绳子 II","frequency":32.73827882206933,"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.7465822658318825,"acs":0,"articleLive":2,"columnArticles":1231,"formTitle":"[剑指 Offer 15]二进制中1的个数","frequency":51.33164110939982,"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.33912455703219346,"acs":0,"articleLive":2,"columnArticles":740,"formTitle":"[剑指 Offer 16]数值的整数次方","frequency":36.90760470819734,"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.7770837534627509,"acs":0,"articleLive":2,"columnArticles":1102,"formTitle":"[剑指 Offer 17]打印从1到最大的n位数","frequency":65.35655806132922,"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.5956593296926586,"acs":0,"articleLive":2,"columnArticles":1429,"formTitle":"[剑指 Offer 18]删除链表的节点","frequency":60.78841434725818,"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.37550493748946534,"acs":0,"articleLive":2,"columnArticles":434,"formTitle":"[剑指 Offer 19]正则表达式匹配","frequency":55.82729559973928,"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.2403990057180907,"acs":0,"articleLive":2,"columnArticles":823,"formTitle":"[剑指 Offer 20]表示数值的字符串","frequency":67.82730315572302,"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.6426069521946035,"acs":0,"articleLive":2,"columnArticles":1586,"formTitle":"[剑指 Offer 21]调整数组顺序使奇数位于偶数前面","frequency":57.666009730734615,"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.7976535241304032,"acs":0,"articleLive":2,"columnArticles":2400,"formTitle":"[剑指 Offer 22]链表中倒数第k个节点","frequency":62.914956641450544,"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.7427731139363029,"acs":0,"articleLive":2,"columnArticles":1780,"formTitle":"[剑指 Offer 24]反转链表","frequency":92.43198537966228,"frontendQuestionId":"剑指 Offer 24","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"反转链表","titleSlug":"fan-zhuan-lian-biao-lcof"},{"acceptance":0.7285956976482387,"acs":0,"articleLive":2,"columnArticles":1160,"formTitle":"[剑指 Offer 25]合并两个排序的链表","frequency":79.70688777027709,"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.465519318417583,"acs":0,"articleLive":2,"columnArticles":1150,"formTitle":"[剑指 Offer 26]树的子结构","frequency":70.89729607147927,"frontendQuestionId":"剑指 Offer 26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"树的子结构","titleSlug":"shu-de-zi-jie-gou-lcof"},{"acceptance":0.7914269522059455,"acs":0,"articleLive":2,"columnArticles":1367,"formTitle":"[剑指 Offer 27]二叉树的镜像","frequency":62.140959279445426,"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.5805244352934052,"acs":0,"articleLive":2,"columnArticles":1060,"formTitle":"[剑指 Offer 28]对称的二叉树","frequency":51.601432909223455,"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.4399871409933895,"acs":0,"articleLive":2,"columnArticles":1447,"formTitle":"[剑指 Offer 29]顺时针打印矩阵","frequency":80.38387057229744,"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.5718266375374472,"acs":0,"articleLive":2,"columnArticles":885,"formTitle":"[剑指 Offer 30]包含min函数的栈","frequency":58.527268521626674,"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.614592512257394,"acs":0,"articleLive":2,"columnArticles":919,"formTitle":"[剑指 Offer 31]栈的压入、弹出序列","frequency":41.94961522499853,"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.6451321447791333,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[剑指 Offer 32 - I]从上到下打印二叉树","frequency":63.35514910385178,"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.6859053804600767,"acs":0,"articleLive":2,"columnArticles":1063,"formTitle":"[剑指 Offer 32 - II]从上到下打印二叉树 II","frequency":56.81304873275926,"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.5885511133158675,"acs":0,"articleLive":2,"columnArticles":1100,"formTitle":"[剑指 Offer 32 - III]从上到下打印二叉树 III","frequency":56.81304873275926,"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.5506369152753388,"acs":0,"articleLive":2,"columnArticles":925,"formTitle":"[剑指 Offer 33]二叉搜索树的后序遍历序列","frequency":61.35986713099519,"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.577284749413127,"acs":0,"articleLive":2,"columnArticles":845,"formTitle":"[剑指 Offer 34]二叉树中和为某一值的路径","frequency":66.67780017680944,"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.7206831923387976,"acs":0,"articleLive":2,"columnArticles":796,"formTitle":"[剑指 Offer 35]复杂链表的复制","frequency":60.85613190921782,"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.6543447139803502,"acs":0,"articleLive":2,"columnArticles":869,"formTitle":"[剑指 Offer 36]二叉搜索树与双向链表","frequency":68.66599288116674,"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.5602228794052576,"acs":0,"articleLive":2,"columnArticles":548,"formTitle":"[剑指 Offer 37]序列化二叉树","frequency":70.52967817412862,"frontendQuestionId":"剑指 Offer 37","leaf":true,"level":3,"nodeType":"def","status":"ac","submitted":0,"title":"序列化二叉树","titleSlug":"xu-lie-hua-er-cha-shu-lcof"},{"acceptance":0.5789441903295443,"acs":0,"articleLive":2,"columnArticles":1088,"formTitle":"[剑指 Offer 38]字符串的排列","frequency":91.66375673263907,"frontendQuestionId":"剑指 Offer 38","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"字符串的排列","titleSlug":"zi-fu-chuan-de-pai-lie-lcof"},{"acceptance":0.6898385742278623,"acs":0,"articleLive":2,"columnArticles":1001,"formTitle":"[剑指 Offer 39]数组中出现次数超过一半的数字","frequency":57.85034412522395,"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.5698070564001821,"acs":0,"articleLive":2,"columnArticles":1782,"formTitle":"[剑指 Offer 40]最小的k个数","frequency":74.78630419184967,"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.5808766784997684,"acs":0,"articleLive":2,"columnArticles":447,"formTitle":"[剑指 Offer 41]数据流中的中位数","frequency":45.57266560129181,"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.605330280117443,"acs":0,"articleLive":2,"columnArticles":1493,"formTitle":"[剑指 Offer 42]连续子数组的最大和","frequency":88.78485365986606,"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.4837122171029315,"acs":0,"articleLive":2,"columnArticles":497,"formTitle":"[剑指 Offer 43]1～n 整数中 1 出现的次数","frequency":52.28177000236804,"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.4139275723082377,"acs":0,"articleLive":2,"columnArticles":448,"formTitle":"[剑指 Offer 44]数字序列中某一位的数字","frequency":51.33164110939982,"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.561864732261188,"acs":0,"articleLive":2,"columnArticles":779,"formTitle":"[剑指 Offer 45]把数组排成最小的数","frequency":68.73664156287091,"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.5373982057888699,"acs":0,"articleLive":2,"columnArticles":1394,"formTitle":"[剑指 Offer 46]把数字翻译成字符串","frequency":70.94837050737904,"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.6888585140635441,"acs":0,"articleLive":2,"columnArticles":963,"formTitle":"[剑指 Offer 47]礼物的最大价值","frequency":55.82729559973928,"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.46457374291072745,"acs":0,"articleLive":2,"columnArticles":1003,"formTitle":"[剑指 Offer 48]最长不含重复字符的子字符串","frequency":70.89729607147927,"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.6512890927640511,"acs":0,"articleLive":2,"columnArticles":504,"formTitle":"[剑指 Offer 49]丑数","frequency":69.10229081008032,"frontendQuestionId":"剑指 Offer 49","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"丑数","titleSlug":"chou-shu-lcof"},{"acceptance":0.6140284184026897,"acs":0,"articleLive":2,"columnArticles":1025,"formTitle":"[剑指 Offer 50]第一个只出现一次的字符","frequency":66.6606839843693,"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.48185384992643454,"acs":0,"articleLive":2,"columnArticles":823,"formTitle":"[剑指 Offer 51]数组中的逆序对","frequency":91.03571084273469,"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.6483080289448934,"acs":0,"articleLive":2,"columnArticles":1029,"formTitle":"[剑指 Offer 52]两个链表的第一个公共节点","frequency":66.49803066411765,"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.5386352762167415,"acs":0,"articleLive":2,"columnArticles":1539,"formTitle":"[剑指 Offer 53 - I]在排序数组中查找数字 I","frequency":60.58950713254049,"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.44705869196920306,"acs":0,"articleLive":2,"columnArticles":1424,"formTitle":"[剑指 Offer 53 - II]0～n-1中缺失的数字","frequency":58.05101334413118,"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.755470602467941,"acs":0,"articleLive":2,"columnArticles":1116,"formTitle":"[剑指 Offer 54]二叉搜索树的第k大节点","frequency":46.676974177008915,"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.7895548496984762,"acs":0,"articleLive":2,"columnArticles":1238,"formTitle":"[剑指 Offer 55 - I]二叉树的深度","frequency":57.58589797198614,"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.5870360317869951,"acs":0,"articleLive":2,"columnArticles":912,"formTitle":"[剑指 Offer 55 - II]平衡二叉树","frequency":52.05404043127747,"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.6994004977000227,"acs":0,"articleLive":2,"columnArticles":1001,"formTitle":"[剑指 Offer 56 - I]数组中数字出现的次数","frequency":63.641639249835166,"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.7994988623068916,"acs":0,"articleLive":2,"columnArticles":680,"formTitle":"[剑指 Offer 56 - II]数组中数字出现的次数 II","frequency":50.03572266522871,"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.664164355779976,"acs":0,"articleLive":2,"columnArticles":816,"formTitle":"[剑指 Offer 57]和为s的两个数字","frequency":64.04412000006855,"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.7063351095322676,"acs":0,"articleLive":2,"columnArticles":1831,"formTitle":"[剑指 Offer 57 - II]和为s的连续正数序列","frequency":59.51538647669269,"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.4412247090675575,"acs":0,"articleLive":2,"columnArticles":946,"formTitle":"[剑指 Offer 58 - I]翻转单词顺序","frequency":58.153581497686766,"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.8569039823746786,"acs":0,"articleLive":2,"columnArticles":1737,"formTitle":"[剑指 Offer 58 - II]左旋转字符串","frequency":53.35450887644894,"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.4439237825408844,"acs":0,"articleLive":2,"columnArticles":1171,"formTitle":"[剑指 Offer 59 - I]滑动窗口的最大值","frequency":74.8257970993307,"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.47479294856816473,"acs":0,"articleLive":2,"columnArticles":1048,"formTitle":"[剑指 Offer 59 - II]队列的最大值","frequency":46.595970850135885,"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.5605932316687314,"acs":0,"articleLive":2,"columnArticles":567,"formTitle":"[剑指 Offer 60]n个骰子的点数","frequency":56.468639730490935,"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.459683122503173,"acs":0,"articleLive":2,"columnArticles":951,"formTitle":"[剑指 Offer 61]扑克牌中的顺子","frequency":60.708096420317446,"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.6552738349221227,"acs":0,"articleLive":2,"columnArticles":748,"formTitle":"[剑指 Offer 62]圆圈中最后剩下的数字","frequency":75.34632789455667,"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.6334813938426547,"acs":0,"articleLive":2,"columnArticles":924,"formTitle":"[剑指 Offer 63]股票的最大利润","frequency":65.35655806132922,"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.8571685740002571,"acs":0,"articleLive":2,"columnArticles":1265,"formTitle":"[剑指 Offer 64]求1+2+…+n","frequency":52.899802725696844,"frontendQuestionId":"剑指 Offer 64","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求1+2+…+n","titleSlug":"qiu-12n-lcof"},{"acceptance":0.5820448750202543,"acs":0,"articleLive":2,"columnArticles":479,"formTitle":"[剑指 Offer 65]不用加减乘除做加法","frequency":48.927781421700644,"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.5978316675794085,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[剑指 Offer 66]构建乘积数组","frequency":55.82729559973928,"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.2856002582130956,"acs":0,"articleLive":2,"columnArticles":544,"formTitle":"[剑指 Offer 67]把字符串转换成整数","frequency":47.079612279226836,"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.6931296215878996,"acs":0,"articleLive":2,"columnArticles":671,"formTitle":"[剑指 Offer 68 - I]二叉搜索树的最近公共祖先","frequency":48.82036964655011,"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.6999143676235154,"acs":0,"articleLive":2,"columnArticles":669,"formTitle":"[剑指 Offer 68 - II]二叉树的最近公共祖先","frequency":60.55505084333813,"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.20611029989891047,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 001]整数除法","frequency":14.854916490623221,"frontendQuestionId":"剑指 Offer II 001","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数除法","titleSlug":"xoh6Oh"},{"acceptance":0.5863188535602328,"acs":0,"articleLive":2,"columnArticles":99,"formTitle":"[剑指 Offer II 002]二进制加法","frequency":2.3660979279908263,"frontendQuestionId":"剑指 Offer II 002","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制加法","titleSlug":"JFETK5"},{"acceptance":0.7849618597893208,"acs":0,"articleLive":2,"columnArticles":102,"formTitle":"[剑指 Offer II 003]前 n 个数字二进制中 1 的个数","frequency":14.854916490623221,"frontendQuestionId":"剑指 Offer II 003","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"前 n 个数字二进制中 1 的个数","titleSlug":"w3tCBm"},{"acceptance":0.6928590390230953,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 004]只出现一次的数字 ","frequency":4.028891143876636,"frontendQuestionId":"剑指 Offer II 004","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"只出现一次的数字 ","titleSlug":"WGki4K"},{"acceptance":0.7167161226508407,"acs":0,"articleLive":2,"columnArticles":66,"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.6660934365147607,"acs":0,"articleLive":2,"columnArticles":73,"formTitle":"[剑指 Offer II 006]排序数组中两个数字之和","frequency":18.035896247680004,"frontendQuestionId":"剑指 Offer II 006","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"排序数组中两个数字之和","titleSlug":"kLl5u1"},{"acceptance":0.46238488219112545,"acs":0,"articleLive":2,"columnArticles":55,"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.510978835978836,"acs":0,"articleLive":2,"columnArticles":67,"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.5427328111401218,"acs":0,"articleLive":2,"columnArticles":55,"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.43527180783817954,"acs":0,"articleLive":2,"columnArticles":41,"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.5685043033263549,"acs":0,"articleLive":2,"columnArticles":45,"formTitle":"[剑指 Offer II 011]0 和 1 个数相同的子数组","frequency":14.854916490623221,"frontendQuestionId":"剑指 Offer II 011","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"0 和 1 个数相同的子数组","titleSlug":"A1NYOS"},{"acceptance":0.6599869309518623,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 012]左右两边子数组的和相等","frequency":4.507275614106019,"frontendQuestionId":"剑指 Offer II 012","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"左右两边子数组的和相等","titleSlug":"tvdfij"},{"acceptance":0.6605793450881612,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 013]二维子矩阵的和","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 013","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二维子矩阵的和","titleSlug":"O4NDxx"},{"acceptance":0.5009511731135067,"acs":0,"articleLive":2,"columnArticles":50,"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.6430769230769231,"acs":0,"articleLive":2,"columnArticles":39,"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.49577559986481917,"acs":0,"articleLive":2,"columnArticles":57,"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.5279273216689099,"acs":0,"articleLive":2,"columnArticles":33,"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.538899430740038,"acs":0,"articleLive":2,"columnArticles":48,"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.4769168191986984,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 019]最多删除一个字符得到回文","frequency":15.643615799953498,"frontendQuestionId":"剑指 Offer II 019","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最多删除一个字符得到回文","titleSlug":"RQku0D"},{"acceptance":0.7072872014696877,"acs":0,"articleLive":2,"columnArticles":46,"formTitle":"[剑指 Offer II 020]回文子字符串的个数","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 020","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"回文子字符串的个数","titleSlug":"a7VOhD"},{"acceptance":0.5359646449253277,"acs":0,"articleLive":2,"columnArticles":58,"formTitle":"[剑指 Offer II 021]删除链表的倒数第 n 个结点","frequency":15.643615799953498,"frontendQuestionId":"剑指 Offer II 021","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"删除链表的倒数第 n 个结点","titleSlug":"SLwz0R"},{"acceptance":0.5167249126310535,"acs":0,"articleLive":2,"columnArticles":43,"formTitle":"[剑指 Offer II 022]链表中环的入口节点","frequency":14.345661641861726,"frontendQuestionId":"剑指 Offer II 022","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中环的入口节点","titleSlug":"c32eOV"},{"acceptance":0.7123893805309734,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 023]两个链表的第一个重合节点","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 023","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"两个链表的第一个重合节点","titleSlug":"3u1WK4"},{"acceptance":0.7685572526510361,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[剑指 Offer II 024]反转链表","frequency":22.454106114617538,"frontendQuestionId":"剑指 Offer II 024","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"反转链表","titleSlug":"UHnkqh"},{"acceptance":0.6080020920502092,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 025]链表中的两数相加","frequency":29.683142518751797,"frontendQuestionId":"剑指 Offer II 025","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"链表中的两数相加","titleSlug":"lMSNwu"},{"acceptance":0.650992438563327,"acs":0,"articleLive":2,"columnArticles":53,"formTitle":"[剑指 Offer II 026]重排链表","frequency":16.208607595358924,"frontendQuestionId":"剑指 Offer II 026","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重排链表","titleSlug":"LGjMqU"},{"acceptance":0.6135207897098415,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[剑指 Offer II 027]回文链表","frequency":2.779566435968746,"frontendQuestionId":"剑指 Offer II 027","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文链表","titleSlug":"aMhZSa"},{"acceptance":0.6057142857142858,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 028]展平多级双向链表","frequency":17.40322030163009,"frontendQuestionId":"剑指 Offer II 028","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"展平多级双向链表","titleSlug":"Qv1Da2"},{"acceptance":0.2963464140730717,"acs":0,"articleLive":2,"columnArticles":38,"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.5304592314901593,"acs":0,"articleLive":2,"columnArticles":24,"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.5838461538461538,"acs":0,"articleLive":2,"columnArticles":21,"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.5982614095001553,"acs":0,"articleLive":2,"columnArticles":36,"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.7868391451068616,"acs":0,"articleLive":2,"columnArticles":34,"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.5780247969217615,"acs":0,"articleLive":2,"columnArticles":33,"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.6993801652892562,"acs":0,"articleLive":2,"columnArticles":26,"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.5909090909090909,"acs":0,"articleLive":2,"columnArticles":37,"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.46064981949458483,"acs":0,"articleLive":2,"columnArticles":33,"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.7781635802469136,"acs":0,"articleLive":2,"columnArticles":38,"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.5225594749794914,"acs":0,"articleLive":2,"columnArticles":20,"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.5753701211305519,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 040]矩阵中最大的矩形","frequency":15.643615799953498,"frontendQuestionId":"剑指 Offer II 040","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"矩阵中最大的矩形","titleSlug":"PLYXKQ"},{"acceptance":0.7930016863406408,"acs":0,"articleLive":2,"columnArticles":38,"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.8596395412342982,"acs":0,"articleLive":2,"columnArticles":31,"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.646795827123696,"acs":0,"articleLive":2,"columnArticles":20,"formTitle":"[剑指 Offer II 043]往完全二叉树添加节点","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 043","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"往完全二叉树添加节点","titleSlug":"NaqhDT"},{"acceptance":0.6458871265215788,"acs":0,"articleLive":2,"columnArticles":37,"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.8086031899468342,"acs":0,"articleLive":2,"columnArticles":40,"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.7105378224748579,"acs":0,"articleLive":2,"columnArticles":33,"formTitle":"[剑指 Offer II 046]二叉树的右侧视图","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 046","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树的右侧视图","titleSlug":"WNC0Lk"},{"acceptance":0.6864521975532397,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 047]二叉树剪枝","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 047","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉树剪枝","titleSlug":"pOCWxh"},{"acceptance":0.671651937457512,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 048]序列化与反序列化二叉树","frequency":7.211508204687712,"frontendQuestionId":"剑指 Offer II 048","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"序列化与反序列化二叉树","titleSlug":"h54YBf"},{"acceptance":0.7542754275427542,"acs":0,"articleLive":2,"columnArticles":37,"formTitle":"[剑指 Offer II 049]从根节点到叶节点的路径数字之和","frequency":16.208607595358924,"frontendQuestionId":"剑指 Offer II 049","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"从根节点到叶节点的路径数字之和","titleSlug":"3Etpl5"},{"acceptance":0.6097832128960534,"acs":0,"articleLive":2,"columnArticles":25,"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.4190017513134851,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 051]节点之和最大的路径","frequency":24.866724145644405,"frontendQuestionId":"剑指 Offer II 051","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"节点之和最大的路径","titleSlug":"jC7MId"},{"acceptance":0.7338675664276677,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 052]展平二叉搜索树","frequency":3.5682657452990214,"frontendQuestionId":"剑指 Offer II 052","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"展平二叉搜索树","titleSlug":"NYBBNL"},{"acceptance":0.6421052631578947,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 053]二叉搜索树中的中序后继","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 053","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中的中序后继","titleSlug":"P5rCT8"},{"acceptance":0.8475390156062425,"acs":0,"articleLive":2,"columnArticles":32,"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.8934959349593496,"acs":0,"articleLive":2,"columnArticles":19,"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.7262990876636255,"acs":0,"articleLive":2,"columnArticles":42,"formTitle":"[剑指 Offer II 056]二叉搜索树中两个节点之和","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 056","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树中两个节点之和","titleSlug":"opLdQZ"},{"acceptance":0.3566507684154743,"acs":0,"articleLive":2,"columnArticles":10,"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.5831157528285466,"acs":0,"articleLive":2,"columnArticles":12,"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.6252010723860589,"acs":0,"articleLive":2,"columnArticles":17,"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.6681246582832149,"acs":0,"articleLive":2,"columnArticles":31,"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.5401509951956074,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 061]和最小的 k 个数对","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 061","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"和最小的 k 个数对","titleSlug":"qn8gGX"},{"acceptance":0.725328947368421,"acs":0,"articleLive":2,"columnArticles":17,"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.7228661749209695,"acs":0,"articleLive":2,"columnArticles":20,"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.6081871345029239,"acs":0,"articleLive":2,"columnArticles":12,"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.6287878787878788,"acs":0,"articleLive":2,"columnArticles":12,"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.6371061843640606,"acs":0,"articleLive":2,"columnArticles":18,"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.6381322957198443,"acs":0,"articleLive":2,"columnArticles":14,"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.5161192214111923,"acs":0,"articleLive":2,"columnArticles":36,"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.7228496959165943,"acs":0,"articleLive":2,"columnArticles":29,"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.6798007246376812,"acs":0,"articleLive":2,"columnArticles":27,"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.517208413001912,"acs":0,"articleLive":2,"columnArticles":11,"formTitle":"[剑指 Offer II 071]按权重生成随机数","frequency":6.62395241264668,"frontendQuestionId":"剑指 Offer II 071","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"按权重生成随机数","titleSlug":"cuyjEf"},{"acceptance":0.4231961959892495,"acs":0,"articleLive":2,"columnArticles":40,"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.5369167158889545,"acs":0,"articleLive":2,"columnArticles":20,"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.536870854467421,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 074]合并区间","frequency":16.794658773886972,"frontendQuestionId":"剑指 Offer II 074","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合并区间","titleSlug":"SsGoHC"},{"acceptance":0.7121734844751109,"acs":0,"articleLive":2,"columnArticles":35,"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.6693246947420882,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 076]数组中的第 k 大的数字","frequency":30.333498337885196,"frontendQuestionId":"剑指 Offer II 076","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数组中的第 k 大的数字","titleSlug":"xx4gT2"},{"acceptance":0.5628402366863905,"acs":0,"articleLive":2,"columnArticles":43,"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.6428571428571429,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 078]合并排序链表","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 078","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序链表","titleSlug":"vvXgSW"},{"acceptance":0.8475378787878788,"acs":0,"articleLive":2,"columnArticles":48,"formTitle":"[剑指 Offer II 079]所有子集","frequency":4.507275614106019,"frontendQuestionId":"剑指 Offer II 079","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"所有子集","titleSlug":"TVdhkn"},{"acceptance":0.8146143437077131,"acs":0,"articleLive":2,"columnArticles":24,"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.7837150127226463,"acs":0,"articleLive":2,"columnArticles":35,"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.6427969671440606,"acs":0,"articleLive":2,"columnArticles":23,"formTitle":"[剑指 Offer II 082]含有重复元素集合的组合","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 082","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的组合","titleSlug":"4sjJUc"},{"acceptance":0.8560411311053985,"acs":0,"articleLive":2,"columnArticles":40,"formTitle":"[剑指 Offer II 083]没有重复元素集合的全排列","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 083","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"没有重复元素集合的全排列","titleSlug":"VvJkup"},{"acceptance":0.6750111756817165,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 084]含有重复元素集合的全排列 ","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 084","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"含有重复元素集合的全排列 ","titleSlug":"7p8L0Z"},{"acceptance":0.8546743464776252,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 085]生成匹配的括号","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 085","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生成匹配的括号","titleSlug":"IDBivT"},{"acceptance":0.769811320754717,"acs":0,"articleLive":2,"columnArticles":21,"formTitle":"[剑指 Offer II 086]分割回文子字符串","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 086","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"分割回文子字符串","titleSlug":"M99OJA"},{"acceptance":0.63125,"acs":0,"articleLive":2,"columnArticles":22,"formTitle":"[剑指 Offer II 087]复原 IP ","frequency":17.40322030163009,"frontendQuestionId":"剑指 Offer II 087","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"复原 IP ","titleSlug":"0on3uN"},{"acceptance":0.7458359037631092,"acs":0,"articleLive":2,"columnArticles":39,"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.6190476190476191,"acs":0,"articleLive":2,"columnArticles":20,"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.5207646671061306,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 090]环形房屋偷盗","frequency":5.004603235121968,"frontendQuestionId":"剑指 Offer II 090","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"环形房屋偷盗","titleSlug":"PzWKhm"},{"acceptance":0.75,"acs":0,"articleLive":2,"columnArticles":31,"formTitle":"[剑指 Offer II 091]粉刷房子","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 091","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"粉刷房子","titleSlug":"JEj789"},{"acceptance":0.6424148606811145,"acs":0,"articleLive":2,"columnArticles":22,"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.5494163424124514,"acs":0,"articleLive":2,"columnArticles":11,"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.6095534787123572,"acs":0,"articleLive":2,"columnArticles":15,"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.6621352184158057,"acs":0,"articleLive":2,"columnArticles":32,"formTitle":"[剑指 Offer II 095]最长公共子序列","frequency":46.248819617080564,"frontendQuestionId":"剑指 Offer II 095","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长公共子序列","titleSlug":"qJnOS7"},{"acceptance":0.5037406483790524,"acs":0,"articleLive":2,"columnArticles":12,"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.5350052246603971,"acs":0,"articleLive":2,"columnArticles":9,"formTitle":"[剑指 Offer II 097]子序列的数目","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 097","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"子序列的数目","titleSlug":"21dk04"},{"acceptance":0.7658536585365854,"acs":0,"articleLive":2,"columnArticles":27,"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.6813365933170334,"acs":0,"articleLive":2,"columnArticles":26,"formTitle":"[剑指 Offer II 099]最小路径之和","frequency":24.866724145644405,"frontendQuestionId":"剑指 Offer II 099","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小路径之和","titleSlug":"0i0mDW"},{"acceptance":0.7454407294832827,"acs":0,"articleLive":2,"columnArticles":28,"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.4708256880733945,"acs":0,"articleLive":2,"columnArticles":28,"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.5908360128617364,"acs":0,"articleLive":2,"columnArticles":14,"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.4987038237200259,"acs":0,"articleLive":2,"columnArticles":14,"formTitle":"[剑指 Offer II 103]最少的硬币数目","frequency":30.333498337885196,"frontendQuestionId":"剑指 Offer II 103","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最少的硬币数目","titleSlug":"gaM7Ch"},{"acceptance":0.5584192439862543,"acs":0,"articleLive":2,"columnArticles":10,"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.692154255319149,"acs":0,"articleLive":2,"columnArticles":36,"formTitle":"[剑指 Offer II 105]岛屿的最大面积","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 105","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"岛屿的最大面积","titleSlug":"ZL6zAn"},{"acceptance":0.5446985446985447,"acs":0,"articleLive":2,"columnArticles":12,"formTitle":"[剑指 Offer II 106]二分图","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 106","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二分图","titleSlug":"vEAB3K"},{"acceptance":0.5497017892644135,"acs":0,"articleLive":2,"columnArticles":13,"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.5783132530120482,"acs":0,"articleLive":2,"columnArticles":8,"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.5976702508960573,"acs":0,"articleLive":2,"columnArticles":20,"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.8387978142076503,"acs":0,"articleLive":2,"columnArticles":24,"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.6595238095238095,"acs":0,"articleLive":2,"columnArticles":12,"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.5799126637554585,"acs":0,"articleLive":2,"columnArticles":19,"formTitle":"[剑指 Offer II 112]最长递增路径","frequency":6.62395241264668,"frontendQuestionId":"剑指 Offer II 112","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最长递增路径","titleSlug":"fpTFWP"},{"acceptance":0.5719329214474845,"acs":0,"articleLive":2,"columnArticles":17,"formTitle":"[剑指 Offer II 113]课程顺序","frequency":16.794658773886972,"frontendQuestionId":"剑指 Offer II 113","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"课程顺序","titleSlug":"QA2IGt"},{"acceptance":0.4031339031339031,"acs":0,"articleLive":2,"columnArticles":11,"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.27704280155642025,"acs":0,"articleLive":2,"columnArticles":13,"formTitle":"[剑指 Offer II 115]重建序列","frequency":5.522175928223974,"frontendQuestionId":"剑指 Offer II 115","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"重建序列","titleSlug":"ur2n8P"},{"acceptance":0.6358866736621196,"acs":0,"articleLive":2,"columnArticles":46,"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.6360225140712945,"acs":0,"articleLive":2,"columnArticles":11,"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.6974664679582713,"acs":0,"articleLive":2,"columnArticles":18,"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.445095168374817,"acs":0,"articleLive":2,"columnArticles":27,"formTitle":"[剑指 Offer II 119]最长连续序列","frequency":6.061429485312524,"frontendQuestionId":"剑指 Offer II 119","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长连续序列","titleSlug":"WhsWhI"},{"acceptance":0.7212105905627815,"acs":0,"articleLive":2,"columnArticles":1492,"formTitle":"[面试题 01.01]判定字符是否唯一","frequency":76.28161609651613,"frontendQuestionId":"面试题 01.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定字符是否唯一","titleSlug":"is-unique-lcci"},{"acceptance":0.6501530787143752,"acs":0,"articleLive":2,"columnArticles":1062,"formTitle":"[面试题 01.02]判定是否互为字符重排","frequency":46.38693405061856,"frontendQuestionId":"面试题 01.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"判定是否互为字符重排","titleSlug":"check-permutation-lcci"},{"acceptance":0.5796277216841816,"acs":0,"articleLive":2,"columnArticles":464,"formTitle":"[面试题 01.03]URL化","frequency":40.58498988108451,"frontendQuestionId":"面试题 01.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"URL化","titleSlug":"string-to-url-lcci"},{"acceptance":0.5510691198408751,"acs":0,"articleLive":2,"columnArticles":754,"formTitle":"[面试题 01.04]回文排列","frequency":45.57266560129181,"frontendQuestionId":"面试题 01.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"回文排列","titleSlug":"palindrome-permutation-lcci"},{"acceptance":0.33321553635107787,"acs":0,"articleLive":2,"columnArticles":537,"formTitle":"[面试题 01.05]一次编辑","frequency":40.58498988108451,"frontendQuestionId":"面试题 01.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"一次编辑","titleSlug":"one-away-lcci"},{"acceptance":0.47270793165348046,"acs":0,"articleLive":2,"columnArticles":1148,"formTitle":"[面试题 01.06]字符串压缩","frequency":67.82730315572302,"frontendQuestionId":"面试题 01.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串压缩","titleSlug":"compress-string-lcci"},{"acceptance":0.7548093530750081,"acs":0,"articleLive":2,"columnArticles":943,"formTitle":"[面试题 01.07]旋转矩阵","frequency":54.434988072590315,"frontendQuestionId":"面试题 01.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"旋转矩阵","titleSlug":"rotate-matrix-lcci"},{"acceptance":0.6215180435430957,"acs":0,"articleLive":2,"columnArticles":473,"formTitle":"[面试题 01.08]零矩阵","frequency":38.90599085929966,"frontendQuestionId":"面试题 01.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"零矩阵","titleSlug":"zero-matrix-lcci"},{"acceptance":0.5513525825215502,"acs":0,"articleLive":2,"columnArticles":406,"formTitle":"[面试题 01.09]字符串轮转","frequency":37.550349817636906,"frontendQuestionId":"面试题 01.09","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"字符串轮转","titleSlug":"string-rotation-lcci"},{"acceptance":0.6836791363070908,"acs":0,"articleLive":2,"columnArticles":672,"formTitle":"[面试题 02.01]移除重复节点","frequency":48.29201633778837,"frontendQuestionId":"面试题 02.01","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"移除重复节点","titleSlug":"remove-duplicate-node-lcci"},{"acceptance":0.7800845640051474,"acs":0,"articleLive":2,"columnArticles":927,"formTitle":"[面试题 02.02]返回倒数第 k 个节点","frequency":61.298938862228304,"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.8538663490288548,"acs":0,"articleLive":2,"columnArticles":667,"formTitle":"[面试题 02.03]删除中间节点","frequency":61.97658708663474,"frontendQuestionId":"面试题 02.03","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"删除中间节点","titleSlug":"delete-middle-node-lcci"},{"acceptance":0.6564319603191718,"acs":0,"articleLive":2,"columnArticles":345,"formTitle":"[面试题 02.04]分割链表","frequency":47.02093428419921,"frontendQuestionId":"面试题 02.04","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"分割链表","titleSlug":"partition-list-lcci"},{"acceptance":0.46658202000104715,"acs":0,"articleLive":2,"columnArticles":510,"formTitle":"[面试题 02.05]链表求和","frequency":73.04810303689553,"frontendQuestionId":"面试题 02.05","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"链表求和","titleSlug":"sum-lists-lcci"},{"acceptance":0.4834774611365872,"acs":0,"articleLive":2,"columnArticles":495,"formTitle":"[面试题 02.06]回文链表","frequency":27.86312408616031,"frontendQuestionId":"面试题 02.06","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"回文链表","titleSlug":"palindrome-linked-list-lcci"},{"acceptance":0.6857948765375012,"acs":0,"articleLive":2,"columnArticles":400,"formTitle":"[面试题 02.07]链表相交","frequency":23.026000412431554,"frontendQuestionId":"面试题 02.07","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"链表相交","titleSlug":"intersection-of-two-linked-lists-lcci"},{"acceptance":0.5319927243330639,"acs":0,"articleLive":2,"columnArticles":275,"formTitle":"[面试题 02.08]环路检测","frequency":50.26505379655652,"frontendQuestionId":"面试题 02.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"环路检测","titleSlug":"linked-list-cycle-lcci"},{"acceptance":0.5411092817452151,"acs":0,"articleLive":2,"columnArticles":169,"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.6133055623621662,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 03.02]栈的最小值","frequency":43.22942487860522,"frontendQuestionId":"面试题 03.02","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"栈的最小值","titleSlug":"min-stack-lcci"},{"acceptance":0.3864049079754601,"acs":0,"articleLive":2,"columnArticles":121,"formTitle":"[面试题 03.03]堆盘子","frequency":33.990080073438854,"frontendQuestionId":"面试题 03.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"堆盘子","titleSlug":"stack-of-plates-lcci"},{"acceptance":0.7119175206041803,"acs":0,"articleLive":2,"columnArticles":336,"formTitle":"[面试题 03.04]化栈为队","frequency":36.286253269868816,"frontendQuestionId":"面试题 03.04","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"化栈为队","titleSlug":"implement-queue-using-stacks-lcci"},{"acceptance":0.54422570631459,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 03.05]栈排序","frequency":17.40322030163009,"frontendQuestionId":"面试题 03.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"栈排序","titleSlug":"sort-of-stacks-lcci"},{"acceptance":0.5892240647461656,"acs":0,"articleLive":2,"columnArticles":170,"formTitle":"[面试题 03.06]动物收容所","frequency":34.64949327968721,"frontendQuestionId":"面试题 03.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"动物收容所","titleSlug":"animal-shelter-lcci"},{"acceptance":0.5337854889589906,"acs":0,"articleLive":2,"columnArticles":232,"formTitle":"[面试题 04.01]节点间通路","frequency":35.33334009083937,"frontendQuestionId":"面试题 04.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"节点间通路","titleSlug":"route-between-nodes-lcci"},{"acceptance":0.7894527874442394,"acs":0,"articleLive":2,"columnArticles":411,"formTitle":"[面试题 04.02]最小高度树","frequency":49.58497580741732,"frontendQuestionId":"面试题 04.02","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最小高度树","titleSlug":"minimum-height-tree-lcci"},{"acceptance":0.8051357956696843,"acs":0,"articleLive":2,"columnArticles":505,"formTitle":"[面试题 04.03]特定深度节点链表","frequency":33.35349327229824,"frontendQuestionId":"面试题 04.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"特定深度节点链表","titleSlug":"list-of-depth-lcci"},{"acceptance":0.5841600230871902,"acs":0,"articleLive":2,"columnArticles":377,"formTitle":"[面试题 04.04]检查平衡性","frequency":18.035896247680004,"frontendQuestionId":"面试题 04.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"检查平衡性","titleSlug":"check-balance-lcci"},{"acceptance":0.35112647209421405,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 04.05]合法二叉搜索树","frequency":35.33334009083937,"frontendQuestionId":"面试题 04.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"合法二叉搜索树","titleSlug":"legal-binary-search-tree-lcci"},{"acceptance":0.5908466400024425,"acs":0,"articleLive":2,"columnArticles":230,"formTitle":"[面试题 04.06]后继者","frequency":18.035896247680004,"frontendQuestionId":"面试题 04.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"后继者","titleSlug":"successor-lcci"},{"acceptance":0.7162946428571428,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 04.08]首个共同祖先","frequency":31.008249446544394,"frontendQuestionId":"面试题 04.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"首个共同祖先","titleSlug":"first-common-ancestor-lcci"},{"acceptance":0.47812245502332124,"acs":0,"articleLive":2,"columnArticles":108,"formTitle":"[面试题 04.09]二叉搜索树序列","frequency":18.035896247680004,"frontendQuestionId":"面试题 04.09","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"二叉搜索树序列","titleSlug":"bst-sequences-lcci"},{"acceptance":0.7170250650595809,"acs":0,"articleLive":2,"columnArticles":244,"formTitle":"[面试题 04.10]检查子树","frequency":6.62395241264668,"frontendQuestionId":"面试题 04.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"检查子树","titleSlug":"check-subtree-lcci"},{"acceptance":0.4875905304439928,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 04.12]求和路径","frequency":30.333498337885196,"frontendQuestionId":"面试题 04.12","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"求和路径","titleSlug":"paths-with-sum-lcci"},{"acceptance":0.5065043827815309,"acs":0,"articleLive":2,"columnArticles":174,"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.6881710477600889,"acs":0,"articleLive":2,"columnArticles":118,"formTitle":"[面试题 05.02]二进制数转字符串","frequency":18.035896247680004,"frontendQuestionId":"面试题 05.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"二进制数转字符串","titleSlug":"bianry-number-to-string-lcci"},{"acceptance":0.3893445706975694,"acs":0,"articleLive":2,"columnArticles":222,"formTitle":"[面试题 05.03]翻转数位","frequency":39.622276849619915,"frontendQuestionId":"面试题 05.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"翻转数位","titleSlug":"reverse-bits-lcci"},{"acceptance":0.3911376878258203,"acs":0,"articleLive":2,"columnArticles":133,"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.5276122554309576,"acs":0,"articleLive":2,"columnArticles":220,"formTitle":"[面试题 05.06]整数转换","frequency":5.522175928223974,"frontendQuestionId":"面试题 05.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"整数转换","titleSlug":"convert-integer-lcci"},{"acceptance":0.7037037037037037,"acs":0,"articleLive":2,"columnArticles":198,"formTitle":"[面试题 05.07]配对交换","frequency":5.522175928223974,"frontendQuestionId":"面试题 05.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"配对交换","titleSlug":"exchange-lcci"},{"acceptance":0.5523700928489982,"acs":0,"articleLive":2,"columnArticles":70,"formTitle":"[面试题 05.08]绘制直线","frequency":24.866724145644405,"frontendQuestionId":"面试题 05.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"绘制直线","titleSlug":"draw-line-lcci"},{"acceptance":0.36407648210290827,"acs":0,"articleLive":2,"columnArticles":460,"formTitle":"[面试题 08.01]三步问题","frequency":41.340513794670066,"frontendQuestionId":"面试题 08.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"三步问题","titleSlug":"three-steps-problem-lcci"},{"acceptance":0.36098310291858676,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 08.02]迷路的机器人","frequency":37.550349817636906,"frontendQuestionId":"面试题 08.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"迷路的机器人","titleSlug":"robot-in-a-grid-lcci"},{"acceptance":0.6767944159093903,"acs":0,"articleLive":2,"columnArticles":428,"formTitle":"[面试题 08.03]魔术索引","frequency":6.061429485312524,"frontendQuestionId":"面试题 08.03","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"魔术索引","titleSlug":"magic-index-lcci"},{"acceptance":0.8224177784987226,"acs":0,"articleLive":2,"columnArticles":318,"formTitle":"[面试题 08.04]幂集","frequency":40.58498988108451,"frontendQuestionId":"面试题 08.04","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"幂集","titleSlug":"power-set-lcci"},{"acceptance":0.6801648567316498,"acs":0,"articleLive":2,"columnArticles":462,"formTitle":"[面试题 08.05]递归乘法","frequency":6.62395241264668,"frontendQuestionId":"面试题 08.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"递归乘法","titleSlug":"recursive-mulitply-lcci"},{"acceptance":0.6564450552596919,"acs":0,"articleLive":2,"columnArticles":259,"formTitle":"[面试题 08.06]汉诺塔问题","frequency":52.71925717990641,"frontendQuestionId":"面试题 08.06","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"汉诺塔问题","titleSlug":"hanota-lcci"},{"acceptance":0.8136068189779317,"acs":0,"articleLive":2,"columnArticles":306,"formTitle":"[面试题 08.07]无重复字符串的排列组合","frequency":29.683142518751797,"frontendQuestionId":"面试题 08.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"无重复字符串的排列组合","titleSlug":"permutation-i-lcci"},{"acceptance":0.7186310083770102,"acs":0,"articleLive":2,"columnArticles":227,"formTitle":"[面试题 08.08]有重复字符串的排列组合","frequency":46.248819617080564,"frontendQuestionId":"面试题 08.08","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"有重复字符串的排列组合","titleSlug":"permutation-ii-lcci"},{"acceptance":0.8121858573456624,"acs":0,"articleLive":2,"columnArticles":335,"formTitle":"[面试题 08.09]括号","frequency":63.33097551881593,"frontendQuestionId":"面试题 08.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"括号","titleSlug":"bracket-lcci"},{"acceptance":0.55955094116654,"acs":0,"articleLive":2,"columnArticles":208,"formTitle":"[面试题 08.10]颜色填充","frequency":16.794658773886972,"frontendQuestionId":"面试题 08.10","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"颜色填充","titleSlug":"color-fill-lcci"},{"acceptance":0.4946018297884859,"acs":0,"articleLive":2,"columnArticles":322,"formTitle":"[面试题 08.11]硬币","frequency":45.57266560129181,"frontendQuestionId":"面试题 08.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"硬币","titleSlug":"coin-lcci"},{"acceptance":0.76013354650616,"acs":0,"articleLive":2,"columnArticles":291,"formTitle":"[面试题 08.12]八皇后","frequency":47.02093428419921,"frontendQuestionId":"面试题 08.12","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"八皇后","titleSlug":"eight-queens-lcci"},{"acceptance":0.5011408579251597,"acs":0,"articleLive":2,"columnArticles":87,"formTitle":"[面试题 08.13]堆箱子","frequency":17.40322030163009,"frontendQuestionId":"面试题 08.13","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"堆箱子","titleSlug":"pile-box-lcci"},{"acceptance":0.5340063761955367,"acs":0,"articleLive":2,"columnArticles":72,"formTitle":"[面试题 08.14]布尔运算","frequency":25.52684182318494,"frontendQuestionId":"面试题 08.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"布尔运算","titleSlug":"boolean-evaluation-lcci"},{"acceptance":0.5543762867022446,"acs":0,"articleLive":2,"columnArticles":2363,"formTitle":"[面试题 10.01]合并排序的数组","frequency":72.86494062208345,"frontendQuestionId":"面试题 10.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"合并排序的数组","titleSlug":"sorted-merge-lcci"},{"acceptance":0.7395618112947658,"acs":0,"articleLive":2,"columnArticles":425,"formTitle":"[面试题 10.02]变位词组","frequency":61.298938862228304,"frontendQuestionId":"面试题 10.02","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"变位词组","titleSlug":"group-anagrams-lcci"},{"acceptance":0.3959805306955566,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 10.03]搜索旋转数组","frequency":59.26372409830992,"frontendQuestionId":"面试题 10.03","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"搜索旋转数组","titleSlug":"search-rotate-array-lcci"},{"acceptance":0.5534871371253245,"acs":0,"articleLive":2,"columnArticles":250,"formTitle":"[面试题 10.05]稀疏数组搜索","frequency":24.866724145644405,"frontendQuestionId":"面试题 10.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"稀疏数组搜索","titleSlug":"sparse-array-search-lcci"},{"acceptance":0.4559142114384749,"acs":0,"articleLive":2,"columnArticles":163,"formTitle":"[面试题 10.09]排序矩阵查找","frequency":43.90290732822527,"frontendQuestionId":"面试题 10.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"排序矩阵查找","titleSlug":"sorted-matrix-search-lcci"},{"acceptance":0.6308859310147417,"acs":0,"articleLive":2,"columnArticles":80,"formTitle":"[面试题 10.10]数字流的秩","frequency":0.0,"frontendQuestionId":"面试题 10.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数字流的秩","titleSlug":"rank-from-stream-lcci"},{"acceptance":0.667117970936005,"acs":0,"articleLive":2,"columnArticles":91,"formTitle":"[面试题 10.11]峰与谷","frequency":42.578812263600504,"frontendQuestionId":"面试题 10.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"峰与谷","titleSlug":"peaks-and-valleys-lcci"},{"acceptance":0.8330767170973357,"acs":0,"articleLive":2,"columnArticles":392,"formTitle":"[面试题 16.01]交换数字","frequency":24.866724145644405,"frontendQuestionId":"面试题 16.01","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换数字","titleSlug":"swap-numbers-lcci"},{"acceptance":0.7662547017732402,"acs":0,"articleLive":2,"columnArticles":185,"formTitle":"[面试题 16.02]单词频率","frequency":6.62395241264668,"frontendQuestionId":"面试题 16.02","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词频率","titleSlug":"words-frequency-lcci"},{"acceptance":0.4432558139534884,"acs":0,"articleLive":2,"columnArticles":231,"formTitle":"[面试题 16.03]交点","frequency":7.826061825326265,"frontendQuestionId":"面试题 16.03","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"交点","titleSlug":"intersection-lcci"},{"acceptance":0.4608177172061329,"acs":0,"articleLive":2,"columnArticles":153,"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.4639056912004945,"acs":0,"articleLive":2,"columnArticles":125,"formTitle":"[面试题 16.05]阶乘尾数","frequency":30.333498337885196,"frontendQuestionId":"面试题 16.05","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"阶乘尾数","titleSlug":"factorial-zeros-lcci"},{"acceptance":0.42444582128596997,"acs":0,"articleLive":2,"columnArticles":182,"formTitle":"[面试题 16.06]最小差","frequency":34.64949327968721,"frontendQuestionId":"面试题 16.06","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最小差","titleSlug":"smallest-difference-lcci"},{"acceptance":0.7328995215311005,"acs":0,"articleLive":2,"columnArticles":281,"formTitle":"[面试题 16.07]最大数值","frequency":41.255068326624084,"frontendQuestionId":"面试题 16.07","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"最大数值","titleSlug":"maximum-lcci"},{"acceptance":0.3758004718570947,"acs":0,"articleLive":2,"columnArticles":61,"formTitle":"[面试题 16.08]整数的英语表示","frequency":0.0,"frontendQuestionId":"面试题 16.08","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"整数的英语表示","titleSlug":"english-int-lcci"},{"acceptance":0.5499219968798752,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 16.09]运算","frequency":9.855093570160312,"frontendQuestionId":"面试题 16.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"运算","titleSlug":"operations-lcci"},{"acceptance":0.6830832196452933,"acs":0,"articleLive":2,"columnArticles":186,"formTitle":"[面试题 16.10]生存人数","frequency":17.40322030163009,"frontendQuestionId":"面试题 16.10","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"生存人数","titleSlug":"living-people-lcci"},{"acceptance":0.44100997076772264,"acs":0,"articleLive":2,"columnArticles":576,"formTitle":"[面试题 16.11]跳水板","frequency":23.617833197594297,"frontendQuestionId":"面试题 16.11","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"跳水板","titleSlug":"diving-board-lcci"},{"acceptance":0.4322209436133487,"acs":0,"articleLive":2,"columnArticles":50,"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.5507315521628499,"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.5036307053941909,"acs":0,"articleLive":2,"columnArticles":219,"formTitle":"[面试题 16.15]珠玑妙算","frequency":6.62395241264668,"frontendQuestionId":"面试题 16.15","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"珠玑妙算","titleSlug":"master-mind-lcci"},{"acceptance":0.4520556491359411,"acs":0,"articleLive":2,"columnArticles":204,"formTitle":"[面试题 16.16]部分排序","frequency":36.78166698742219,"frontendQuestionId":"面试题 16.16","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"部分排序","titleSlug":"sub-sort-lcci"},{"acceptance":0.6007148418147074,"acs":0,"articleLive":2,"columnArticles":368,"formTitle":"[面试题 16.17]连续数列","frequency":38.90599085929966,"frontendQuestionId":"面试题 16.17","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"连续数列","titleSlug":"contiguous-sequence-lcci"},{"acceptance":0.3443327239488117,"acs":0,"articleLive":2,"columnArticles":308,"formTitle":"[面试题 16.18]模式匹配","frequency":34.64949327968721,"frontendQuestionId":"面试题 16.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"模式匹配","titleSlug":"pattern-matching-lcci"},{"acceptance":0.6105211616733482,"acs":0,"articleLive":2,"columnArticles":352,"formTitle":"[面试题 16.19]水域大小","frequency":46.248819617080564,"frontendQuestionId":"面试题 16.19","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"水域大小","titleSlug":"pond-sizes-lcci"},{"acceptance":0.7204256032171582,"acs":0,"articleLive":2,"columnArticles":167,"formTitle":"[面试题 16.20]T9键盘","frequency":30.333498337885196,"frontendQuestionId":"面试题 16.20","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"T9键盘","titleSlug":"t9-lcci"},{"acceptance":0.46550244788775047,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 16.21]交换和","frequency":6.061429485312524,"frontendQuestionId":"面试题 16.21","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"交换和","titleSlug":"sum-swap-lcci"},{"acceptance":0.5825688073394495,"acs":0,"articleLive":2,"columnArticles":56,"formTitle":"[面试题 16.22]兰顿蚂蚁","frequency":8.469811387364896,"frontendQuestionId":"面试题 16.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"兰顿蚂蚁","titleSlug":"langtons-ant-lcci"},{"acceptance":0.47240062878958006,"acs":0,"articleLive":2,"columnArticles":154,"formTitle":"[面试题 16.24]数对和","frequency":24.866724145644405,"frontendQuestionId":"面试题 16.24","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"数对和","titleSlug":"pairs-with-sum-lcci"},{"acceptance":0.5447710791980662,"acs":0,"articleLive":2,"columnArticles":251,"formTitle":"[面试题 16.25]LRU 缓存","frequency":86.23965343629112,"frontendQuestionId":"面试题 16.25","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"LRU 缓存","titleSlug":"lru-cache-lcci"},{"acceptance":0.38748001543635263,"acs":0,"articleLive":2,"columnArticles":194,"formTitle":"[面试题 16.26]计算器","frequency":58.527268521626674,"frontendQuestionId":"面试题 16.26","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"计算器","titleSlug":"calculator-lcci"},{"acceptance":0.5970910181436497,"acs":0,"articleLive":2,"columnArticles":166,"formTitle":"[面试题 17.01]不用加号的加法","frequency":17.40322030163009,"frontendQuestionId":"面试题 17.01","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"不用加号的加法","titleSlug":"add-without-plus-lcci"},{"acceptance":0.6452319188938337,"acs":0,"articleLive":2,"columnArticles":439,"formTitle":"[面试题 17.04]消失的数字","frequency":37.550349817636906,"frontendQuestionId":"面试题 17.04","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的数字","titleSlug":"missing-number-lcci"},{"acceptance":0.38686558432060847,"acs":0,"articleLive":2,"columnArticles":89,"formTitle":"[面试题 17.05] 字母与数字","frequency":18.035896247680004,"frontendQuestionId":"面试题 17.05","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":" 字母与数字","titleSlug":"find-longest-subarray-lcci"},{"acceptance":0.44883675078864355,"acs":0,"articleLive":2,"columnArticles":104,"formTitle":"[面试题 17.06]2出现的次数","frequency":6.62395241264668,"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.41161737790193625,"acs":0,"articleLive":2,"columnArticles":214,"formTitle":"[面试题 17.07]婴儿名字","frequency":34.64949327968721,"frontendQuestionId":"面试题 17.07","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"婴儿名字","titleSlug":"baby-names-lcci"},{"acceptance":0.27216695139516967,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.08]马戏团人塔","frequency":41.255068326624084,"frontendQuestionId":"面试题 17.08","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"马戏团人塔","titleSlug":"circus-tower-lcci"},{"acceptance":0.5501908013657361,"acs":0,"articleLive":2,"columnArticles":139,"formTitle":"[面试题 17.09]第 k 个数","frequency":52.94170328824299,"frontendQuestionId":"面试题 17.09","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"第 k 个数","titleSlug":"get-kth-magic-number-lcci"},{"acceptance":0.5710488283266233,"acs":0,"articleLive":2,"columnArticles":922,"formTitle":"[面试题 17.10]主要元素","frequency":59.04427824711437,"frontendQuestionId":"面试题 17.10","leaf":true,"level":1,"nodeType":"def","status":"ac","submitted":0,"title":"主要元素","titleSlug":"find-majority-element-lcci"},{"acceptance":0.686603334625824,"acs":0,"articleLive":2,"columnArticles":254,"formTitle":"[面试题 17.11]单词距离","frequency":34.64949327968721,"frontendQuestionId":"面试题 17.11","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词距离","titleSlug":"find-closest-lcci"},{"acceptance":0.6315462315462316,"acs":0,"articleLive":2,"columnArticles":284,"formTitle":"[面试题 17.12]BiNode","frequency":5.522175928223974,"frontendQuestionId":"面试题 17.12","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"BiNode","titleSlug":"binode-lcci"},{"acceptance":0.5530534957026555,"acs":0,"articleLive":2,"columnArticles":267,"formTitle":"[面试题 17.13]恢复空格","frequency":31.008249446544394,"frontendQuestionId":"面试题 17.13","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"恢复空格","titleSlug":"re-space-lcci"},{"acceptance":0.5981783959675876,"acs":0,"articleLive":2,"columnArticles":750,"formTitle":"[面试题 17.14]最小K个数","frequency":48.25213164647331,"frontendQuestionId":"面试题 17.14","leaf":true,"level":2,"nodeType":"def","status":"ac","submitted":0,"title":"最小K个数","titleSlug":"smallest-k-lcci"},{"acceptance":0.40257889862506235,"acs":0,"articleLive":2,"columnArticles":113,"formTitle":"[面试题 17.15]最长单词","frequency":31.709178233000372,"frontendQuestionId":"面试题 17.15","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最长单词","titleSlug":"longest-word-lcci"},{"acceptance":0.5188859773126918,"acs":0,"articleLive":2,"columnArticles":1128,"formTitle":"[面试题 17.16]按摩师","frequency":51.33164110939982,"frontendQuestionId":"面试题 17.16","leaf":true,"level":1,"nodeType":"def","status":"not_started","submitted":0,"title":"按摩师","titleSlug":"the-masseuse-lcci"},{"acceptance":0.44245583550535766,"acs":0,"articleLive":2,"columnArticles":171,"formTitle":"[面试题 17.17]多次搜索","frequency":16.794658773886972,"frontendQuestionId":"面试题 17.17","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"多次搜索","titleSlug":"multi-search-lcci"},{"acceptance":0.4459881460709961,"acs":0,"articleLive":2,"columnArticles":116,"formTitle":"[面试题 17.18]最短超串","frequency":24.866724145644405,"frontendQuestionId":"面试题 17.18","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最短超串","titleSlug":"shortest-supersequence-lcci"},{"acceptance":0.5816150610302738,"acs":0,"articleLive":2,"columnArticles":180,"formTitle":"[面试题 17.19]消失的两个数字","frequency":35.33334009083937,"frontendQuestionId":"面试题 17.19","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"消失的两个数字","titleSlug":"missing-two-lcci"},{"acceptance":0.5708295896975142,"acs":0,"articleLive":2,"columnArticles":67,"formTitle":"[面试题 17.20]连续中值","frequency":18.694466070773423,"frontendQuestionId":"面试题 17.20","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"连续中值","titleSlug":"continuous-median-lcci"},{"acceptance":0.6358944705457173,"acs":0,"articleLive":2,"columnArticles":533,"formTitle":"[面试题 17.21]直方图的水量","frequency":86.80342901779473,"frontendQuestionId":"面试题 17.21","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"直方图的水量","titleSlug":"volume-of-histogram-lcci"},{"acceptance":0.37248497517637835,"acs":0,"articleLive":2,"columnArticles":150,"formTitle":"[面试题 17.22]单词转换","frequency":40.58498988108451,"frontendQuestionId":"面试题 17.22","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"单词转换","titleSlug":"word-transformer-lcci"},{"acceptance":0.3791782729805014,"acs":0,"articleLive":2,"columnArticles":97,"formTitle":"[面试题 17.23]最大黑方阵","frequency":6.061429485312524,"frontendQuestionId":"面试题 17.23","leaf":true,"level":2,"nodeType":"def","status":"not_started","submitted":0,"title":"最大黑方阵","titleSlug":"max-black-square-lcci"},{"acceptance":0.5195357031816769,"acs":0,"articleLive":2,"columnArticles":112,"formTitle":"[面试题 17.24]最大子矩阵","frequency":74.60838146558488,"frontendQuestionId":"面试题 17.24","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"最大子矩阵","titleSlug":"max-submatrix-lcci"},{"acceptance":0.508859913072551,"acs":0,"articleLive":2,"columnArticles":38,"formTitle":"[面试题 17.25]单词矩阵","frequency":29.262324829840008,"frontendQuestionId":"面试题 17.25","leaf":true,"level":3,"nodeType":"def","status":"not_started","submitted":0,"title":"单词矩阵","titleSlug":"word-rectangle-lcci"},{"acceptance":0.34108368329406946,"acs":0,"articleLive":2,"columnArticles":50,"formTitle":"[面试题 17.26]稀疏相似度","frequency":17.40322030163009,"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/LongestWordInDictionaryThroughDeleting.md b/src/main/java/leetcode/editor/cn/doc/content/LongestWordInDictionaryThroughDeleting.md new file mode 100644 index 0000000..0c1ff7b --- /dev/null +++ b/src/main/java/leetcode/editor/cn/doc/content/LongestWordInDictionaryThroughDeleting.md @@ -0,0 +1,31 @@ +

给你一个字符串 s 和一个字符串数组 dictionary 作为字典，找出并返回字典中最长的字符串，该字符串可以通过删除 s 中的某些字符得到。

+ +

如果答案不止一个，返回长度最长且字典序最小的字符串。如果答案不存在，则返回空字符串。

+ +

 

+ +

示例 1：

+ +
+输入：s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]
+输出："apple"
+
+ +

示例 2：

+ +
+输入：s = "abpcplea", dictionary = ["a","b","c"]
+输出："a"
+
+ +

 

+ +

提示：

+ + +
Related Topics
  • 数组
  • 双指针
  • 字符串
  • 排序

  • 👍 214
  • 👎 0
    • \ No newline at end of file